我們將原本求只有實根的多項式問題轉換為利用QR方法求一個友矩陣(companion matrix)或是對稱三對角(symmetric tridiagonal matrix)的特徵值問題，在數值測試中顯示出利用傳統演算法去求多項式的根會比求轉換過後矩陣特徵值的方法較沒效率。 / Given a polynomial pn(x) of degree n with real roots, we transform the problem of finding all roots of pn (x) into a problem of finding the eigenvalues of a companion matrix or of a symmetric tridiagonal matrix, which can be done with the QR algorithm. Numerical testing shows that finding the roots of a polynomial by standard algorithms is less efficient than by computing the eigenvalues of a related matrix.

檔案是研究歷史或瞭解過去事情的重要工具，因此檔案館除了需善盡保存檔案之責外，還要提供檢索工具供使用者使用。隨著網際網路的蓬勃發展及資源分享概念的形成，透過WWW，採用更一致、更友善且更便利的方式進行檢索成為一種趨勢，檔案描述編碼格式（EAD）即逐漸發展出來。以此格式所製作的檢索工具，能適當地描述檔案的階層架構，且對於檔案資訊的描述較豐富。由於以標準為基礎且與平台無關，所描述的資訊可被搜尋、檢索、瀏覽，亦可方便資源共享與資訊交換，並有較長久的使用時間。在國外已有許多計畫研究EAD，也有檔案館實際利用EAD編製檔案檢索工具，並放在網站上供使用。為期EAD亦能應用在國內的中文檔案，乃進行本研究。 本研究採文獻分析法與試驗法。藉由文獻分析法，瞭解EAD架構、目前EAD的發展現況及實際使用情形；而試驗法為實際至國內檔案館調閱檔案資料，將這些資料編製成符合EAD格式的檢索工具，並放在網站上，以檢視其是否能在WWW上瀏覽使用。 研究結論為：(1)EAD編碼之檔案檢索工具所含資訊豐富，能在網路上直接檢索，便利使用，並能使檢索工具具有較長久的使用時間；(2)中文檔案編製成EAD格式之檢索工具，部份著錄項目可直接使用，部份則需另行輸入；(3)EAD格式可應用於中文檔案；(4)國外地區較易推展EAD的實施使用。建議有六項：(1)EAD DTD依中文檔案之特質需做調整修改或發展中文版EAD；(2)利用EAD製作中文檔案檢索工具；(3)訂定中文檔案描述相關標準；(4)配合相關軟體的使用；(5)應於文件生命週期初期做好文件整編工作；(6)不可輕忽人工分析與檔案整理的工作。 第一章 緒論..............................1 第一節 研究動機........................1 第二節 研究目的........................2 第三節 研究問題........................3 第四節 預期貢獻........................3 第五節 名詞解釋........................4 第二章 文獻探討..........................9 第一節 檔案描述與檢索工具..............9 第二節 檔案描述標準...................26 第三節 SGML...........................30 第四節 XML............................37 第五節 EAD的沿革......................42 第六節 EAD相關研究計畫................50 第三章 研究方法與步驟...................65 第一節 研究方法.......................65 第二節 研究範圍與限制.................66 第三節 研究工具.......................67 第四節 研究步驟.......................67 第五節 研究實施.......................69 第四章 EAD架構與使用現況................71 第一節 EAD架構........................71 第二節 EAD使用現況....................84 第五章 研究結果與討論..................101 第一節 研究結果......................101 第二節 綜合討論......................140 第六章 結論與建議......................145 第一節 結論..........................145 第二節 建議..........................147 第三節 後續研究建議..................149 參考書目................................151 附錄....................................161 附錄一 EAD DTD 1.0版標籤.............161 附錄二 中文檔案以EAD編碼之實例.......165

