Alboserpin, a Factor Xa Inhibitor from the Mosquito Vector of Yellow Fever, Binds Heparin and Membrane Phospholipids and Exhibits Antithrombotic Activity

The molecular mechanism of factor Xa (FXa) inhibition by Alboserpin, the major salivary gland anticoagulant from the mosquito and yellow fever vector Aedes albopictus, has been characterized. cDNA of Alboserpin predicts a 45-kDa protein that belongs to the serpin family of protease inhibitors. Recombinant Alboserpin displays stoichiometric, competitive, reversible and tight binding to FXa (picomolar range). Binding is highly specific and is not detectable for FX, catalytic site-blocked FXa, thrombin, and 12 other enzymes. Alboserpin displays high affinity binding to heparin (K(D) similar to 20 nM), but no change in FXa inhibition was observed in the presence of the cofactor, implying that bridging mechanisms did not take place. Notably, Alboserpin was also found to interact with phosphatidylcholine and phosphatidylethanolamine but not with phosphatidylserine. Further, annexin V (in the absence of Ca(2+)) or heparin outcompetes Alboserpin for binding to phospholipid vesicles, suggesting a common binding site. Consistent with its activity, Alboserpin blocks prothrombinase activity and increases both prothrombin time and activated partial thromboplastin time in vitro or ex vivo. Furthermore, Alboserpin prevents thrombus formation provoked by ferric chloride injury of the carotid artery and increases bleeding in a dose-dependent manner. Alboserpin emerges as an atypical serpin that targets FXa and displays unique phospholipid specificity. It conceivably uses heparin and phosphatidylcholine/phosphatidylethanolamine as anchors to increase protein localization and effective concentration at sites of injury, cell activation, or inflammation.

Development of an adenoviral vector with robust expression driven by p53

Here we introduce a new adenoviral vector where transgene expression is driven by p53. We first developed a synthetic promoter, referred to as PGTx beta containing a p53-responsive element, a minimal promoter and the first intron of the rabbit P-globin gene. Initial assays using plasmid-based vectors indicated that expression was tightly controlled by p53 and was 5-fold stronger than the constitutive CMV immediate early promoter/enhancer. The adenoviral vector, AdPG, was also shown to offer p53-responsive expression in prostate carcinoma cells LNCaP (wt p53), DU-145 (temperature sensitive mutant of p53) and PC3 (p53-null, but engineered to express temperature-sensitive p53 mutants). AdPG served as a sensor of p53 activity in LNCaP cells treated with chemotherapeutic agents. Since p53 can be induced by radiotherapy and chemotherapy, this new vector could be further developed for use in combination with conventional therapies to bring about cooperation between the genetic and pharmacologic treatment modalities. (c) 2007 Elsevier Inc. All rights reserved.

C(k)-solvability near the characteristic set for a class of planar complex vector fields of infinite type

This paper deals with semi-global C(k)-solvability of complex vector fields of the form L = partial derivative/partial derivative t + x(r) (a(x) + ib(x))partial derivative/partial derivative x, r >= 1, defined on Omega(epsilon) = (-epsilon, epsilon) x S(1), epsilon > 0, where a and b are C(infinity) real-valued functions in (-epsilon, epsilon). It is shown that the interplay between the order of vanishing of the functions a and b at x = 0 influences the C(k)-solvability at Sigma = {0} x S(1). When r = 1, it is permitted that the functions a and b of L depend on the x and t variables, that is, L = partial derivative/partial derivative t + x(a(x, t) + ib(x, t))partial derivative/partial derivative x, where (x, t) is an element of Omega(epsilon).

THE POINCARE-BENDIXSON THEOREM ON THE KLEIN BOTTLE FOR CONTINUOUS VECTOR FIELDS

We present a version of the Poincare-Bendixson Theorem on the Klein bottle K(2) for continuous vector fields. As a consequence, we obtain the fact that K(2) does not admit continuous vector fields having a omega-recurrent injective trajectory.

Phase portraits of quadratic polynomial vector fields having a rational first integral of degree 3

In this paper, we classify all the global phase portraits of the quadratic polynomial vector fields having a rational first integral of degree 3. (C) 2008 Elsevier Ltd. All rights reserved.

Invariant theory and reversible-equivariant vector fields

In this paper we present results for the systematic study of reversible-equivariant vector fields - namely, in the simultaneous presence of symmetries and reversing symmetries - by employing algebraic techniques from invariant theory for compact Lie groups. The Hilbert-Poincare series and their associated Molien formulae are introduced,and we prove the character formulae for the computation of dimensions of spaces of homogeneous anti-invariant polynomial functions and reversible-equivariant polynomial mappings. A symbolic algorithm is obtained for the computation of generators for the module of reversible-equivariant polynomial mappings over the ring of invariant polynomials. We show that this computation can be obtained directly from a well-known situation, namely from the generators of the ring of invariants and the module of the equivariants. (C) 2008 Elsevier B.V, All rights reserved.

Nonexistence of global solutions for a class of complex vector fields on two-torus

