Search results for "PROGRAM"
showing 10 items of 5938 documents
Neuronal cell cycle: the neuron itself and its circumstances.
2015
Neurons are usually regarded as postmitotic cells that undergo apoptosis in response to cell cycle reactivation. Nevertheless, recent evidence indicates the existence of a defined developmental program that induces DNA replication in specific populations of neurons, which remain in a tetraploid state for the rest of their adult life. Similarly, de novo neuronal tetraploidization has also been described in the adult brain as an early hallmark of neurodegeneration. The aim of this review is to integrate these recent developments in the context of cell cycle regulation and apoptotic cell death in neurons. We conclude that a variety of mechanisms exists in neuronal cells for G1/S and G2/M check…
Bax-derived membrane-active peptides act as potent and direct inducers of apoptosis in cancer cells.
2011
SUMMARYAlthough many cancer cells are primed for apoptosis, they usually develop resistance to cell death at multiple levels. Permeabilization of the outer mitochondrial membrane, which is mediated by proapoptotic Bcl-2 family members like Bax, is considered as a point-of-no-return for initiating apoptotic cell death. This crucial role has placed Bcl-2 family proteins as recurrent targets for anticancer drug development. Here, we propose and demonstrate a new concept based on using minimal active version of Bax to induce cell death independently of endogenous Bcl-2 proteins. We show that membrane-active segments of Bax can directly induce the release of mitochondria-residing apoptogenic fac…
Scenario optimization asset and liability modelling for individual investors
2006
We develop a scenario optimization model for asset and liability management of individual investors. The individual has a given level of initial wealth and a target goal to be reached within some time horizon. The individual must determine an asset allocation strategy so that the portfolio growth rate will be sufficient to reach the target. A scenario optimization model is formulated which maximizes the upside potential of the portfolio, with limits on the downside risk. Both upside and downside are measured vis- `a-vis the goal. The stochastic behavior of asset returns is captured through bootstrap simulation, and the simulation is embedded in the model to determine the optimal portfolio. …
Sampling methods for low-frequency electromagnetic imaging
2007
For the detection of hidden objects by low-frequency electromagnetic imaging the linear sampling method works remarkably well despite the fact that the rigorous mathematical justification is still incomplete. In this work, we give an explanation for this good performance by showing that in the low-frequency limit the measurement operator fulfils the assumptions for the fully justified variant of the linear sampling method, the so-called factorization method. We also show how the method has to be modified in the physically relevant case of electromagnetic imaging with divergence-free currents. We present numerical results to illustrate our findings, and to show that similar performance can b…
The factorization method for real elliptic problems
2006
The Factorization Method localizes inclusions inside a body from mea- surements on its surface. Without a priori knowing the physical parameters inside the inclusions, the points belonging to them can be characterized using the range of an auxiliary operator. The method relies on a range characterization that relates the range of the auxiliary operator to the measurements and is only known for very particular applications. In this work we develop a general framework for the method by considering sym- metric and coercive operators between abstract Hilbert spaces. We show that the important range characterization holds if the difference between the inclusions and the background medium satisfi…
A Hardware and Secure Pseudorandom Generator for Constrained Devices
2018
Hardware security for an Internet of Things or cyber physical system drives the need for ubiquitous cryptography to different sensing infrastructures in these fields. In particular, generating strong cryptographic keys on such resource-constrained device depends on a lightweight and cryptographically secure random number generator. In this research work, we have introduced a new hardware chaos-based pseudorandom number generator, which is mainly based on the deletion of an Hamilton cycle within the $N$ -cube (or on the vectorial negation), plus one single permutation. We have rigorously proven the chaotic behavior and cryptographically secure property of the whole proposal: the mid-term eff…
Étude sur les réformes curriculaires par l'approche par compétences en Afrique
2009
Cette étude vise trois objectifs : réaliser un état des lieux des processus de réformes curriculaires en éducation de base en Afrique pour identifier les problèmes rencontrés, les résultats positifs et les "bonnes pratiques", aider les responsables des systèmes éducatifs à prendre des mesures pertinentes et accompagner les réformes et enfin aider les bailleurs de fonds à mieux comprendre les effets de leur aide et à mieux cibler les projets de réforme en termes de coût et d'efficacité à tous les niveaux des systèmes éducatifs impliqués.
Ietvarprogramma Apvārsnis 2020 un jaunākās Open Access nostādnes Eiropā
2012
Ziņojumā, kas sagatavots Open Access nedēļas semināram " Brīvpieejas e-resursu puiblicēšana: iespējas un attīstība" (2012.g. 26.oktobris), sniegta informācija par Eiropas Komisijas 2011. gadā publicētajos ieteikumos un paziņojumos ietvertajām Open Access nostādnēm saistībā ar jauno ES pētniecības un inovāciju finansēšanas programmu 2014.-2020. gadam Apvārsnis 2020. Prezentācijā iekļauts arī programmas Apvārsnis 2020 raksturojums un tajā paredzētās prasības zinātnisko rakstu publicēšanai brīvpieejā.
External labeling and algorithms for hierarchic networks
1988
Algorithms for generating internal data structures for networks are given. Data bases for networks can be partitioned hierarchically. Nodes of lower class networks may also be in the interior of a higher class arc which will be split if it is included into the final network. Naming is based either on nodes or on arcs.
A comparison of two different formulations for Arc Routing Problems on Mixed graphs
2006
[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.