A spectrum of abstractions for multicast communications is introduced in increasing order of both desirability and semantic level: functional mapping, iterators, and streams. Examples of distributed algorithms from th...
详细信息
A spectrum of abstractions for multicast communications is introduced in increasing order of both desirability and semantic level: functional mapping, iterators, and streams. Examples of distributed algorithms from the literature are used to illustrate the expressive power of each mechanism. Streams, in particular, provide first-class status for multicast communication in progress and can be implemented efficiently in typical multicast communication architectures. Related work and the criteria for multicast support are discussed. the layers of a typical distributed system that are relevant to language support for multicast communication are discussed.< >
We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. the proposed modular schemes over these rings achieve improvements both in security and applicability compared ...
详细信息
We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. the proposed modular schemes over these rings achieve improvements both in security and applicability compared to classical schemes over the ring of integers. Our threshold schemes are perfect i.e. secure in the sense of information theory and ideal i.e. efficient in the terms of memory storage (the size of the secret is equal to the size of the shares). then we consider the modular secret sharing schemes with pairwise co-prime moduli over the ring of polynomials and the ring of integers. We give a complete description of the access structuresthat can be realized by such modular schemes.
In the context of structural testing, automatic test-pattern generation (ATPG) may fail to provide suites covering 100% of the testing requirements for grey-box programs, i.e., Applications wherein source code is avai...
详细信息
In the context of structural testing, automatic test-pattern generation (ATPG) may fail to provide suites covering 100% of the testing requirements for grey-box programs, i.e., Applications wherein source code is available for some parts (white-box), but not for others (black-box). Furthermore, test suites based on abstract models may elicit behaviors on the actual program that diverge from the intended ones. In this paper, we present a new ATPG methodology to reduce divergence without increasing manual effort. this is achieved by (i) learning models of black-box components as finite-state machines, and (ii) composing the learnt models withthe white-box components to generate test-suites for the grey-box program. Experiments with a prototypical implementation of our methodology show that it yields measurable improvements over two comparable state-of-the-art solutions.
Among the biological sequences, sequential pattern mining reveals implicit motifs/patterns, which are of functional significance and have specific structures. Small alphabets and long sequences, such as DNA and protei...
详细信息
Techniques and performance of text recognition systems and software has shown great improvement in recent years. OCRs now can read any machine printed document with good accuracy. However, the advancements are primari...
详细信息
Techniques and performance of text recognition systems and software has shown great improvement in recent years. OCRs now can read any machine printed document with good accuracy. However, the advancements are primarily for Latin scripts and even for such scripts performance is limited in case of handwritten documents. Little work has been done for cursive scripts such as Arabic and still there is a room for improvement both in terms of accuracy and techniques. this paper presents an algorithm to recognize handwritten Arabic text using an ensemble of biased classifiers in a hierarchical setting. We address the fundamental shortcomings of the traditional Machine Learning paradigms when applied to Arabic scripts. Experiments have been conducted on the AMA Arabic dataset to show the efficacy of our method.
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among these global constraints, edge-finding fi...
详细信息
the materialization of multidimensional structures is a common way to speed up OLAP queries. Since there might be a huge number of those structures, a variety of proposals tried to select the most beneficial set, base...
详细信息
the materialization of multidimensional structures is a common way to speed up OLAP queries. Since there might be a huge number of those structures, a variety of proposals tried to select the most beneficial set, based on the profile of the queries and observing some constraints as materializing space and maintenance time, addressing a centralized storage facility. Only recently, the distributed scenario came to stage on this area, introducing the space dimension (and corresponding communication costs) into the equation to minimize costs. this paper focuses on the selection and allocation of distributed OLAP cubes, using evolutionary algorithms, having an extended aggregation lattice as framework to capture the distributed semantics. Moreover, the evaluation of the fitness of evolutionary solutions is based on cost estimation algorithmsthat simulate the execution of parallel tasks, using time units as cost metric
In this paper we propose a new dynamic video summarization procedure. For this purpose, we find an economical image representation in terms of edge-like features that facilitates video re-sampling with minimal loss of...
详细信息
In this paper we propose a new dynamic video summarization procedure. For this purpose, we find an economical image representation in terms of edge-like features that facilitates video re-sampling with minimal loss of information. We propose a fast noise tolerant way to extract the representation. We argue against the use of an auxiliary descriptor for the samples and we show how we can re-use the existing principal components analysis (PCA) withthe appropriate modifications on the new image representation without sacrificing accuracy.
Various methodologies to model and analyze timed and hybrid systems using SAL are reported. We assume that the system is specified as a network of timed/hybrid automata with synchronized transitions and urgency. We sh...
详细信息
Various methodologies to model and analyze timed and hybrid systems using SAL are reported. We assume that the system is specified as a network of timed/hybrid automata with synchronized transitions and urgency. We show how to translate the system into a SAL model withthe time domain being either discrete or dense, and the clocks being either saturated or unsaturated. Depending on these choices, various tools provided by SAL to model check reachability properties over the system are used to establish safety properties of timed systems. We profile the performance of these tools with a comparative study.
Many parallel and distributed algorithms have been developed using such regular data structure as linear arrays, rings, trees, and meshes on hypercube-type interconnection networks. the augmented cube AQ n , proposed ...
详细信息
Many parallel and distributed algorithms have been developed using such regular data structure as linear arrays, rings, trees, and meshes on hypercube-type interconnection networks. the augmented cube AQ n , proposed by Choudum and Sunitha, is a derivative of hypercubes with good geometric nature and retains all the favorable properties of the hypercube. the pancyclic properties of the n-dimensional augmented cube, AQ n , has attracted a lot of interest. In this paper, we introduce the augmented Gray code, AGC, and use AGC to construct cycles of arbitrary number of vertices into the augmented cube for any specific edge.
暂无评论