Extending lagrange interpolation to develop a 4-node quadrilateral element

Today finite element method is a well established tool in engineering analysis and design. Though there axe many two and three dimensional finite elements available, it is rare that a single element performs satisfactorily in majority of practical problems. The present work deals with the development of 4-node quadrilateral element using extended Lagrange interpolation functions. The classical univariate Lagrange interpolation is well developed for 1-D and is used for obtaining shape functions. We propose a new approach to extend the Lagrange interpolation to several variables. When variables axe more than one the method also gives the set of feasible bubble functions. We use the two to generate shape function for the 4-node arbitrary quadrilateral. It will require the incorporation of the condition of rigid body motion, constant strain and Navier equation by imposing necessary constraints. The procedure obviates the need for isoparametric transformation since interpolation functions are generated for arbitrary quadrilateral shapes. While generating the element stiffness matrix, integration can be carried out to the accuracy desired by dividing the quadrilateral into triangles. To validate the performance of the element which we call EXLQUAD4, we conduct several pathological tests available in the literature. EXLQUAD4 predicts both stresses and displacements accurately at every point in the element in all the constant stress fields. In tests involving higher order stress fields the element is assured to converge in the limit of discretisation. A method thus becomes available to generate shape functions directly for arbitrary quadrilateral. The method is applicable also for hexahedra. The approach should find use for development of finite elements for use with other field equations also.

Theoretical foundations for multiple rendezvous of glowworm-inspired mobile agents with variable local-decision domains

We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper.

Glowworm-inspired robot swarm for simultaneous taxis towards multiple radiation sources

This paper presents a glowworm metaphor based distributed algorithm that enables a collection of minimalist mobile robots to split into subgroups, exhibit simultaneous taxis-behavior towards, and rendezvous at multiple radiation sources such as nuclear/hazardous chemical spills and fire-origins in a fire calamity. The algorithm is based on a glowworm swarm optimization (GSO) technique that finds multiple optima of multimodal functions. The algorithm is in the same spirit as the ant-colony optimization (ACO) algorithms, but with several significant differences. The agents in the glowworm algorithm carry a luminescence quantity called luciferin along with them. Agents are thought of as glowworms that emit a light whose intensity is proportional to the associated luciferin. The key feature that is responsible for the working of the algorithm is the use of an adaptive local-decision domain, which we use effectively to detect the multiple source locations of interest. The glowworms have a finite sensor range which defines a hard limit on the local-decision domain used to compute their movements. Extensive simulations validate the feasibility of applying the glowworm algorithm to the problem of multiple source localization. We build four wheeled robots called glowworms to conduct our experiments. We use a preliminary experiment to demonstrate the basic behavioral primitives that enable each glowworm to exhibit taxis behavior towards source locations and later demonstrate a sound localization task using a set of four glowworms.

Distributed Transmission of Functions of Correlated Sources over a Fading Multiple Access Channel

In this paper we address the problem of distributed transmission of functions of correlated sources over a fast fading multiple access channel (MAC). This is a basic building block in a hierarchical sensor network used in estimating a random field where the cluster head is interested only in estimating a function of the observations. The observations are transmitted to the cluster head through a fast fading MAC. We provide sufficient conditions for lossy transmission when the encoders and decoders are provided with partial information about the channel state. Furthermore signal side information maybe available at the encoders and the decoder. Various previous studies are shown as special cases. Efficient joint-source channel coding schemes are discussed for transmission of discrete and continuous alphabet sources to recover function values.

Thermal correlation functions of twisted quantum fields

We derive the thermal correlators for twisted quantum fields on noncommutative spacetime. We show that the thermal expectation value of the number operator is same as in commutative spacetime, but that higher correlators are sensitive to the noncommutativity parameters phi(mu nu).

Chronopotentiometry with power-law perturbation functions at an expanding plane electrode with and without a preceding blank period for systems with a coupled first-order homogeneous chemical reaction

