Polynomial Approximation, Local Polynomial convexity, and Degenerate CR Singularities- II

We provide some conditions for the graph of a Holder-continuous function on (D) over bar, where (D) over bar is a closed disk in C, to be polynomially convex. Almost all sufficient conditions known to date - provided the function (say F) is smooth - arise from versions of the Weierstrass Approximation Theorem on (D) over bar. These conditions often fail to yield any conclusion if rank(R)DF is not maximal on a sufficiently large subset of (D) over bar. We bypass this difficulty by introducing a technique that relies on the interplay of certain plurisubharmonic functions. This technique also allows us to make some observations on the polynomial hull of a graph in C(2) at an isolated complex tangency.

Discovering injective episodes with general partial orders

Frequent episode discovery is a popular framework for temporal pattern discovery in event streams. An episode is a partially ordered set of nodes with each node associated with an event type. Currently algorithms exist for episode discovery only when the associated partial order is total order (serial episode) or trivial (parallel episode). In this paper, we propose efficient algorithms for discovering frequent episodes with unrestricted partial orders when the associated event-types are unique. These algorithms can be easily specialized to discover only serial or parallel episodes. Also, the algorithms are flexible enough to be specialized for mining in the space of certain interesting subclasses of partial orders. We point out that frequency alone is not a sufficient measure of interestingness in the context of partial order mining. We propose a new interestingness measure for episodes with unrestricted partial orders which, when used along with frequency, results in an efficient scheme of data mining. Simulations are presented to demonstrate the effectiveness of our algorithms.

Study of non-local wave properties of nanotubes with surface effects

In macroscopic and even microscopic structural elements, surface effects can be neglected and classical theories are sufficient. As the structural size decreases towards the nanoscale regime, the surface-to-bulk energy ratio increases and surface effects must be taken into account. In the present work, the terahertz wave dispersion characteristics of a nanotube are studied with consideration of the surface effects as well as the non-local small scale effects. Non-local elasticity theory is used to derive the general governing differential equation based on equilibrium approach to include those scale effects. Scale and surface property dependent wave characteristic equations are obtained via spectral analysis. For the present study the material properties of an anodic alumina nanotube with crystallographic of < 111 > direction are considered. The present analysis shows that the effect of surface properties (surface integrated residual stress and surface integrated modulus) on the flexural wave characteristics of anodic nanotubes are more significant. It has been found that the flexural wavenumbers with surface effects are high as compared to that without surface effects. It has also been shown that, with consideration of surface effects the flexural wavenumbers are under compressive nature. The effect of the small scale and the size of the nanotube on wave dispersion properties are also captured in the present work. (C) 2012 Elsevier B.V. All rights reserved.

Structural Transformations, Composition Anomalies and a Dramatic Collapse of Linear Polymer Chains in Dilute Ethanol-Water Mixtures

Water-ethanol mixtures exhibit many interesting anomalies, such as negative excess partial molar volume of ethanol, excess sound absorption coefficient at low concentrations, and positive deviation from Raoult's law for vapor pressure, to mention a few. These anomalies have been attributed to different, often contradictory origins, but a quantitative understanding is still lacking. We show by computer simulation and theoretical analyses that these anomalies arise from the sudden emergence of a bicontinuous phase that occurs at a relatively low ethanol concentration of x(eth) approximate to 0.06-0.10 (that amounts to a volume fraction of 0.17-0.26, which is a significant range!). The bicontinuous phase is formed by aggregation of ethanol molecules, resulting in a weak phase transition whose nature is elucidated. We find that the microheterogeneous structure of the mixture gives rise to a pronounced nonmonotonic composition dependence of local compressibility and nonmonotonic dependence in the peak value of the radial distribution function of ethyl groups. A multidimensional free energy surface of pair association is shown to provide a molecular explanation of the known negative excess partial volume of ethanol in terms of parallel orientation and hence better packing of the ethyl groups in the mixture due to hydrophobic interactions. The energy distribution of the ethanol molecules indicates additional energy decay channels that explain the excess sound attenuation coefficient in aqueous alcohol mixtures. We studied the dependence of the solvation of a linear polymer chain on the composition of the water-ethanol solvent. We find that there is a sudden collapse of the polymer at x(eth) approximate to 0.05-a phenomenon which we attribute to the formation of the microheterogeneous structures in the binary mixture at low ethanol concentrations. Together with recent single molecule pulling experiments, these results provide new insight into the behavior of polymer chain and foreign solutes, such as enzymes, in aqueous binary mixtures.

