Search results for "Applied Mathematic"
showing 10 items of 4398 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 …
Communication complexity in a 3-computer model
1996
It is proved that the probabilistic communication complexity of the identity function in a 3-computer model isO(√n).
On t-Conorm Based Fuzzy (Pseudo)metrics
2020
We present an alternative approach to the concept of a fuzzy (pseudo)metric using t-conorms instead of t-norms and call them t-conorm based fuzzy (pseudo)metrics or just CB-fuzzy (pseudo)metrics. We develop the basics of the theory of CB-fuzzy (pseudo)metrics and compare them with “classic” fuzzy (pseudo)metrics. A method for construction CB-fuzzy (pseudo)metrics from ordinary metrics is elaborated and topology induced by CB-fuzzy (pseudo)metrics is studied. We establish interrelations between CB-fuzzy metrics and modulars, and in the process of this study, a particular role of Hamacher t-(co)norm in the theory of (CB)-fuzzy metrics is revealed. Finally, an intuitionistic version of a CB-fu…
Representation theory treatment of measurement semantics for ratio, ordinal and nominal scales
1997
Within the scope of the representational theory a formal framework for description of semantic aspects of measurement on different scales is proposed. This is done by means of a first-order formal logical system consisting of a set of empirical predicates which play the part of a data structure in the framework, a set of operations by means of which syntactically correct statements can be formed; a set of axioms being true statements and a set of numerical statements which is an aggregation of potential measurement results carrying a meaningful load. On this basis the notation of semantic information on various scales is introduced and some common claims about the measurement semantic infor…
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…
A basic analysis toolkit for biological sequences
2007
This paper presents a software library, nicknamed BATS, for some basic sequence analysis tasks. Namely, local alignments, via approximate string matching, and global alignments, via longest common subsequence and alignments with affine and concave gap cost functions. Moreover, it also supports filtering operations to select strings from a set and establish their statistical significance, via z-score computation. None of the algorithms is new, but although they are generally regarded as fundamental for sequence analysis, they have not been implemented in a single and consistent software package, as we do here. Therefore, our main contribution is to fill this gap between algorithmic theory an…
On essential spectra of operator-matrices and their Feshbach maps
2004
Abstract A connection between the essential spectrum of certain operator-matrices and essential spectra of the corresponding “Feshbach maps” is discussed and applied to some concrete rational operator-valued functions.
Analogical Modeling and Numerical Simulation for Sintering Phenomena
2013
In this paper the authors propose an approach for analogical modeling and numerical simulation of the phenomena of sintering, taking into account different cases depending on the type of energy used in the process of aggregation and the nature of the material powder, using a software which simulates the propagation and the control of the temperature. Many physical phenomena encountered in science and engineering can be described mathematically through partial differential equations (PDE) and ordinary differential equations (ODE) such as propagation phenomena, engineering applications, hydrotechnics, chemistry, pollution a.s.o. There may be situations when the exact establish of the analytic…
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…
An Approximate Determinization Algorithm for Weighted Finite-State Automata
2001
Nondeterministic weighted finite-state automata are a key abstraction in automatic speech recognition systems. The efficiency of automatic speech recognition depends directly on the sizes of these automata and the degree of nondeterminism present, so recent research has studied ways to determinize and minimize them, using analogues of classical automata determinization and minimization. Although, as we describe here, determinization can in the worst case cause poly-exponential blowup in the number of states of a weighted finite-state automaton, in practice it is remarkably successful. In extensive experiments in automatic speech recognition systems, deterministic weighted finite-state autom…