A Fast Linear Separability Test by Projection of Positive Points on Subspaces

A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d

Construction of Stability Multipliers with Prescribed Phase Characteristics: an Improved Value for $\sigma

For a feedback system consisting of a transfer function $G(s)$ in the forward path and a time-varying gain $n(t)(0 \leqq n(t) \leqq k)$ in the feedback loop, a stability multiplier $Z(s)$ has been constructed (and used to prove stability) by Freedman [2] such that $Z(s)(G(s) + {1 / K})$ and $Z(s - \sigma )(0 < \sigma < \sigma _ * )$ are strictly positive real, where $\sigma _ * $ can be computed from a knowledge of the phase-angle characteristic of $G(i\omega ) + {1 / k}$ and the time-varying gain $n(t)$ is restricted by $\sigma _ * $ by means of an integral inequality. In this note it is shown that an improved value for $\sigma _ * $ is possible by making some modifications in his derivation. ©1973 Society for Industrial and Applied Mathematics.

On the maximal rate of non-square STBCs from complex orthogonal designs

A Linear Processing Complex Orthogonal Design (LPCOD) is a p x n matrix epsilon, (p >= n) in k complex indeterminates x(1), x(2),..., x(k) such that (i) the entries of epsilon are complex linear combinations of 0, +/- x(i), i = 1,..., k and their conjugates, (ii) epsilon(H)epsilon = D, where epsilon(H) is the Hermitian (conjugate transpose) of epsilon and D is a diagonal matrix with the (i, i)-th diagonal element of the form l(1)((i))vertical bar x(1)vertical bar(2) + l(2)((i))vertical bar x(2)vertical bar(2)+...+ l(k)((i))vertical bar x(k)vertical bar(2) where l(j)((i)), i = 1, 2,..., n, j = 1, 2,...,k are strictly positive real numbers and the condition l(1)((i)) = l(2)((i)) = ... = l(k)((i)), called the equal-weights condition, holds for all values of i. For square designs it is known. that whenever a LPCOD exists without the equal-weights condition satisfied then there exists another LPCOD with identical parameters with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1. This implies that the maximum possible rate for square LPCODs without the equal-weights condition is the same as that or square LPCODs with equal-weights condition. In this paper, this result is extended to a subclass of non-square LPCODs. It is shown that, a set of sufficient conditions is identified such that whenever a non-square (p > n) LPCOD satisfies these sufficient conditions and do not satisfy the equal-weights condition, then there exists another LPCOD with the same parameters n, k and p in the same complex indeterminates with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1.

On the Limits of Spatial Reuse and Cooperative Communication for Dense Wireless Networks

We consider a dense ad hoc wireless network comprising n nodes confined to a given two dimensional region of fixed area. For the Gupta-Kumar random traffic model and a realistic interference and path loss model (i.e., the channel power gains are bounded above, and are bounded below by a strictly positive number), we study the scaling of the aggregate end-to-end throughput with respect to the network average power constraint, P macr, and the number of nodes, n. The network power constraint P macr is related to the per node power constraint, P macr, as P macr = np. For large P, we show that the throughput saturates as Theta(log(P macr)), irrespective of the number of nodes in the network. For moderate P, which can accommodate spatial reuse to improve end-to-end throughput, we observe that the amount of spatial reuse feasible in the network is limited by the diameter of the network. In fact, we observe that the end-to-end path loss in the network and the amount of spatial reuse feasible in the network are inversely proportional. This puts a restriction on the gains achievable using the cooperative communication techniques studied in and, as these rely on direct long distance communication over the network.

A Nearly Exact Reformulation of the Girsanov Linearization for Stochastically Driven Nonlinear Oscillators

The Girsanov linearization method (GLM), proposed earlier in Saha, N., and Roy, D., 2007, ``The Girsanov Linearisation Method for Stochastically Driven Nonlinear Oscillators,'' J. Appl. Mech., 74, pp. 885-897, is reformulated to arrive at a nearly exact, semianalytical, weak and explicit scheme for nonlinear mechanical oscillators under additive stochastic excitations. At the heart of the reformulated linearization is a temporally localized rejection sampling strategy that, combined with a resampling scheme, enables selecting from and appropriately modifying an ensemble of locally linearized trajectories while weakly applying the Girsanov correction (the Radon-Nikodym derivative) for the linearization errors. The semianalyticity is due to an explicit linearization of the nonlinear drift terms and it plays a crucial role in keeping the Radon-Nikodym derivative ``nearly bounded'' above by the inverse of the linearization time step (which means that only a subset of linearized trajectories with low, yet finite, probability exceeds this bound). Drift linearization is conveniently accomplished via the first few (lower order) terms in the associated stochastic (Ito) Taylor expansion to exclude (multiple) stochastic integrals from the numerical treatment. Similarly, the Radon-Nikodym derivative, which is a strictly positive, exponential (super-) martingale, is converted to a canonical form and evaluated over each time step without directly computing the stochastic integrals appearing in its argument. Through their numeric implementations for a few low-dimensional nonlinear oscillators, the proposed variants of the scheme, presently referred to as the Girsanov corrected linearization method (GCLM), are shown to exhibit remarkably higher numerical accuracy over a much larger range of the time step size than is possible with the local drift-linearization schemes on their own.

