Consider a large population containing a small number of defective items. A commonly encountered goal is to identify the defective items, for example, to isolate them. In the classical non-adaptive group testing (NAGT) approach, one groups the items into subsets, or pools, and runs tests for the presence of a defective itemon each pool. Using the outcomes the tests, a fundamental goal of group testing is to reliably identify the complete set of defective items with as few tests as possible. In contrast, this thesis studies a non-defective subset identification problem, where the primary goal is to identify a “subset” of “non-defective” items given the test outcomes. The main contributions of this thesis are: We derive upper and lower bounds on the number of nonadaptive group tests required to identify a given number of non-defective items with arbitrarily small probability of incorrect identification as the population size goes to infinity. We show that an impressive reduction in the number of tests is achievable compared to the approach of first identifying all the defective items and then picking the required number of non-defective items from the complement set. For example, in the asymptotic regime with the population size N → ∞, to identify L nondefective items out of a population containing K defective items, when the tests are reliable, our results show that O _ K logK L N _ measurements are sufficient when L ≪ N − K and K is fixed. In contrast, the necessary number of tests using the conventional approach grows with N as O _ K logK log N K_ measurements. Our results are derived using a general sparse signal model, by virtue of which, they are also applicable to other important sparse signal based applications such as compressive sensing. We present a bouquet of computationally efficient and analytically tractable nondefective subset recovery algorithms. By analyzing the probability of error of the algorithms, we obtain bounds on the number of tests required for non-defective subset recovery with arbitrarily small probability of error. By comparing with the information theoretic lower bounds, we show that the upper bounds bounds on the number of tests are order-wise tight up to a log(K) factor, where K is the number of defective items. Our analysis accounts for the impact of both the additive noise (false positives) and dilution noise (false negatives). We also provide extensive simulation results that compare the relative performance of the different algorithms and provide further insights into their practical utility. The proposed algorithms significantly outperform the straightforward approaches of testing items one-by-one, and of first identifying the defective set and then choosing the non-defective items from the complement set, in terms of the number of measurements required to ensure a given success rate. We investigate the use of adaptive group testing in the application of finding a spectrum hole of a specified bandwidth in a given wideband of interest. We propose a group testing based spectrum hole search algorithm that exploits sparsity in the primary spectral occupancy by testing a group of adjacent sub-bands in a single test. This is enabled by a simple and easily implementable sub-Nyquist sampling scheme for signal acquisition by the cognitive radios. Energy-based hypothesis tests are used to provide an occupancy decision over the group of sub-bands, and this forms the basis of the proposed algorithm to find contiguous spectrum holes of a specified bandwidth. We extend this framework to a multistage sensing algorithm that can be employed in a variety of spectrum sensing scenarios, including non-contiguous spectrum hole search. Our analysis allows one to identify the sparsity and SNR regimes where group testing can lead to significantly lower detection delays compared to a conventional bin-by-bin energy detection scheme. We illustrate the performance of the proposed algorithms via Monte Carlo simulations.

The aim of this master thesis is to study algorithms for automatically tuning antenna parameters to improve the performance of the radio access part of a telecommunication network and user experience. There are four dierent optimization algorithms, Stepwise Minimization Algorithm, Random Search Algorithm, Modied Steepest Descent Algorithm and Multi-Objective Genetic Algorithm to be applied to a model of a radio access network. The performances of all algorithms will be evaluated in this thesis. Moreover, a graphical user interface which is developed to facilitate the antenna tuning simulations will also be presented in the appendix of the report.

Predicting evaporation is essential for managing water resources in basins. Improvement of the prediction accuracy is essential to identify adequate inputs on evaporation. In this study, artificial neural network (ANN) is coupled with several evolutionary algorithms, i.e., capuchin search algorithm (CSA), firefly algorithm (FFA), sine cosine algorithm (SCA), and genetic algorithm (GA) for robust training to predict daily evaporation of seven synoptic stations with different climates. The inclusive multiple model (IMM) is then used to predict evaporation based on established hybrid ANN models. The adjusting model parameters of the current study is a major challenge. Also, another challenge is the selection of the best inputs to the models. The IMM model had significantly improved the root mean square error (RMSE) and Nash Sutcliffe efficiency (NSE) values of all the proposed models. The results for all stations indicated that the IMM model and ANN-CSA could outperform other models. The RMSE of the IMM was 18, 21, 22, 30, and 43% lower than those of the ANNCSA, ANN-SCA, ANN-FFA, ANN-GA, and ANN models in the Sharekord station. The MAE of the IMM was 0.112 mm/day, while it was 0.189 mm/day, 0.267 mm/day, 0.267 mm/day, 0.389 mm/day, 0.456 mm/day, and 0.512 mm/day for the ANN-CSA, ANN-SCA, and ANN-FFA, ANN-GA, and ANN models, respectively, in the Tehran station. The current study proved that the inclusive multiple models based on improved ANN models considering the fuzzy reasoning had the high ability to predict evaporation.