Relevance of local parallel theory to the linear stability of laminar separation bubbles

Laminar separation bubbles are thought to be highly non-parallel, and hence global stability studies start from this premise. However, experimentalists have always realized that the flow is more parallel than is commonly believed, for pressure-gradient-induced bubbles, and this is why linear parallel stability theory has been successful in describing their early stages of transition. The present experimental/numerical study re-examines this important issue and finds that the base flow in such a separation bubble becomes nearly parallel due to a strong-interaction process between the separated boundary layer and the outer potential flow. The so-called dead-air region or the region of constant pressure is a simple consequence of this strong interaction. We use triple-deck theory to qualitatively explain these features. Next, the implications of global analysis for the linear stability of separation bubbles are considered. In particular we show that in the initial portion of the bubble, where the flow is nearly parallel, local stability analysis is sufficient to capture the essential physics. It appears that the real utility of the global analysis is perhaps in the rear portion of the bubble, where the flow is highly non-parallel, and where the secondary/nonlinear instability stages are likely to dominate the dynamics.

Combining adiabatic and Hartmann-Hahn cross-polarization for sensitivity enhancement in solid state separated local field 2D-NMR experiments of partially ordered systems

In this Letter, we examine magnetization in double- and zero-quantum reservoirs of an ensemble of spin-1/2 nuclei and describe their role in determining the sensitivity of a class of separated local field NMR experiments based on Hartmann-Hahn cross-polarization. We observe that for the liquid crystal system studied, a large dilute spin-polarization, obtained initially by the use of adiabatic cross-polarization, can enhance the sensitivity of the above experiment. The signal enhancement factors, however, are found to vary and depend on the local dynamics. The experimental results have been utilized to obtain the local order-parameters of the system. (C) 2012 Elsevier B. V. All rights reserved.

Estimation of vapour pressure and partial pressure of subliming compounds by low-pressure thermogravimetry

A method for the estimation of vapour pressure and partial pressure of subliming compounds under reduced pressure, using rising temperature thermogravimetry, is described in this paper. The method is based on our recently developed procedure to estimate the vapour pressure from ambient pressure thermogravimetric data using Langmuir equation. Using benzoic acid as the calibration standard, vapour pressure temperature curves are calculated at 80, 160 and 1000 mbar for salicylic acid and vanadyl bis-2,4-pentanedionate, a precursor used for chemical vapour deposition of vanadium oxides. Using a modification of the Langmuir equation, the partial pressure of these materials at different total pressures is also determined as a function of temperature. Such data can be useful for the deposition of multi-metal oxide thin films or doped thin films by chemical vapour deposition (CVD).

The Treewidth of MDS and Reed-Muller Codes

The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parameterization of the maximum-likelihood decoding complexity for linear codes. In this paper, we show the surprising fact that for maximum distance separable codes and Reed-Muller codes, treewidth equals trelliswidth, which, for a code, is defined to be the least constraint complexity (or branch complexity) of any of its trellis realizations. From this, we obtain exact expressions for the treewidth of these codes, which constitute the only known explicit expressions for the treewidth of algebraic codes.

Local Structural Differences in Homologous Proteins: Specificities in Different SCOP Classes

