Design of speaker identification schemes for large number of speakers (A)

Design of speaker identification schemes for a small number of speakers (around 10) with a high degree of accuracy in controlled environment is a practical proposition today. When the number of speakers is large (say 50–100), many of these schemes cannot be directly extended, as both recognition error and computation time increase monotonically with population size. The feature selection problem is also complex for such schemes. Though there were earlier attempts to rank order features based on statistical distance measures, it has been observed only recently that the best two independent measurements are not the same as the combination in two's for pattern classification. We propose here a systematic approach to the problem using the decision tree or hierarchical classifier with the following objectives: (1) Design of optimal policy at each node of the tree given the tree structure i.e., the tree skeleton and the features to be used at each node. (2) Determination of the optimal feature measurement and decision policy given only the tree skeleton. Applicability of optimization procedures such as dynamic programming in the design of such trees is studied. The experimental results deal with the design of a 50 speaker identification scheme based on this approach.

Enhanced Pair Hydrophobicity in the Water-Dimethylsulfoxide (DMSO) Binary Mixture at Low DMSO Concentrations

We observe a surprisingly sharp increase in the pair hydrophobicity in the water climethylsulfoxide (DMSO) binary mixture at small DMSO concentrations, with the mole fraction of DMSO (x(D)) in the range 0.12-0.16. The increase in pair hydrophobicity is measured by an increase in the depth of the first minimum in the potential of mean force (PMF) between two methane molecules. However, this enhanced hydrophobicity again weakens at higher DMSO concentrations. We find markedly unusual behavior of the pure binary mixture (in the same composition range) in the diffusion coefficient of DMSO and in the local composition fluctuation of water, We find that, in the said composition range, the average coordination number of the methyl groups (of distinct DMSO) varies between 2.4 and 2.6, indicating the onset of the formation of a chain-like extended connectivity in an otherwise stable tetrahedral network comprising of water and DMSO molecules. We propose that the enhanced pair hydrophobicity of the binary mixture at low DMSO concentrations is due to the participation of the two methane molecules in the local structural order and the emerging molecular associations in the water-DMSO mixture.

Correlations between frequency of infra-red active vibrational modes and copper-oxygen distance in copper oxides. Application to superconductors

The infra-red spectra of a large number of ternary Cu(II) oxides with at least a quasi square-planar coordination of oxygen around the copper ions have been studied. The frequency of the bands with the highest frequency,v max, is found to correlate extremely well with the shortest Cu–O distance.v max increases at an impressive rate of sim20 cm–1 per 0.01 Å when the Cu–O distance becomes less than 1.97 Å, which is the Cu2+–O2– distance in square-planar CuO4 complexes as obtained from empirical ionic radii considerations. The marked sensitivity may be used as a ldquotitrationrdquo procedure not only to assign bands but also to obtain diagnostic information about local coordination in compounds derived, for example, from the YBa2Cu3O7–d structure such as LaCaBaCu3O7–d . The only example where this correlation fails is in the two-layer non-superconducting oxides derived from La2(Ca, Sr)Cu2O6. The significance of this result is discussed. The marked dependence of frequency on the bond-distance is qualitatively examined in terms of an increased electron-phonon coupling to account for the observed tendency of the superconducting transition temperature to go through a maximum as the average basal plane Cu–O distance is decreased.

Low reynolds number flow of a dilute suspension in slowly varying tubes

We have discussed here the flow of a dilute suspension of rigid particles in Newtonian fluid in slowly varying tubes characterized by a small parameter ε. Solutions are presented in the form of asymptotic expansions in powers of ε. The effect of the suspension on the fluid is described by two parameters β and γ which depend on the volume fraction of the particles which we assume to be small. It is found that the presence of the particles accelerate the process of eddy formation near the constriction and shifts the point of separation.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

High-quality annotation of promoter regions for 913 bacterial genomes

Motivation: The number of bacterial genomes being sequenced is increasing very rapidly and hence, it is crucial to have procedures for rapid and reliable annotation of their functional elements such as promoter regions, which control the expression of each gene or each transcription unit of the genome. The present work addresses this requirement and presents a generic method applicable across organisms. Results: Relative stability of the DNA double helical sequences has been used to discriminate promoter regions from non-promoter regions. Based on the difference in stability between neighboring regions, an algorithm has been implemented to predict promoter regions on a large scale over 913 microbial genome sequences. The average free energy values for the promoter regions as well as their downstream regions are found to differ, depending on their GC content. Threshold values to identify promoter regions have been derived using sequences flanking a subset of translation start sites from all microbial genomes and then used to predict promoters over the complete genome sequences. An average recall value of 72% (which indicates the percentage of protein and RNA coding genes with predicted promoter regions assigned to them) and precision of 56% is achieved over the 913 microbial genome dataset.

A systolic algorithm for hidden surface removal

With the advent of VLSI it has become possible to map parallel algorithms for compute-bound problems directly on silicon. Systolic architecture is very good candidate for VLSI implementation because of its regular and simple design, and regular communication pattern. In this paper, a systolic algorithm and corresponding systolic architecture, a linear systolic array, for the scanline-based hidden surface removal problem in three-dimensional computer graphics have been proposed. The algorithm is based on the concept of sample spans or intervals. The worst case time taken by the algorithm is O(n), n being the number of segments in a scanline. The time taken by the algorithm for a given scene depends on the scene itself, and on an average considerable improvement over the worst case behaviour is expected. A pipeline scheme for handling the I/O process has also been proposed which is suitable for VLSI implementation of the algorithm.

