Search results for "Linear"
showing 10 items of 7165 documents
Asymmetric Comparison and Querying of Biological Networks
2011
Comparing and querying the protein-protein interaction (PPI) networks of different organisms is important to infer knowledge about conservation across species. Known methods that perform these tasks operate symmetrically, i.e., they do not assign a distinct role to the input PPI networks. However, in most cases, the input networks are indeed distinguishable on the basis of how the corresponding organism is biologically well characterized. In this paper a new idea is developed, that is, to exploit differences in the characterization of organisms at hand in order to devise methods for comparing their PPI networks. We use the PPI network (called Master) of the best characterized organism as a …
Extracting string motif bases for quorum higher than two
2012
Bases of generators of motifs consisting of strings in which some positions can be occupied by a don’t care provide a useful conceptual tool for their description and a way to reduce the time and space involved in the discovery process. In the last few years, a few algorithms have been proposed for the extraction of a basis, building in large part on combinatorial properties of strings and their autocorrelations. Currently, the most efficient techniques for binary alphabets and quorum q = 2 require time quadratic in the length of the host string. The present paper explores properties of motif bases for quorum q ≥ 2, both with binary and general alphabets, by also showing that important resu…
Electronic properties of graphene: A learning path for undergraduate students
2016
The purpose of this work is to present a learning path aimed at deepening student understanding of the fundamental concepts underlying the electronic properties of new materials, graphene in particular. To achieve this task, we propose a five-week long workshop where students may be introduced to fundamental concepts of advanced physics, rarely used in learning paths, such as the symmetry properties of the crystal lattice, the group theory , the features of the free electron wave functions and energy levels, the relativistic Dirac equation. Particular emphasis is given to the manner of introducing these concepts, since an essential knowledge of solid state physics, quantum physics and relat…
Recursive modeling for completed code generation
2009
Model-Driven Development is promising to software development because it can reduce the complexity and cost of developing large software systems. The basic idea is the use of different kinds of models during the software development process, transformations between them, and automatic code generation at the end of the development. But unlike the structural parts, fully-automated code generation from the behavior parts is still hard, if it works at all, restricted to specific application areas using a domain specific language, DSL.This paper proposes an approach to model the behavior parts of a system and to embed them into the structural models. The underlying idea is recursive refinements …
Diagrammatic approach to cellular automata and the emergence of form with inner structure
2018
We present a diagrammatic method to build up sophisticated cellular automata (CAs) as models of complex physical systems. The diagrams complement the mathematical approach to CA modeling, whose details are also presented here, and allow CAs in rule space to be classified according to their hierarchy of layers. Since the method is valid for any discrete operator and only depends on the alphabet size, the resulting conclusions, of general validity, apply to CAs in any dimension or order in time, arbitrary neighborhood ranges and topology. We provide several examples of the method, illustrating how it can be applied to the mathematical modeling of the emergence of order out of disorder. Specif…
Pseudo-Bosons, So Far
2011
In the past years several extensions of the canonical commutation relations have been proposed by different people in different contexts and some interesting physics and mathematics have been deduced. Here, we review some recent results on the so-called {\em pseudo-bosons}. They arise from a special deformation of the canonical commutation relation $[a,a^\dagger]=\1$, which is replaced by $[a,b]=\1$, with $b$ not necessarily equal to $a^\dagger$. We start discussing some of their mathematical properties and then we discuss several examples.
Multi-rogue waves solutions: from the NLS to the KP-I equation
2013
Our discovery of multi-rogue wave (MRW) solutions in 2010 completely changed the viewpoint on the links between the theory of rogue waves and integrable systems, and helped explain many phenomena which were never understood before. It is enough to mention the famous Three Sister waves observed in oceans, the creation of a regular approach to studying higher Peregrine breathers, and the new understanding of 2 + 1 dimensional rogue waves via the NLS-KP correspondence. This article continues the study of the MRW solutions of the NLS equation and their links with the KP-I equation started in a previous series of articles (Dubard et al 2010 Eur. Phys. J. 185 247–58, Dubard and Matveev 2011 Natur…
Analytical design of nonlinear optical loop mirrors for fiber-optic communication systems
2006
International audience; We propose an easy and efficient method for analytically designing nonlinear optical loop mirrors (NOLMs) for fiber-optic communication systems. This analytical design is based on a Taylor series expansion of the transfer function of the NOLM, from which highly stable dynamical regimes can be readily obtained for any desired pulse parameters. We present numerical simulations showing dramatically improved performances in a 160 Gb/s transmission system that incorporates the NOLMs designed analytically.
Quantum versus Probabilistic One-Way Finite Automata with Counter
2001
The paper adds the one-counter one-way finite automaton [6] to the list of classical computing devices having quantum counterparts more powerful in some cases. Specifically, two languages are considered, the first is not recognizable by deterministic one-counter one-way finite automata, the second is not recognizable with bounded error by probabilistic one-counter one-way finite automata, but each recognizable with bounded error by a quantum one-counter one-way finite automaton. This result contrasts the case of one-way finite automata without counter, where it is known [5] that the quantum device is actually less powerful than its classical counterpart.
Multiple Usage of Random Bits in Finite Automata
2012
Finite automata with random bits written on a separate 2-way readable tape can recognize languages not recognizable by probabilistic finite automata. This shows that repeated reading of random bits by finite automata can have big advantages over one-time reading of random bits.