583 research outputs found
The presence of alpha-catenin in the VE-cadherin complex is required for efficient transendothelial migration of leukocytes
The majority of the leukocytes cross the endothelial lining of the vessels through cell-cell junctions. The junctional protein Vascular Endothelial (VE)-cadherin is transiently re-distributed from sites of cell-cell contacts during passage of leukocytes. VE-cadherin is part of a protein complex comprising p120-catenin and beta-catenin as intracellular partners. Beta-catenin connects VE-cadherin to alpha-catenin. This VE-cadherin-catenin complex is believed to dynamically control endothelial cell-cell junctions and to regulate the passage of leukocytes, although not much is known about the role of alpha- and beta-catenin during the process of transendothelial migration (TEM). In order to study the importance of the interaction between alpha- and beta-catenin in TEM, we used a cell-permeable version of the peptide encoding the binding site of alpha-catenin for beta-catenin (S27D). The data show that S27D interferes with the interaction between alpha- and beta-catenin and induces a reversible decrease in electrical resistance of the endothelial monolayer. In addition, S27D co-localized with beta-catenin at cell-cell junctions. Surprisingly, transmigration of neutrophils across endothelial monolayers was blocked in the presence of S27D. In conclusion, our results show for the first time that the association of alpha-catenin with the cadherin-catenin complex is required for efficient leukocyte TEM
Studying Parallel Evolutionary Algorithms: The cellular Programming Case
Parallel evolutionary algorithms, studied to some extent over the past few years, have proven empirically worthwhile—though there seems to be lacking a better understanding of their workings. In this paper we concentrate on cellular (fine-grained) models, presenting a number of statistical measures, both at the genotypic and phenotypic levels. We demonstrate the application and utility of these measures on a specific example, that of the cellular programming evolutionary algorithm, when used to evolve solutions to a hard problem in the cellular-automata domain, known as synchronization
On RAF Sets and Autocatalytic Cycles in Random Reaction Networks
The emergence of autocatalytic sets of molecules seems to have played an
important role in the origin of life context. Although the possibility to
reproduce this emergence in laboratory has received considerable attention,
this is still far from being achieved. In order to unravel some key properties
enabling the emergence of structures potentially able to sustain their own
existence and growth, in this work we investigate the probability to observe
them in ensembles of random catalytic reaction networks characterized by
different structural properties. From the point of view of network topology, an
autocatalytic set have been defined either in term of strongly connected
components (SCCs) or as reflexively autocatalytic and food-generated sets
(RAFs). We observe that the average level of catalysis differently affects the
probability to observe a SCC or a RAF, highlighting the existence of a region
where the former can be observed, whereas the latter cannot. This parameter
also affects the composition of the RAF, which can be further characterized
into linear structures, autocatalysis or SCCs. Interestingly, we show that the
different network topology (uniform as opposed to power-law catalysis systems)
does not have a significantly divergent impact on SCCs and RAFs appearance,
whereas the proportion between cleavages and condensations seems instead to
play a role. A major factor that limits the probability of RAF appearance and
that may explain some of the difficulties encountered in laboratory seems to be
the presence of molecules which can accumulate without being substrate or
catalyst of any reaction.Comment: pp 113-12
Phase transition and landscape statistics of the number partitioning problem
The phase transition in the number partitioning problem (NPP), i.e., the
transition from a region in the space of control parameters in which almost all
instances have many solutions to a region in which almost all instances have no
solution, is investigated by examining the energy landscape of this classic
optimization problem. This is achieved by coding the information about the
minimum energy paths connecting pairs of minima into a tree structure, termed a
barrier tree, the leaves and internal nodes of which represent, respectively,
the minima and the lowest energy saddles connecting those minima. Here we apply
several measures of shape (balance and symmetry) as well as of branch lengths
(barrier heights) to the barrier trees that result from the landscape of the
NPP, aiming at identifying traces of the easy/hard transition. We find that it
is not possible to tell the easy regime from the hard one by visual inspection
of the trees or by measuring the barrier heights. Only the {\it difficulty}
measure, given by the maximum value of the ratio between the barrier height and
the energy surplus of local minima, succeeded in detecting traces of the phase
transition in the tree. In adddition, we show that the barrier trees associated
with the NPP are very similar to random trees, contrasting dramatically with
trees associated with the spin-glass and random energy models. We also
examine critically a recent conjecture on the equivalence between the NPP and a
truncated random energy model
Blackwell-Optimal Strategies in Priority Mean-Payoff Games
We examine perfect information stochastic mean-payoff games - a class of
games containing as special sub-classes the usual mean-payoff games and parity
games. We show that deterministic memoryless strategies that are optimal for
discounted games with state-dependent discount factors close to 1 are optimal
for priority mean-payoff games establishing a strong link between these two
classes
Deterministic Priority Mean-payoff Games as Limits of Discounted Games
International audienceInspired by the paper of de Alfaro, Henzinger and Majumdar about discounted -calculus we show new surprising links between parity games and different classes of discounted games
Perfect Information Stochastic Priority Games
International audienceWe introduce stochastic priority games - a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority games a play can be stopped by the environment after a finite number of stages, however, infinite plays are also possible. In discounted priority games only infinite plays are possible and the payoff is a linear combination of the classical discount payoff and of a limit payoff evaluating the performance at infinity. Shapley games and parity games are special extreme cases of priority games
- …