<p>Сваки мехатронички систем лифта (МСЛ) садржи механички подсистем<br />који је карактерисан својом резонантном фреквенцијом. У дисертацији је<br />представљен оригинални метод за подешавање антирезонантног<br />филтера базиран на примјени Герцеловог алгоритма и Киферовог<br />алгоритма претраживања. Предложен је јединствени генерализовани<br />модел референце брзине у функцији трзаја. Кроз експерименталне<br />провјере, верификовано је да само синергијски ефекат контроле трзаја и<br />филтрирања референтног момента може елиминисати резонантне<br />вибрације. Предложени су поступци и развијени алгоритми за повећање<br />енергетске ефикасности погона МСЛ. Предложени алгоритми су у<br />интеракцији са планираном трајекторијом брзине и антирезонантном<br />управљачком шемом. Сви предложени алгоритми су имплементирани<br />на дигиталном сигнал процесору.</p> / <p>Svaki mehatronički sistem lifta (MSL) sadrži mehanički podsistem<br />koji je karakterisan svojom rezonantnom frekvencijom. U disertaciji je<br />predstavljen originalni metod za podešavanje antirezonantnog<br />filtera baziran na primjeni Gercelovog algoritma i Kiferovog<br />algoritma pretraživanja. Predložen je jedinstveni generalizovani<br />model reference brzine u funkciji trzaja. Kroz eksperimentalne<br />provjere, verifikovano je da samo sinergijski efekat kontrole trzaja i<br />filtriranja referentnog momenta može eliminisati rezonantne<br />vibracije. Predloženi su postupci i razvijeni algoritmi za povećanje<br />energetske efikasnosti pogona MSL. Predloženi algoritmi su u<br />interakciji sa planiranom trajektorijom brzine i antirezonantnom<br />upravljačkom šemom. Svi predloženi algoritmi su implementirani<br />na digitalnom signal procesoru.</p> / <p>Each elevator mechatronic system (EMS) contains a mechanical subsystem<br />which is characterized by its resonant frequencies. The original method for<br />band-stop filter tuning based on Goertzel algorithm and Kiefer search<br />algorithm is proposed in dissertation. In order to generate the speed<br />reference trajectory which can be defined by different shapes and amplitudes<br />of jerk, a unique generalized model is proposed. Through experimental<br />verifications, it has been verified that only synergistic effect of controlling jerk<br />and filtrating the reference torque can eliminate resonant vibrations. The<br />dissertation proposes procedures and developed algorithms for increasing<br />the energy efficiency of the EMS power drive. The proposed algorithms are<br />in interaction with the planned speed reference trajectory and the proposed<br />anti-resonant control scheme. The all proposed algorithms are implemented<br />on the digital signal processor.</p>

在傳統的線性迴歸分析當中，當基本假設不滿足時，有時可考慮變數轉換使得資料能夠比較符合基本假設。在眾多的轉換方法當中，以Box和Cox(1964)所提出的乘冪轉換(Box-Cox power transformation)最為常用，乘冪轉換可將某些複雜的系統轉換成線性常態模式。然而當資料存在離群值(outlier)時，Box-Cox Transformation會受到影響，因此不是一種穩健方法。 在本篇論文當中，我們利用前進演算法(forward search algorithm)求得最小消去平方估計量(Least trimmed squares estimator)，在過程當中估計出穩健的轉換參數。

