Local polynomial convexity of the union of two totally-real surfaces at their intersection

We consider the following question: Let S (1) and S (2) be two smooth, totally-real surfaces in C-2 that contain the origin. If the union of their tangent planes is locally polynomially convex at the origin, then is S-1 boolean OR S-2 locally polynomially convex at the origin? If T (0) S (1) a (c) T (0) S (2) = {0}, then it is a folk result that the answer is yes. We discuss an obstruction to the presumed proof, and provide a different approach. When dim(R)(T0S1 boolean AND T0S2) = 1, we present a geometric condition under which no consistent answer to the above question exists. We then discuss conditions under which we can expect local polynomial convexity.

Fast computation of Legendre and Zernike moments

This paper presents recursive algorithms for fast computation of Legendre and Zernike moments of a grey-level image intensity distribution. For a binary image, a contour integration method is developed for the evaluation of Legendre moments using only the boundary information. A method for recursive calculation of Zernike polynomial coefficients is also given. A square-to-circular image transformation scheme is introduced to minimize the computation involved in Zernike moment functions. The recursive formulae can also be used in inverse moment transforms to reconstruct the original image from moments. The mathematical framework of the algorithms is given in detail, and illustrated with binary and grey-level images.

Derivation and consistency of the partial functions of the ternary system involving interaction coefficients

The logarithm of activity coefficients of the components of the ternary system is derived based on the Maclaurin infinite series, which is expressed in terms of the integral property of the system and subjected to appropriate boundary conditions. The derivation of the functions involves extensive summation of various infinite series pertaining to the first-order interaction coefficients that have been shown completely to remove any truncational error. Since the conventional equations involving interaction coefficients are internally inconsistent, a consistent form of the partial functions is developed in the article using the technique just described. The thermodynamic consistency of the functions based on the Maxwell and the Gibbs-Duhem relations has been established. The derived values of the logarithmic activity coefficients of the components have been found to be in agreement with the thermodynamic data of the Fe-Cr-Ni system at 1873 K and have been found to be independent of the compositional paths.

Spatially dependent zero-frequency response functions and correlation functions in the Kondo model

We present the details of a formalism for calculating spatially varying zero-frequency response functions and equal-time correlation functions in models of magnetic and mixed-valence impurities of metals. The method is based on a combination of perturbative, thermodynamic scaling theory [H. R. Krishna-murthy and C. Jayaprakash, Phys. Rev. B 30, 2806 (1984)] and a nonperturbative technique such as the Wilson renormalization group. We illustrate the formalism for the spin-1/2 Kondo problem and present results for the conduction-spin-density�impurity-spin correlation function and conduction-electron charge density near the impurity. We also discuss qualitative features that emerge from our calculations and discuss how they can be carried over to the case of realistic models for transition-metal impurities.

Transmembrane domains participate in functions of integral membrane proteins

Integral membrane proteins have one or more transmembrane a-helical domains and carry out a variety of functions such as enzyme catalysis, transport across membranes, transducing signals as receptors of hormones and growth factors, and energy transfer in ATP synthesis. These transmembrane domains are not mere structural units anchoring the protein to the lipid bilayer but seem to-contribute in the overall activity. Recent findings in support of this are described using some typical examples-LDL receptor, growth factor receptor tyrosine kinase, HMG-CoA reductase, F-0-ATPase and adrenergic receptors. The trends in research indicate that these transmembrane domains participate in a variety of ways such as a linker, a transducer or an exchanger in the overall functions of these proteins in transfer of materials, energy and signals.

Flat connections, geometric invariants and energy of harmonic functions on compact Riemann surfaces

A geometric invariant is associated to the space of fiat connections on a G-bundle over a compact Riemann surface and is related to the energy of harmonic functions.

Generation of an eight node brick element using Papcovitch-Neuber functions

Some conventional finite elements suffer from drawbacks, such as shear locking, membrane locking, etc. To overcome them researchers have developed various techniques, termed as tricks by some and variational crimes by others. Many attempts have been made, but satisfactory explanations for why some of these techniques work have not been obtained, especially in the case of solid elements. This paper attempts a simple non-conforming solid element using assumed displacement fields which satisfy the Navier equation exactly. Its behaviour under simple loadings like bending, torsion and tension is examined and comparisons are made with existing elements.

A polynomial bound on the number of light cycles in an undirected graph

Let G be an undirected graph with a positive real weight on each edge. It is shown that the number of minimum-weight cycles of G is bounded above by a polynomial in the number of edges of G. A similar bound holds if we wish to count the number of cycles with weight at most a constant multiple of the minimum weight of a cycle of G.

Violin string shape functions for finite element analysis of rotating Timoshenko beams

Violin strings are relatively short and stiff and are well modeled by Timoshenko beam theory. We use the static part of the homogeneous differential equation of violin strings to obtain new shape functions for the finite element analysis of rotating Timoshenko beams. For deriving the shape functions, the rotating beam is considered as a sequence of violin strings. The violin string shape functions depend on rotation speed and element position along the beam length and account for centrifugal stiffening effects as well as rotary inertia and shear deformation on dynamic characteristics of rotating Timoshenko beams. Numerical results show that the violin string basis functions perform much better than the conventional polynomials at high rotation speeds and are thus useful for turbo machine applications. (C) 2011 Elsevier B.V. All rights reserved.

The effect of temperature on the surface tension and adsorption functions of the Fe-S-O melts - an analysis based on interaction parameters

The present investigation analyses the thermodynamic behaviour of the surfaces and adsorption as a function of temperature and composition in the Fe-S-O melts based on the Butler's equations. The calculated-values of the surface tensions exhibit an elevation or depression depending on the type of the added solute at a concentration which coincides with that already present in the system. Generally, the desorption of the solutes as a function of temperature results in an initial increase followed by a decrease in the values of the surface tension. The observations are analyzed based on the surface interaction parameters which are derived in the present research.

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

Exact spectral functions of a non-Fermi liquid in one dimension

We study the exact one-electron propagator and spectral function of a solvable model of interacting electrons due to Schulz and Shastry. The solution previously found for the energies and wave functions is extended to give spectral functions that turn out to be computable, interesting, and nontrivial. They provide one of the few examples of cases where the spectral functions are known asymptotically as well as exactly.