Epoch extraction from linear prediction residual for identification of closed glottis interval

In voiced speech analysis epochal information is useful in accurate estimation of pitch periods and the frequency response of the vocal tract system. Ideally, linear prediction (LP) residual should give impulses at epochs. However, there are often ambiguities in the direct use of LP residual since samples of either polarity occur around epochs. Further, since the digital inverse filter does not compensate the phase response of the vocal tract system exactly, there is an uncertainty in the estimated epoch position. In this paper we present an interpretation of LP residual by considering the effect of the following factors: 1) the shape of glottal pulses, 2) inaccurate estimation of formants and bandwidths, 3) phase angles of formants at the instants of excitation, and 4) zeros in the vocal tract system. A method for the unambiguous identification of epochs from LP residual is then presented. The accuracy of the method is tested by comparing the results with the epochs obtained from the estimated glottal pulse shapes for several vowel segments. The method is used to identify the closed glottis interval for the estimation of the true frequency response of the vocal tract system.

Some nonstandard error analysis of discontinuous Galerkin methods for elliptic problems

An a priori error analysis of discontinuous Galerkin methods for a general elliptic problem is derived under a mild elliptic regularity assumption on the solution. This is accomplished by using some techniques from a posteriori error analysis. The model problem is assumed to satisfy a GAyenrding type inequality. Optimal order L (2) norm a priori error estimates are derived for an adjoint consistent interior penalty method.

Structure of disocium uridine 5'-Phosphate heptahydrate