In dieser Arbeit wird ein simultanes Quell-, Ziel-, Verkehrsmittel- und Routenwahlmodell (Modell EVA-U) entwickelt, welches ein stochastisches Nutzergleichgewicht erreicht. Die Routenwahlmodelle der Verkehrsarten sind nicht mehr Teil der Umlegungsalgorithmen, sondern in das Nachfragemodell integriert. Dadurch ist eine konsistente Bewertung aller Alternativen (der Verkehrsarten) möglich. Das Simultanmodell EVA-U stellt eine Weiterentwicklung des Simultanmodells EVA von LOHSE dar. Das EVA-U-Modell ist den universalen Logit-Modellen zuzuordnen. Die Randsummenbedingungen der Verkehrsverteilung werden beachtet. Die Bewertung der Alternativen erfolgt mittels Generalisierter Kosten. Die Abhängigkeit von Routen wird berücksichtigt, ebenso die Tagesganglinie der Verkehrsnachfrage und die Fahrpläne des ÖV-Systems. Das Modell EVA-U erlaubt auch die Berücksichtigung von Routen intermodaler Verkehrsarten (z.B. P+R). Darüber hinaus ist die Integration eines Modells des ruhenden Verkehrs möglich. / In this thesis a simultaneous Trip Generation-, Distribution-, Modal-Split and Route Choice Model (modell EVA-U) is elaborated. The model tends to reach a stochastic user equilibrium. The route choice algorithms are not longer part of an assignment procedure but part of the demand model. A consistent assessment of properties of all transport systems is possible. The simultaneous model EVA-U is an advancement of the EVA-Model by Lohse. The model EVA-U is to be assigned to the generalised logit-models. All matrix constrains are taken into account. The assessment is effected by generalised costs. The dependence of routes is taken into account. Moreover, the integration of day time and the schedules of private transport lines is possible. Furthermore, it is possible to integrate a model of parked cars and circuits of inter-modal traffic forms (park and ride) in the Model EVA-U.

In this thesis, our focus is on low-complexity, high-performance detection algorithms for multi-antenna communication receivers. A key contribution in this thesis is the demonstration that efficient algorithms from metaheuristics and machine learning can be gainfully adapted for signal detection in multi- antenna communication receivers. We first investigate a popular metaheuristic known as the reactive tabu search (RTS), a combinatorial optimization technique, to decode the transmitted signals in large-dimensional communication systems. A basic version of the RTS algorithm is shown to achieve near-optimal performance for 4-QAM in large dimensions. We then propose a method to obtain a lower bound on the BER performance of the optimal detector. This lower bound is tight at moderate to high SNRs and is useful in situations where the performance of optimal detector is needed for comparison, but cannot be obtained due to very high computational complexity. To improve the performance of the basic RTS algorithm for higher-order modulations, we propose variants of the basic RTS algorithm using layering and multiple explorations. These variants are shown to achieve near-optimal performance in higher-order QAM as well. Next, we propose a new receiver called linear regression of minimum mean square error (MMSE) residual receiver (referred to as LRR receiver). The proposed LRR receiver improves the MMSE receiver by learning a linear regression model for the error of the MMSE receiver. The LRR receiver uses pilot data to estimate the channel, and then uses locally generated training data (not transmitted over the channel) to find the linear regression parameters. The LRR receiver is suitable for applications where the channel remains constant for a long period (slow-fading channels) and performs well. Finally, we propose a receiver that uses a committee of linear receivers, whose parameters are estimated from training data using a variant of the AdaBoost algorithm, a celebrated supervised classification algorithm in ma- chine learning. We call our receiver boosted MMSE (B-MMSE) receiver. We demonstrate that the performance and complexity of the proposed B-MMSE receiver are quite attractive for multi-antenna communication receivers.

The diploma thesis deals with the use of a simulation model for the development of an automatic algorithm for the creation of a routing table and route evaluation in a transport system. It includes a search of modeling and simulation issues and state-space search issues with an analysis of available search methods. The simulation model of the transport system is created in the software Tecnomatix Plant Simulation, where an algorithm for automatic creation of routing tables for routing and evaluation of routes according to static criteria is subsequently developed and tested. The work presents a proposal for the principle of the algorithm for evaluating the routes of the transport system, including dynamic criteria and their optimization.