Nucleophilic additions to 4-substituted snoutanones: getting a measure of long range electrostatic and orbital control of pi-face selectivity

Pentacyclic ketones 10a-e (snoutan-9-ones) undergo nucleophilic additions with the same facial preference as the corresponding norsnoutanones 9a-e, but with markedly reduced selectivity, revealing the involvement of electrostatic effects in the former and implying the importance of hyperconjugative orbital interactions in determining pi-face selectivity in the latter systems.

On The Topology Of Manifolds With Positive Isotropic Curvature

We show that a closed orientable Riemannian n-manifold, n >= 5, with positive isotropic curvature and free fundamental group is homeomorphic to the connected sum of copies of Sn-1 x S-1.

A global convergence criterion for discrete-time multivariable adaptive systems

The paper deals with the basic problem of adjusting a matrix gain in a discrete-time linear multivariable system. The object is to obtain a global convergence criterion, i.e. conditions under which a specified error signal asymptotically approaches zero and other signals in the system remain bounded for arbitrary initial conditions and for any bounded input to the system. It is shown that for a class of up-dating algorithms for the adjustable gain matrix, global convergence is crucially dependent on a transfer matrix G(z) which has a simple block diagram interpretation. When w(z)G(z) is strictly discrete positive real for a scalar w(z) such that w-1(z) is strictly proper with poles and zeros within the unit circle, an augmented error scheme is suggested and is proved to result in global convergence. The solution avoids feeding back a quadratic term as recommended in other schemes for single-input single-output systems.

Genetic analysis of foot-and-mouth disease virus serotype A of Indian origin and detection of positive selection and recombination in leader protease- and capsid-coding regions

The leader protease (L-pro) and capsid-coding sequences (P1) constitute approximately 3 kb of the foot-and-mouth disease virus (FMDV). We studied the phylogenetic relationship of 46 FMDV serotype A isolates of Indian origin collected during the period 1968-2005 and also eight vaccine strains using the neighbour-joining tree and Bayesian tree methods. The viruses were categorized under three major groups - Asian, Euro-South American and European. The Indian isolates formed a distinct genetic group among the Asian isolates. The Indian isolates were further classified into different genetic subgroups (<5% divergence). Post-1995 isolates were divided into two subgroups while a few isolates which originated in the year 2005 from Andhra Pradesh formed a separate group. These isolates were closely related to the isolates of the 1970s. The FMDV isolates seem to undergo reverse mutation or onvergent evolution wherein sequences identical to the ancestors are present in the isolates in circulation. The eight vaccine strains included in the study were not related to each other and belonged to different genetic groups. Recombination was detected in the L-pro region in one isolate (A IND 20/82) and in the VP1 coding 1D region in another isolate (A RAJ 21/96). Positive selection was identified at aa positions 23 in the L-pro (P<0.05; 0.046*) and at aa 171 in the capsid protein VP1 (P<0.01; 0.003**).

A measure of logical complexity of programs

The research in software science has so far been concentrated on three measures of program complexity: (a) software effort; (b) cyclomatic complexity; and (c) program knots. In this paper we propose a measure of the logical complexity of programs in terms of the variable dependency of sequence of computations, inductive effort in writing loops and complexity of data structures. The proposed complexity mensure is described with the aid of a graph which exhibits diagrammatically the dependence of a computation at a node upon the computation of other (earlier) nodes. Complexity measures of several example programs have been computed and the related issues have been discussed. The paper also describes the role played by data structures in deciding the program complexity.

Studies on Rat Ovarian Receptors for Lutropin (Luteinizing Hormone): Applicability of radioimmunoassay to measure lutropin bound to receptors.

Measurement of receptor-bound unlabelled physiologically active lutropin (luteinizing hormone, LH) was possible by a modified radioimmunoassay. The conventional radioimmunoassayconducted at 4°C was inadequate, whereas the modified assay performed at 37'C could measure receptor-bound lutropin. The radioimmunoassay at 37'C takes only 36h for completion compared with 5-7 days at 4°C. The sensitivity and range of dose-response curves are, however, unaltered. The validity of the technique was established by a number of criteria.

