On the upper bound of the number of limit cycles obtained by the second order averaging method I

"Vegeu el resum a l'inici del document del fitxer adjunt."

On the upper bound of the number of limit cycles obtained by the second order averaging method II

"Vegeu el resum a l'inici del document del fitxer adjunt."

Peptide substrate specificity of the membrane-bound metalloprotease of Leishmania.

The promastigote surface protease (PSP) of Leishmania is a neutral membrane-bound zinc enzyme. The protease has no exopeptidase activity and does not cleave a large selection of substrates with chromogenic and fluorogenic leaving groups at the P1' site. The substrate specificity of the enzyme was studied by using natural and synthetic peptides of known amino acid sequence. The identification of 11 cleavage sites indicates that the enzyme preferentially cleaves peptides at the amino side when hydrophobic residues are in the P1' site and basic amino acid residues in the P2' and P3' sites. In addition, tyrosine residues are commonly found at the P1 site. Hydrolysis is not, however, restricted to these residues. These results have allowed the synthesis of a model peptide, H2N-L-I-A-Y-L-K-K-A-T-COOH, which is cleaved by PSP between the tyrosine and leucine residues with a kcat/Km ratio of 1.8 X 10(6) M-1 s-1. Furthermore, a synthetic nonapeptide overlapping the last four amino acids of the prosequence and the first five residues of mature PSP was found to be cleaved by the protease at the expected site to release the mature enzyme. This result suggests a possible autocatalytic mechanism for the activation of the protease. Finally, the hydroxamate-derivatized dipeptide Cbz-Tyr-Leu-NHOH was shown to inhibit PSP competitively with a KI of 17 microM.

An objective anisotropic elastic plastic model and Algorithm applicable to bone mechanics

The implicit projection algorithm of isotropic plasticity is extended to an objective anisotropic elastic perfectly plastic model. The recursion formula developed to project the trial stress on the yield surface, is applicable to any non linear elastic law and any plastic yield function.A curvilinear transverse isotropic model based on a quadratic elastic potential and on Hill's quadratic yield criterion is then developed and implemented in a computer program for bone mechanics perspectives. The paper concludes with a numerical study of a schematic bone-prosthesis system to illustrate the potential of the model.

A numerical algorithm for finding solutions of a generalized Nash equilibrium problem

A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.

Synaptobrevin N-terminally bound to syntaxin-SNAP-25 defines the primed vesicle state in regulated exocytosis.

Rapid neurotransmitter release depends on the ability to arrest the SNAP receptor (SNARE)-dependent exocytosis pathway at an intermediate "cocked" state, from which fusion can be triggered by Ca(2+). It is not clear whether this state includes assembly of synaptobrevin (the vesicle membrane SNARE) to the syntaxin-SNAP-25 (target membrane SNAREs) acceptor complex or whether the reaction is arrested upstream of that step. In this study, by a combination of in vitro biophysical measurements and time-resolved exocytosis measurements in adrenal chromaffin cells, we find that mutations of the N-terminal interaction layers of the SNARE bundle inhibit assembly in vitro and vesicle priming in vivo without detectable changes in triggering speed or fusion pore properties. In contrast, mutations in the last C-terminal layer decrease triggering speed and fusion pore duration. Between the two domains, we identify a region exquisitely sensitive to mutation, possibly constituting a switch. Our data are consistent with a model in which the N terminus of the SNARE complex assembles during vesicle priming, followed by Ca(2+)-triggered C-terminal assembly and membrane fusion.

Conversion of membrane-bound Fas(CD95) ligand to its soluble form is associated with downregulation of its proapoptotic activity and loss of liver toxicity.

Human Fas ligand (L) (CD95L) and tumor necrosis factor (TNF)-alpha undergo metalloproteinase-mediated proteolytic processing in their extracellular domains resulting in the release of soluble trimeric ligands (soluble [s]FasL, sTNF-alpha) which, in the case of sFasL, is thought to be implicated in diseases such as hepatitis and AIDS. Here we show that the processing of sFasL occurs between Ser126 and Leu127. The apoptotic-inducing capacity of naturally processed sFasL was reduced by >1,000-fold compared with membrane-bound FasL, and injection of high doses of recombinant sFasL in mice did not induce liver failure. However, soluble FasL retained its capacity to interact with Fas, and restoration of its cytotoxic activity was achieved both in vitro and in vivo with the addition of cross-linking antibodies. Similarly, the marginal apoptotic activity of recombinant soluble TNF-related apoptosis-inducing ligand (sTRAIL), another member of the TNF ligand family, was greatly increased upon cross-linking. These results indicate that the mere trimerization of the Fas and TRAIL receptors may not be sufficient to trigger death signals. Thus, the observation that sFasL is less cytotoxic than membrane-bound FasL may explain why in certain types of cancer, systemic tissue damage is not detected, even though the levels of circulating sFasL are high.

Detachment of cell surface-bound anticarcinoembryonic antigen immune complexes by phospholipase C.

CEA as well as normal cross-reacting antigens (NCA) are fixed to the cell membrane via phosphatidylinositol (PI). To find out whether these antigens are internalized after antibody contact, acid pH desorption was compared to phospholipase C (PLC)-mediated cleavage of the antigen anchor. With the former procedure, marked differences in the desorbability of individual MAbs were noted, while PLC was able to cleave off surface-bound immune complexes irrespective of the MAb involved. From this it is concluded that internalization of MAb complexes of CEA/NCA, if occurring at all, is a low efficiency process.

An algorithm for semi-infinite polynomial optimization

"Vegeu el resum a l'inici del document del fitxer adjunt."

An approximation algorithm for #k-SAT

"Vegeu el resum a l'inici del document del fitxer adjunt"

A lower bound in Nehari's theorem on the polydisc

"Vegeu el resum a l'inici del document del fitxer adjunt"

An iterative Multiscale Finite-Volume algorithm converging to the exact solution

The multiscale finite volume (MsFV) method has been developed to efficiently solve large heterogeneous problems (elliptic or parabolic); it is usually employed for pressure equations and delivers conservative flux fields to be used in transport problems. The method essentially relies on the hypothesis that the (fine-scale) problem can be reasonably described by a set of local solutions coupled by a conservative global (coarse-scale) problem. In most cases, the boundary conditions assigned for the local problems are satisfactory and the approximate conservative fluxes provided by the method are accurate. In numerically challenging cases, however, a more accurate localization is required to obtain a good approximation of the fine-scale solution. In this paper we develop a procedure to iteratively improve the boundary conditions of the local problems. The algorithm relies on the data structure of the MsFV method and employs a Krylov-subspace projection method to obtain an unconditionally stable scheme and accelerate convergence. Two variants are considered: in the first, only the MsFV operator is used; in the second, the MsFV operator is combined in a two-step method with an operator derived from the problem solved to construct the conservative flux field. The resulting iterative MsFV algorithms allow arbitrary reduction of the solution error without compromising the construction of a conservative flux field, which is guaranteed at any iteration. Since it converges to the exact solution, the method can be regarded as a linear solver. In this context, the schemes proposed here can be viewed as preconditioned versions of the Generalized Minimal Residual method (GMRES), with a very peculiar characteristic that the residual on the coarse grid is zero at any iteration (thus conservative fluxes can be obtained).

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

Speculative parallelization of multipath radiosity algorithm

In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm