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.
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.
In order to enable interactive applications to benefit from the offerings of the Cloud paradigm, factors such as QoS and event handling need to be taken into consideration in the development of new platforms. In this ...
详细信息
In order to enable interactive applications to benefit from the offerings of the Cloud paradigm, factors such as QoS and event handling need to be taken into consideration in the development of new platforms. In this paper we propose a hierarchical Execution Management System Architecture that enables the execution of real-time interactive applications on SOIs by providing the required QoS levels.
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.
In this paper we employ the mathematical methodology of metric semantics in defining and relating a denotational and an operational semantics for an abstract concurrent language embodying the following features: paral...
详细信息
In this paper we employ the mathematical methodology of metric semantics in defining and relating a denotational and an operational semantics for an abstract concurrent language embodying the following features: parallel composition is based on maximal parallelism, and computations are specified by means of multiset rewriting rules. We relate these semantics, and compare them in terms of this combination of concepts. the semantic models are designed by using continuations for concurrency.
In a general purpose cloud system efficiencies are yet to be had from supporting diverse application requirements within a heterogeneous storage system. Such a system poses significant technical challenges since stora...
详细信息
In a general purpose cloud system efficiencies are yet to be had from supporting diverse application requirements within a heterogeneous storage system. Such a system poses significant technical challenges since storage systems are traditionally homogeneous. this paper uses the Ceph distributed file system, and in particular its concept of storage pools, to show how a storage solution can be partitioned to provide the heterogeneity needed to support the required application requirements.
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.
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.
In this paper we describe the concept of a semi-automated wrapper for extracting information from semi-structured pages, usually part of the e-commerce data intensive web sites. the process is based on creating extrac...
详细信息
In this paper we describe the concept of a semi-automated wrapper for extracting information from semi-structured pages, usually part of the e-commerce data intensive web sites. the process is based on creating extraction rules in a visual manner, using the DOM tree associated to a XHTML document, helping the user to make the right decisions. the extraction rules defined have a natural tree structure. Based on the model designed, the wrapper can then be used to navigate through the site and extract the relevant data.
暂无评论