by Gilbert Chiu-sing Lui. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 112-117). / Chapter 1. --- Introduction --- p.1 / Chapter 2. --- Models and Assumptions --- p.4 / Chapter 3. --- Asymptotics of FM-SEA Estimators --- p.15 / Chapter 3.1. --- Model without Determinstic Trends --- p.15 / Chapter 3.2. --- Model with Determinstic Trends --- p.27 / Chapter 4. --- Asymptotics of FM-SEA Estimators of VAR System --- p.33 / Chapter 4.1. --- General Model --- p.33 / Chapter 4.2. --- Model with d = 4 --- p.44 / Chapter 5. --- Monte Carlo Experimental Results --- p.49 / Chapter 6. --- Conclusion --- p.54 / Chapter 7. --- Mathematical Appendix --- p.56 / Chapter 8. --- References --- p.112

This thesis is concerned with quasigroups with a small number of associative triples. The minimum number of associative triples among quasigroups of orders up to seven has already been determined. The goal of this thesis is to determine the minimum for orders eight and nine. This thesis reports that the minimum number of associative triples among quasigroups of order eight is sixteen and among quasigroups of order nine is nine. The latter finding is rather significant and we present a construction of an infinite series of quasigroups with the number of associative triples equal to their order. Findings of this thesis have been a result of a computer search which used improved algorithm presented in this thesis. The first part of the thesis is devoted to the theory that shows how to reduce the search space. The second part deals with the development of the algorithm and the last part analyzes the findings and shows a comparison of the new algorithm to the previous work. It shows that new search program is up to four orders of magnitude faster than the one used to determine the minimum number of associative triples among quasigroups of order seven.

Xu, Yang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 99-104). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background of Sensors and Sensor Networks --- p.2 / Chapter 1.2 --- Introduction to Coverage Problems --- p.6 / Chapter 1.3 --- Literature Review --- p.8 / Chapter 1.3.1 --- Deterministic Deployment Methods --- p.9 / Chapter 1.3.2 --- Dynamic Deployment Methods --- p.10 / Chapter 1.4 --- A Brief Introduction to Least Squares Analysis --- p.13 / Chapter 1.5 --- Thesis Outline --- p.15 / Chapter 2 --- Mobile Sensor Network Deployment Problem --- p.18 / Chapter 2.1 --- Sensor Coverage Models --- p.18 / Chapter 2.1.1 --- Binary Sensor Models --- p.19 / Chapter 2.1.2 --- Attenuated and Truncated Attenuated Disk Models --- p.20 / Chapter 2.2 --- Problem Statement --- p.23 / Chapter 3 --- Coverage Optimization as Nonlinear Least Squares Problems --- p.26 / Chapter 3.1 --- Introduction --- p.26 / Chapter 3.2 --- Network Deployment as Least Squares Problems --- p.28 / Chapter 3.2.1 --- Assignment of Sample Points --- p.28 / Chapter 3.2.2 --- Least Squares Function --- p.30 / Chapter 3.2.3 --- Gauss-Newton Method --- p.33 / Chapter 3.2.4 --- Solutions --- p.36 / Chapter 3.3 --- Extension to Binary Sensor Models --- p.39 / Chapter 3.3.1 --- Restrictions of Subgradient Methods --- p.40 / Chapter 3.3.2 --- Sigmoid Functions --- p.42 / Chapter 3.4 --- Convergence and Multiple Minima Issues --- p.44 / Chapter 3.4.1 --- Convergence --- p.44 / Chapter 3.4.2 --- Multiple Minima --- p.48 / Chapter 3.5 --- Stopping Criteria --- p.52 / Chapter 3.6 --- Summary --- p.53 / Chapter 4 --- Experimental Results --- p.55 / Chapter 4.1 --- Introduction --- p.55 / Chapter 4.2 --- Numerical Examples --- p.56 / Chapter 4.2.1 --- Examples of Attenuated Disk Models --- p.57 / Chapter 4.2.2 --- Examples of Binary Sensor Models --- p.63 / Chapter 4.3 --- Performance Metrics of Mobile Sensor Deployment Schemes --- p.68 / Chapter 4.4 --- Comparison to Existing Methods --- p.74 / Chapter 4.5 --- Summary --- p.81 / Chapter 5 --- Conclusions --- p.83 / Chapter 5.1 --- Conclusions --- p.83 / Chapter 5.2 --- Future Research Directions --- p.85 / Appendices --- p.87 / Chapter A --- An Overview of Existing Deployment Methods --- p.88 / Chapter A.1 --- Potential Fields and Virtual Forces --- p.88 / Chapter A.2 --- Distributed Self-Spreading Algorithm --- p.92 / Chapter A.3 --- VD-Based Deployment Algorithm --- p.96 / Bibliography --- p.99

Fung, Chun Yip. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 53-54). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- The Exchange Algorithm Framework --- p.4 / Chapter 2.1 --- Ordinary Least Squares Linear Regression --- p.5 / Chapter 2.2 --- The Exchange Algorithm --- p.6 / Chapter 3 --- Methodology --- p.12 / Chapter 3.1 --- Least Median Squares Linear Regression --- p.12 / Chapter 3.2 --- Least Median Squares Algorithm for Clusterwise Linear Re- gression --- p.16 / Chapter 3.3 --- Measures of Performance --- p.20 / Chapter 3.4 --- An Illustrative Example --- p.24 / Chapter 4 --- Monte Carlo Simulation Study --- p.34 / Chapter 4.1 --- Simulation Plan --- p.34 / Chapter 4.2 --- Simulation Results --- p.41 / Chapter 4.2.1 --- Effects of the Six factors --- p.41 / Chapter 4.2.2 --- Comparisons between LMSA and the Exchange Algorithm --- p.47 / Chapter 4.2.3 --- Evaluation of the Improvement of Regression Parame- ters by Performing Stage 3 in LMSA --- p.50 / Chapter 5 --- Concluding Remarks --- p.51 / Bibliography --- p.52

Hops are one of the four main ingredients used to produce beer. Many studies have been done to analyze the science behind growing and harvesting hops, creating hop hybrids, and how to brew beer with hops. However, there has been little research done revolving around the economic demand and supply model of the hop market. The objectives of this study are to create an econometric model of supply and demand of hops in the United States from 1981 to 2012, and to identify important exogenous variables that explain the supply and demand of hops using the two-stage least squares (2SLS) method of analysis. Using the 2SLS method, the demand model yielded that the US beer production variable is significant at the 10 percent level. For every 1 percent change in US beer production, there will be a 6.25 percent change in quantity of hops demanded in the same direction. The supply model showed that US acreage is significant at the 1 percent level. For every 1 percent change in US acreage, there will be a 0.889 percent change in quantity of hops supplied in the same direction. The implications of this study are viewed in relation to both producers and consumers.

Adaptive filters have found applications in many signal processing problems. In some situations, linear constraints are imposed on the filter weights such that the filter is forced to exhibit a certain desired response. Several algorithms for linearly constrained least-squares adaptive filtering have been developed in the literature. When implemented with finite precision arithmetic, these algorithms are inevitably subjected to rounding errors. It is essential to understand how these algorithms react to rounding errors.In this thesis, the numerical properties of three linearly constrained least-squares adaptive filtering algorithms, namely, the linearly constrained fast least algorithm, the linear systolic array for MVDR beamforming and the linearly constrained QRD-RLS algorithm, are studied. It is shown that all these algorithms can be separated into a constrained part and an unconstrained part. The numerical properties of unconstrained least-squares algorithms (i.e., the unconstrained part of the linearly constrained algorithms under study) are reviewed from the perspectives of error propagation, error accumulation and numerical persistency. It is shown that persistent excitation and sufficient numerical resolution are needed to ensure the stability of the CRLS algorithm, while the QRD-RLS algorithm is unconditionally stable. The numerical properties of the constrained algorithms are then examined. Based on the technique of how the constraints are applied, these algorithms can be grouped into two categories. The first two algorithms admit a similar structure in that the unconstrained parts preceed the constrained parts. Error propagation analysis shows that this structure gives rise to unstable error propagation in the constrained part. In contrast, the constrained part of the third algorithm preceeds the unconstrained part. It is shown that this algorithm gives an ++ / exact solution to a linearly constrained least-squares adaptive filtering problem with perturbed constraints and perturbed input data. A minor modification to the constrained part of the linearly constrained QRD-RLS algorithm is proposed to avoid a potential numerical difficulty due to the Gaussian elimination operation employed in the algorithm.

