For discretization method, which provides an effective way to handle the problem, we focus on constructing a discretized version of continuous failure times. The major observation is that discrete failure times with finite values will attain their exact values although only ranks are given, as long as sample size is large enough. The score function can be asymptotically approximated by a sum of independent random variables. Consistency, asymptotic normality and efficiency of estimator can be obtained by using standard results for estimating equations, given some milder and more feasible conditions than those of martingale method. / In this thesis, some finite sample properties of marginal likelihood will be established. We prove under some regular conditions the score function of the marginal likelihood is a martingale, and prove the marginal likelihood satisfies some properties enjoyed by the standard likelihood method, although only use the relative ranks to make inference of the parameter instead of the full information. / In this thesis, the author studies some asymptotic properties of the marginal maximum likelihood estimate (marginal MLE) for general transformation models. The general transformation model is an important class of models for survival times and is nontrivially more general model than the linear transformation model (Gu, Sun and Zuo, 2005). By using marginal likelihood, we obtain estimator of regression parameter which does not depend on its baseline survival function, a property enjoyed by the Cox regression model. The major obstacle for the general transformation models is the resulting estimation function is complicated and usually has no closed analytic expression. Gu etc. (2005) proposed Markov chain Monte Carlo (MCMC) stochastic approximation algorithm to solve the marginal MLE. / Moreover, a discussion is given for the question of asymptotic properties for the proposed marginal MLE based on two different methods: martingale method and discretization method. For martingale method, emphasis is given to the role of martingale limit theory and results presented are primarily theoretical. / We also demonstrate some important transformation models do satisfy our conditions and thus show their consistency, asymptotic normality and efficiency for the first time. / Huang Bin. / "Dec 2005." / Source: Dissertation Abstracts International, Volume: 67-11, Section: B, page: 6484. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (p. 63-69). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

No description available.

The Discrete Cosine Transform is used in many image and video compression standards. Many methods have been developed for efficiently computing the Discrete Cosine Transform including flowgraph algorithms, distributed arithmetic and two-dimensional decompositions. A new architecture based on distributed arithmetic is presented for computing the Discrete Cosine Transform and it's inverse. The main objective of the design is to minimize the area of the VLSI implementation while maintaining the throughput necessary for video and image compression standards such as MPEG and JPEG. Several improvements have been made compared to previously published distributed arithmetic architectures. These include elimination of four lookup tables and implementation of the lookup tables using logic instead of ROM. A model of the proposed architecture was written in C. The model was used to verify the accuracy of the architecture and to do JPEG compression on a series of test images. Behavioral simulations were performed with a hardware model written in the Verilog hardware description language. These behavioral simulations verify that the hardware implementation matches the C model. The model was synthesized using the Synopsis synthesis tool. The gate count and clock rate of the design were estimated using the synthesis results. / Graduation date: 1997

A VLSI system for image compression based on two dimensional discrete cosine transform (2-D DCT) is designed and its performance is estimated. The focus is mainly on the reduction of power consumption and a reasonable speed. A 2-D DCT algorithm called row-column decomposition is chosen for the VLSI design of the system. Then a modified power saving architecture is proposed based on the property and purpose of image compression. Several methods, including the use of low power library cells and low voltage (Vdd=1.5v), are used to achieve the goal of power reduction. Techniques that reduces power, such as ordering of input signals and common term sharing, are applied to the design of the system. These techniques and methods span from algorithm, architecture, logic style and circuit. In addition to using standard cells, some custom cells are also created. The control, timing and synchronization circuitry is detailed in the design of the system. HSPICE simulation shows that the designed 2-D DCT system can operate at more than 20MHz for 8 by 8 image blocks using 1.2u CMOS technology. Based on the effective switched capacitances provided by library cell data sheets, power consumption performance is estimated. The system consumes about 17mW at the maximum speed and the specified supply voltage. Comparisons to other implementations show that the designed system exceeds in power performance. / Graduation date: 1996

Thèse de doctorat : Sciences : Paris, Faculté des sciences : 1867. / Titre provenant de l'écran-titre.

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 117-125). Available also in a digital version from Dissertation Abstracts.

In chapters I and II, we show that the group G of invertible, non-singular transformations of a Lebesgue space is perfect, simple, and has no outer automorphisms. Some related results are obtained for the subgroup of measure preserving transformations and for the full group of an ergodic transformation. Further results are given with the underlying Lebesgue space replaced by a homogeneous measure algebra. It is also shown, in chapter III, that ergodic transformations are algebraically distinguishable from non-ergodics. Chapter IV introduces the notion of a fibered ergodic transformation. A fibered analogue of Dye's theorem is proved. In chapter V the family of transformations satisfying Dye's theorem for two fixed ergodics is shown to be dense in the coarse topology. Finally, in chapter VI, the concept of a triangle set in the unit square is introduced. Using this notion, a sufficiency condition for the ergodicity of T x S is obtained.

No description available.

No description available.

No description available.