While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. this is due to a...
详细信息
ISBN:
(纸本)9780769539645
While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. this is due to a variety of factors, not least the problems posed by cyclotomic polynomials. In this paper we state a few of the challenges that sparse polynomials pose.
Service oriented architectures become more and more popular withthe emergence and consolidation of new paradigms such as Clouds and Grids. In this context scheduling becomes an important and difficult problem as serv...
详细信息
ISBN:
(纸本)9780769539645
Service oriented architectures become more and more popular withthe emergence and consolidation of new paradigms such as Clouds and Grids. In this context scheduling becomes an important and difficult problem as services hide their actual implementation, requirements or efficiency and are spread across multiple institutions and geographical locations. this paper proposes a distributed scheduling approach based on agents where each agent handles a certain domain and manages independently the policies inside it. In its frame several scheduling algorithms are also studied, compared and some results are given.
Modern program analysis and model-based tools are increasingly complex and multi-faceted software systems. However, at their core is invariably a component using logic for describing states and transformations between...
详细信息
ISBN:
(纸本)9780769539645
Modern program analysis and model-based tools are increasingly complex and multi-faceted software systems. However, at their core is invariably a component using logic for describing states and transformations between system states. the system Z3, developed at Microsoft Research, is a Satisfiability Modulo theories (SMT) solver. It provides logic inference capabilities that are critical for the functionality of these systems. the tutorial exemplifies a number of applications of Z3 at Microsoft.
Simulation of quantum computers using classical computers is a computationally hard problem, requiring a huge amount of operations and storage. Grid systems are a good choice for simulating quantum algorithms, since t...
详细信息
ISBN:
(纸本)9780769539645
Simulation of quantum computers using classical computers is a computationally hard problem, requiring a huge amount of operations and storage. Grid systems are a good choice for simulating quantum algorithms, since they provide access to high performance computer clusters. In this paper we present the design of a message passing parallel version of the quantum computer simulator, QCL, deployed as a grid service. After describing the architecture of our grid service and the parallelization strategy for the general single qubit operator, we present the performance measurements for some test cases, showing the speedups obtained.
Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Grobner basis procedures an...
详细信息
ISBN:
(纸本)9780769539645
Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Grobner basis procedures and prove the correctness of two classical criteria for recognising superfluous S-polynomials, Buchberger's criteria 1 and 2, w.r.t. arbitrary fair and correct basis construction strategies. To do so, we develop a general method for proving the strategy-independent correctness of superfluous S-polynomial criteria which seems to be quite powerful. We also derive a new superfluous S-polynomial criterion which is a generalization of Buchberger-1 for Grobner basis procedures implementing a special form of eager simplification and is proved to be correct strategy-independently.
the computation of self-intersection loci of parametrized surfaces is needed for constructing trimmed parametrizations and describing the topology of the considered surfaces in real settings. this paper presents two g...
详细信息
ISBN:
(纸本)9780769539645
the computation of self-intersection loci of parametrized surfaces is needed for constructing trimmed parametrizations and describing the topology of the considered surfaces in real settings. this paper presents two general and efficient methods for determining self-intersection loci of rationally parametrized surfaces. One of the methods, based on regular systems, is capable of computingthe exact parametric locus of self-intersection of a given surface and the other, based on Grobner bases, can compute the minimal variety passing through the exact parametric locus. the relation between the results computed by the two methods is established and two algorithms for computing parametric loci of self-intersection are described. Experimental results and comparisons with some existing methods show that our algorithms have a good performance for parametrized surfaces.
We present an algorithm for solving Diophantine equations which are linear in the variables, but non-linear in one parameter. We are looking for the pointwise solutions, i.e., the solutions for the unknowns in depende...
详细信息
ISBN:
(纸本)9780769535234
We present an algorithm for solving Diophantine equations which are linear in the variables, but non-linear in one parameter. We are looking for the pointwise solutions, i.e., the solutions for the unknowns in dependence of the value of the parameter. Solving Diophantine equations is central to computingthe data dependences of certain codes (loops with certain array accesses) which often occur in scientificcomputing. Our algorithm enables the computation of data dependences in more general situations than is possible with current algorithms.
the development of software systems for scientific exploration and discovery through computation has an important issue to address: the management of underlying computational steps. To support composition of Web and G...
详细信息
ISBN:
(纸本)9780769535234
the development of software systems for scientific exploration and discovery through computation has an important issue to address: the management of underlying computational steps. To support composition of Web and Grid services, standard workflow languages and workflow execution engines were built but management capabilities are not yet entirely explored. In the context of Grid services, we propose a solution for controlling the execution of workflows without the assistance of a user interface oriented workflow engine. We also investigate the capabilities that our solution may offer for related features such as dynamic retrieval of partial results, steering and provenance.
scientific visualization is the process of transforming raw numeric data into a visual form, and is a key element of computational science. While many tools exist, they are unnecessarily difficult to use. this complex...
详细信息
ISBN:
(纸本)9781424439355
scientific visualization is the process of transforming raw numeric data into a visual form, and is a key element of computational science. While many tools exist, they are unnecessarily difficult to use. this complexity increases time to insight and inhibits casual inquiry. the complexity derives from the need to support arbitrarily formatted data and many visualization algorithms. EnVision addresses both sources of complexity. Its design is predicated on two key insights. First, though the number of data file formats is unbounded, the structure of any one can be described using a small number of parameters. Second, the set of visualization algorithms applicable to a given type of data is small, and the subset used within a specific scientific discipline is smaller. EnVision utilizes domain-specific knowledge and user-directed semi-automation to dramatically simplify data importation and visualization algorithm selection. Its web-based interface facilitates access to remote hardware resources and provides a collaborative visualization environment.
Motivated by ideas of software measurement, the area of process measurement has attracted attention in recent time. Numerous process metrics have been proposed to measure (often structural) properties of business proc...
详细信息
ISBN:
(纸本)9780769535234
Motivated by ideas of software measurement, the area of process measurement has attracted attention in recent time. Numerous process metrics have been proposed to measure (often structural) properties of business processes. In this paper, we propose heatmaps, a visualization technique for high-dimensional data originally used in genetics, for visualizing the process metric values of business process collections. So, new insights into the distribution of the metric values among the processes could be gained. Additionally, we use clustering for analyzing (1) the correlations between different process metrics and (2) finding (structurally) similar processes among business process collections. Our approach has been successfully applied to the SAP Reference Model processes.
暂无评论