نتایج جستجو برای: finite source

تعداد نتایج: 668342  

Journal: :IEEE Trans. Information Theory 1989
John C. Kieffer

1259 Ahsfracf-We associate with a given nonstationary finite-alphabet information source a certain class of stationary processes which we term the stationary hull of the given source. It is then shown that the optimum average rate at which the given source can be noiselessly coded via finite-state adaptive block to variable-length coding schemes is the largest entropy rate among those processes...

2014
Li Lin Xu Zhang Yun Li Guangxu Cheng Li LIN Xu ZHANG Yun LI Guangxu CHENG

An analytical model based on modal series expansion method for calculating transmission loss (TL) of compressor’s mufflers has been present in this paper. The approximately averaged pressure response value, obtained by calculating the weighted average pressure response value in the vicinity of the point source, is applied to derive the pressure response functions and four-pole parameters. There...

2012
Sathish Ramani Jeffrey A. Fessler

Statistical reconstruction methods for X-ray CT rely on regularization to yield good quality images. We propose and investigate a specific type of nonquadratic regularization for 3-D CT reconstruction that corresponds to applying a 2-D orthonormal wavelet transform (OWT) on trans-axial slices and finite differences (FD) along the axial direction. We use an iterative variable-splitting-based alt...

2007
Omar Ramadan Oyku Akaydin

In this paper, the parallel implementation of the Wave-Equation Finite Difference Time Domain (WE-FDTD) method, using the Message Passing Interface (MPI) system, is presented. The WE-FDTD computational domain is divided into subdomains using onedimensional topology. Numerical simulations have been carried out for a line current source radiating in two-dimensional domains of different sizes and ...

2009
Michael Riley Cyril Allauzen Martin Jansche

Finite-state methods are well established in language and speech processing. OpenFst (available from www.openfst.org) is a free and open-source software library for building and using finite automata, in particular, weighted finite-state transducers (FSTs). This tutorial is an introduction to weighted finitestate transducers and their uses in speech and language processing. While there are othe...

2013
XIAOMAO DENG YUBO ZHAO JUN ZOU

Linear elements are least expensive finite elements for simultaneously recovering the source location and intensity in a general convection-diffusion process. However, the derivatives of the least-squares objective functional with Tikhonov regularizations are not well-defined when linear finite elements are used. In this work we provide a systematic formulation of the numerical inversion using ...

Ali Delnavaz, Ali Hajsayedtaghiya Mohammad Ali Habibzadeh

Time-history analysis is defined as a kind of dynamic analysis increasingly used in design of structures and evaluation of existing ones. One of the important issues in the Time-history analysis is selecting earthquake records. In this case, seismic design provisions states that time histories shall have similar source mechanisms, geological and seismological features with region under study. A...

Journal: :IEEE Trans. Information Theory 1994
László Györfi Istvan Pali Edward C. van der Meulen

We show that a discrete infinite distribution with finite entropy cannot be estimated consistently in information divergence. As a corollary we get that there is no universal source code for an infinite source alphabet over the class of all discrete memoryless sources with finite entropy.

Kazerooni, A., Moradi, M., Shaikh Meiabadi, M.Saleh ,

Laser welding is a novel method for direct joining of metals and polymers, which leads to a mechanical and chemical bond between metal and polymer. In this study, feasibility of dissimilar joining between St12 and polycarbonate is studied theoretically. Then, the ND: YAG laser is implemented to join St12 and Polycarbonate. Empirical results indicate creation of a joint between St12 and polycarb...

Journal: :CoRR 2010
John C. Kieffer Yu Liao

Let G be a finite strongly connected aperiodic directed graph in which each edge carries a label from a finite alphabet A. Then G induces a trellis coded quantizer for encoding an alphabet A memoryless source. A source sequence of long finite length is encoded by finding a path in G of that length whose sequence of labels is closest in Hamming distance to the source sequence; finding the minimu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید