Hybrid stiff-string-polynomial basis functions for vibration analysis of high speed rotating beams

A new finite element is developed for free vibration analysis of high speed rotating beams using basis functions which use a linear combination of the solution of the governing static differential equation of a stiff-string and a cubic polynomial. These new shape functions depend on rotation speed and element position along the beam and account for the centrifugal stiffening effect. The natural frequencies predicted by the proposed element are compared with an element with stiff-string, cubic polynomial and quintic polynomial shape functions. It is found that the new element exhibits superior convergence compared to the other basis functions.

Watson-Crick pairing, the Heisenberg group and Milnor invariants

We study the secondary structure of RNA determined by Watson-Crick pairing without pseudo-knots using Milnor invariants of links. We focus on the first non-trivial invariant, which we call the Heisenber invariant. The Heisenberg invariant, which is an integer, can be interpreted in terms of the Heisenberg group as well as in terms of lattice paths. We show that the Heisenberg invariant gives a lower bound on the number of unpaired bases in an RNA secondary structure. We also show that the Heisenberg invariant can predict allosteric structures for RNA. Namely, if the Heisenberg invariant is large, then there are widely separated local maxima (i.e., allosteric structures) for the number of Watson-Crick pairs found.

On the invariants of coloured Petri Nets

In this paper, we develop a theorem that enables computation of the place invariants of the union of a finite collection of coloured Petri Nets when the individual nets satisfy certain conditions and their invariants are known. We consider the illustrative examples of the Readers-Writers problem, a resource sharing system, and a network of databases and show how this theorem is a valuable tool in the analysis of concurrent systems.

Microprocessor-based polynomial generator

A new method of generating polynomials using microprocessors is proposed. The polynomial is generated as a 16-bit digital word. The algorithm for generating a variety of basic 'building block' functions and its implementation is discussed. A technique for generating a generalized polynomial based on the proposed algorithm is indicated. The performance of the proposed generator is evaluated using a commercially available microprocessor kit.

Anisotropic Gaussian Schell-model beams: Passage through optical systems and associated invariants

Anisotropic Gaussian Schell-model (AGSM) fields and their transformation by first-order optical systems (FOS’s) forming Sp(4,R) are studied using the generalized pencils of rays. The fact that Sp(4,R), rather than the larger group SL(4,R), is the relevant group is emphasized. A convenient geometrical picture wherein AGSM fields and FOS’s are represented, respectively, by antisymmetric second-rank tensors and de Sitter transformations in a (3+2)-dimensional space is developed. These fields are shown to separate into two qualitatively different families of orbits and the invariants over each orbit, two in number, are worked out. We also develop another geometrical picture in a (2+1)-dimensional Minkowski space suitable for the description of the action of axially symmetric FOS’s on AGSM fields, and the invariants, now seven in number, are derived. Interesting limiting cases forming coherent and quasihomogeneous fields are analyzed.

On the sufficient conditions for the equality of the unassignable polynomial and Davison's fixed polynomial of strongly connected systems

In this technical note, it is established that the unassignable polynomial defined for a not strongly connected decentralized control system is not equal to Davison's fixed polynomial. This leads to a "sufficient condition" for the equality of the unassignable polynomial and Davison's fixed polynomial for strongly connected systems.

A parallel wilf algorithm for complex zeros of a polynomial

A global recursive bisection algorithm is described for computing the complex zeros of a polynomial. It has complexityO(n 3 p) wheren is the degree of the polynomial andp the bit precision requirement. Ifn processors are available, it can be realized in parallel with complexityO(n 2 p); also it can be implemented using exact arithmetic. A combined Wilf-Hansen algorithm is suggested for reduction in complexity.

Microprocessor-based polynomial generator

A new method of generating polynomials using microprocessors is proposed. The polynomial is generated as a 16-bit digital word. The algorithm for generating a variety of basic 'building block' functions and its implementation is discussed. A technique for generating a generalized polynomial based on the proposed algorithm is indicated. The performance of the proposed generator is evaluated using a commercially available microprocessor kit.

Localization of handwritten text in documents using moment invariants and Delaunay triangulation

This paper describes an approach based on Zernike moments and Delaunay triangulation for localization of hand-written text in machine printed text documents. The Zernike moments of the image are first evaluated and we classify the text as hand-written using the nearest neighbor classifier. These features are independent of size, slant, orientation, translation and other variations in handwritten text. We then use Delaunay triangulation to reclassify the misclassified text regions. When imposing Delaunay triangulation on the centroid points of the connected components, we extract features based on the triangles and reclassify the text. We remove the noise components in the document as part of the preprocessing step so this method works well on noisy documents. The success rate of the method is found to be 86%. Also for specific hand-written elements such as signatures or similar text the accuracy is found to be even higher at 93%.

Multi-Tone Testing of Linear and Nonlinear Analog Circuits using Polynomial Coefficients

A method of testing for parametric faults of analog circuits based on a polynomial representation of fault-free function of the circuit is presented. The response of the circuit under test (CUT) is estimated as a polynomial in the applied input voltage at relevant frequencies in addition to DC. Classification or Cur is based on a comparison of the estimated polynomial coefficients with those of the fault free circuit. This testing method requires no design for test hardware as might be added to the circuit fly some other methods. The proposed method is illustrated for a benchmark elliptic filter. It is shown to uncover several parametric faults causing deviations as small as 5% from the nominal values.

Open manifolds, Ozsvath-Szabo invariants and exotic R-4 ` S

We construct an invariant of certain open four-manifolds using the Heegaard Floer theory of Ozsvath and Szabo. We show that there is a manifold X homeomorphic to R-4 for which the invariant is non-trivial,showing that X is an exotic R-4. This is the first invariant that detects exotic R-4' s. (C) 2009 Published by Elsevier GmbH.

On Application Of The Method Of Kinetic Invariants To The Description Of Dissolution Accompanied By A Chemical Reaction

The dissolution, accompanied by chemical reaction, of monodisperse solid particles has been analysed. The resulting model, which accounts for the variation of mass transfer coefficient with the size of the dissolving particles, yields an approximate analytical form of a kinetic function. Rigorous numerical and approximate analytical solutions have been obtained for the governing system of nonlinear ordinary differential equations. The transient nature of the dissolution process as well as the accuracy of the analytical solution is brought out by the rigorous numerical solution. The analytical solution is fairly accurate for the major part of the range of operational times encountered in practice.

Attitude estimation using moment invariants

The problem of estimating the three-dimensional rotational parameters of a rigid body from its monocular image data has been considered using the method of moment invariants. Second- and third-order moment invariants are used to construct the feature vector for the scale and orientation independent identification of the camera view axis direction in the body-fixed reference frame. The camera rotation angle about the view axis is derived from second-order central moments. The relative attitude of the rigid body is then expressed in terms of quaternion parameters to model the outputs of a video sensor in attitude control simulations. Experimental results and simulation outputs are presented using the mathematical model of a spacecraft.

Flat connections, geometric invariants and the symplectic nature of the fundamental group of surfaces

In this paper we associate a new geometric invariant to the space of fiat connections on a G (= SU(2))-bundle on a compact Riemann surface M and relate it tcr the symplectic structure on the space Hom(pi(1)(M), G)/G consisting of representations of the fundamental group pi(1)(M) Of M into G module the conjugate action of G on representations.

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.