Results 51 to 60 of about 3,210,715 (302)

Residual tail twisting in ascidian larvae is stabilized by asymmetric myofibrils that resist bilateral symmetry restoration

open access: yesFEBS Letters, EarlyView.
Ascidian Ciona larvae initially show strong clockwise tail twisting, which is largely corrected during development. However, a small residual twist remains. This study shows that organized helical myofibrils in tail muscles mechanically stabilize this residual asymmetry, preventing complete restoration of bilateral symmetry and revealing how embryos ...
Yuki S. Kogure   +3 more
wiley   +1 more source

Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq [PDF]

open access: yes, 2012
This paper shows equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in LR, the deterministic call-by-need lambda calculus with letrec extended by data constructors, case ...
Sabel, David   +2 more
core  

Provably correct Java implementations of Spi Calculus security protocols specifications [PDF]

open access: yes, 2010
Spi Calculus is an untyped high level modeling language for security protocols, used for formal protocols specification and verification. In this paper, a type system for the Spi Calculus and a translation function are formally defined, in order to ...
Pironti, Alfredo, Sisto, Riccardo
core   +1 more source

Septin 9 PB domains coordinate centrosome positioning and microtubule acetylation to control epithelial polarity

open access: yesFEBS Letters, EarlyView.
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai   +4 more
wiley   +1 more source

Towards sharing in lazy computation systems [PDF]

open access: yes, 2004
Work on proving congruence of bisimulation in functional programming languages often refers to [How89,How96], where Howe gave a highly general account on this topic in terms of so-called lazy computation systems .
Mann, Matthias, Matthias Mann
core  

Model checking probabilistic and stochastic extensions of the pi-calculus [PDF]

open access: yes, 2009
We present an implementation of model checking for probabilistic and stochastic extensions of the pi-calculus, a process algebra which supports modelling of concurrency and mobility.
Parker, D.   +7 more
core   +1 more source

Density estimates for the exponential functionals of fractional Brownian motion

open access: yesComptes Rendus. Mathématique, 2022
In this note, we investigate the density of the exponential functional of the fractional Brownian motion. Based on the techniques of Malliavin’s calculus, we provide a log-normal upper bound for the density.
Tien Dung, Nguyen   +2 more
doaj   +1 more source

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

A finite simulation method in a non-deterministic call-by-need calculus with letrec, constructors and case [PDF]

open access: yes, 2008
The paper proposes a variation of simulation for checking and proving contextual equivalence in a non-deterministic call-by-need lambda-calculus with constructors, case, seq, and a letrec with cyclic dependencies. It also proposes a novel method to prove
Schmidt-Schauß, Manfred   +1 more
core  

A contextual semantics for concurrent Haskell with futures [PDF]

open access: yes, 2011
In this paper we analyze the semantics of a higher-order functional language with concurrent threads, monadic IO and synchronizing variables as in Concurrent Haskell. To assure declarativeness of concurrent programming we extend the language by implicit,
Sabel, David   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy