Mutual Coupling (MC) is the exchange of energy between multiple antennas when placed on the same PCB, it being one of the critical parameters and a significant issue to be considered when designing MIMO antennas. It appears significantly where multiple antennas are placed very close to each other, with a high coupling affecting the performance of the array, in terms radiation patterns, the reflection coefficient, and influencing the input impedance. Moreover; it degrades the designed efficiency and gain since part of the power that could have been radiated becomes absorbed by other adjacent antennas' elements. The coupling mechanism between multiple antenna elements is identified as being mainly through three different paths or channels: surface wave propagation, space (direct) radiation and reactive near-field coupling. In this thesis, various coupling reduction approaches that are commonly employed in the literature are categorised based on these mechanisms. Furthermore, a new comparative study involving four different array types (PIFA, patch, monopole, and slot), is explained in detail. This thesis primarily focuses on three interconnected research topics for mutual coupling reduction based on new isolation approaches for different wireless applications (i.e. Narrowband, Ultra-wide-band and Multi-band). First, a new Fractal based Electromagnetic Band Gap (FEBG) decoupling structure between PIFAs is proposed and investigated for a narrowband application. Excellent isolation of more than 27 dB (Z-X plane) and 40 dB (Z-Y plane) is obtained without much degradation of the radiation characteristics. It is found that the fractal structures can provide a band-stop effect, because of their self-similarity features for a particular frequency band. Second, new UWB-MIMO antennas are presented with high isolation characteristics. Wideband isolation (≥ 31 dB) is achieved through the entire UWB band (3.1-10.6 GHz) by etching a novel compact planar decoupling structure inserted between these multiple UWB antennas. Finally, new planar MIMO antennas are presented for multi-band (quad bands) applications. A significant isolation improvement over the reference (≥ 17 dB) is achieved in each band by etching a hybrid solution. All the designs reported in this thesis have been fabricated and measured, with the simulated and measured results agreeing well in most cases.

Automatiser la conduite peut réduire le risque d'accidents et fluidifier le trafic en s’appuyant sur des communications entre véhicules et avec une infrastructure dédiée. Maintenir les services lorsque l’infrastructure faillit nécessite un protocole de routage adapté aux communications véhicule-à-véhicule (V2V). Cette thèse pose l’hypothèse de l’absence d’infrastructure et de service global de localisation, chaque véhicule connaissant sa seule position. Un modèle d’organisation des communications V2V, CBL, est proposé pour créer et maintenir une structure supportant les échanges proches, entre véhicules voisins, et lointains à travers le trafic. Il crée une hiérarchie où des groupes dissociés de véhicules voisins (feuilles) sont connectés via un véhicule leader (branche) à une colonne vertébrale (chaîne) formée le long de la route par interconnexion des branches. CBL requière la seule connaissance du voisinage à un saut et peut s’intégrer à tout protocole de routage. Les évaluations sur des scénarios routiers montrent que CBL exploite mieux les contraintes spatiales dues à la route, obtenant une structure plus adaptée à l’optimisation du trafic broadcast comparativement à la technique des multipoints relais dans OLSR, mais aussi face aux protocoles DSR, AODV et GRP, pour un trafic basé sur les préconisations IEEE de taille et fréquence de messages en milieu routier. Des évaluations sur des trafics d’applications coopératives telles que l’égo-localisation et la perception élargie montrent que CBL offre un service de communication à latence et taux de pertes faibles selon un compromis voulu entre fréquence de messages et performances. / Automated driving can reduce accidents and improve the traffic flow by using communications between vehicles and dedicated infrastructures. Maintaining services when an infrastructure failed requires a routing protocol adapted to vehicle-to-vehicle (V2V) communications. This dissertation assumes the absence of dedicated infrastructure and global location service, each vehicle knowing its only own position. A V2V communication organization model, CBL, is proposed to create and maintain a structure that supports close exchanges between neighbouring vehicles and remote exchanges through the traffic. CBL creates a hierarchy where disjoint groups of neighbouring vehicles (leaves) are connected via a leader vehicle (branch) to a backbone (chain) formed along the road by the interconnection of the branches. CBL requires only the knowledge of the one-hop neighborhood and can be integrated into any routing protocol. The evaluations on road scenarios using IEEE-based traffic recommended on road environments in terms of size and message frequency show that CBL makes a better use of the spatial constraints due to the road. A structure is obtained that suits better in the optimisation of the broadcast traffic than the technique of multipoint relays in OLSR, but also compared to DSR, AODV and GRP protocols. Evaluations of cooperative application traffic such as ego-localization and extended perception show that CBL offers a communication service with low latency, low packet loss, according to a wanted trade-off between message frequency and performance.