Doctor of Philosophy (PhD) / This thesis considers transmission techniques for current and future wireless and mobile communications systems. Many of the results are quite general, however there is a particular focus on code-division multiple-access (CDMA) and multi-input multi-output (MIMO) systems. The thesis provides analytical techniques and results for finding key performance metrics such as signal-to-interference and noise power ratios (SINR) and capacity. This thesis considers a large-system analysis of a general linear matrix-vector communications channel, in order to determine the asymptotic performance of linear fixed and adaptive receivers. Unlike many previous large-system analyses, these results cannot be derived directly from results in the literature. This thesis considers a first-principles analytical approach. The technique unifies the analysis of both the minimum-mean-squared-error (MMSE) receiver and the adaptive least-squares (ALS) receiver, and also uses a common approach for both random i.i.d. and random orthogonal precoding. The approach is also used to derive the distribution of sums and products of free random matrices. Expressions for the asymptotic SINR of the MMSE receiver are derived, along with the transient and steady-state SINR of the ALS receiver, trained using either i.i.d. data sequences or orthogonal training sequences. The results are in terms of key system parameters, and allow for arbitrary distributions of the power of each of the data streams and the eigenvalues of the channel correlation matrix. In the case of the ALS receiver, we allow a diagonal loading constant and an arbitrary data windowing function. For i.i.d. training sequences and no diagonal loading, we give a fundamental relationship between the transient/steady-state SINR of the ALS and the MMSE receivers. We demonstrate that for a particular ratio of receive to transmit dimensions and window shape, all channels which have the same MMSE SINR have an identical transient ALS SINR response. We demonstrate several applications of the results, including an optimization of information throughput with respect to training sequence length in coded block transmission.

<p>Shooter localization systems are used to detect and locate the origin of gunfire. A wireless sensor network is one possible implementation of such a system. A wireless sensor network is sensitive to synchronization errors. Localization techniques that rely on the timing will give less accurate or even useless results if the synchronization errors are too large.</p><p>This thesis focuses on the influence of synchronization errors on the abilityto localize a shooter using a wireless sensor network. A localization algorithm</p><p>is developed and implemented and the effect of synchronization errors is studied. The localization algorithm is evaluated using numerical experiments, simulations, and data from real gunshots collected at field trials.</p><p>The results indicate that the developed localization algorithm is able to localizea shooter with quite good accuracy. However, the localization performance is to a high degree influenced by the geographical configuration of the network as well as the synchronization error.</p> / <p><p>Skottlokaliseringssystem används för att upptäcka och lokalisera ursprunget för avlossade skott. Ett trådlöst sensornätverk är ett sätt att utforma ett sådant system.Trådlösa sensornätverk är känsliga för synkroniseringsfel. Lokaliseringsmetoder som bygger på tidsobservationer kommer med för stora synkroniseringsfel ge dåliga eller helt felaktiga resultat.</p><p>Detta examensarbete fokuserar på vilken inverkan synkroniseringsfel har på möjligheterna att lokalisera en skytt i ett trådlöst sensornätverk. En lokaliseringsalgoritm utvecklas och förmågan att korrekt lokalisera en skytt vid olika synkroniseringsfel undersöks. Lokaliseringsalgoritmen prövas med numeriska experiment, simuleringar och även för data från riktiga skottljud, insamlade vid fältförsök.</p><p>Resultaten visar att lokaliseringsalgoritmen fungerar tillfredställande, men att lokaliseringsförmågan till stor del påverkas av synkroniseringsfel men även av sensornätverkets geografiska utseende.</p></p>

No description available.

Representations of SO(4,2;R) are constructed using 4 x 4 and 2 x 2 matrices with elements in H' ��� C . Using 2 x 2 matrix representations of C and H', the 4 x 4 representation is interpreted in terms of 16 x 16 real matrices. Finally, the known isomorphism between the conformal group and SO(4,2;R) is written explicitly in terms of the 4 x 4 representation. The 4 x 4 construction should generalize to matrices with elements in K' ��� K for K any normed division algebra over the reals and K' any split algebra over the reals. / Graduation date: 2013