<p>Polarisation, which was first studied in optics, is a fundamental property of all electromagnetic fields. A convenient way to describe the polarisation of two dimensional electromagnetic fields is given by the Stokes parameters. This thesis deals with different aspects of wave polarisation and electromagnetic field measurements. A generalisation of the Stokes parameters to three dimensions is presented. The theory has been used to develop methods and systems for obtaining the polarisation parameters of electromagnetic waves. The methods can be applied for a wide range of electromagnetic fields, measured both on ground and onboard satellites. The applications include, e.g., direction-finding, polarisation analysis, radar, and several examples in the field of wireless communication. Further applications are given in the analysis of satellite data, where a whistler wave is considered. Whistlers are circularly polarised electromagnetic waves propagating in the magnetosphere along the geomagnetic field. Dispersion in the magnetospheric plasma make the whistler frequencies travel at different speeds and the signal takes the form of a chirp. From instantaneous polarisation analysis of the whistler´s magnetic wave field, the normal to the polarisation plane is obtained and found to precess around the geomagnetic field. A statistic analysis of ionospheric stimulated electromagnetic emissions (SEE) is also presented. SEE is generated by injecting a powerful high frequency radio wave into the ionosphere. It is shown that the SEE features have a statistical behaviour indistinguishable from the amplitude and phase distributions of narrow-band Gaussian noise. The results suggests that SEE cannot be explained by simple coherent processes alone. Finally, an expression for the complex Poynting theorem is derived for the general case of anharmonic fields. It is found that the complex Poynting theorem, for real fields and sources, is not a conservation law of the imaginary part of electromagnetic energy.</p>

Polarisation, which was first studied in optics, is a fundamental property of all electromagnetic fields. A convenient way to describe the polarisation of two dimensional electromagnetic fields is given by the Stokes parameters. This thesis deals with different aspects of wave polarisation and electromagnetic field measurements. A generalisation of the Stokes parameters to three dimensions is presented. The theory has been used to develop methods and systems for obtaining the polarisation parameters of electromagnetic waves. The methods can be applied for a wide range of electromagnetic fields, measured both on ground and onboard satellites. The applications include, e.g., direction-finding, polarisation analysis, radar, and several examples in the field of wireless communication. Further applications are given in the analysis of satellite data, where a whistler wave is considered. Whistlers are circularly polarised electromagnetic waves propagating in the magnetosphere along the geomagnetic field. Dispersion in the magnetospheric plasma make the whistler frequencies travel at different speeds and the signal takes the form of a chirp. From instantaneous polarisation analysis of the whistler´s magnetic wave field, the normal to the polarisation plane is obtained and found to precess around the geomagnetic field. A statistic analysis of ionospheric stimulated electromagnetic emissions (SEE) is also presented. SEE is generated by injecting a powerful high frequency radio wave into the ionosphere. It is shown that the SEE features have a statistical behaviour indistinguishable from the amplitude and phase distributions of narrow-band Gaussian noise. The results suggests that SEE cannot be explained by simple coherent processes alone. Finally, an expression for the complex Poynting theorem is derived for the general case of anharmonic fields. It is found that the complex Poynting theorem, for real fields and sources, is not a conservation law of the imaginary part of electromagnetic energy.

