An Algorithm for Testing 2-Asummability of Boolean Functions

Simple algorithms have been developed to generate pairs of minterms forming a given 2-sum and thereby to test 2-asummability of switching functions. The 2-asummability testing procedure can be easily implemented on the computer. Since 2-asummability is a necessary and sufficient condition for a switching function of upto eight variables to be linearly separable (LS), it can be used for testing LS switching functions of upto eight variables.

Glycodelin-A interferes with IL-2/IL-2R signalling to induce cell growth arrest, loss of effector functions and apoptosis in T-lymphocytes

The progesterone-regulated glycoprotein glycodelin-A (GdA), secreted by the decidualized endometrium at high concentrations in primates, inhibits the maternal immune response against fetal antigens and thereby contributes to the tolerance of the semi-allogenic fetus during a normal pregnancy. Our earlier studies demonstrated the ability of GdA to induce an intrinsic apoptotic cascade in CD4 T-lymphocytes and suppress the cytolytic effector function of CD8 T-lymphocytes. In this report, we investigated further into the mechanism of action of GdA controlling perforin and granzyme B expression in CD8 T-lymphocytes and the mechanism of action of GdA leading to lymphocyte death. Flow cytometry analysis was performed to check for the surface expression of interleukin-2 receptor (IL-2R) and intracellular eomesodermin (Eomes) in activated T-lymphocytes, whereas quantitative RTPCR analysis was used to find out their mRNA profile upon GdA treatment. Western analysis was carried out to confirm the protein level of Bax and Bcl-2. GdA reduces the surface expression of the high-affinity IL-2R complex by down-regulating the synthesis of IL-2R (CD25). This disturbs the optimal IL-2 signalling and decreases the Eomes expression, which along with IL-2 directly regulates perforin and granzymes expression. Consequently, the CD8 T-lymphocytes undergo growth arrest and are unable to mature into competent cytotoxic T-lymphocytes. In the CD4 T-lymphocytes, growth factor IL-2 deprivation leads to proliferation inhibition, decreased Bcl-2/enhanced Bax expression, culminating in mitochondrial stress and cell death. GdA spurs cell cycle arrest, loss of effector functions and apoptosis in different T-cell subsets by making T-lymphocytes unable to respond to IL-2.

Characterization of Birkhoff-James orthogonality

The Birkhoff-James orthogonality is a generalization of Hilbert space orthogonality to Banach spaces. We investigate this notion of orthogonality when the Banach space has more structures. We start by doing so for the Banach space of square matrices moving gradually to all bounded operators on any Hilbert space, then to an arbitrary C*-algebra and finally a Hilbert C*-module.

On existence of periodic solutions for stable interval plants with odd, sector type nonlinearities

In several systems, the physical parameters of the system vary over time or operating points. A popular way of representing such plants with structured or parametric uncertainties is by means of interval polynomials. However, ensuring the stability of such systems is a robust control problem. Fortunately, Kharitonov's theorem enables the analysis of such interval plants and also provides tools for design of robust controllers in such cases. The present paper considers one such case, where the interval plant is connected with a timeinvariant, static, odd, sector type nonlinearity in its feedback path. This paper provides necessary conditions for the existence of self sustaining periodic oscillations in such interval plants, and indicates a possible design algorithm to avoid such periodic solutions or limit cycles. The describing function technique is used to approximate the nonlinearity and subsequently arrive at the results. Furthermore, the value set approach, along with Mikhailov conditions, are resorted to in providing graphical techniques for the derivation of the conditions and subsequent design algorithm of the controller.

Effect of choice of basis functions in neural network for capturing unknown function for dynamic inversion control

The basic requirement for an autopilot is fast response and minimum steady state error for better guidance performance. The highly nonlinear nature of the missile dynamics due to the severe kinematic and inertial coupling of the missile airframe as well as the aerodynamics has been a challenge for an autopilot that is required to have satisfactory performance for all flight conditions in probable engagements. Dynamic inversion is very popular nonlinear controller for this kind of scenario. But the drawback of this controller is that it is sensitive to parameter perturbation. To overcome this problem, neural network has been used to capture the parameter uncertainty on line. The choice of basis function plays the major role in capturing the unknown dynamics. Here in this paper, many basis function has been studied for approximation of unknown dynamics. Cosine basis function has yield the best response compared to any other basis function for capturing the unknown dynamics. Neural network with Cosine basis function has improved the autopilot performance as well as robustness compared to Dynamic inversion without Neural network.

Electrostatic modulation of periodic potentials in a two-dimensional electron gas: from antidot lattice to quantum dot lattice

We use a dual gated device structure to introduce a gate-tuneable periodic potential in a GaAs/AlGaAs two dimensional electron gas (2DEG). Using only a suitable choice of gate voltages we can controllably alter the potential landscape of the bare 2DEG, inducing either a periodic array of antidots or quantum dots. Antidots are artificial scattering centers, and therefore allow for a study of electron dynamics. In particular, we show that the thermovoltage of an antidot lattice is particularly sensitive to the relative positions of the Fermi level and the antidot potential. A quantum dot lattice, on the other hand, provides the opportunity to study correlated electron physics. We find that its current-voltage characteristics display a voltage threshold, as well as a power law scaling, indicative of collective Coulomb blockade in a disordered background.

Spiral-wave dynamics in ionically realistic mathematical models for human ventricular tissue: the effects of periodic deformation

