Showing papers on "Logical matrix published in 1995"
TL;DR: An algorithm is derived for inferring a binary vector given noisy observations of As modulo 2, where A is a binary matrix and the binary vector is replaced by a vector of probabilities optimised by free energy minimisation.
Abstract: An algorithm is derived for inferring a binary vector s given noisy observations of As modulo 2, where A is a binary matrix. The binary vector is replaced by a vector of probabilities, optimised by free energy minimisation. Experiments on the inference of the state of a linear feedback shift register indicate that this algorithm supersedes the Meier and Staffelbach polynomial algorithm.
76 citations
TL;DR: A novel stage binary matrix format is applied to describe each stage in a flow network, which allows proper representation of possible routes as binary strings to be used by a genetic algorithm.
51 citations
TL;DR: In this article, a new structural invariant, called the Arranged Sequence of Total Distance Ranks of all the Joints, was developed for planar kinematic chains with simple joints.
Abstract: A new matrix, called the joint-joint relation matrix, is defined for representing the structure of kinematic chain. An algorithm has been developed for deriving the joint-joint distance matrix of a kinematic chain from its joint-joint relation matrix with the help of the computer. A new structural invariant, called the Arranged Sequence of Total Distance Ranks of all the Joints, and based on the concept of distance, has been developed for a kinematic chain, leading to the development of a simple methodology for detecting isomorphism among planar kinematic chains with simple joints.
26 citations
Patent•
17 Nov 1995
TL;DR: In this paper, a system for mapping a warehouse rack structure consisting of a storage and retrieval machine, a rack structure, a logical matrix, and a computer is presented, based on the distance measurements made by the first and second ultrasonic sensors.
Abstract: A method of mapping a warehouse rack structure having a plurality of racks comprises the steps of creating a logical matrix and updating the logical matrix The updating step further includes the steps of causing a moveable device to travel to a first one of the plurality of racks, and producing a first machine-readable distance measurement output The machine-readable distance measurement output is produced using a first sensor and represents a distance between the first sensor and a first position on the warehouse rack structure A system for mapping a warehouse rack structure comprises a storage and retrieval machine; a rack structure; a logical matrix; and a computer The storage and retrieval machine has first and second ultrasonic sensors mounted thereon The rack structure includes a plurality of racks The logical matrix stores horizontal position information and vertical position information for each of the plurality of racks The computer updates the logical matrix based on distance measurements made by the first and second ultrasonic sensors
17 citations
TL;DR: It is shown that the real-time calculation of open-closing and close-opening is accomplished by local matrix operations rather than cascade operations (opening/closing followed by closing/opening), thus eliminating delays and requiring less memory storage.
Abstract: We propose a method for the real-time implementation of function processing (FP), open-closing (OC), and close-opening (CO) morphological operations The proposed method is based on the block basis matrix (BBM), which is an extension of the basis matrix of Ko and Shridar (1990) A procedure to obtain the BBM is proposed This matrix is skew symmetric, and some related properties lead to simplify the FP morphological operations It is shown that the real-time calculation of open-closing and close-opening is accomplished by local matrix operations rather than cascade operations (opening/closing followed by closing/opening), thus eliminating delays and requiring less memory storage >
10 citations
04 Jul 1995
TL;DR: The paper presents the work that has resulted in the sum and threshhold (SAT) processor; a dedicated hardware implementation of a binary neural image processor aimed specifically at supporting the ADAM algorithm and currently being integrated into a new version of the C-NNAP parallel image processor.
Abstract: The paper presents the work that has resulted in the sum and threshhold (SAT) processor; a dedicated hardware implementation of a binary neural image processor. The SAT processor is aimed specifically at supporting the ADAM algorithm and is currently being integrated into a new version of the C-NNAP parallel image processor. The SAT processor performs binary matrix multiplications, a task that is computationally complex for a CPU with a standard instruction set. It can perform the matrix multiplication and thresholding between 100 and 200 times faster than the DSP32C that uses an in-house produced dedicated coprocessor. This speed-up will allow the SAT to process images of up to 220*220 pixels at 25-Hz frame rates.
8 citations
NEC1
TL;DR: Experimental results show that the proposed logic partitioning method achieves high-quality design comparable to the one optimized for the whole circuits, with much shorter time.
Abstract: This paper presents a new logic partitioning method for optimizing large scale circuits. The proposed method partitions a given circuit into transitive fanin-disjoint sub-circuits by matrix operations, so that various optimization methods can be applied to each partitioned sub-circuit instead of the whole circuit. Experimental results show that the proposed method achieves high-quality design comparable to the one optimized for the whole circuits, with much shorter time(1/20). Thus, the circuits with over 10,000 gates can be optimized by the proposed partitioning.
5 citations
30 Oct 1995
TL;DR: It has been shown that the best transitive closure algorithm known is based on the matrix multiplication method of Strassen (1959), and it is shown that this method requires, at most, O(n/sup /spl alpha///spl middot/P(n) bit-wise operations), which bounds the number of bitwise operations needed for arithmetic module n+1.
Abstract: Arithmetic operations on matrices are applied to the problem of finding the transitive closure of a Boolean matrix. The best transitive closure algorithm known is based on the matrix multiplication method of Strassen (1959). It has been shown that this method requires, at most, O(n/sup /spl alpha///spl middot/P(n)) bit-wise operations, where /spl alpha/=log/sub 2/ 7, and P(n) bounds the number of bitwise operations needed for arithmetic module n+1. The problems of computing the transitive closure and computing the and-or product of Boolean matrices can then be considered of the same order of difficulty.
4 citations
TL;DR: It is proved that, relative to a random oracle, the class NP contains infinite sets having no infinite Co- NP-subsets (Co-NP-immune sets) and AMCo-AMPP under some oracles is proved.
Abstract: In the first part of the paper we prove that, relative to a random oracle, the class NP contains infinite sets having no infinite Co-NP-subsets (Co-NP-immune sets). In the second part we prove that perceptrons separating Boolean matrices in which each row contains at least one 1 from matrices in which many rows (say 99% of them) have no 1's must have either large size or large order. This result partially strengthens the "one-in-a-box"' theorem of Minsky and Papert [16] which states that perceptrons of small order cannot decide if every row of a given Boolean matrix has a 1. As a corollary, we prove that AMCo-AMPP under some oracles.
3 citations
TL;DR: This paper proposes a method to integrate multiple processes for decision making on the behavior of the mobile robots and defines two relation matrices between the processes : a priority relation matrix and an interest relation matrix.
Abstract: This paper provides an architecture of mobile robots for the cellular robotic system. The cellular robotic system (CEBOT) is an autonomous distributed robotic system composed of a number of robotic units called "cells." Since the CEBOT has variable structure, flexibility and extendibility are required in the control system for the CEBOT. To design the mobile robots for the CEBOT, we selected a parallel processing control system, with which it is easy to add new rules. In this paper we propose a method to integrate multiple processes for decision making on the behavior of the mobile robots. We define two relation matrices between the processes : a priority relation matrix and an interest relation matrix. Interprocess conflicts are solved by coordination between the priority relation matrix and the interest relation matrix. We also show a learning method to obtain the most suitable priority relation matrix.
3 citations
TL;DR: The gap between the logarithm of the rank of a matrix and its communication complexity is studied using algebraic interpretation of some methods which yield non constant gaps by combining, mainly via tensor products, matrices with constant gap.
21 Jul 1995
TL;DR: A class of decomposition techniques for data represented as matrices is presented to transform a matrix into a sequence of components in order to represent and analyze the matrix in a multi-resolution setting.