Der Aufenthaltsort eines mobilen Benutzers stellt eine wichtige Information für Anwendungen aus den Bereichen Mobile Computing, Wearable Computing oder Ubiquitous Computing dar. Ist ein mobiles Endgerät in der Lage, die aktuelle Position des Benutzers zu bestimmen, kann diese Information von der Anwendung berücksichtigt werden -- man spricht dabei allgemein von ortsbezogenen Anwendungen. Eng verknüpft mit dem Begriff der ortsbezogenen Anwendung ist der Begriff des ortsbezogenen Dienstes. Hierbei handelt es sich beispielsweise um einen Dienst, der Informationen über den aktuellen Standort übermittelt. Mittlerweile werden solche Dienste kommerziell eingesetzt und erlauben etwa, dass ein Reisender ein Hotel, eine Tankstelle oder eine Apotheke in der näheren Umgebung findet. Man erwartet, nicht zuletzt durch die Einführung von LTE, ein großes Potenzial ortsbezogener Anwendungen für die Zukunft. Das jährlich stattfindende Fachgespräch "Ortsbezogene Anwendungen und Dienste" der GI/ITG-Fachgruppe Kommunikation und Verteilte Systeme hat sich zum Ziel gesetzt, aktuelle Entwicklungen dieses Fachgebiets in einem breiten Teilnehmerkreis aus Industrie und Wissenschaft zu diskutieren. Der vorliegende Konferenzband fasst die Ergebnisse des neunten Fachgesprächs zusammen. / The location of a mobile user poses an important information for applications in the scope of Mobile Computung, Wearable Computing and Ubiquitous Computing. If a mobile device is able to determine the current location of its user, this information may be taken into account by an application. Such applications are called a location-based applications. Closely related to location-based applications are location-based services, which for example provides the user informations about his current location. Meanwhile such services are deployed commercially and enable travelers for example to find a hotel, a petrol station or a pharmacy in his vicinity. It is expected, not least because of the introduction of LTE, a great potential of locations-based applications in the future. The annual technical meeting "Location-based Applications and Services" of the GI/ITG specialized group "Communication and Dsitributed Systems" targets to discuss current evolutions in a broad group of participants assembling of industrial representatives and scientists. The present proceedings summarizes the result of the 9th annual meeting.

This thesis develops a simulation and visualization of a path finding algorithm based on ant pheromone paths created in 3D space. The simulation is useful as a demonstration of a heuristic approach to NP-complete problems and as an educational tool for demonstrating how ant colonies gather food. An interactive real time 3D visualization is built on top of the simulation. A graphical user interface layer allows user interaction with the simulation and visualization.

In this study, a neural network(NN) based algorithm is proposed for real time multiple source tracking problem based on a previously reported work. The proposed algorithm namely modified neural network based multiple source tracking algorithm (MN-MUST) performs direction of arrival(DoA) estimation in three stages which are the detection, filtering and DoA estimation stages. The main contributions of this proposed system are: reducing the input size for the uncorrelated source case (reducing the training time) of NN system without degradation of accuracy and insertion of a nonlinear spatial filter to isolate each one of the sectors where sources are present, from the others. MN-MUST algorithm finds the targets correctly no matter whether the targets are located within the same angular sector or not. In addition as the number of targets exceeds the number of antenna elements the algorithm can still perform sufficiently well. Mutual coupling in array does not influence MN-MUST algorithm performance. iv MN-MUST algorithm is further improved for a cylindrical microstrip patch antenna array by using the advantages of directive antenna pattern properties. The new algorithm is called cylindrical patch array MN-MUST(CMN-MUST). CMN-MUST algorithm consists of three stages as MN-MUST does. Detection stage is exactly the same as in MN-MUST. However spatial filtering and DoA estimation stage are reduced order by using the advantages of directive antenna pattern of cylindirical microstrip patch array. The performance of the algorithm is investigated via computer simulations, for uniform linear arrays, a six element uniform dipole array and a twelve element uniform cylindrical microstrip patch array. The simulation results are compared to the previously reported works and the literature. It is observed that the proposed algorithm improves the previously reported works. The algorithm accuracy does not degrade in the presence of the mutual coupling. A uniform cylindrical patch array is successfully implemented to the MN-MUST algorithm. The implementation does not only cover full azimuth, but also improv the accuracy and speed. It is observed that the MN-MUST algorithm provides an accurate and efficient solution to the targettracking problem in real time.

