Balanced ternary number representation and arithmetic, based on the symmetric radix-3 digit set {−1, 0, +1}, has been studied at various times in the history of computing. Among established advantages of balanced ternary arithmetic are representational symmetry, favourable error characteristics and rounding by truncation. In this study, we show an additional advantage: that of lower-error trunc...

Modeling structural and mechanical properties of intermetallic compounds and alloys requires detailed knowledge of their interatomic interactions. The first two papers of this series @Phys. Rev. B 56, 7905 ~1997!; 58, 8967 ~1998!# derived first-principles interatomic potentials for transition-metal ~TM! aluminides using generalized pseudopotential theory ~GPT!. Those papers focused on binary al...

Although a single binary functional complex between cytochrome P450 (P450 or CYP for a specific isoform) and cytochrome P450 reductase (CPR) has been generally accepted in the literature, this simple model failed to explain the experimentally observed catalytic activity of recombinant CYP2E1 in dependence on the total concentration of the added CPR-K56Q mutant. Our rejection of the simplest 1:1...

1.

Clustering is an important data exploration task. A prominent clustering algorithm is agglomerative hierarchical clustering. Roughly, in each iteration, it merges the closest pair of clusters. It was rst proposed way back in 1951, and since then there have been numerous mod-iications. Some of its good features are: a natural, simple, and non-parametric grouping of similar objects which is capab...

N-gram indexing is used in many practical applications. Spam detection, plagiarism detection or comparison of DNA reads. There are many data structures that can be used for this purpose, each with different characteristics. In this article the ternary search tree data structure is used. One improvement of ternary tree that can save up to 43% of required memory is introduced. In the second part ...

In this paper we investigate some properties of congruences on ternary semigroups. We also define the notion of congruence on a ternary semigroup generated by a relation and we determine the method of obtaining a congruence on a ternary semigroup T from a relation R on T. Furthermore we study the lattice of congruences on a ternary semigroup and we show that this lattice is not generally modular...

Let $A$ be a Banach ternary algebra over a scalar field $Bbb R$ or $Bbb C$ and $X$ be a ternary Banach $A$--module. Let $sigma,tau$ and $xi$ be linear mappings on $A$, a linear mapping $D:(A,[~]_A)to (X,[~]_X)$ is called a Lie ternary $(sigma,tau,xi)$--derivation, if $$D([a,b,c])=[[D(a)bc]_X]_{(sigma,tau,xi)}-[[D(c)ba]_X]_{(sigma,tau,xi)}$$ for all $a,b,cin A$, where $[abc]_{(sigma,tau,xi)}=ata...