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

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

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

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 Languages Accepted by P/T Systems Composed of joins

Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood by just looking at their topology, that is, information flow. Here we continue this line of research introducing J languages and proving that they can be accepted by place/transition systems whose underlying net is composed only of joins. Moreover, we investigate how J languages relate to other families of formal languages. In particular, we show that every J language can be accepted by a log n space-bounded non-deterministic Turing machine with a one-way read-only input. We also show that every J language has a semilinear Parikh map and that J languages and context-free languages (CFLs) are incomparable

Metabolite essentiality elucidates robustness of Escherichia coli metabolism

Complex biological systems are very robust to genetic and environmental changes at all levels of organization. Many biological functions of Escherichia coli metabolism can be sustained against single-gene or even multiple-gene mutations by using redundant or alternative pathways. Thus, only a limited number of genes have been identified to be lethal to the cell. In this regard, the reaction-centric gene deletion study has a limitation in understanding the metabolic robustness. Here, we report the use of flux-sum, which is the summation of all incoming or outgoing fluxes around a particular metabolite under pseudo-steady state conditions, as a good conserved property for elucidating such robustness of E. coli from the metabolite point of view. The functional behavior, as well as the structural and evolutionary properties of metabolites essential to the cell survival, was investigated by means of a constraints-based flux analysis under perturbed conditions. The essential metabolites are capable of maintaining a steady flux-sum even against severe perturbation by actively redistributing the relevant fluxes. Disrupting the flux-sum maintenance was found to suppress cell growth. This approach of analyzing metabolite essentiality provides insight into cellular robustness and concomitant fragility, which can be used for several applications, including the development of new drugs for treating pathogens.Comment: Supplements available at http://stat.kaist.ac.kr/publication/2007/PJKim_pnas_supplement.pd

Bounded Languages Meet Cellular Automata with Sparse Communication

Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell communication by bounding the number of allowed uses of the links between cells. Moreover, we consider the devices as acceptors for bounded languages in order to explore the borderline at which non-trivial decidability problems of cellular automata classes become decidable. It is shown that even devices with drastically reduced communication, that is, each two neighboring cells may communicate only constantly often, accept bounded languages that are not semilinear. If the number of communications is at least logarithmic in the length of the input, several problems are undecidable. The same result is obtained for classes where the total number of communications during a computation is linearly bounded

Acoustic localisation of wildlife with low-cost equipment: Lower sensitivity, but no loss of precision

Abstract Context Synchronised acoustic recorders can be used as a non-invasive tool to detect and localise sounds of interest, including vocal wildlife and anthropogenic sounds. Due to the high cost of commercial synchronised recorders, acoustic localisation has typically been restricted to small or well funded surveys. Recently, low-cost acoustic recorders have been developed, but until now their efficacy has not been compared with higher specification recorders. Aims The present study aimed to compare the efficacy of a newly developed low-cost recorder, the Conservation at Range through Audio Classification and Localisation (CARACAL), with an established, high-end recorder, the Wildlife Acoustics Song Meter (SM). Methods Four recorders of each type were deployed in a paired set-up across five nights in Wisconsin, USA. The recordings allowed for manual identification of domestic dog (Canis familiaris), grey wolf (Canis lupus), coyote (Canis latrans) and barred owl (Strix varia) calls, and then the ability of each recorder type to detect and localise the vocalising animals was compared. Key results The CARACALs were less sensitive, detecting only 47.5% of wolf, 55% of coyote, 65% of barred owl and 82.5% of dog vocalisations detected by the paired SMs. However, when the same vocalisations were detected on both recorders, localisation was comparable, with no significant difference in the precision or maximum detection ranges. Conclusions Low-cost recording equipment can be used effectively for acoustic localisation of both wild and domestic animals. However, the lower sensitivity of the CARACALs means that a denser network of these recorders would be needed to achieve the same efficacy as the SMs. Deploying a greater number of cheaper recorders increases the labour time in the field and the quantity of data to process and store. Thus, there is a trade-off between cost and time to be considered. Implications The ability to use low-cost recorders for acoustic localisation provides new avenues for tracking, managing and researching a wide range of wildlife species. Presently, CARACALs are more suited to monitoring species that have small home ranges and high amplitude vocalisations, and for when a large time investment for in situ equipment checks and data processing is feasible.Christine Stevens Wildlife Award from the Animal Welfare Institut

Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections

In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs). We show that there are universal ANEPFCs of size 10, by devising a method for simulating 2-Tag Systems. This result significantly improves the known upper bound for the size of universal ANEPFCs which is 18. We also propose a new, computationally and descriptionally efficient simulation of nondeterministic Turing machines by ANEPFCs. More precisely, we describe (informally, due to space limitations) how ANEPFCs with 16 nodes can simulate in O(f(n)) time any nondeterministic Turing machine of time complexity f(n). Thus the known upper bound for the number of nodes in a network simulating an arbitrary Turing machine is decreased from 26 to 16