Αντικείμενο της παρούσας διδακτορικής διατριβής είναι η μελέτη και η σχεδίαση αποδοτικών αλγορίθμων για τη διαχείριση και ανάλυση ακολουθιών βιολογικών δεδομένων. Οι αλγόριθμοι που θα περιγράψουμε εφαρμόζονται σε προβλήματα Βιοπληροφορικής, όπως η αναγνώριση γνωστών ή άγνωστων μοτίβων του DNA και RNA, που εμπλέκονται σε ποικίλες βιολογικές διεργασίες καθώς και η ανακάλυψη περιοδικοτήτων. Ειδικότερα οι αλγόριθμοι που θα παρουσιάσουμε χρησιμοποιούνται για την ανάλυση Βιολογικών Ακολουθιών με “αδιάφορους χαρακτήρες” και Βιολογικών Ακολουθιών με Βάρη. Οι Βιολογικές Ακολουθίες με “αδιάφορους χαρακτήρες” αναπαριστούν συνήθως οικογένειες πρωτεϊνών ενώ οι Βιολογικές Ακολουθίες με βάρη αναπαριστούν συναρμολογούμένες ακολουθίες γονιδιωμάτων που έχουν πρόσφατα αλληλουχηθεί. Στις Βιολογικές Ακολουθίες με αδιάφορους χαρακτήρες παρουσιάζουμε δυο αποδοτικούς αλγορίθμους γραμμικού χρόνου για τον υπολογισμό της περιόδου και τον υπολογισμό του καλύμματος. Ο δεύτερος αλγόριθμος εφαρμόζεται και σε κυκλικά (circular DNAs). Στις Βιολογικές Ακολουθίες με βάρη παρουσιάζουμε δυο αλγορίθμους για τον υπολογισμό των βασικών περιοδικοτήτων: της περιόδου και του καλύμματος ενώ επιλύουμε και το πρόβλημα της εύρεσης προτύπου. Η ανάγκη για αποδοτική διαχείριση βιολογικών ακολουθιών με βάρη μας ώθησε να εισάγουμε μια νέα αποδοτική δομή η οποία επιλύει αποδοτικά τα 2 προηγούμενα προβλήματα. Η δομή αυτή ονομάζεται Δέντρο Επιθεμάτων με Βάρη. Χρησιμοποιώντας το Δέντρο Επιθεμάτων με Βάρη επιλύουμε διάφορες παραλλαγές του προβλήματος εξαγωγής μοτίβων από Βιολογικές Ακολουθίες με Βάρη. Τέλος αποφασίσαμε να μελετήσουμε τη χρήση των Γενετικών Αλγορίθμων και του Εξελικτικού Προγραμματισμού στην ανάλυση ακολουθιών βιολογικών δεδομένων. Αποτέλεσμα αυτής της μελέτης είναι η περιγραφή ενός γενετικού αλγορίθμου που υπολογίζει τις επαναλήψεις σε μια βιολογική ακολουθία. / The object of this doctoral thesis is the study and the design of efficient algorithms for the analysis of sequences of biological data. The algorithms that we describe have application on Bioinformatics problems, such as the recognition of known or unknown patterns in DNA and RNA that are involved in various biological activities, as well as the discovery of periodicities. More specifically the algorithms that we present are used for the analysis of Biological Sequences with “don't care characters”' and Weighted Biological Sequences. Biological Sequences with “don't care characters”, usually represent protein families while Weighted Biological Sequences represent assembled sequences of genomes that they have been recently sequenced. In Biological Sequences with “don't care characters”' we present two efficient algorithms of linear time for the computation of the period and the cover. The second algorithm is also applied in circular DNAs . In Weighted Biological Sequences we present two algorithms for the computation of basic periodicities: the period and the cover, while we also solve the problem of pattern matching. The need for efficient management of biological sequences with weights prompted us to introduce a new efficient data structure which solves efficiently the two precedents problems. This structure is named Weighted Suffix Tree. Using the Weighted Suffix Tree we solve various instances of the motif discovery problem in Biological Weighted Sequences. Finally we decided to study the use of Genetic Algorithms and Evolutionary Programming in the analysis of biological sequences. The result of this study is the description of a genetic algorithm that computes the repetitions in a biological sequence.

Dinaminiai kelio paieškos algoritmai apjungia euristinės ir plečiamos (angl. incremental) paieškos metodus, sprendžiant eiles panašių paieškos uždavinių tiek žinant visą informaciją apie aplinką, tiek neturint jokios informacijos. Yra trys plečiamą paiešką naudojančių algoritmų klasės. Šiame darbe pateikiama trumpa dinaminių kelio paieškos algoritmų, naudojančių plečiamos paieškos metodus analizė. Pagrindinis darbo tikslas – visų trijų plečiamos paieškos klasių algoritmų, kuriuos naudojant gaunamas optimalus kelio paieškos sprendinys aplinkose, kur perėjimų tarp viršūnių svoriai gali didėti ir mažėti, palyginimas. Algoritmai lyginami trijose skirtingose situacijose: stacionarioje, judėjimo link tikslo (angl. goal – directed) bei judančio taikinio (angl. moving – target). Tyrimo rezultatai parodė, jog A* ir FSA* nepasiekiamų viršūnių kiekiui esant ~16000 yra ~23,6% našesni už GAA* ir trečios plečiamos klasės algoritmus, o pasiekiamumą keičiančių viršūnių kiekiui esant ~8000 – 42,3%. Nepasiekiamų viršūnių kiekiui kintant nuo 1000 iki 16000 trečios plečiamos klasės algoritmai yra vidutiniškai ~58,7% našesni už GAA* ir ~54% našesni už A* ir FSA*. Pasiekiamumą keičiančių viršūnių kiekiui kintant nuo 500 iki 8000 trečios plečiamos klasės algoritmai yra vidutiniškai ~69,3% našesni už GAA* ir ~47,8% našesni už A* ir FSA*. / Dynamic path finding algorithms combine heuristic and incremental search methods to solve a series of similar search tasks in both known and unknown environments. There are three classes of incremental search algorithms. In this document we provide a brief summary of dynamic path finding algorithms, that uses incremental search methods, but its main focus is on comparing main algorithms of all three incremental classes, that are guaranteed to give optimal solution in environment where action costs can increase and decrease over time, and showing their strong and weak sides. The algorithms are compared in three different situations: stationary, goal – directed and moving – target. At the end of the document conclusions are given based on performed work. In this paper, research showed that A* and FSA* are ~23,6% more efficient than GAA* and third incremental class algorithms when the amount of untraversable cells is ~16000 and ~42,3% more efficient when the amount of traversability changing cells is ~8000. When the amount of untraversable cells is between 1000 and 16000, the third incremental class algorithms are ~58,7% more efficient than GAA* and ~54% – than A* and FSA*. When the amount of traversability changing cells is between 500 and 8000, the third incremental class algorithms are ~69,3% more efficient than GAA* and ~47,8% – than A* and FSA*.

Scientific evidence is increasingly relied on in litigation. Discussions and debates aimed at enabling courts to make the best use scientific evidence are therefore critical. This thesis adds the perspective of procedural legitimacy to the science and law dialogue. Procedural Legitimacy is the concept that consistent adherence to legal procedure maintains the overall legitimacy of the legal system, and the validity of its outcomes. I argue that to maintain legitimate legal outcomes, procedural rules must be applied consistently and vigilantly to scientific evidence. This means that admissibility rules must be applied properly to scientific evidence, and that admitted scientific evidence must be duly scrutinized and weighed against the legal standard of proof. This ensures that the legal outcome will be based on valid legal facts. When the law is applied to those legal facts, litigants are legitimately bound by the judicial decision, despite the risk of factual inaccuracy. / The bulk of this thesis develops the notion of procedural legitimacy, and argues that its role in the adjudicative process is vital. The argument is founded on the conditions of uncertainty in which legal decisions are made. I show that both liability determinations and damages determinations in personal injury actions are made in conditions of uncertainty, and are dependent on consistency in procedure to maintain legitimacy. Ultimately, I apply the procedural legitimacy argument to admissibility and use of scientific evidence, and endorse the recommendations of the Goudge Inquiry in that respect.