Results 41 to 50 of about 26,862 (284)
Self-Regulated Symmetry Breaking Model for Stem Cell Differentiation
In conventional disorder–order phase transitions, a system shifts from a highly symmetric state, where all states are equally accessible (disorder) to a less symmetric state with a limited number of available states (order).
Madelynn McElroy +2 more
doaj +1 more source
Decidability of Conjugacy of Tree-Shifts of Finite Type [PDF]
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state automaton. While the conjugacy of shifts of finite type is decidable for one-sided shifts of finite type of dimension one, the result is unknown in the two-sided case.
Aubrun, Nathalie, Béal, Marie-Pierre
openaire +2 more sources
Compactly Supported Curvelet-Type Systems
We study a flexible method for constructing curvelet-type frames. These curvelet-type systems have the same sparse representation properties as curvelets for appropriate classes of smooth functions, and the flexibility of the method allows us to give a ...
Kenneth N. Rasmussen, Morten Nielsen
doaj +1 more source
Energetic Effects of Whale-Watching Boats on Humpback Whales on a Breeding Ground
Interactions between whale-watching boats and cetaceans can lead to changes in their behavior. From a management perspective, it is important to understand how this type of disturbance can be translated into physiological effects, such as changes in ...
Damian Villagra +4 more
doaj +1 more source
Cellular automata and strongly irreducible shifts of finite type [PDF]
If A is a finite alphabet and Γ is a finitely generated amenable group, Ceccherini-Silberstein, Machı̀ and Scarabotti have proved that a local transition function defined on the full shift AΓ is surjective if and only if it is pre-injective; this ...
Francesca Fiorenzi, Fiorenzi, Francesca
core +1 more source
Decidability of Irreducible Tree Shifts of Finite Type [PDF]
We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT), we show that the CPC-irreducibility of TSFTs is related to the connectivity of its graph representation, which is ...
Jung-Chao Ban +3 more
openaire +3 more sources
Analytical Modeling and Control of Dual Active Bridge Converter Considering All Phase-Shifts
In the field of power electronics-based electrical power conversion, the Dual Active Bridge (DAB) topology has become very popular in recent years due to its characteristics (e.g., bidirectional operation and galvanic isolation), which are particularly ...
Muhammad Faisal Fiaz +3 more
doaj +1 more source
Factoring Higher-Dimensional Shifts Of Finite Type Onto The Full Shift [PDF]
A one-dimensional shift of finite type with entropy at least log factors onto the full -shift. The factor map is constructed by exploiting the fact that , or a subshift of , is conjugate to a shift of finite type in which every symbol can be followed by ...
Madden, K., Johnson, Aimee S.A.
core +2 more sources
A characterization of the entropies of multidimensional shifts of finite type [PDF]
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right recursively enumerable, i.e. there is a computable sequence of rational numbers converging to $h$ from above.
Hochman, Michael, Meyerovitch, Tom
openaire +3 more sources
Shifts of finite type as fundamental objects in the theory of shadowing [PDF]
Shifts of finite type and the notion of shadowing, or pseudo-orbittracing, are powerful tools in the study of dynamical systems. In this paper we prove that there is a deep and fundamental relationship between these two concepts.
Meddaugh, Jonathan +1 more
core +1 more source