Identification and functional characterization of a cis-acting positive DNA element regulating CYP 2B1/B2 gene transcription in rat liver

A positive cis-acting DNA element in the near 5'-upstream region of the CYP2B1/B2 genes in rat liver was found to play an important role in the transcription of these genes. An oligonucleotide covering -69 to -98 nt mimicked the gel mobility shift pattern given by the fragment -179 to +29 nt, which was earlier found adequate to confer the regulatory features of this gene. Two major complexes were seen, of which the slower and faster moving complexes became intense under uninduced and Phenobarbitone-induced conditions respectively. Minigene cloned DNA plasmid covering -179 to +181 nt in pUC 19 and Bal 31 mutants derived from this parent were transcribed in whole nuclei and cell free transcription extracts and mutants containing only upto -75 nt of the upstream were poorly transcribed. Transcription extracts from phenobarbitone-injected rat liver nuclei were significantly more active than extracts from uninduced rats in transcribing the minigene constructs. Addition of the oligonucleotide (-69 to -98nt) specifically inhibited the transcription of the minigene construct (-179 to +181 nt) in the cell free transcription system. It is therefore, concluded that the region -69 to -98 nt acts as a positive cis-acting element in the transcription of the CYP2B1/B2 genes and in mediating the inductive effects of phenobarbitone.

Negative sequence compensation within fundamental positive sequence reference frame for a stiff micro-grid generation in a wind power system using slip ring induction machine

An isolated wind power generation scheme using slip ring induction machine (SRIM) is proposed. The proposed scheme maintains constant load voltage and frequency irrespective of the wind speed or load variation. The power circuit consists of two back-to-back connected inverters with a common dc link, where one inverter is directly connected to the rotor side of SRIM and the other inverter is connected to the stator side of the SRIM through LC filter. Developing a negative sequence compensation method to ensure that, even under the presence of unbalanced load, the generator experiences almost balanced three-phase current and most of the unbalanced current is directed through the stator side converter is the focus here. The SRIM controller varies the speed of the generator with variation in the wind speed to extract maximum power. The difference of the generated power and the load power is either stored in or extracted from a battery bank, which is interfaced to the common dc link through a multiphase bidirectional fly-back dc-dc converter. The SRIM control scheme, maximum power point extraction algorithm and the fly-back converter topology are incorporated from available literature. The proposed scheme is both simulated and experimentally verified.

Regulation of human CD4(+) alphabeta T-cell-receptor-positive (TCR(+)) and gammadelta TCR(+) T-cell responses to Mycobacterium tuberculosis by interleukin-10 and transforming growth factor beta.

Mycobacterium tuberculosis is the etiologic agent of human tuberculosis and is estimated to infect one-third of the world's population. Control of M. tuberculosis requires T cells and macrophages. T-cell function is modulated by the cytokine environment, which in mycobacterial infection is a balance of proinflammatory (interleukin-1 [IL-1], IL-6, IL-8, IL-12, and tumor necrosis factor alpha) and inhibitory (IL-10 and transforming growth factor beta [TGF-beta]) cytokines. IL-10 and TGF-beta are produced by M. tuberculosis-infected macrophages. The effect of IL-10 and TGF-beta on M. tuberculosis-reactive human CD4(+) and gammadelta T cells, the two major human T-cell subsets activated by M. tuberculosis, was investigated. Both IL-10 and TGF-beta inhibited proliferation and gamma interferon production by CD4(+) and gammadelta T cells. IL-10 was a more potent inhibitor than TGF-beta for both T-cell subsets. Combinations of IL-10 and TGF-beta did not result in additive or synergistic inhibition. IL-10 inhibited gammadelta and CD4(+) T cells directly and inhibited monocyte antigen-presenting cell (APC) function for CD4(+) T cells and, to a lesser extent, for gammadelta T cells. TGF-beta inhibited both CD4(+) and gammadelta T cells directly and had little effect on APC function for gammadelta and CD4(+) T cells. IL-10 down-regulated major histocompatibility complex (MHC) class I, MHC class II, CD40, B7-1, and B7-2 expression on M. tuberculosis-infected monocytes to a greater extent than TGF-beta. Neither cytokine affected the uptake of M. tuberculosis by monocytes. Thus, IL-10 and TGF-beta both inhibited CD4(+) and gammadelta T cells but differed in the mechanism used to inhibit T-cell responses to M. tuberculosis.