Na2[CgHllN2OgP].7H20, M r = 494.0,orthorhombic, C222~, a = 22.880 (7), b = 8.877 (3),c = 19.592 (9) A, Z = 8, V = 3979.2 A 3. The Cu Ka intensity data consisted of 1005 unique reflections. Final R -- 14.5%. This nucleotide shows no unusual conformational features. The uracil base has an anti conformation about the glycosidic bond (tpo o = 44.4°). The furanose ring conformation is C(2')-endo,gauchegauche with tpo o = -75.5 ° and ~Poc = 49"6°.

Conformational Variability in Modified Nucleosides. Crystal and Molecular Structure of 2',3'-O-Isopropylidene Inosine

The crystal structure of 2',3'-O-isopropylidene inosine shows a number of interesting features. The four independent molecules in the asymmetric unit exhibit significant conformational variations. Ribose puckers fall in the O(4')-exo region, unfavourable in unsubstituted nucleosides. Hypoxanthine bases show base-pairing (I.I) in a manner analogous to the guanine self pairs (G.G) in 2',3'-O-isopropylidene guanosine but with a C(2)-H…O(6) hydrogen bond instead of N(2)-H…O(6).

Crystal Structure of Sodium Deoxyinosine Monophosphate

The crystal and molecular structure of sodium deoxyinosine monophosphate (5'-dIMP) has been determined by x-ray crystallographic methods. The crystals belong to orthorhombic space group P212121, with a = 21.079(5) Aring, b = 9.206(3) Aring and c = 12.770(6) Aring. This deoxynucleotide shows common nucleotide features namely anti conformation about the glycosyl bond, C2' endo pucker for the deoxyribose sugar and gauche-gauche orientation for the phosphate group. The sodium ion is directly coordinated to the O3' atom, a feature observed in many crystal structures of sodium salts of nucleotides.

A Parallel Progressive Refinement Image Rendering Algorithm on a Scalable Multithreaded VLSI Processor Array

In this paper we develop a multithreaded VLSI processor linear array architecture to render complex environments based on the radiosity approach. The processing elements are identical and multithreaded. They work in Single Program Multiple Data (SPMD) mode. A new algorithm to do the radiosity computations based on the progressive refinement approach[2] is proposed. Simulation results indicate that the architecture is latency tolerant and scalable. It is shown that a linear array of 128 uni-threaded processing elements sustains a throughput close to 0.4 million patches/sec.

Composite Performance and Reliability Analysis for Hypercube Systems

In this paper we propose a novel technique to model and ana¿ lyze the performability of parallel and distributed architectures using GSPN-reward models.

Stereochemistry of 2'-5' linked nucleic acids: crystal and molecular structure of ammonium adenylyl-2',5'-adenosine tetrahydrate: a core fragment of 2'-5' oligo A's produced by interferon induced adenylate synthetase

The preponderance of 3'-5' phosphodiester links in nucleic acids is well known. Albeit less prevalent, the 2'-5' links are specifically utilised in the formation of 'lariat' in group II introns and in the msDNA-RNA junction in myxobacterium. As a sequel to our earlier study on cytidylyl-2',5'-adenosine we have now obtained the crystal structure of adenylyl-2',5'-adenosine (A2'p5'A) at atomic resolution. This dinucleoside monophosphate crystallizes in the orthorhombic space group P2(1)2(1)2(1) with a = 7.956(3) A, b = 12.212(3) A and c = 36.654(3) A. CuK alpha intensity data were collected on a diffractometer. The structure was sloved by direct methods and refined by full matrix least squares methods to R = 10.8%. The 2' terminal adenine is in the commonly observed anti (chi 2 = 161 degrees) conformation and the 5' terminal base has a syn (chi 1 = 55 degrees) conformation more often seen in purine nucleotides. A noteworthy feature of A2'p5'A is the intranucleotide hydrogen bond between N3 and O5' atoms of the 5' adenine base. The two furanose rings in A2'p5'A show different conformations - C2' endo, C3' endo puckering for the 5' and 2' ends respectively. In this structure too there is a stacking of the purine base on the ribose O4' just as in other 2'-5' dinucleoside structures, a feature characteristically seen in the left handed Z DNA. In having syn, anti conformation about the glycosyl bonds, C2' endo, C3' endo mixed sugar puckering and N3-O5' intramolecular hydrogen bond A2'p5'A resembles its 3'-5' analogue and several other 2'-5' dinucleoside monophosphate structures solved so far. Striking similarities between the 2'-5' dinucleoside monophosphate structures suggest that the conformation of the 5'-end nucleoside dictates the conformation of the 2' end nucleoside. Also, the 2'-5' dimers do not favour formation of miniature classical double helical structures like the 3'-5' dimers. It is conceivable, 2-5(A) could be using the stereochemical features of A2'p5'A which accounts for its higher activity.

Gain calibration of CCD systems at VBO

The system gain of two CCD systems in regular use at the Vainu Bappu Observatory, Kavalur, is determined at a few gain settings. The procedure used for the determination of system gain and base-level noise is described in detail. The Photometrics CCD system at the 1-m reflector uses a Thomson-CSF TH 7882 CDA chip coated for increased ultraviolet sensitivity. The gain is programme-selected through the parameter 'cgain' varying between 0 and 4095 in steps of 1. The inverse system gain for this system varies almost linearly from 27.7 electrons DN-1 at cgain = 0 to 1.5 electrons DN-1 at cgain = 500. The readout noise is less than or similar 11 electrons at cgain = 66. The Astromed CCD system at 2.3-m Vainu Bappu Telescope uses a GEC P8603 chip which is also coated for enhanced ultraviolet sensitivity. The amplifier gain is selected in discrete steps using switches in the controller. The inverse system gain is 4.15 electrons DN-1 at the gain setting of 9.2, and the readout noise approximately 8 electrons.

Growing pseudo-eigenmodes and positive logarithmic norms in rotating shear flows

Rotating shear flows, when angular momentum increases and angular velocity decreases as functions of radiation coordinate, are hydrodynamically stable under linear perturbation. The Keplerian flow is an example of such a system, which appears in an astrophysical context. Although decaying eigenmodes exhibit large transient energy growth of perturbation which could govern nonlinearity in the system, the feedback of inherent instability to generate turbulence seems questionable. We show that such systems exhibiting growing pseudo-eigenmodes easily reach an upper bound of growth rate in terms of the logarithmic norm of the involved non-normal operators, thus exhibiting feedback of inherent instability. This supports the existence of turbulence of hydrodynamic origin in the Keplerian accretion disc in astrophysics. Hence, this answers the question of the mismatch between the linear theory and experimental/observed data and helps in resolving the outstanding question of the origin of turbulence therein.

Concise row-pruning algorithm to invert a matrix

Presented here, in a vector formulation, is an O(mn2) direct concise algorithm that prunes/identifies the linearly dependent (ld) rows of an arbitrary m X n matrix A and computes its reflexive type minimum norm inverse A(mr)-, which will be the true inverse A-1 if A is nonsingular and the Moore-Penrose inverse A+ if A is full row-rank. The algorithm, without any additional computation, produces the projection operator P = (I - A(mr)- A) that provides a means to compute any of the solutions of the consistent linear equation Ax = b since the general solution may be expressed as x = A(mr)+b + Pz, where z is an arbitrary vector. The rank r of A will also be produced in the process. Some of the salient features of this algorithm are that (i) the algorithm is concise, (ii) the minimum norm least squares solution for consistent/inconsistent equations is readily computable when A is full row-rank (else, a minimum norm solution for consistent equations is obtainable), (iii) the algorithm identifies ld rows, if any, and reduces concerned computation and improves accuracy of the result, (iv) error-bounds for the inverse as well as the solution x for Ax = b are readily computable, (v) error-free computation of the inverse, solution vector, rank, and projection operator and its inherent parallel implementation are straightforward, (vi) it is suitable for vector (pipeline) machines, and (vii) the inverse produced by the algorithm can be used to solve under-/overdetermined linear systems.

Connectionist approach for global optimization

A connectionist approach for global optimization is proposed. The standard function set is tested. Results obtained, in the case of large scale problems, indicate excellent scalability of the proposed approach

Study Of Acoustic Source Localization Algorithm For Planar Arrays

The source localization algorithms in the earlier works, mostly used non-planar arrays. If we consider scenarios like human-computer communication, or human-television communication where the microphones need to be placed on the computer monitor or television front panel, i.e we need to use the planar arrays. The algorithm proposed in 1], is a Linear Closed Form source localization algorithm (LCF algorithm) which is based on Time Difference of Arrivals (TDOAs) that are obtained from the data collected using the microphones. It assumes non-planar arrays. The LCF algorithm is applied to planar arrays in the current work. The relationship between the error in the source location estimate and the perturbation in the TDOAs is derived using first order perturbation analysis and validated using simulations. If the TDOAs are erroneous, both the coefficient matrix and the data matrix used for obtaining source location will be perturbed. So, the Total least squares solution for source localization is proposed in the current work. The sensitivity analysis of the source localization algorithm for planar arrays and non-planar arrays is done by introducing perturbation in the TDOAs and the microphone locations. It is shown that the error in the source location estimate is less when we use planar array instead of the particular non-planar array considered for same perturbation in the TDOAs or microphone location. The location of the reference microphone is proved to be important for getting an accurate source location estimate if we are using the LCF algorithm.

Parts based representation for pedestrian using NMF with robustness to partial occlusion

Computer Vision has seen a resurgence in the parts-based representation for objects over the past few years. The parts are usually annotated beforehand for training. We present an annotation free parts-based representation for the pedestrian using Non-Negative Matrix Factorization (NMF). We show that NMF is able to capture the wide range of pose and clothing of the pedestrians. We use a modified form of NMF i.e. NMF with sparsity constraints on the factored matrices. We also make use of Riemannian distance metric for similarity measurements in NMF space as the basis vectors generated by NMF aren't orthogonal. We show that for 1% drop in accuracy as compared to the Histogram of Oriented Gradients (HOG) representation we can achieve robustness to partial occlusion.