Chains of Recurrences (CR's) are introduced as an effective method to evaluate functions at regular intervals. Algebraic properties of CR's are examined and an algorithm that constructs a CR for a given functi...
详细信息
ISBN:
(纸本)9780897916387
Chains of Recurrences (CR's) are introduced as an effective method to evaluate functions at regular intervals. Algebraic properties of CR's are examined and an algorithm that constructs a CR for a given function is explained. Finally, an implementation of the method in MAXIMA/Common Lisp is discussed.
We propose a classification of partial order temporal properties into a hierarchy, which is a generalization of the safety-progress hierarchy of Chang, Manna and Pnueli. The classes of the hierarchy are characterized ...
详细信息
We propose two moment ratios based on the first four moments. These moment ratios are useful in identifying different members from a class of discrete or continuous distributions. These ratios are also useful in appro...
详细信息
We propose two moment ratios based on the first four moments. These moment ratios are useful in identifying different members from a class of discrete or continuous distributions. These ratios are also useful in approximating the Neyman type A and the generalized Poisson distribution by the negative binomial distribution.
Contention control strategies for high speed backbone networks are studied. Packet loss is a serious problem in a backbone scenario due to the speed mismatch of the different networks. The authors' new mechanism t...
详细信息
In this paper, we propose a general method for mapping Affine Recurrence Equations (ARE's) on a Multi-Rate Array (MRA). We show that the mapping is valid if and only if it maps the problem domain on the null space...
详细信息
In this paper, we propose a general method for mapping Affine Recurrence Equations (ARE's) on a Multi-Rate Array (MRA). We show that the mapping is valid if and only if it maps the problem domain on the null space of the matrix (D − I) along the range space of this matrix (D is the dependency matrix, I is the identity matrix). We also prove that in the resulting array, variables are flowing at different speeds.
A compositional proof system is presented to axiomatize the real-time behavior of asynchronously communicating processes. Programs are written in a real-time version of CSP where processes asynchronously send and rece...
详细信息
A compositional proof system is presented to axiomatize the real-time behavior of asynchronously communicating processes. Programs are written in a real-time version of CSP where processes asynchronously send and receive messages along channels that are capable of buffering an arbitrary number of messages. Timing properties are expressed in explicitly clock temporal logic, which extends linear temporal logic with a special time variable, referring to a global clock.< >
An infinite series of curves is constructed in order to show that all linear codes can be obtained from curves using Goppa's construction. If one imposes conditions on the degree of the divisor used, then we deriv...
详细信息
An infinite series of curves is constructed in order to show that all linear codes can be obtained from curves using Goppa's construction. If one imposes conditions on the degree of the divisor used, then we derive criteria for linear codes to be algebraic-geometric. In particular, the family of q-ary Hamming codes is investigated, and it is proven that only those with redundancy one or two and the binary [7,4,3] code are algebraic-geometric in this sense. For these codes we explicitly give a curve, rational points and a divisor. It is proven that this triple is in a certain sense unique in the case of the [7,4,3] code.
暂无评论