The systems formalism is used to obtain the interfacial concentration transients for power-law current input at an expanding plane electrode. The explicit results for the concentration transients obtained here pertain to arbitrary homogeneous reaction schemes coupled to the oxidant and reductant of a single charge-transfer step and the power-law form without and with a preceding blank period (for two types of power-law current profile, say, (i) I(t) = I0(t−t0)q for t greater-or-equal, slanted t0, I(t) = 0 for t < t0; and (ii) I(t) = I0tq for t greater-or-equal, slanted t0, I(t) = 0 for t < t0). Finally the potential transients are obtained using Padé approximants. The results of Galvez et al. (for E, CE, EC, aC) (J. Electroanal. Chem., 132 (1982) 15; 146 (1983) 221, 233, 243), Molina et al. (for E) (J. Electroanal. Chem., 227 (1987) 1 and Kies (for E) (J. Electroanal. Chem., 45 (1973) 71) are obtained as special cases.

A New Structure Preserving Energy Function Incorporating Transmission Line Resistances

A novel method to account for the transmission line resistances in structure preserving energy functions (SPEF) is presented in this paper. The method exploits the equivalence of a lossy network having the same conductance to susceptance ratio for all its elements to a lossless network with a new set of power injections. The system equations and the energy function are developed using centre of inertia (COI) variables and the loads are modelled as arbitrary functions of respective bus voltages. The application of SPEF to direct transient stability evaluation is presented considering a realistic power system example.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

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.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

Linear gramicidin activates neutrophil functions and the activation is blocked by chemotactic peptide receptor antagonist

The activation of functional responses in rabbit peritoneal neutrophils by gramicidin and the chemotactic peptide, N-formyl-methionyl-leucyl-phenylalanine methyl ester, was studied. Gramicidin activated superoxide generation, lysosomal enzyme release and a decrease in fluorescence of chlortetracycline-loaded cells, as for the chemotactic peptide. The maximum intensities of the responses by gramicidin were lower than that by chemotactic peptide. Responses by both these peptides could be inhibited by t-butyloxycarbonyl-methionyl-leucyl-phenylalanine, a chemotactic peptide receptor antagonist. Gramicidin gave responses at low doses comparable to that of the chemotactic peptide.

Spatially dependent correlation functions in the Anderson model

We report results from a first principles calculation of spatially dependent correlation functions around a magnetic impurity in metals described by the nondegenerate Anderson model. Our computations are based on a combination of perturbative scaling theory and numerical renormalization group methods. Results for the conduction election charge density around the impurity and correlation functions involving the conduction electron and impurity charge and spin densities will be presented. The behavior in various regimes including the mixed valent regime will be explored.

Approximate multipole coefficients of RF ion traps as functions of aperture size

In this study we present approximate analytical expressions for estimating the variation in multipole expansion coefficients as a function of the size of the apertures in the electrodes in axially symmetric (3D) and two-dimensional (2D) ion trap ion traps. Following the approach adopted in our earlier studies which focused on the role of apertures to fields within the traps, here too, the analytical expression we develop is a sum of two terms, A(n,noAperiure), the multipole expansion coefficient for a trap with no apertures and A(n,dueToAperture), the multipole expansion coefficient contributed by the aperture. A(n,noAperture) has been obtained numerically and A(n,dueToAperture) is obtained from the n th derivative of the potential within the trap. The expressions derived have been tested on two 3D geometries and two 2D geometries. These include the quadrupole ion trap (QIT) and the cylindrical ion trap (CIT) for 3D geometries and the linear ion trap (LIT) and the rectilinear ion trap (RIT) for the 2D geometries. Multipole expansion coefficients A(2) to A(12), estimated by our analytical expressions, were compared with the values obtained numerically (using the boundary element method) for aperture sizes varying up to 50% of the trap dimension. In all the plots presented, it is observed that our analytical expression for the variation of multipole expansion coefficients versus aperture size closely follows the trend of the numerical evaluations for the range of aperture sizes considered. The maximum relative percentage errors, which provide an estimate of the deviation of our values from those obtained numerically for each multipole expansion coefficient, are seen to be largely in the range of 10-15%. The leading multipole expansion coefficient, A(2), however, is seen to be estimated very well by our expressions, with most values being within 1% of the numerically determined values, with larger deviations seen for the QIT and the LIT for large aperture sizes. (C) 2010 Elsevier B.V. All rights reserved.

A Cellular Array for Multivalued Logic Functions

An algebraic generalization of the well-known binary q-function array to a multivalued q-function array is presented. It is possible to associate tree-structure realizations for binary q-functions and multivalued q-functions. Synthesis of multivalued functions using this array is very simple