The constant increase in the number of solved protein structures is of great help in understanding the basic principles behind protein folding and evolution. 3-D structural knowledge is valuable in designing and developing methods for comparison, modelling and prediction of protein structures. These approaches for structure analysis can be directly implicated in studying protein function and for drug design. The backbone of a protein structure favours certain local conformations which include alpha-helices, beta-strands and turns. Libraries of limited number of local conformations (Structural Alphabets) were developed in the past to obtain a useful categorization of backbone conformation. Protein Block (PB) is one such Structural Alphabet that gave a reasonable structure approximation of 0.42 angstrom. In this study, we use PB description of local structures to analyse conformations that are preferred sites for structural variations and insertions, among group of related folds. This knowledge can be utilized in improving tools for structure comparison that work by analysing local structure similarities. Conformational differences between homologous proteins are known to occur often in the regions comprising turns and loops. Interestingly, these differences are found to have specific preferences depending upon the structural classes of proteins. Such class-specific preferences are mainly seen in the all-beta class with changes involving short helical conformations and hairpin turns. A test carried out on a benchmark dataset also indicates that the use of knowledge on the class specific variations can improve the performance of a PB based structure comparison approach. The preference for the indel sites also seem to be confined to a few backbone conformations involving beta-turns and helix C-caps. These are mainly associated with short loops joining the regular secondary structures that mediate a reversal in the chain direction. Rare beta-turns of type I' and II' are also identified as preferred sites for insertions.

The local polynomial hull near a degenerate CR singularity: Bishop discs revisited

Let be a smooth real surface in and let be a point at which the tangent plane is a complex line. How does one determine whether or not is locally polynomially convex at such a p-i.e. at a CR singularity? Even when the order of contact of with at p equals 2, no clean characterisation exists; difficulties are posed by parabolic points. Hence, we study non-parabolic CR singularities. We show that the presence or absence of Bishop discs around certain non-parabolic CR singularities is completely determined by a Maslov-type index. This result subsumes all known facts about Bishop discs around order-two, non-parabolic CR singularities. Sufficient conditions for Bishop discs have earlier been investigated at CR singularities having high order of contact with . These results relied upon a subharmonicity condition, which fails in many simple cases. Hence, we look beyond potential theory and refine certain ideas going back to Bishop.

Local demodulation of holograms using the Riesz transform with application to microscopy

We propose a Riesz transform approach to the demodulation of digital holograms. The Riesz transform is a higher-dimensional extension of the Hilbert transform and is steerable to a desired orientation. Accurate demodulation of the hologram requires a reliable methodology by which quadrature-phase functions (or simply, quadratures) can be constructed. The Riesz transform, by itself, does not yield quadratures. However, one can start with the Riesz transform and construct the so-called vortex operator by employing the notion of quasi-eigenfunctions, and this approach results in accurate quadratures. The key advantage of using the vortex operator is that it effectively handles nonplanar fringes (interference patterns) and has the ability to compensate for the local orientation. Therefore, this method results in aberration-free holographic imaging even in the case when the wavefronts are not planar. We calibrate the method by estimating the orientation from a reference hologram, measured with an empty field of view. Demodulation results on synthesized planar as well as nonplanar fringe patterns show that the accuracy of demodulation is high. We also perform validation on real experimental measurements of Caenorhabditis elegans acquired with a digital holographic microscope. (c) 2012 Optical Society of America

Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

Fast Likelihood Computation in Speech Recognition using Matrices

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for Large Vocabulary Continuous Speech Recognition (LVCSR) systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication. In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on 1,138 work vocabulary RM1 task and 6,224 word vocabulary TIMIT task using Sphinx 3.7 system show that, for a typical case the matrix multiplication based approach leads to overall speedup of 46 % on RM1 task and 115 % for TIMIT task. Our low-rank approximation methods provide a way for trading off recognition accuracy for a further increase in computational performance extending overall speedups up to 61 % for RM1 and 119 % for TIMIT for an increase of word error rate (WER) from 3.2 to 3.5 % for RM1 and for no increase in WER for TIMIT. We also express pairwise Euclidean distance computation phase in Dynamic Time Warping (DTW) in terms of matrix multiplication leading to saving of approximately of computational operations. In our experiments using efficient implementation of matrix multiplication, this leads to a speedup of 5.6 in computing the pairwise Euclidean distances and overall speedup up to 3.25 for DTW.

Fast acoustic likelihood computation using low-rank matrix approximation

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for LVCSR systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication.In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on a 1138 word vocabulary RM1 task using Sphinx 3.7 system show that, for a typical case the matrix multiplication approach leads to overall speedup of 46%. Both the low-rank approximation methods increase the speedup to around 60%, with the former method increasing the word error rate (WER) from 3.2% to 6.6%, while the latter increases the WER from 3.2% to 3.5%.