By means of dimension-decreasing method and cell-decomposition,a practical algorithm is proposed to decide the positivity of a certain class of symmetric polynomials,the numbers of whose elements are *** is a class of...
详细信息
By means of dimension-decreasing method and cell-decomposition,a practical algorithm is proposed to decide the positivity of a certain class of symmetric polynomials,the numbers of whose elements are *** is a class of mechanically decidable problems beyond Tarski *** implement the algorithm,a program nprove written in maple is developed which can decide the positivity of these polynomials rapidly.
In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and th...
详细信息
We introduce a new nameless representation of lambda terms inspired by ordered logic. At a lambda abstraction, number and relative position of all occurrences of the bound variable are stored, and application carries ...
详细信息
In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and th...
In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and their preservation by refinements is investigated to find out which of these relations may be used in top-down design. It is demonstrated that the place bisimulation equivalences may be used for the compositional and history preserving reduction of Petri nets. In addition, we consider all the mentioned equivalences on sequential nets which are a special subclass of general Petri nets modelling sequential systems, where no two actions can happen simultaneously. On this net subclass all pomset equivalences merge with the corresponding interleaving ones, and it allows us to simplify their check.
Analyzing static snapshots of massive, graph-structured data cannot keep pace with the growth of social networks, financial transactions, and other valuable data sources. We introduce a framework, STING (Spatio-Tempor...
详细信息
Analyzing static snapshots of massive, graph-structured data cannot keep pace with the growth of social networks, financial transactions, and other valuable data sources. We introduce a framework, STING (Spatio-Temporal Interaction Networks and Graphs), and evaluate its performance on multicore, multisocket Intel ® -based platforms. STING achieves rates of around 100 000 edge updates per second on large, dynamic graphs with a single, general data structure. We achieve speedups of up to 1000× over parallel static computation, improve monitoring a dynamic graph's connected components, and show an exact algorithm for maintaining local clustering coefficients performs better on Intel-based platforms than our earlier approximate algorithm.
This paper describes computational techniques for concurrent Direct Simulation Monte Carlo (DSMC) of neutral flow inside three-dimensional plasma reactors. These techniques are designed to reduce the overall time to o...
详细信息
暂无评论