Andrew JENNINGS Hideyuki HIGUCHI
New methods are needed for accessing very large information services. This paper proposes the use of a user model neural network to allow better access to a news service. The network is constructed on the basis of articles read, and articles marked as rejected. It adapts over time to better represent the user's interests and rank the articles supplied by the news service. Using an augmented keyword search we can also search for articles using keywords in conjunction with the user model neural network. Trials of the system in a USENET news environment show promising results for the use of this approach in information retrieval.
This article proposes a four dimensional autonomous hyperchaos generator whose nonlinear element is only one diode. The circuit is analyzed by regarding the diode as an ideal switch. Hence we can derive the two dimensional return map rigorously and its Lyapunov exponents confirm the hyperchaos generation. Also, a novel mathematical basis for the simplification to the ideal switch is given.
Harufusa KONDOH Seiji KOZAKI Shinya MAKINO Hiromi NOTANI Fuminobu HIDANI Masao NAKAYA
A fully integrated digital PLL (Phase Locked Loop) with on-chip CMOS oscillator is described. Nominal division number of the variable divider is automatically tuned in this digital PLL and this feature makes it possible to widen the pull-in range. In general, output jitter may increase if the pull-in range is widened. To overcome this problem, output jitter is reduced by utilizing the dual loop architecture. Wide pull-in range enables us on-chip oscillator, which is not so precise as the expensive crystal oscillator. This CMOS oscillator must be carefully designed to be stable against the temperature and the supply voltage variations. Using these digital PLL techniques, together with the on-chip CMOS oscillator, a fully integrated PLL can be achieved. Circuits are designed for 1.544 Mbit/s ISDN primary rate interface, and 6.25% pull-in range is obtained.
Fusako HIRABAYASHI Yutaka KASAHARA
Proposed here is an internal representation and mapping method for multimedia information in which retrieval is based on the impression documents desired to make. A user interface design for a system using this method is also proposed. The proposed internal representation and mapping method represents each desired document impression as an axis in a semantic space. Documents are represented as points in the space. Queries are represented as subspaces. The proposed user interface design employs a method of visual presentation of the semantic space. Pictorial examples are given to illustrate the range of impressions represented by the axes. The relations between the axes are represented by dispersion diagrams for the documents stored in the document base. With this method, the user can intuitively decide the appropriate subspace for his needs and can specify it directly. For evaluation purposes, a prototype system has been developed. An image retrieval experiment shows that the proposed internal representation and mapping method and the user interface design provide effective tools for information retrieval.
A reversible (or injective) cellular automaton (RCA) is a backward deterministic" CA, i.e., every configuration of it has at most one predecessor. Margolus has been shown that there is a computation-universal two-dimensional 2-state RCA model. Although his model is very interesting, it differs from a standard CA model because of its somewhat spatial and temporal non-uniformity. In this paper, we present two kinds of simple 16-state computation-universal models using the framework of two-dimensional reversible partitioned CA (PCA). Since PCA can be considered as a subclass of standard CA, we can immediately obtain 16-state standard RCA models from them. For each of these models, we designed a configuration which simulates a Fredkin gate. Since Fredkin gate has been known to be a universal logic element, computation-universality of these two models is concluded.
Tomoaki OHTSUKI Hiroyuki YASHIMA Iwao SASASE Shinsaku MORI
We propose parallel rate-variable punctured convolutional coded PPM in photon communication to achieve high energy information efficiency Ie for desired bit error rate (BER) and transmission bandwidth. We theoretically show the BER performance, bandwidth expansion factor β and necessary Ie to achieve BER=10-6 of the proposed systems for some combinations of code rates. It is found that the proposed system can achieve high Ie for desired BER and β by selecting a suitable combination of code rates depending on the channel conditions. Moreover, it is shown that the proposed system has better BER performance than RS-coded PPM in the range of small β.
This paper discusses new trends and directions in human interface (HI) technologies, and the effects of HI technologies on human life or on social activities. This paper postulates that the HI subsumes man-machine interface, human-computer interaction, human-human interaction, human-organizational interface, human-environmental interface, human-social interface, etc. A new communication model, called Human Interface Communication Model (HICOM), and a new human dialogue model, called Human Interface Dialogue model (HIDIM), are derived by reexamining trends and directions on HI technologies from the viewpoint of functional meanings of interfaces, and from the viewpoint of a socially distributed cognition mechanism.
We propose two types of public-key cryptographic schemes based on elliptic curves modulo n, where n is the product of secret large primes p and q. The RSA-type scheme has an encryption function with an odd multiplier. The Rabin-type scheme has an encryption function with a multiplier of 2. The security of the proposed schemes is based on the difficulty of factoring n. Other security characteristics are also discussed. We show some applications to a master key scheme and blind signature scheme.
A maximal l-diameter tree cover of a graph G(V,E) is a spanning subgraph C(V,EC) of G such that each connected component of C is a tree, C contains no path with more than l edges, and adding any edge in EEC to C yields either a path of length l1 or a cycle. For every function f from positive integers to positive integers, the maximal f-diameter tree cover prolem (MDTC(f) problem for short) is to find a maximal f(n)-diameter tree cover of G, given an n-node graph G. In this paper, we give two parallel algorithms for the MDTC(f) problem. The first algorithm can be implemented in time O(TMSP(n,f(n))log2n) using polynomial number of processors on an EREW PRAM, where TMSP(n,f(n) is the time needed to find a maximal set of vertex disjoint paths of length f(n) in a given n-node graph using polynomial number of processors on an EREW PRAM. We then show that if suitable restrictions are imposed on the input graph and/or on the magnitude of f, then TMSP(n,f(n))O(logkn) for some constant k and thus, for such cases, we obtain an NC algorithm for the MDTC(f) problem. The second algorithm runs in time O(n log2n/{f(n)1}) using polynomial number of processors on an EREW PRAM. Thus if f(n)Ω(n/logkn) for some kO, we obtain an NC algorithm for the MDTC(f) problem.
Yasuhiko TAKENAGA Shuzo YAJIMA
By adding some functions to memories, highly parallel computation may be realized. We have proposed memory-based parallel computation models, which uses a new functional memory as a SIMD type parallel computation engine. In this paper, we consider models with communication between the words of the functional memory. The memory-based parallel computation model consists of a random access machine and a functional memory. On the functional memory, it is possible to access multiple words in parallel according to the partial match with their memory addresses. The cube-FRAM model, which we propose in this paper, has a hypercube network on the functional memory. We prove that PSPACE is accelerated to polynomial time on the model. We think that the operations on each word of the functional memory are, in a sense, the essential ones for SIMD type parallel computation to realize the computational power.
Circuit complexity of a Boolean function is defined to be the minimum number of gates in circuits computing the function. In general, the circuit complexity is established by deriving two types of bounds on the complexity. On one hand, an upper bound is derived by showing a circuit, of the size given by the bound, to compute a function. On the other hand, a lower bound is established by proving that a function can not be computed by any circuit of the size. There has been much success in obtaining good upper bounds, while in spite of much efforts few progress has been made toward establishing strong lower bounds. In this paper, after surveying general results concerning circuit complexity for Boolean functions, we explain recent results about lower bounds, focusing on the method of approximation.
Yuichi KAJI Ryuichi NAKANISI Hiroyuki SEKI Tadao KASAMI
Multiple context-free grammars (mcfg's) are a subclass of generalized context-free grammars introduced by Pollard in order to describe the syntax of natural languages. First, this paper shows that the universal recognition problem for mcfg's is EXP-POLY time-complete, where the universal recognition problem is the one to decide whether G generates w for a given grammar G and string w. Next, it is shown that the problem for linear context-free rewriting systems introduced by Vijay-Shanker et al., which is a proper subclass of mcfg's, is PSPACE-complete.
We study the depth of planar Boolean circuits. We show that planar Boolean circuits of depth D(n) are simulated by on-line Turing machines in space O(D(n)). From this relationship, it is shown that any planar circuit for computing integer multiplication requires linear depth. It is also shown that a planar analogue to the NC-hierarchy is properly separated.
Tetsuo KINOSHITA Kenji SUGAWARA Norio SHIRATORI
This paper proposes a knowledge-based design method of a protocol of a communication network system based on the knowledge-based design methodology for computer communication systems. In the proposed method, two knowledge models, i.e., the communication network architecture model (CNAM) and the communication protocol architecture model (CPAM), are introduced and a protocol design task is modeled as a successive transformation process of these knowledge models. Giving CNAM which represents the users' requirements concerning a communication network system, the requirements specification of a protocol is derived from CNAM and represented as CPAM. Then, the detailed requirements specification of a protocol is also derived from CPAM and represented by the formal description technique (FDT-Expressions). The derivations of CPAM and FDT-Expressions are executed by the transformation rules which represent the mappings between knowledge models. Due to formally defined knowledge models and mappings, the proposed method provides a framework of a systematic support of knowledge-based protocol design. In this paper, the formal definitions of CNAM and CPAM are given, then the derivation process of FDT-Expressions of a protocol is also formalized based on these knowledge models. Furthermore, a design example is demonstrated by using LOTOS as one of the FDT-Expressions of a protocol.
Xin-Min HUANG Yasumitsu MIYAZAKI
This paper presents a new connected associative memory neural network. In this network, a threshold function which has two dynamical parameters is introduced. After analyzing the dynamical behaviors and giving an upper bound of the memory capacity of the conventional connected associative memory neural network, it is demonstrated that these parameters play an important role in the recalling processes of the connected neural network. An approximate method of evaluationg their optimum values is given. Further, the optimum feedback stopping time of this network is discussed. Therefore, in our network, the recalling processes are ended at the optimum feedback stopping time whether a state energy has been local minimum or not. The simulations on computer show that the dynamical behaviors of our network are greatly improved. Even though the number of learned patterns is so large as the number of neurons, the statistical properties of the dynamical behaviors of our network are that the output series of recalling processes approach to the expected patterns on their initial inputs.
Tomoaki OHTSUKI Hiroyuki YASHIMA Iwao SASASE Shinsaku MORI
We propose parallel rate-variable punctured convolutional coded PPM in photon communication to achieve high energy information efficiency Ie for desired bit error rate (BER) and transmission bandwidth. We theoretically show the BER performance, bandwidth expansion factor β and necessary Ie to achieve BER10-6 of the proposed systems for some combinations of code rates. It is found that the proposed system can achieve high Ie for desired BER and β by selecting a suitable combination of code rates depending on the channel conditions. Moreover, it is showm that the proposed system has better BER performance than RS-coded PPM in the range of small β.
W. Thomas CATHEY Satoshi ISHIHARA Soo-Young LEE Jacek CHROSTOWSKI
We review the role of optics in interconnects, analog processing, neural networks, and digital computing. The properties of low interference, massively parallel interconnections, and very high data rates promise extremely high performance for optical information processing systems.
W. Thomas CATHEY Satoshi ISHIHARA Soo-Young LEE Jacek CHROSTOWSKI
We review the role of optics in interconnects, analog processing, neural networks, and digital computing. The properties of low interference, massively parallel interconnections, and very high data rates promise extremely high performance for optical information processing systems.