We carry out an extensive numerical study of the dynamics of spiral waves of electrical activation, in the presence of periodic deformation (PD) in two-dimensional simulation domains, in the biophysically realistic mathematical models of human ventricular tissue due to (a) ten-Tusscher and Panfilov (the TP06 model) and (b) ten-Tusscher, Noble, Noble, and Panfilov (the TNNPO4 model). We first consider simulations in cable-type domains, in which we calculate the conduction velocity theta and the wavelength lambda of a plane wave; we show that PD leads to a periodic, spatial modulation of theta and a temporally periodic modulation of lambda; both these modulations depend on the amplitude and frequency of the PD. We then examine three types of initial conditions for both TP06 and TNNPO4 models and show that the imposition of PD leads to a rich variety of spatiotemporal patterns in the transmembrane potential including states with a single rotating spiral (RS) wave, a spiral-turbulence (ST) state with a single meandering spiral, an ST state with multiple broken spirals, and a state SA in which all spirals are absorbed at the boundaries of our simulation domain. We find, for both TP06 and TNNPO4 models, that spiral-wave dynamics depends sensitively on the amplitude and frequency of PD and the initial condition. We examine how these different types of spiral-wave states can be eliminated in the presence of PD by the application of low-amplitude pulses by square- and rectangular-mesh suppression techniques. We suggest specific experiments that can test the results of our simulations.

An Algorithmic Characterization of Polynomial Functions over Z(pn)

In this paper we consider polynomial representability of functions defined over , where p is a prime and n is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to determine whether a given function over is polynomially representable or not, and (ii) finds the polynomial if it is polynomially representable. The previous characterizations given by Kempner (Trans. Am. Math. Soc. 22(2):240-266, 1921) and Carlitz (Acta Arith. 9(1), 67-78, 1964) are existential in nature and only lead to an exhaustive search method, i.e. algorithm with complexity exponential in size of the input. Our characterization leads to an algorithm whose running time is linear in size of input. We also extend our result to the multivariate case.

THE BERGMAN KERNEL FUNCTION

In this note, we point out that a large family of n x n matrix valued kernel functions defined on the unit disc D subset of C, which were constructed recently in [9], behave like the familiar Bergman kernel function on ID in several different ways. We show that a number of questions involving the multiplication operator on the corresponding Hilbert space of holomorphic functions on D can be answered using this likeness.

Detection of a periodic structure embedded in surface roughness, for various correlation functions

This paper deals with surface profilometry, where we try to detect a periodic structure, hidden in randomness using the matched filter method of analysing the intensity of light, scattered from the surface. From the direct problem of light scattering from a composite rough surface of the above type, we find that the detectability of the periodic structure can be hindered by the randomness, being dependent on the correlation function of the random part. In our earlier works, we had concentrated mainly on the Cauchy-type correlation function for the rough part. In the present work, we show that this technique can determine the periodic structure of different kinds of correlation functions of the roughness, including Cauchy, Gaussian etc. We study the detection by the matched filter method as the nature of the correlation function is varied.

Learning Optimal Discriminant Functions through a Cooperative Game of Automata

The problem of learning correct decision rules to minimize the probability of misclassification is a long-standing problem of supervised learning in pattern recognition. The problem of learning such optimal discriminant functions is considered for the class of problems where the statistical properties of the pattern classes are completely unknown. The problem is posed as a game with common payoff played by a team of mutually cooperating learning automata. This essentially results in a probabilistic search through the space of classifiers. The approach is inherently capable of learning discriminant functions that are nonlinear in their parameters also. A learning algorithm is presented for the team and convergence is established. It is proved that the team can obtain the optimal classifier to an arbitrary approximation. Simulation results with a few examples are presented where the team learns the optimal classifier.

Entire Solutions of Hydrodynamical Equations with Exponential Dissipation

We consider a modification of the three-dimensional Navier-Stokes equations and other hydrodynamical evolution equations with space-periodic initial conditions in which the usual Laplacian of the dissipation operator is replaced by an operator whose Fourier symbol grows exponentially as e(vertical bar k vertical bar/kd) at high wavenumbers vertical bar k vertical bar. Using estimates in suitable classes of analytic functions, we show that the solutions with initially finite energy become immediately entire in the space variables and that the Fourier coefficients decay faster than e-(C(k/kd) ln(vertical bar k vertical bar/kd)) for any C < 1/(2 ln 2). The same result holds for the one-dimensional Burgers equation with exponential dissipation but can be improved: heuristic arguments and very precise simulations, analyzed by the method of asymptotic extrapolation of van der Hoeven, indicate that the leading-order asymptotics is precisely of the above form with C = C-* = 1/ ln 2. The same behavior with a universal constant C-* is conjectured for the Navier-Stokes equations with exponential dissipation in any space dimension. This universality prevents the strong growth of intermittency in the far dissipation range which is obtained for ordinary Navier-Stokes turbulence. Possible applications to improved spectral simulations are briefly discussed.

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.

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.

Asymptotics of Harish-Chandra expansions, bounded hypergeometric functions associated with root systems, and applications

A series expansion for Heckman-Opdam hypergeometric functions phi(lambda) is obtained for all lambda is an element of alpha(C)*. As a consequence, estimates for phi(lambda) away from the walls of a Weyl chamber are established. We also characterize the bounded hypergeometric functions and thus prove an analogue of the celebrated theorem of Helgason and Johnson on the bounded spherical functions on a Riemannian symmetric space of the noncompact type. The L-P-theory for the hypergeometric Fourier transform is developed for 0 < p < 2. In particular, an inversion formula is proved when 1 <= p < 2. (C) 2013 Elsevier Inc. All rights reserved.