A tese está dividida em duas partes. A primeira parte é dedicada a análise de quando certas aplicações definidas em uma classe de anéis não-associativos são aditivas. Esta questão foi estudada para anéis associativos por Martindale, [38], e outros, [35], [4], [22], [23], [37], [39], [36], [7] e [27]. Para anéis de Jordan, foi estudada por Ji Peisheng, [26], e para anéis alternativos por Ferreira e Guzzo, [12], [13] e [14]. Muito pouco se conhece ainda sobre esta questão com relação a anéis e álgebras não-associativas em geral. Assim, um propósito é o de tentar ampliar ou aprofundar esse conhecimento para outras classes de anéis não-associativos. Um teorema muito importante na teoria das álgebras associativas é o Teorema de Wedderburn. A segunda parte a ser investigada nesta tese procura provar um teorema do tipo Wedderburn para b-álgebras do tipo (, ). Muitos autores buscam provar um teorema do tipo de Wedderburn para algumas álgebras não-associativas, já temos isso feito para as álgebras alternativas e de Jordan. No caso das b-álgebras definimos: No capitulo 4, definimos bdecomposição de Wedderburn. Assim, outra linha es- tudada é ver se alguma b-álgebra possu uma b-decomposição de Wedderburn. / The thesis is divided into two parts. The first part is dedicated to analysis when certain applications defined in a class of non-associative rings are additive. This question was studied for associative rings by Martindale, [38], and others, [35], [4], [22], [23], [37] , [39], [36], [7] and [27]. For Jordans rings, it was studied by Ji Peisheng, [26], and for alternative rings, by Ferreira and Guzzo, [12], [13] and [14]. We know very few results with regard to nonassociative rings and algebras, in general. This way, a purpose is the one of try to extend or to deepen that knowledge to other classes of non-associative rings. A very important theorem in the theory of associative algebras is the Theorem of Wedderburn. The second part to be investigated try to prove a theorem of Wedderburn type to b-algebras (, ) type. Many authors seek to prove a theorem of Wedderburn for some type of non-associative algebras, we have done it for alternative algebras and Jordan. In the case of b-algebras defined: In chapter 4, we define bWedderburn decomposition. Thus, another line study is to see if some b-algebra possess a b-Wedderburn decomposition.

Les spectres de rotation de anti- et gauche-normal-butyronitrile, mesurés au laboratoire jusqu'à 506 GHz ont été analysés pour obtenir un jeu de paramètres moléculaires précis pour l'état fondamental de vibration et cinq vibrations de faible énergie de chaque conformère. L'objectif est de pouvoir fournir les meilleures prévisions possibles pour la radioastronomie. Un total d'environ 15000 raies a été utilisé pour l'analyse. Des paramètres améliorés ont été déterminés pour v30 = 1, v30 = 2, v18 = 1, v29 = 1, pour le conformère anti, et v30 = 1, v30 = 2, v28 = 1, v29 = 1, pour le conformère gauche. Des paramètres ont été déterminés pour la première fois pour v18 = v30 = 1 du conformère anti et v29 = v30 = 1 du conformère gauche. Des preuves ont été trouvées pour un couplage des vibrations pour certains transitions supérieures à 380 GHz. Le couplage entre v18 = 1 et v30 = 2 du conformère anti a été bien caractérisé. Certaines raies montrent aussi un dédoublement dû à la rotation interne qui ne devrait pas être résolu dans les spectres astronomiques. / Laboratory measured rotational spectra of anti- and gauche-normal-propyl cyanide up to 506 GHz have been analyzed to obtain a precise set of molecular parameters for the ground state and five low-lying vibrational states of each conformer. The objective is to be able to make best possible predictions for radio-astronomy. In total around 15000 lines have been included in the analysis. Improved parameters have been determined for v30 = 1, v30 = 2, v18 = 1, v29 = 1, for the anti conformer, and v30 = 1, v30 = 2, v28 = 1, v29 = 1, for the gauche conformer. Parameters are derived for the first time for v18 = v30 = 1 of the anti conformer and v29 = v30 = 1 of the gauche conformer. Evidence has been found for vibrational coupling for some transitions above 380 GHz. The coupling between v18 = 1 and v30 = 2 of the anti conformer has been well characterized. Internal rotation splitting is also observed but not expected to be resolved in astronomical spectra.

