In this paper we address several problems regarding content distribution (broadcast) and communication optimization and scheduling for some restricted classes of graphs (trees, intersecting cliques). For the broadcast...
详细信息
In this paper we address several problems regarding content distribution (broadcast) and communication optimization and scheduling for some restricted classes of graphs (trees, intersecting cliques). For the broadcast problem in trees we introduce some new extensions and present some new algorithmic results for determining optimal offline broadcast strategies. the communication scheduling problems are also addressed from an offline algorithmic perspective, considering mutual exclusion constraints or geometric aspects.
Reversibility is one of the most important characteristics of microscopic mechanisms in physics. It is our aim in this paper to describe some classes of linear cellular automata(LCAs) that can be studied in terms of a...
详细信息
Reversibility is one of the most important characteristics of microscopic mechanisms in physics. It is our aim in this paper to describe some classes of linear cellular automata(LCAs) that can be studied in terms of an associated reversible LCA. We prove that any given LCA having as local transition map a row contraction can be dilated to a LCA having a local rule with isometric components. We finally show that a LCA such that its global transition function is a partial isometry has a quantum LCA power dilation which is reversible.
For standard algorithms verifying positive definiteness of a matrix A ∈ Mn(R) based on Sylvester's criterion, the computationally pessimistic case is this when A is positive definite. We present an algorithm real...
详细信息
ISBN:
(纸本)9781509057085
For standard algorithms verifying positive definiteness of a matrix A ∈ Mn(R) based on Sylvester's criterion, the computationally pessimistic case is this when A is positive definite. We present an algorithm realizing the same task for A ∈ M n (Z), for which the case when A is positive definite is the optimistic one. the algorithm relies on performing certain edge transformations, called inflations, on the signed graph (bigraph) Δ = Δ(A) associated with A. We provide few variants of the algorithm, including Las Vegas type randomized ones (with precisely described maximal number of steps). the algorithms work very well in practice, in many cases with a better speed than the standard tests. On the other hand, our results provide an interesting example of an application of symboliccomputing methods originally developed for different purposes, with a big potential for further generalizations in matrix problems.
A combinatorial condition called well distributedoccurrences, or WELLDOC for short, has been introducedrecently. the proofs that WELLDOC property holds for thefamily of Sturmian words, and more generally, for Arnoux-R...
详细信息
ISBN:
(纸本)9781509004621
A combinatorial condition called well distributedoccurrences, or WELLDOC for short, has been introducedrecently. the proofs that WELLDOC property holds for thefamily of Sturmian words, and more generally, for Arnoux-Rauzy words are given in two papers by Balkova et al. the WELLDOC property for bounded bi-ideals is analysed inthis paper. the existence of a 1-bounded bi-ideal over thefinite alphabet that satisfies the WELLDOC property has beenproved by the authors.
the obtainment of a quality software architecture that fulfils the design principles and addresses the stakeholders' concerns is an ongoing problem. In this paper, we present an approach to construct modular softw...
详细信息
the obtainment of a quality software architecture that fulfils the design principles and addresses the stakeholders' concerns is an ongoing problem. In this paper, we present an approach to construct modular software architectures based on the stakeholders' concerns and the domain ontology of the informational system where the software system will operate. the approach uses the Model-View-Controller architectural pattern and fulfils new additional design rules. We applied the approach in the design and implementation of the software architecture of a system that provides the selection criteria of the subjects in the clinical trials.
the task of the standard Mamdani fuzzy logic controller is to find a crisp control action from the fuzzy rule-base and from a set of crisp inputs. Because the interval inputs are frequently used in various domains (on...
详细信息
the task of the standard Mamdani fuzzy logic controller is to find a crisp control action from the fuzzy rule-base and from a set of crisp inputs. Because the interval inputs are frequently used in various domains (online shopping, for instance), in this paper we propose an extension of this type of controller which works with intervals as inputs and with various implication operators. For any implication we obtain a crisp value as output. Finally, these outputs are combined to obtain the overall crisp output action of the system.
Even-Odd Trees are a canonical tree-based number representation derived from a bijection between trees defined by the data type equation T = 1+T *T* +T *T* and positive natural numbers seen as iterated applications of...
详细信息
ISBN:
(纸本)9781509004621
Even-Odd Trees are a canonical tree-based number representation derived from a bijection between trees defined by the data type equation T = 1+T *T* +T *T* and positive natural numbers seen as iterated applications of o(x) = 2x and i(x) = 2x + 1 starting from 1. this paper introduces purely functional arithmetic algorithms for operations on Even-Odd Trees. While within constant factors from their traditional counterparts for their average case behavior, our algorithms make tractable important computations that are impossible with traditional number representations.
this paper presents a rule-based approach for the phonetic transcription of the Romanian language. We integrate this phonetic analysis in the text processing component of a text-to-speech system for Romanian. Grapheme...
详细信息
this paper presents a rule-based approach for the phonetic transcription of the Romanian language. We integrate this phonetic analysis in the text processing component of a text-to-speech system for Romanian. Grapheme-to-phoneme rules are constructed based on expert information from DOOMII dictionary. In the cases when rules are useless, we employed decision trees constructed on engineered training sets to help the classifiers to learn the language exceptions.
A redex in a graph G is a triple r = (u, c, v) of distinct vertices that determine a 2-star. Shrinking r means deleting the center c and merging u with v into one vertex. Reduction of G entails shrinking all of its re...
详细信息
A redex in a graph G is a triple r = (u, c, v) of distinct vertices that determine a 2-star. Shrinking r means deleting the center c and merging u with v into one vertex. Reduction of G entails shrinking all of its redexes in a recursive way, and, at the same time, deleting all loops that are created during this process. It is shown that reduction can be implemented in O(m) time, where m is the number of edges in G.
Using the framework of formal theory of partial differential equations, we consider a method of computation of the m-Hilbert polynomial (i.e. Hilbert polynomial with multivariable), which generalizes the Seiler's ...
详细信息
Using the framework of formal theory of partial differential equations, we consider a method of computation of the m-Hilbert polynomial (i.e. Hilbert polynomial with multivariable), which generalizes the Seiler's theorem of Hilbert polynomial with single variable. Next we present an approach to compute the number of arbitrary functions of positive differential order in the general solution, and give a formally well-posed initial problem. Finally,as applications the Maxwell equations and weakly over determined equations are considered.
暂无评论