Nowadays, important efforts in the research of the Transition P Systems have been focused on the simulation/ implementation of the massively parallel character of the model. the distributed implementation of P Systems...
详细信息
the aim of this paper is to discuss a novel application of Grobner bases in the study of Diophantine equations. the idea appeared during some work on the number of solutions of systems of Pell equations, but can be us...
详细信息
the aim of this paper is to discuss a novel application of Grobner bases in the study of Diophantine equations. the idea appeared during some work on the number of solutions of systems of Pell equations, but can be useful in other circumstances as well.
We propose a simple solution to Yao's millionaires' problem using thesubtractive homomorphic properties of the secret sharing schemes based on the Chinese remainder theorem (CRT).
We propose a simple solution to Yao's millionaires' problem using thesubtractive homomorphic properties of the secret sharing schemes based on the Chinese remainder theorem (CRT).
In this paper, we extend some complexity results on the secrecy problem for bounded security protocols by adding composed keys and disequality tests to an existing model for security protocols.
In this paper, we extend some complexity results on the secrecy problem for bounded security protocols by adding composed keys and disequality tests to an existing model for security protocols.
the mean N is the complementary of the mean M with respect to the mean P if P(M, N) = P. We study the complementaries of Greek means with respect to the logarithmic mean. We look after the complementary of a mean in s...
详细信息
the mean N is the complementary of the mean M with respect to the mean P if P(M, N) = P. We study the complementaries of Greek means with respect to the logarithmic mean. We look after the complementary of a mean in some families of means. Most of the computations are performed withthe symbolic capabilities of the Maple computer algebra system.
the aim of our paper is to solve numerically a second order elliptic BVP, using a collocation method. then, an optimal control problem governed by an elliptic equation is considered and numerical solutions are presented.
the aim of our paper is to solve numerically a second order elliptic BVP, using a collocation method. then, an optimal control problem governed by an elliptic equation is considered and numerical solutions are presented.
In this talk, we present several algorithms for decomposing systems of multivariate polynomials into triangular systems of various kinds. the algorithms have been efficiently implemented and successfully applied to nu...
详细信息
In this talk, we present several algorithms for decomposing systems of multivariate polynomials into triangular systems of various kinds. the algorithms have been efficiently implemented and successfully applied to numerous problems of scientificcomputing, ranging over computational polynomial algebra, automated geometric reasoning, solving systems of nonlinear equations, qualitative analysis of biological systems, and computer aided geometric design. We discuss some of the applications with a number of illustrative examples.
In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable ...
详细信息
In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable jumping Petri ***, as future work, we discuss some ideas for parallel implementations of the decision procedures for these problems.
the paper proposes to the information security specialists, a new algorithm based on a synchronous stream cipher HENKOS, built around a performing pseudorandom number generator. the paper describes the main parts of t...
详细信息
the paper proposes to the information security specialists, a new algorithm based on a synchronous stream cipher HENKOS, built around a performing pseudorandom number generator. the paper describes the main parts of the algorithm, analyze the quality of the implementation, measure the performance and present the statistical tests results for the pseudorandom number generator .
this paper presents a method for enhancing the performance of current clustering algorithms; the method is based on Particle Swarm Optimization techniques. Namely, a preprocessing step aims at bringing rdquocloserrdqu...
详细信息
this paper presents a method for enhancing the performance of current clustering algorithms; the method is based on Particle Swarm Optimization techniques. Namely, a preprocessing step aims at bringing rdquocloserrdquo objects which are likely to belong to the same cluster, while increasing the distance between objects likely to belong to different clusters. Experimental results show significantly improved performance for further clustering procedures especially when non-spherical clusters are involved.
暂无评论