在迴歸分析中，當資料中存在很多離群值時，偵測的工作變得非常不容易。 在此狀況下，我們無法使用傳統的殘差分析正確地偵測出其是否存在，此現象稱為遮蔽效應(The Masking Effect)。 而為了避免此效應的發生，我們利用最小中位數穩健迴歸估計值(Least Median Squares Estimator)正確地找出這些群集離群值，此估計值擁有最大即50﹪的容離值 (Breakdown point)。 在這篇論文中，用來求出最小中位數穩健迴歸估計值的演算法稱為步進搜尋演算法 (the Forward Search Algorithm)。 結果顯示，我們可以利用此演算法得到的穩健迴歸估計值，很快並有效率的找出資料中的群集離群值；另外，更進一步的結果顯示，我們只需從資料中隨機選取一百次子集，並進行步進搜尋，即可得到概似的穩健迴歸估計值並正確的找出那些群集離群值。 最後，我們利用鐘乳石圖(Stalactite Plot)列出所有被偵測到的離群值。 在多變量資料中，我們若使用Mahalanobis距離也會遭遇到同樣的屏蔽效應。 而此一問題，隨著另一高度穩健估計值的採用，亦可迎刃而解。 此估計值稱為最小體積橢圓體估計值 (Minimum Volume Ellipsoid)，其亦擁有最大即50﹪的容離值。 在此，我們也利用步進搜尋法求出此估計值，並利用鐘乳石圖列出所有被偵測到的離群值。 這篇論文的第二部分則利用變數轉換的技巧將迴歸資料中的殘差項常態化並且加強其等變異的特性以利後續的資料分析。 在步進搜尋進行的過程中，我們觀察分數統計量(Score Statistic)和其他相關診斷統計量的變化。 結果顯示，這些統計量一起提供了有關轉換參數選取豐富的資訊，並且我們亦可從步進搜尋進行的過程中觀察出某些離群值對參數選取的影響。 / Detecting regression outliers is not trivial when there are many of them. The methods of using classical diagnostic plots sometimes fail to detect them. This phenomenon is known as the masking effect. To avoid this, we propose to find out those multiple outliers by using a highly robust regression estimator called the least median squares (LMS) estimator which has maximal breakdown point. The algorithm in search of the LMS estimator is called the forward search algorithm. The estimator found by the forward search is shown to lead to the rapid detection of multiple outliers. Furthermore, the result reveals that 100 repeats of a simple forward search from a random starting subset are shown to provide sufficiently robust parameter estimators to reveal multiple outliers. Finally, those detected outliers are exhibited by the stalactite plot that shows greatly stable pattern of them. Referring to multivariate data, the Mahalanobis distance also suffers from the masking effect that can be remedied by using a highly robust estimator called the minimum volume ellipsoid (MVE) estimator. It can also be found by using the forward search algorithm and it also has maximal breakdown point. The detected outliers are then displayed in the stalactite plot. The second part of this dissertation is the transformation of regression data so that the approximate normality and the homogeneity of the residuals can be achieved. During the process of the forward search, we monitor the quantity of interest called score statistic and some other diagnostic plots. They jointly provide a wealth of information about transformation along with the effect of individual observation on this statistic.

In dieser Arbeit wird ein simultanes Quell-, Ziel-, Verkehrsmittel- und Routenwahlmodell (Modell EVA-U) entwickelt, welches ein stochastisches Nutzergleichgewicht erreicht. Die Routenwahlmodelle der Verkehrsarten sind nicht mehr Teil der Umlegungsalgorithmen, sondern in das Nachfragemodell integriert. Dadurch ist eine konsistente Bewertung aller Alternativen (der Verkehrsarten) möglich. Das Simultanmodell EVA-U stellt eine Weiterentwicklung des Simultanmodells EVA von LOHSE dar. Das EVA-U-Modell ist den universalen Logit-Modellen zuzuordnen. Die Randsummenbedingungen der Verkehrsverteilung werden beachtet. Die Bewertung der Alternativen erfolgt mittels Generalisierter Kosten. Die Abhängigkeit von Routen wird berücksichtigt, ebenso die Tagesganglinie der Verkehrsnachfrage und die Fahrpläne des ÖV-Systems. Das Modell EVA-U erlaubt auch die Berücksichtigung von Routen intermodaler Verkehrsarten (z.B. P+R). Darüber hinaus ist die Integration eines Modells des ruhenden Verkehrs möglich. / In this thesis a simultaneous Trip Generation-, Distribution-, Modal-Split and Route Choice Model (modell EVA-U) is elaborated. The model tends to reach a stochastic user equilibrium. The route choice algorithms are not longer part of an assignment procedure but part of the demand model. A consistent assessment of properties of all transport systems is possible. The simultaneous model EVA-U is an advancement of the EVA-Model by Lohse. The model EVA-U is to be assigned to the generalised logit-models. All matrix constrains are taken into account. The assessment is effected by generalised costs. The dependence of routes is taken into account. Moreover, the integration of day time and the schedules of private transport lines is possible. Furthermore, it is possible to integrate a model of parked cars and circuits of inter-modal traffic forms (park and ride) in the Model EVA-U.