The goal of this paper is study the global solvability of a class of complex vector fields of the special form L = partial derivative/partial derivative t + (a + ib)(x)partial derivative/partial derivative x, a, b epsilon C(infinity) (S(1) ; R), defined on two-torus T(2) congruent to R(2)/2 pi Z(2). The kernel of transpose operator L is described and the solvability near the characteristic set is also studied. (c) 2008 Elsevier Inc. All rights reserved.

Gevrey solvability near the characteristic set for a class of planar complex vector fields of infinite type

We study the Gevrey solvability of a class of complex vector fields, defined on Omega(epsilon) = (-epsilon, epsilon) x S(1), given by L = partial derivative/partial derivative t + (a(x) + ib(x))partial derivative/partial derivative x, b not equivalent to 0, near the characteristic set Sigma = {0} x S(1). We show that the interplay between the order of vanishing of the functions a and b at x = 0 plays a role in the Gevrey solvability. (C) 2008 Elsevier Inc. All rights reserved.

A Parallel Hardware Architecture for Scale and Rotation Invariant Feature Detection

This paper proposes a parallel hardware architecture for image feature detection based on the Scale Invariant Feature Transform algorithm and applied to the Simultaneous Localization And Mapping problem. The work also proposes specific hardware optimizations considered fundamental to embed such a robotic control system on-a-chip. The proposed architecture is completely stand-alone; it reads the input data directly from a CMOS image sensor and provides the results via a field-programmable gate array coupled to an embedded processor. The results may either be used directly in an on-chip application or accessed through an Ethernet connection. The system is able to detect features up to 30 frames per second (320 x 240 pixels) and has accuracy similar to a PC-based implementation. The achieved system performance is at least one order of magnitude better than a PC-based solution, a result achieved by investigating the impact of several hardware-orientated optimizations oil performance, area and accuracy.

Pion: space-like structure

The scalar form factor describes modifications induced by the pion over the quark condensate. Assuming that representations produced by chiral perturbation theory can be pushed to high values of negative-t, a region in configuration space is reached (r < R similar to 0.5 fm) where the form factor changes sign, indicating that the condensate has turned into empty space. A simple model for the pion incorporates this feature into density functions. When supplemented by scalar-meson excitations, it yields predictions close to empirical values for the mean square radius (< r(2)>(pi)(S) = 0.59 fm(2)) and for one of the low energy constants ((l) over bar (4) = 4.3), with no adjusted parameters.

Improved voice activity detection algorithm using wavelet and support vector machine

This paper proposes an improved voice activity detection (VAD) algorithm using wavelet and support vector machine (SVM) for European Telecommunication Standards Institution (ETS1) adaptive multi-rate (AMR) narrow-band (NB) and wide-band (WB) speech codecs. First, based on the wavelet transform, the original IIR filter bank and pitch/tone detector are implemented, respectively, via the wavelet filter bank and the wavelet-based pitch/tone detection algorithm. The wavelet filter bank can divide input speech signal into several frequency bands so that the signal power level at each sub-band can be calculated. In addition, the background noise level can be estimated in each sub-band by using the wavelet de-noising method. The wavelet filter bank is also derived to detect correlated complex signals like music. Then the proposed algorithm can apply SVM to train an optimized non-linear VAD decision rule involving the sub-band power, noise level, pitch period, tone flag, and complex signals warning flag of input speech signals. By the use of the trained SVM, the proposed VAD algorithm can produce more accurate detection results. Various experimental results carried out from the Aurora speech database with different noise conditions show that the proposed algorithm gives considerable VAD performances superior to the AMR-NB VAD Options 1 and 2, and AMR-WB VAD. (C) 2009 Elsevier Ltd. All rights reserved.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

Measuring time series predictability using support vector regression

Most studies involving statistical time series analysis rely on assumptions of linearity, which by its simplicity facilitates parameter interpretation and estimation. However, the linearity assumption may be too restrictive for many practical applications. The implementation of nonlinear models in time series analysis involves the estimation of a large set of parameters, frequently leading to overfitting problems. In this article, a predictability coefficient is estimated using a combination of nonlinear autoregressive models and the use of support vector regression in this model is explored. We illustrate the usefulness and interpretability of results by using electroencephalographic records of an epileptic patient.

UNIT VECTOR FIELDS ON ANTIPODALLY PUNCTURED SPHERES: BIG INDEX, BIG VOLUME

We establish in this paper a lower bound for the volume of a unit vector field (v) over right arrow defined ou S(n) \ {+/-x}, n = 2,3. This lower bound is related to the sum of the absolute values of the indices of (v) over right arrow at x and -x.

Periodic geodesics and geometry of compact Lorentzian manifolds with a Killing vector field

We study the geometry and the periodic geodesics of a compact Lorentzian manifold that has a Killing vector field which is timelike somewhere. Using a compactness argument for subgroups of the isometry group, we prove the existence of one timelike non self-intersecting periodic geodesic. If the Killing vector field is nowhere vanishing, then there are at least two distinct periodic geodesics; as a special case, compact stationary manifolds have at least two periodic timelike geodesics. We also discuss some properties of the topology of such manifolds. In particular, we show that a compact manifold M admits a Lorentzian metric with a nowhere vanishing Killing vector field which is timelike somewhere if and only if M admits a smooth circle action without fixed points.