Prediction of breakout noise from an elliptical duct of finite length

This paper describes a predictive model for breakout noise from an elliptical duct or shell of finite length. The transmission mechanism is essentially that of ``mode coupling'', whereby higher structural modes in the duct walls get excited because of non-circularity of the wall. Effect of geometry has been taken care of by evaluating Fourier coefficients of the radius of curvature. The noise radiated from the duct walls is represented by that from a finite vibrating length of a semi infinite cylinder in a free field. Emphasis is on understanding the physics of the problem as well as analytical modeling. The analytical model is validated with 3-D FEM. Effects of the ovality, curvature, and axial terminations of the duct have been demonstrated. (C) 2010 Institute of Noise Control Engineering.

Quantum Error Correction via Codes over GF(2)

It is well known that n-length stabilizer quantum error correcting codes (QECCs) can be obtained via n-length classical error correction codes (CECCs) over GF(4), that are additive and self-orthogonal with respect to the trace Hermitian inner product. But, most of the CECCs have been studied with respect to the Euclidean inner product. In this paper, it is shown that n-length stabilizer QECCs can be constructed via 371 length linear CECCs over GF(2) that are self-orthogonal with respect to the Euclidean inner product. This facilitates usage of the widely studied self-orthogonal CECCs to construct stabilizer QECCs. Moreover, classical, binary, self-orthogonal cyclic codes have been used to obtain stabilizer QECCs with guaranteed quantum error correcting capability. This is facilitated by the fact that (i) self-orthogonal, binary cyclic codes are easily identified using transform approach and (ii) for such codes lower bounds on the minimum Hamming distance are known. Several explicit codes are constructed including two pure MDS QECCs.

Task assignment in a multiprocessor system

One of the key problems in the design of any incompletely connected multiprocessor system is to appropriately assign the set of tasks in a program to the Processing Elements (PEs) in the system. The task assignment problem has proven difficult both in theory and in practice. This paper presents a simple and efficient heuristic algorithm for assigning program tasks with precedence and communication constraints to the PEs in a Message-based Multiple-bus Multiprocessor System, M3, so that the total execution time for the program is minimized. The algorithm uses a cost function: “Minimum Distance and Parallel Transfer” to minimize the completion time. The effectiveness of the algorithm has been demonstrated by comparing the results with (i) the lower bound on the execution time of a program (task) graph and (ii) a random assignment.

Reducing the babel in plant volatile communication: using the forest to see the trees

