544 research outputs found
Capacity Bounded Grammars and Petri Nets
A capacity bounded grammar is a grammar whose derivations are restricted by
assigning a bound to the number of every nonterminal symbol in the sentential
forms. In the paper the generative power and closure properties of capacity
bounded grammars and their Petri net controlled counterparts are investigated
Deterministic soliton automata with at most one cycle
AbstractSoliton valves have been proposed as molecular switching elements. Their mathematical model is the soliton graph and the soliton automaton (Dassow and Jürgensen, J. Comput. System Sci.40 (1990), 154–181). In this paper we continue the study of the logic aspects of soliton switching. There are two cases of special importance: those of deterministic and those of strongly deterministic soliton automata. The former have deterministic state transitions in the usual sense of automaton theory. The latter do not only have deterministic state transitions, but also deterministic soliton paths—a much stronger property, as it turns out. In op cit. a characterization of indecomposable, strongly deterministic soliton automata was proved and it was shown that their transition monoids are primitive groups of permutations. Roughly speaking, the main difference between deterministic and strongly deterministic soliton automata is that in the former the underlying soliton graphs may contain cycles of odd lengths while such cycles are not permitted in the soliton graphs belonging to strongly deterministic soliton automata. In the present paper, we focus on a special class of deterministic soliton automata, that of deterministic soliton automata whose underlying graphs contain at most one cycle. For this class we derive structural descriptions. Our main results concern the elimination of certain types of loops, the treatment of soliton paths with repeated edges, the structure of cycles of odd length, and the transition monoid. As an application we show that the memory element proposed in the literature (Carter, in Bioelectronics, edited by Aizawa, Research and Development Report 50, CMC Press, Denver, CO, 1984) can be transformed in into a soliton tree, thus turning a deterministic device into a logically equivalent strongly deterministic device
The Need for Effective Early Behavioral Family Interventions for Children with Attention Deficit Hyperactivity Disorder (ADHD)
There is a pressing need for the development of effective early family intervention programs for children showing Attention Deficit Hyperactivity Disorder (ADHD) behaviours with Conduct Disorder (CD) or Oppositional Defiant Disorder (ODD) behaviours. Previous research has indicated that children with ADHD are at risk of developing comorbid CD or ODD behaviours. In addition, it has been shown that ODD or CD behaviours in childhood tend to persist and to have adverse effects on later social adjustment. However, ODD or CD behaviours are not necessary concomitants of ADHD, and it has been demonstrated that behavioural intervention can have both short- and long term beneficial effects for children showing early signs of ODD or CD behaviours. In short term, behavioural family interventions may be able to reduce oppositional behaviour, particularly in the preschool years. In the long term, early intervention has shown to reduce the incidence of later antisocial behaviour in children at risk for this developmental trajectory. In this paper, it will be argued that behavioural family interventions have not been effectively utilised or promulgated in the community for children with ADHD despite the demonstrated efficacy of these types of interventions. A model of a multilevel system of intervention that can be tailored to the individual family’s needs is presented
Intensity of Brillouin light scattering from spin waves in magnetic multilayers with noncollinear spin configurations: Theory and experiment
The scattering of photons from spin waves (Brillouin light scattering -- BLS)
is a well-established technique for the study of layered magnetic systems. The
information about the magnetic state and properties of the sample is contained
in the frequency position, width, and intensity of the BLS peaks. Previously
[Phys. Rev. B 67, 184404 (2003)], we have shown that spin wave frequencies can
be conveniently calculated within the ultrathin film approach, treating the
intralayer exchange as an effective bilinear interlayer coupling between thin
virtual sheets of the ferromagnetic layers. Here we give the consequent
extension of this approach to the calculation of the Brillouin light scattering
(BLS) peak intensities. Given the very close relation of the BLS cross-section
to the magneto-optic Kerr effect (MOKE), the depth-resolved longitudinal and
polar MOKE coefficients calculated numerically via the usual magneto-optic
formalism can be employed in combination with the spin wave precessional
amplitudes to calculate full BLS spectra for a given magnetic system. This
approach allows an easy calculation of BLS intensities even for noncollinear
spin configurations including the exchange modes. The formalism is applied to a
Fe/Cr/Fe/Ag/Fe trilayer system with one antiferromagnetically coupling spacer
(Cr). Good agreement with the experimental spectra is found for a wide variety
of spin configurations.Comment: 19 pages, 5 figure
An approach to computing downward closures
The downward closure of a word language is the set of all (not necessarily
contiguous) subwords of its members. It is well-known that the downward closure
of any language is regular. While the downward closure appears to be a powerful
abstraction, algorithms for computing a finite automaton for the downward
closure of a given language have been established only for few language
classes.
This work presents a simple general method for computing downward closures.
For language classes that are closed under rational transductions, it is shown
that the computation of downward closures can be reduced to checking a certain
unboundedness property.
This result is used to prove that downward closures are computable for (i)
every language class with effectively semilinear Parikh images that are closed
under rational transductions, (ii) matrix languages, and (iii) indexed
languages (equivalently, languages accepted by higher-order pushdown automata
of order 2).Comment: Full version of contribution to ICALP 2015. Comments welcom
Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems
We consider parallel communicating pushdown automata systems (PCPA) and
define a property called known communication for it. We use this property to
prove that the power of a variant of PCPA, called returning centralized
parallel communicating pushdown automata (RCPCPA), is equivalent to that of
multi-head pushdown automata. The above result presents a new sub-class of
returning parallel communicating pushdown automata systems (RPCPA) called
simple-RPCPA and we show that it can be written as a finite intersection of
multi-head pushdown automata systems
Effective Theories for Circuits and Automata
Abstracting an effective theory from a complicated process is central to the
study of complexity. Even when the underlying mechanisms are understood, or at
least measurable, the presence of dissipation and irreversibility in
biological, computational and social systems makes the problem harder. Here we
demonstrate the construction of effective theories in the presence of both
irreversibility and noise, in a dynamical model with underlying feedback. We
use the Krohn-Rhodes theorem to show how the composition of underlying
mechanisms can lead to innovations in the emergent effective theory. We show
how dissipation and irreversibility fundamentally limit the lifetimes of these
emergent structures, even though, on short timescales, the group properties may
be enriched compared to their noiseless counterparts.Comment: 11 pages, 9 figure
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
Improving the previously known best bound, we show that any recursively
enumerable language can be generated with a non-returning parallel
communicating (PC) grammar system having six context-free components. We also
present a non-returning universal PC grammar system generating unary languages,
that is, a system where not only the number of components, but also the number
of productions and the number of nonterminals are limited by certain constants,
and these size parameters do not depend on the generated language
Understanding the market dynamics of biosimilars
Biosimilars represent an attractive market opportunity in the pharmaceutical industry. In order to understand the underlying market dynamics and to identify the success factors of the biosimilars market, a PEST (political, economic, social, technological) analysis was conducted based on desk research and expert interviews with market participants and stakeholders. The regulatory environment for biosimilars seems to be well established and both the required manufacturing technology and the necessary analytical capabilities for biosimilar development are available. The potential market is expected to grow due to the overall dynamics in the biologics market and the patent expiration of blockbuster drugs. The perspective of the scientific community towards biosimilars has changed from skeptical to rather positive in the last 10 years, probably reflecting the evolution of regulatory guidelines and technological progress. However, physicians, responsible for the prescription of drugs, are still rather skeptical about biosimilars and need to be better informed in order to increase the currently low market penetration of biosimilars. Taken together, the biosimilars industry is expected to step out of its infancy stage and now enter the growth phase
Graph grammars with string-regulated rewriting
Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to have a key role in generating the impressive biotic diversity of organisms found on earth. Inspired by mechanisms of Eukaryotic genetic expression, we propose and analyse graph grammars with string-regulated rewriting. In these grammatical systems a genome sequence is represented by a regulatory string, a graph corresponds to an organism, and a set of graph grammar rules represents different forms of implementing cell division. Accordingly, a graph derivation by the graph grammar resembles the developmental process of an organism. We give examples of the concept and compare its generative power to the power of the traditional context-free graph grammars. We demonstrate that the power of expression increases when genetic regulation is included in the model, as compared to non-regulated grammars. Additionally, we propose a hierarchy of string-regulated graph grammars, arranged by expressive power. These results highlight the key role that the transmission of regulatory information during development has in the emergence of biological diversity.D.L. was supported in part by a research stay fellowship at Otto-von-Guericke-Universität Magdeburg from the Spanish Ministerio de Educación
- …