Graph theory is the foundation on which social network analysis (SNA) is built. With the flood of "big data," graph theoretical concepts and their linear algebraic counterparts are essential tools for analysis in the burgeoning field of network data analysis, in which SNA is a subset. Here we begin with an overview of SNA. We then discuss the common descriptive measures taken on network data as well as proposing new measures specific to homeless networks. We also define a new data structure which we call the location sequence matrix. This data structure makes certain computational network analyses particularly easy. Finally we apply Pulse Processes in a new way to the homeless network in Utah. We believe the new data structure and pulse processes, when used for analysis of the Utah homeless services. In particular, pulse processes, first introduced by Brown, Roberts, and Spencer, to analyze energy demand, form a dynamic population model that can provide a measure of the stability in a network and the patterns of action of individuals experiencing homelessness.

Web applications are increasingly moving business and processing logic from the server to the browser. Traditional, multiple-page request/response applications are quickly being replaced by single-page applications where complex application logic is downloaded on the initial page load and data is then subsequently fetched asynchronously via the browser's native XMLHttpRequest (XHR) object. These new generation web applications are called Rich Web Applications (RWA). Frameworks such as the Google Web Toolkit (GWT), and JavaScript model-view-controller (MVC) frameworks such as Backbone.js are facilitating this move. With this migration, testing frameworks need to follow the logic by moving analysis and test generation from the server to the client. One problem hindering the movement of testing in this domain is the adoption of semantic URLs. This paper introduces a novel approach to systematically identify variables in semantic URLs and use them as part of the test generation process. Using a sample RWA seeded with various JavaScript faults, I demonstrate in this thesis, as an empirical study, that combinatorial testing algorithms and reduction strategies also apply to new RWAs.

No description available.

隨著WWW從單純的資訊傳播管道演進到可作為企業應用的平台，以Web為導向的電腦應用已被企業視為是最具競爭力的武器。基於WWW潛在的龐大商業利益，有越來越多的組織或個人想建立自己的網站，在Internet上發展企業對企業或企業對個人的應用程式。如何設計Web應用系統已成為最重要的課題。然而目前Web程式的開發方法混亂而且沒有標準化，有些建置方式並沒有依循系統分析與設計的原則。簡而言之，我們需要特別的方法與工具來支援超文件系統的開發。所以本研究希望找到一個結構化的步驟與流程來開發以資料庫為核心的超文件應用系統，此外還會製作一套可以支援超文件應用系統設計流程的工具軟體雛形。 / As World Wide Web has evolved from the simple delivery mechanism to a platform for complex business applications, Web-based business computing is already seen as a new competitive business weapon. The potential commercial payoff of WWW results in more and more organizations or people want to construct their own web sites, developing business-to-business or business-to-consumer applications upon the Internet. Designing Web applications has become the serious issue. However, current methods of designing and modeling hypertext applications are still in chaos and keeps ad-hoc nature. Some of the development methods lack serious system analysis and design. In a word, we need special methods and tools to support the development of hypertext applications. Therefore, this research intends to present a structured approach, a step-by-step procedure for developing database-centric hypertext applications. In addition, this paper will implement a tool kit system prototype to support the process of design hypertext applications.

"27 September 2003." / Includes bibliographical references (leaves xix-xxv ; v. 1) / 2 v. : ill., plates (some col.), photos (some col.) ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, School of Chemical Engineering and School of Mechanical Engineering, 2004

Language diversi cation is a stochastic process which presents similarities with phylogenetic evolution. Recently, there has been interest in modelling this process to help solve problems which traditional linguistic methods cannot resolve. The problem of estimating and quantifying the uncertainty in the age of the most recent common ancestor of the Indo-European languages is an example. We model lexical change by a point process on a phylogenetic tree. Our model is speci cally tailored to lexical data and in particular treats aspects of linguistic change which are hitherto unaccounted for and which could have a strong impact on age estimates: catastrophic rate heterogeneity and missing data. We impose a prior distribution on the tree topology, node ages and other model parameters, give recursions to compute the likelihood and estimate all parameters jointly using Markov Chain Monte Carlo. We validate our methods using an extensive cross-validation procedure, reconstructing known ages of internal nodes. We make a second validation using synthetic data and show that model misspeci cations due to borrowing of lexicon between languages and the presence of meaning categories in lexical data do not lead to systematic bias. We fit our model to two data sets of Indo-European languages and estimate the age of Proto-Indo-European. Our main analysis gives a 95% highest posterior probability density interval of 7110 9750 years Before the Present, in line with the so-called Anatolian hypothesis for the expansion of the Indo- European languages. We discuss why we are not concerned by the famous criticisms of statistical methods for historical linguistics leveled by Bergsland and Vogt [1962]. We also apply our methods to the reconstruction of the spread of Swabian dialects and to the detection of punctuational bursts of language change in the Indo-European family.