This paper describes the use of integer equations for high level modeling digital circuits for application of formal verification properties at this level. Most formal verification methods use BDDs, as a low level representation of a design. BDD operations require separation of data and control parts of a design and their implementation requires large CPU time and memory. In our method, a behav...

Matrix inversion is one of the most significant operations on a matrix. For any non-singular matrix A∈Zn×n, inverse this may contain countless numbers non-integer entries. These entries could be endless floating-point numbers. Storing, transmitting, or operating such an cumbersome, especially when size n large. The only square integer that guaranteed to have as its unimodular U∈Zn×n. With prope...

Project selection and resource allocation are critical issues in project-based organizations. These organizations are required to plan, evaluate, and control their projects in accordance with the organizational mission and objectives. In this study, we propose a three-stage hybrid method for selecting an optimal combination of projects. We obtain the maximum fitness between the final selection ...

We develop a new consistent conditional moment test of functional form based on nuisance parameter indexed sample moments. We reduce the nuisance parameter space to known countable sets, provide a new vantage into why existing parametric moment condition tests work, and uncover a new class of revealing weights. These results are exploited to construct a weighted average conditional moment test,...

Young's double-slit or two-beam interference is of fundamental importance to understand various interference effects, in which the stationary phase difference between two beams plays the key role in the first-order coherence. Different from the case of first-order coherence, in the high-order optical coherence the statistic behavior of the optical phase will play the key role. In this article, ...

We prove polynomial time complexity for a now widely used factorization algorithm for polynomials over the rationals. Our approach also yields polynomial time complexity results for bivariate polynomials over a finite field.

The rank of an object is its relative importance to the other objects in the set. Often a rank is an integer assigned from the set 1,...,n. A ranking model is a method of determining a way in which the ranks are assigned. Usually a ranking model uses information available on the objects to determine their respective ratings. The most recognized application of ranking is the competitive sports. ...