University of Macau / Faculty of Science and Technology. / Department of Computer and Information Science

Choi, Yuet Kei. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 68-72). / Abstracts in English and Chinese. / Acknowledgement --- p.i / Abstract --- p.ii / Contents --- p.vi / List of Figures --- p.viii / Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Previous Works --- p.3 / Chapter 1.1.1 --- Template deformation --- p.3 / Chapter 1.1.2 --- Mesh partitioning --- p.3 / Chapter 1.1.3 --- Mesh Smoothing --- p.4 / Chapter 1.2 --- Overview of the approach --- p.5 / Chapter 1.3 --- Thesis outline --- p.7 / Chapter 2. --- Global Deformation --- p.8 / Chapter 2.1 --- The closet point method --- p.10 / Chapter 2.1.1 --- Computational complexity --- p.11 / Chapter 2.2 --- Deformation Techniques --- p.12 / Chapter 2.2.1 --- Existing deformation method --- p.12 / Chapter 2.2.2 --- Radial Basis Functions (RBFs) --- p.14 / Chapter 2.2.2.1 --- Computational complexity --- p.18 / Chapter 2.2.3 --- Result --- p.18 / Chapter 2.3 --- Face flip prevention --- p.20 / Chapter 2.3.1 --- Detection of the flipped face --- p.22 / Chapter 2.3.1.1 --- Common approach: --- p.22 / Chapter 2.3.1.2 --- Our Approach --- p.23 / Chapter 2.3.1.3 --- Comparisons of the face flip detection method: --- p.26 / Chapter 2.3.2 --- Local Subdivision --- p.27 / Chapter 3. --- Partitioning of the mesh --- p.29 / Chapter 3.1 --- Existing method --- p.29 / Chapter 3.2 --- Our approach --- p.31 / Chapter 3.3 --- Computational complexity --- p.34 / Chapter 4. --- Mesh smoothing algorithm --- p.35 / Chapter 4.1 --- The Laplacian flow method --- p.36 / Chapter 4.2 --- The mean-curvature method --- p.40 / Chapter 4.3 --- Our Approach --- p.43 / Chapter 4.3.1 --- The modified mean-curvature method --- p.43 / Chapter 4.3.2 --- The modified Laplacian flow method --- p.45 / Chapter 4.3.3 --- Feature constraints --- p.47 / Chapter 4.3.4 --- Computational complexity --- p.47 / Chapter 4.4 --- Comparison of the mesh smoothing approach --- p.48 / Chapter 5. --- Implementation and Results --- p.51 / Chapter 5.1 --- Construction of the template mesh and boundary curves --- p.51 / Chapter 5.2 --- Selection of the corresponding vertex pairs --- p.52 / Chapter 5.3 --- Results --- p.54 / Chapter 6. --- Conclusions --- p.63 / Chapter 6.1 --- Future development --- p.65 / Appendix A --- p.66 / Determination of the projected path on a mesh: --- p.66 / Reference --- p.68

Computational geometry is the study of algorithms for manipulating sets of points, lines, polygons, planes and other geometric objects. For many problems in this realm, the sets considered are static and the data structures representing them do not permit efficient insertion and deletion of objects (e.g. points). Dynamic problems, in which the set and the geometric data structure change over time, are also of interest. The topic of this thesis is the presentation of fast algorithms for fully dynamic maintenance of some common geometric structures. The following configurations are examined: planar nearest-point and farthest-point Voronoi diagrams, convex hulls (in two and three dimensions), common intersection of halfspaces (2-D and 3-D), and contour of maximal vectors (2-D and 3-D). The principal techniques exploited are fast merging of substructures, and the use of extra storage. Dynamic geometric search structures based upon the configurations are also presented. / Science, Faculty of / Computer Science, Department of / Graduate

Signal-to-noise ratio (SNR) estimation is one of the important research topics in wireless communications. In the receiver, many algorithms require SNR information to achieve optimal performance. In this thesis, an autocorrelation based SNR estimator is proposed. The proposed method utilizes the correlation properties of symbol sequence and the uncorrelated properties of noise sequence to distinguish the signal power from the received signal. Curve fitting method is used for SNR estimator to predict the signal power. Mean and variance performance of the proposed SNR estimator is compared with that of the conventional SNR estimator by computer simulations. These simulations consider additive white Gaussian noise and multipath Rayleigh fading channel with BPSK, 8PSK, 16QAM and 64QAM modulation schemes. According to the simulation results, the proposed method can provide better performance than conventional methods in both mean and mean-square-error.

No description available.

The goal of this thesis is to study and model the Diel Vertical Migration (DVM) pattern using machine learning methods. We choose an Almost Periodic Function as the mathematical model and fit the monthly averaged migration data into a 5-term Fourier series whose coefficients and frequency are functions of time. The resulting function captures the general characteristics of the DVM pattern whose period is similar yet undergoes gradual changes over time. Further correlation analyses show that the monthly averaged distribution of zooplankton and various environmental factors are strongly correlated. Therefore, we adjust the function so that the coefficients and frequency are functions of environmental factors. Besides, we also examine the pattern on finer time scales using classification algorithms. We build classifiers which predict zooplankton existence at different depths based on a set of environmental measurements. Experiments demonstrate that both of the above methods are valid in modeling the DVM pattern.

Thesis (M.A.)--University of Wyoming, 2008. / Title from PDF title page (viewed on Mar. 23, 2010). Includes bibliographical references (p. 93-94).

No description available.

No description available.

This thesis explores the feasibility of the application of statistical regression theory to the curve fitting of mortality data. Equations derived from Makeham's first law were used. These include:1x = ksxgcXlog lx=a+hx+bcx color pX = A + BcxThe 1941 CSO and 1958 CSO mortality tables were used for initial study.Extending this work, pure raw mortality data in conjunction with a modified version of the last equation above was employed. Results were quite interesting.