Denumerable state stochastic games with limiting average payoff

We study stochastic games with countable state space, compact action spaces, and limiting average payoff. ForN-person games, the existence of an equilibrium in stationary strategies is established under a certain Liapunov stability condition. For two-person zero-sum games, the existence of a value and optimal strategies for both players are established under the same stability condition.

Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey

This work is a survey of the average cost control problem for discrete-time Markov processes. The authors have attempted to put together a comprehensive account of the considerable research on this problem over the past three decades. The exposition ranges from finite to Borel state and action spaces and includes a variety of methodologies to find and characterize optimal policies. The authors have included a brief historical perspective of the research efforts in this area and have compiled a substantial yet not exhaustive bibliography. The authors have also identified several important questions that are still open to investigation.

Oxidative copolymerization: microstructure analysis of the terpolymer of styrene, methyl methacrylate, and oxygen

This paper reports the first study of the microstructure of a copolyperoxide by nuclear magnetic resonance spectroscopy. The copolyperoxides of styrene and methyl methacrylate (MMA) of various compositions have been synthesized. An analysis of the resonance signal of the backbone methylene protons gave the diad sequence probabilities which led to the calculation of the oxidative copolymerization reactivity ratios for styrene and MMA and the microstructural parameters like average chain length of the repeat unit sequences, run number, etc. The results point to the tendency of the SO1 and MO:! units to alternate in the chain. Compared to poly(styrene peroxide), the aromatic C1 seems to be stereosensitive in the terpolymers.

Squeezed states, photon-number distributions, and U(l) invariance

We study the photon-number distribution in squeezed states of a single-mode radiation field. A U(l)-invariant squeezing criterion is compared and contrasted with a more restrictive criterion, with the help of suggestive geometric representations. The U(l) invariance of the photon-number distribution in a squeezed coherent state, with arbitrary complex squeeze and displacement parameters, is explicitly demonstrated. The behavior of the photon-number distribution for a representative value of the displacement and various values of the squeeze parameter is numerically investigated. A new kind of giant oscillation riding as an envelope over more rapid oscillations in this distribution is demonstrated.

Dense granular flow down an inclined plane A comparison between the hard particle model and soft particle simulations

The granular flow down an inclined plane is simulated using the discrete element (DE) technique to examine the extent to which the dynamics of an unconfined dense granular flow can be well described by a hard particle model First, we examine the average coordination number for the particles in the flow down an inclined plane using the DE technique using the linear contact model with and without friction, and the Hertzian contact model with friction The simulations show that the average coordination number decreases below 1 for values of the spring stiffness corresponding to real materials, such as sand and glass, even when the angle of inclination is only 10 larger than the angle of repose Additional measures of correlations in the system, such as the fraction of particles with multibody contact, the force ratio (average ratio of the magnitudes of the largest and the second largest force on a particle), and the angle between the two largest forces on the particle, show no evidence of force chains or other correlated motions in the system An analysis of the bond-orientational order parameter indicates that the flow is in the random state, as in event-driven (ED) simulations V Kumaran, J Fluid Mech 632, 107 (2009), J Fluid Mech 632, 145 (2009)] The results of the two simulation techniques for the Bagnold coefficients (ratio of stress and square of the strain rate) and the granular temperature (mean square of the fluctuating velocity) are compared with the theory V Kumaran, J Fluid Mech 632, 107 (2009), J Fluid Mech 632, 145 (2009)] and are found to be in quantitative agreement In addition, we also conduct a comparison of the collision frequency and the distribution of the precollisional relative velocities of particles in contact The strong correlation effects exhibited by these two quantities in event-driven simulations V Kumaran, J Fluid Mech 632, 145 (2009)] are also found in the DE simulations (C) 2010 American Institute of Physics doi 10 1063/1 3504660]

Compiler-assisted power optimization for clustered VLIW architectures

Clustered VLIW architectures solve the scalability problem associated with flat VLIW architectures by partitioning the register file and connecting only a subset of the functional units to a register file. However, inter-cluster communication in clustered architectures leads to increased leakage in functional components and a high number of register accesses. In this paper, we propose compiler scheduling algorithms targeting two previously ignored power-hungry components in clustered VLIW architectures, viz., instruction decoder and register file. We consider a split decoder design and propose a new energy-aware instruction scheduling algorithm that provides 14.5% and 17.3% benefit in the decoder power consumption on an average over a purely hardware based scheme in the context of 2-clustered and 4-clustered VLIW machines. In the case of register files, we propose two new scheduling algorithms that exploit limited register snooping capability to reduce extra register file accesses. The proposed algorithms reduce register file power consumption on an average by 6.85% and 11.90% (10.39% and 17.78%), respectively, along with performance improvement of 4.81% and 5.34% (9.39% and 11.16%) over a traditional greedy algorithm for 2-clustered (4-clustered) VLIW machine. (C) 2010 Elsevier B.V. All rights reserved.