In this thesis we present a novel algorithm, <I>HyperCleaning*</I>, for effectively inferring phylogenetic trees. The method is based on the quartet method paradigm and is guaranteed to recover the best supported edges of the underlying phylogeny based on the witness quartet set. This is performed efficiently using a collapsing mechanism that employs memory/time tradeoff to ensure no loss of information. This enables <I>HyperCleaning*</I> to solve the relaxed version of the Maximum-Quartet-Consistency problem feasibly, thus providing a valuable tool for inferring phylogenies using quartet based analysis.

In this thesis we present a novel algorithm, <I>HyperCleaning*</I>, for effectively inferring phylogenetic trees. The method is based on the quartet method paradigm and is guaranteed to recover the best supported edges of the underlying phylogeny based on the witness quartet set. This is performed efficiently using a collapsing mechanism that employs memory/time tradeoff to ensure no loss of information. This enables <I>HyperCleaning*</I> to solve the relaxed version of the Maximum-Quartet-Consistency problem feasibly, thus providing a valuable tool for inferring phylogenies using quartet based analysis.

Groundwater data in this thesis, which is taken from the database of Sveriges Geologiska Undersökning, characterizes chemical and quantitative status of groundwater in Sweden. The data usually is recorded with only quantification limits when it is below certain values. Accordingly, this thesis is aiming at handling such kind of data. The thesis considers this topic by using the EM algorithm to get the results from maximum likelihood estimation. Consequently, estimations of distributions on censored data of trace elements are expounded on. Related simulations show that the estimation is acceptable.

The main purpose of this thesis is to estimate the direct path in dense multipath Ultra Wide-Band (UWB) environment. The time-of-arrival (ToA) estimation algorithm used is based on Generalized Maximum-Likelihood (GML) algorithm. Nevertheless, GML algorithm is so time-consuming that the results usually take a very long period of time, and sometimes fail to converge. Hence, the schemes that would improve the algorithm are investigated. In the schemes, the search was executed in sequential form. Two threshold parameters are to be determined¡Xone is about the arrival time of the estimation path while the other is the fading amplitude of the estimation path. The thresholds are determined in order to terminate the sequential algorithm. The determination of thresholds is based on error analysis, including the probability of error and root-mean-square error. The analysis of the probability of error is subject to the probability of false alarm and the probability of miss. However, a trade-off problem on the probability of false alarm and the probability of miss exists in the process of determining thresholds. The thresholds are determined according to the requirement of the probability of error. We propose an improvement scheme for determining the two thresholds. In the proposed scheme, candidate pairs are evaluated within an appropriate range. The root-mean-square error value for each pair of thresholds is calculated. The smallest error, corresponding to the desired thresholds, is chosen for use in ToA estimation. From the simulation results, it is seen that, when SNR falls between -4dB and 16dB, the improvement proposed scheme results has the smaller estimation error.

The main purpose of this thesis is to combine modified GML algorithm with 2-D simulated annealing for estimation of signal arrival time in the UWB systems.In a dense multipath environment, the generalized maximum-likelihood (GML) algorithm can be used for the time-of-arrival (TOA) estimation. Nevertheless, the GML algorithm usually takes a long period of time, and sometimes fails to converge. Hence, a modified GML (MGML) algorithm is investigated. Two threshold parameters need to be determined in using the estimation algorithm. One threshold is to decide the arrival time range of estimated path, and the other, an amplitude threshold, is to judge whether the estimated path is true. Generally, the decision rule of thresholds may be based on the minimum error probability, which is defined as the sum of false alarm probability and miss probability. To mitigate the effects from noise and dense multipath interference, and to reduce the computational complexity of the algorithm, a method of threshold settings based on the minimum root mean square error (RMSE) criteria is discussed. In this scheme, the RMSE value for each candidate threshold pair in an appropriate region is computed. Constructing an accurate RMSE table and performing a full-scale grid search of adequate threshold settings can be very time-consuming. A 2-D simulated annealing process is adopted for finding the best pair of thresholds for use in the modified GML algorithm. The simulated annealing, different from the gradient descent, can avoid trapping into a local minimum in finding the best threshold pair. The resulting threshold pair makes the modified GML algorithm become more efficient in estimating the signal arrival time with an automatic search manner. Simulation results show that the proposed scheme can achieve better performance than the grid search approaches in UWB environments.

Univ. der Bundeswehr, Diss.--München, 2003.

No description available.

Universiẗat, Diss., 2002--Dortmund.

Techn. Hochsch., Diss., 2000--Aachen.

Universiẗat, Diss., 2000--Freiburg (Breisgau).