The paper suggests architecture of a reconfigurable processor, which can be customized for implementing different search algorithms over discrete matrices. Such algorithms might be used for solving various problems of combinatorial optimization, such as covering, Boolean satisfiability, etc. The proposed architecture contains memory blocks for a binary or a ternary matrix, general-purpose regis...

in this paper we introduce the concept of weakly prime ternary subsemimodules of a ternary semimodule over a ternary semiring and obtain some characterizations of weakly prime ternary subsemimodules. we prove that if $n$ is a weakly prime subtractive ternary subsemimodule of a ternary $r$-semimodule $m$, then either $n$ is a prime ternary subsemimodule or $(n : m)(n : m)n = 0$. if $n$ is a $q$-...

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...

In 2004, IBM introduced a set of broad operations research-based initiatives designed to improve the efficiency and productivity of its global sales force. The first solution, OnTARGET, provides a set of analytical models designed to identify new sales opportunities at existing IBM accounts and at noncustomer companies. The second solution, the Market Alignment Program (MAP), optimally allocate...

Two definitions of division by an interval containing zero are compared: a functional one and a relational one. We show that the relational definition also provides interval inverses for other functions that do not have point inverses, such as max and the absolute-value function. Applying the same approach to the ≤ relation introduces the “companion functions” of relations. By regarding the ari...

it is well known fact that binary relations are generalized mathematical functions. contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. some basic operations on functions such as the inverse and composition are applicable to binary relations as well. depending on the domain or range or both are fuzzy value fuzzy set, i...

A basic question of cryptographic complexity is to combinatorially characterize all randomized functions which have information-theoretic semi-honest secure 2-party computation protocols. The corresponding question for deterministic functions was answered almost three decades back, by Kushilevitz [Kus89]. In this work, we make progress towards understanding securely computable randomized functi...

We describe the Ordered Ternary Decision Diagram (OTDD) which can be directly evaluated even when given any number of undefined input logic values. Based on Kleeneon strong ternary logic, the OTDD unifies the concepts of “unknown input” with “don’t-care output” for incompletely-specified Boolean functions. The OTDD permits functions having nontrivial don’t-care sets to be represented as single ...