We show that a positive de nite integral ternary form can be reduced with O(M(s) log s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-complexity of s-bit integer multiplication. This result is achieved in two steps. First we prove that the the classical Gaussian algorithm for ternary form reduction, in the variant of Lagarias, has this worst case running ...

An NMOS circuit realization is proposed for ternary functions based on a digital summation threshold gate. The procedure is systematic and any ternary function can be realized with a single gate. Many ternary functions were realized and the resulting circuits were simulated using the MCNC ( Microelectronics Center for North Carolina ) tools for VLSI design. The speed and complexity of the gate ...

Helton and Vinnikov proved that every hyperbolic ternary form admits a symmetric derminantal representation via Riemann theta functions. In the case the algebraic curve of the hyperbolic ternary form is elliptic, the determinantal representation of the ternary form is formulated by using Weierstrass ℘-functions in place of Riemann theta functions. An example of this approach is given.

It is known that any self-dual Boolean function can be decomposed into compositions of 3-bit majority functions. In this paper, we define a notion of a ternary majority formula, which is a ternary tree composed of nodes labeled by 3-bit majority functions and leaves labeled by literals. We study their complexity in terms of formula size. In particular, we prove upper and lower bounds for ternar...

Recent empirical results on long-term dependency tasks have shown that neural networks augmented with an external memory can learn the long-term dependency tasks more easily and achieve better generalization than vanilla recurrent neural networks (RNN). We suggest that memory augmented neural networks can reduce the effects of vanishing gradients by creating shortcut (or wormhole) connections. ...

Condition diagnosis in bearing systems needs an effective and precise method to avoid unacceptable consequences from total system failure. Artificial Neural Networks (ANNs) are one of the most popular methods for classification in condition diagnosis of bearing systems. Regarding to ANNs performance, ANNs parameters have important role especially connectivity weights. In several running of lear...

This paper will show a new approach to the solution of SAT-problems. It has been based on the isomorphism between the Boolean algebras of finite sets and the Boolean algebras of logic functions depending on a finite number of binary variables. Ternary vectors are the main data structure representing sets of Boolean vectors. The respective set operations (mainly the complement and the intersecti...