We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate...
详细信息
ISBN:
(纸本)9781509057078
We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantage of this new approach.
Resource identification in massive deployed distributed systems, like the cloud environments, is a common problem when multiple types of resources need to be managed. this is the case of platform as a service (PaaS) w...
详细信息
ISBN:
(纸本)9781479930357
Resource identification in massive deployed distributed systems, like the cloud environments, is a common problem when multiple types of resources need to be managed. this is the case of platform as a service (PaaS) where the platform offers different types resources that are deployed in heterogeneous systems. While most of the solutions on the market follow a predefined architecture using common naming services in a centralized manner this paper proposes a new approach based on a distributed naming and resource identification service. the proposed solution allows a client to consume or communicate with a resource without having to deal with resource location or discovery protocols.
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.
We define a new bio-inspired computational model for deciding 2-dimensional languages that is directly derived from the one in [13]. the described model has a slightly different accepting protocol as the previous one ...
详细信息
ISBN:
(纸本)9781538626269
We define a new bio-inspired computational model for deciding 2-dimensional languages that is directly derived from the one in [13]. the described model has a slightly different accepting protocol as the previous one and, besides the deletion and substitution operations, we now consider a new type of operation, namely circular permutation. We show that by using circular permutations, such networks can recognize any input that contains a given sub-picture as where our previous model limited one of the pattern dimensions to a size of at most 3.
the strong convergence properties of the projection method for convex feasibility problem are investigated in the frame of a real Hilbert space. the significant role of the regularity properties for strong convergence...
详细信息
ISBN:
(纸本)9780769530789
the strong convergence properties of the projection method for convex feasibility problem are investigated in the frame of a real Hilbert space. the significant role of the regularity properties for strong convergence of these methods is pointed out.
We continue and complete a Coxeter spectral study (presented in our talk given in SYNASC11, Timisoara, September 2011 [6]) of the root systems in the sense of Bourbaki [4], the mesh geometries Gamma(R-Delta, phi(A)) o...
详细信息
ISBN:
(纸本)9780769549347;9781467350266
We continue and complete a Coxeter spectral study (presented in our talk given in SYNASC11, Timisoara, September 2011 [6]) of the root systems in the sense of Bourbaki [4], the mesh geometries Gamma(R-Delta, phi(A)) of roots of Delta in the sense of [20], and matrix morsifications A is an element of Mor (Delta), for simply-laced Dynkin diagrams Delta is an element of {A(n), D-n, E-6, E-7, E-8}. One of the main aims of the talk is to present a progress obtained during the last year in solving the problems stated in our talk [6]. We show that the reduced mesh root systems and mesh geometries of roots for each of the Dynkin diagrams Delta can be classified for n <= 9 by applying symbolic computer algebra computations and numeric algorithmic computations. We also compute the isotropy group Gl(n, Z)(Delta) of Delta defined in [22]-[23], determine its structure and compute the Gl(n, Z)(Delta)-orbits of the morsifications A is an element of Mor (Delta), for Delta is an element of {A(n), D-m}, with n <= 9 and 4 <= m <= 8. Results of our computing experiences are presented in three tables of Section 4.
In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and disc...
详细信息
ISBN:
(纸本)9780769546308
In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and discuss the occurring problems. the main focus is on the question of determining possible branch cuts. We explore the extent to which the treatment of branch cuts can be rendered (more) algorithmic, by adapting Kahan's rules to the differential equation setting. Keywords: computer algebra, differential equation, branch cut
Computational simulation is an important research tool for modern scientists. there are a range of different scales of high performance computing (HPC) resources available to scientists, from laptop and desktop machin...
详细信息
ISBN:
(纸本)9781479930357
Computational simulation is an important research tool for modern scientists. there are a range of different scales of high performance computing (HPC) resources available to scientists, from laptop and desktop machines, to small institutional clusters, to national HPC resources, and the largest parallel computers in the world. this paper outlines the challenges that developers and users face moving from small scale computational resources to larger scale parallel machines. We present an overview of various research efforts to improve performance on large scale systems to enable users and developers to gain an understanding of the performance issues often encountered by simulation codes.
Solving a linear system of equations is a common task performed for most of the scientific experiments. Everyday, these applications increase their demands, pushing the computational capacity to the limits. At a certa...
详细信息
ISBN:
(纸本)9780769549347;9781467350266
Solving a linear system of equations is a common task performed for most of the scientific experiments. Everyday, these applications increase their demands, pushing the computational capacity to the limits. At a certain point, our systems, running common algorithms, become unable to process such massive amounts of information. the paper analyses and modifies the standard Gaussian reduction so that a huge array may be handled by almost any distributed system. Moreover, the paper focuses on providing a decent level of fault tolerance in order to comply with a real, heterogeneous distributed system and on becoming a solution for sensitive applications.
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.
暂无评论