While plants of a single species emit a diversity of volatile organic compounds (VOCs) to attract or repel interacting organisms, these specific messages may be lost in the midst of the hundreds of VOCs produced by sympatric plants of different species, many of which may have no signal content. Receivers must be able to reduce the babel or noise in these VOCs in order to correctly identify the message. For chemical ecologists faced with vast amounts of data on volatile signatures of plants in different ecological contexts, it is imperative to employ accurate methods of classifying messages, so that suitable bioassays may then be designed to understand message content. We demonstrate the utility of `Random Forests' (RF), a machine-learning algorithm, for the task of classifying volatile signatures and choosing the minimum set of volatiles for accurate discrimination, using datam from sympatric Ficus species as a case study. We demonstrate the advantages of RF over conventional classification methods such as principal component analysis (PCA), as well as data-mining algorithms such as support vector machines (SVM), diagonal linear discriminant analysis (DLDA) and k-nearest neighbour (KNN) analysis. We show why a tree-building method such as RF, which is increasingly being used by the bioinformatics, food technology and medical community, is particularly advantageous for the study of plant communication using volatiles, dealing, as it must, with abundant noise.

Interplay between multiple length and time scales in complex chemical systems

Processes in complex chemical systems, such as macromolecules, electrolytes, interfaces, micelles and enzymes, can span several orders of magnitude in length and time scales. The length and time scales of processes occurring over this broad time and space window are frequently coupled to give rise to the control necessary to ensure specificity and the uniqueness of the chemical phenomena. A combination of experimental, theoretical and computational techniques that can address a multiplicity of length and time scales is required in order to understand and predict structure and dynamics in such complex systems. This review highlights recent experimental developments that allow one to probe structure and dynamics at increasingly smaller length and time scales. The key theoretical approaches and computational strategies for integrating information across time-scales are discussed. The application of these ideas to understand phenomena in various areas, ranging from materials science to biology, is illustrated in the context of current developments in the areas of liquids and solvation, protein folding and aggregation and phase transitions, nucleation and self-assembly.

Size-Dependent Melting of Finite-Length Nanowires

We report on the size-dependent melting of nanowires with finite length based on the thermodynamic as well as liquid drop model. It has been inferred that the length dependency cannot be ignored, unlike the case of infinite length nanowires. To validate the length dependency, we have analyzed a few experimental results reported in the literature.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Theoretical Estimation of Length Dependent In-Plane Stiffness of Single Walled Carbon Nanotubes Using the Nonlocal Elasticity Theory

In the present paper, Eringen's nonlocal elasticity theory is employed to evaluate the length dependent in-plane stiffness of single-walled carbon nanotubes (SWCNTs). The SWCNT is modeled as an Euler-Bernoulli beam and is analyzed for various boundary conditions to evaluate the length dependent in-plane stiffness. It has been found that the nonlocal scaling parameter has a significant effect on the length dependent in-plane stiffness of SWCNTs. It has been observed that as the nonlocal scale parameter increases the stiffness ratio of SWCNT decreases. In nonlocality, the cantilever SWCNT has high in-plane stiffness as compared to the simply-supported and the clamped cases.

Bond length distortions associated with torsion potentials; ab-initio studies on methanedio

The 4-31G basis set is used to study the bond length variations as functions of dihedral angels in methanediol. This study is compared with O---C---O bond angle optimization studies by Gorenstein and Kar and the possible reason for bond length shorteing in the trans---trans configuration is analysed.

Length-independent voltage fluctuations in small conductors

The mean-squared voltage fluctuation of a disordered conductor of lengthL smaller than the phase coherence lengthL ϕ, is independent of the distance between the probes. We obtain this result using the voltage additivity and the known results for the conductance fluctuation. Our results complement the recent theoretical and experimental findings.

A XANES study of the K-absorption edge of copper in some of its compounds and use of the same in the determination of bond length

XANES in the K-edge of copper in the systems CuO, Cu(OH)2, La2CuO4, Cu3AsO4 and CuOHF have been investigated and transitions have been assigned to the observed structures. The measurements have been used for calculating the first coordination bond distance in the above systems. It is observed that the values so determined agree fairly well with crystallographic values.

Nucleotide sequence of the 3terminal region of belladonna mottle virus (renamed Physalis mottle virus) RNA and analysis of the evolutionary relationships among tymoviral coat proteins

The 3' terminal 1255 nt sequence of Physalis mottle virus (PhMV) genomic RNA has been determined from a set of overlapping cDNA clones. The open reading frame (ORF) at the 3' terminus corresponds to the amino acid sequence of the coat protein (CP) determined earlier except for the absence of the dipeptide, Lys-Leu, at position 110-111. In addiition, the sequence upstream of the CP gene contains the message coding for 178 amino acid residues of the C-terminus of the putative replicase protein (RP). The sequence downstream of the CP gene contains an untranslated region whose terminal 80 nucleotides can be folded into a characteristic tRNA-like structure. A phylogenetic tree constructed after aligning separately the sequence of the CP, the replicase protein (RP) and the tRNA-like structure determined in this study with the corresponding sequences of other tymoviruses shows that PhMV wrongly named belladonna mottle virus [BDMV(I)] is a separate tymovirus and not another strain of BDMV(E) as originally envisaged. The phylogenetic tree in all the three cases is identical showing that any subset of genomic sequence of sufficient length can be used for establishing evolutionary relationships among tymoviruses.

New Concepts for PVC Detection

A new scheme is proposed for the detection of premature ventricular beats, which is a vital function in rhythm monitoring of cardiac patients. A transformation based on the first difference of the digitized electrocardiogram (ECG) signal is developed for the detection and delineation of QRS complexes. The method for classifying the abnormal complexes from the normal ones is based on the concepts of minimum phase and signal length. The parameters of a linear discriminant function obtained from a training feature vector set are used to classify the complexes. Results of application of the scheme to ECG of two arrhythmia patients are presented.

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

Importance of meridional circulation i flux transport dynamo: the possibility of a maunder-like grand minimum

Meridional circulation is an important ingredient in flux transport dynamo models. We have studied its importance on the period, the amplitude of the solar cycle, and also in producing Maunder-like grand minima in these models. First, we model the periods of the last 23 sunspot cycles by varying the meridional circulation speed. If the dynamo is in a diffusion-dominated regime, then we find that most of the cycle amplitudes also get modeled up to some extent when we model the periods. Next, we propose that at the beginning of the Maunder minimum the amplitude of meridional circulation dropped to a low value and then after a few years it increased again. Several independent studies also favor this assumption. With this assumption, a diffusion-dominated dynamo is able to reproduce many important features of the Maunder minimum remarkably well. If the dynamo is in a diffusion-dominated regime, then a slower meridional circulation means that the poloidal field gets more time to diffuse during its transport through the convection zone, making the dynamo weaker. This consequence helps to model both the cycle amplitudes and the Maunder-like minima. We, however, fail to reproduce these results if the dynamo is in an advection-dominated regime.