We define the functional inverse of the Gamma function. It is a multivalued function, and we define its branches. We present its basic properties, included series approximations, asymptotic results and numerical evalu...
详细信息
ISBN:
(纸本)9781538626269
We define the functional inverse of the Gamma function. It is a multivalued function, and we define its branches. We present its basic properties, included series approximations, asymptotic results and numerical evaluation.
this paper makes a short overview of current state of the art monitoring tools for cloud and big data frameworks. In order to effectively create, test and deploy new algorithms or frameworks one needs suitable monitor...
详细信息
ISBN:
(纸本)9781509004614
this paper makes a short overview of current state of the art monitoring tools for cloud and big data frameworks. In order to effectively create, test and deploy new algorithms or frameworks one needs suitable monitoring solutions. Hence we aim on creating a critical overview for some of the monitoring solutions existing on the market. Also we present relevant metrics used for monitoring cloud and big data applications, focused mainly on cloud deployment scenarios for big data frameworks.
We propose a new technique for identifying frequent patterns that occur in large transactional data sets using Boolean algebras. Our approach, which involves extending the notion of support from sets of attributes to ...
详细信息
ISBN:
(纸本)9781538626269
We propose a new technique for identifying frequent patterns that occur in large transactional data sets using Boolean algebras. Our approach, which involves extending the notion of support from sets of attributes to Boolean functions is more expressive than the standard approach that amounts to a search for conjunctive patterns. An efficient algorithm based on computing supports for minterms is presented. Also, we discuss an application of this algorithm to finding independent sets in graphs.
Colored Petri Nets are a formalism widely used to specify and analyze workflow models. Finding the set of transition color instances enabled in a given marking is a basic task affecting reachability graph construction...
详细信息
ISBN:
(纸本)9780769527406
Colored Petri Nets are a formalism widely used to specify and analyze workflow models. Finding the set of transition color instances enabled in a given marking is a basic task affecting reachability graph construction, model-checking, and especially discrete-event simulation, which is an interesting alternative when analytical solutions are unfeasible due to state-space explosion. A recently introduced symbolic approach to colored transition enabling test is the kernel for the efficient implementation of several algorithms for the analysis of SWN (a Stochastic CPN flavor retaining power that exploits behavioral symmetries) based on state-space exploration. An application example of the symbolic enabling test for efficient simulation of SWN workflow models is presented. the example shows that the technique can be easily integrated to the SWN symbolic firing rule.
In the design of symbolic mathematical computation systems, it is a popular choice to use the same syntax for both mathematical indeterminates and programming variables. While mathematical indeterminates are to be use...
详细信息
ISBN:
(纸本)9781665465458
In the design of symbolic mathematical computation systems, it is a popular choice to use the same syntax for both mathematical indeterminates and programming variables. While mathematical indeterminates are to be used without specific values, programming variables must be initialized before being used in expressions. A problem occurs when mistakenly uninitialized programming variables are silently taken to be mathematical indeterminates. this article explores how this problem can arise and its consequences. An algorithm to analyze programs for this defect is shown along with a Maple implementation.
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.
As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of t...
详细信息
ISBN:
(纸本)9780769539645
As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of the verification conditions for both partial correctness and for termination. A specific feature of our approach is the generation of verification conditions as first order formulae, including the termination condition which is expressed as an induction principle.
Satisfiability Checking is a relatively young research area, aiming at the development of efficient software technologies for checking the satisfiability of existentially quantified logical formulas. Besides the succe...
详细信息
ISBN:
(纸本)9781509057078
Satisfiability Checking is a relatively young research area, aiming at the development of efficient software technologies for checking the satisfiability of existentially quantified logical formulas. Besides the success story of SAT solving for propositional logic, SAT-modulo-theories (SMT) solvers offer sophisticated solutions for different theories. When targeting arithmetic theories, SMT solvers also make use of decision procedures rooted in symbolic Computation. In this paper we give a brief introduction to SMT solving, discuss differences to symbolic Computation, and illustrate the potentials and obstacles for embedding symbolic Computation techniques in SMT solving on the example of the Cylindrical Algebraic Decomposition.
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.
We present an algebraic framework to represent indefinite nested sums over hypergeometric expressions in difference rings. In order to accomplish this task, parts of Karr's difference field theory have been extend...
详细信息
ISBN:
(纸本)9781479984480
We present an algebraic framework to represent indefinite nested sums over hypergeometric expressions in difference rings. In order to accomplish this task, parts of Karr's difference field theory have been extended to a ring theory in which also the alternating sign can be expressed. the underlying machinery relies on algorithmsthat compute all solutions of a given parameterized telescoping equation. As a consequence, we can solve the telescoping and creative telescoping problem in such difference rings.
暂无评论