In order to realize flexible interaction control between user and information processing system, a special purpose user model is proposed on the basis of the knowledge-based design method of user interface system. The user-specific control knowledge of user-oriented interface environment is represented explicitly in the user model and utilized in the user-oriented interface system. Furthermore, the framework of user-oriented interface environment based on this user model called user-model-driven interface system, is proposed as one of user-adaptive human interface systems, in this paper. According to the proposed framework, a prototype system of the user-model-driven interface system is implemented and the facility of user-specific interaction control based on the user model has been verified with respect to an electronic mail handling task.

A chordal ring network is a processor network on which n processors are arranged to a ring with additional chords. We study a distributed leader election algorithm on chordal ring networks and present trade-offs between the message complexity and the number of chords at each processor and between the message complexity and the length of chords as follows:For every d(1dlog* n1) there exists a chordal ring network with d chords at each processor on which the message complexity for leader election is O(n(log(d1)nlog* n)).For every d(1dlog* n1) there exists a chordal ring network with log(d1)nd1 chords at each processor on which the message complexity for leader election is O(dn).For every m(2mn/2) there exists a chordal ring network whose chords have at most length m such that the message complexity for leader election is O((n/m)log n).

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.

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.

We describe two information disseminating schemes, t-disseminate and t-Rdisseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t1 and t2 any of these schemes can broadcast information within any consecutive logt+1N2 rounds, and for an arbitrary t they can broadcast information within any consecutive logt+1N3 rounds.

A rigorous theoretical method for predicting "ratio of desired signal power to interference power [c/i]" and "ratio of signal power to noise plus interference power [c/(n+i)]" where both desired and interference signals vary with time under the Nakagami-Rice fading conditions is presented. An alternative simple prediction method which is more desirable from the viewpoint of engineering application is then proposed. Prediction errors given by the simple method are evaluated by comparing to the errors given by the rigorous method, and it is confirmed that the simple method gives reasonable accuracy. This method is expected to serve in the development of frequency re-use technologies and the coordination of various systems for mobile satellite communications in the near future.

In this paper, we present a new image compression scheme, Projection-VQ, based on reconstruction from vector quantized projections. We can easily deal with the blocks of larger size in Projection-VQ than in conventional VQ schemes, because the dimension of vectors in projection domain is, in general, much smaller than that in the spatial domain. In Projection-VQ, the image can be reconstructed without destroying edge sharpness in the process since the projection data having the edge information are preferentially transmitted. There are several good algorithms of reconstructing an image from projections. However, we use a new modified reconstruction algorithm suitable for a variable bit rate image coding system. We allocate the bits depending on the characteristics of the block images. Our simulation results show that the performances are superior to the ordinary VQ schemes in PSNR, and that the improvement in subjective image quality is substantial.

We propose Polarization-Shift-Keying (POLSK) homodyne system using phase-diversity receivers and theoretically analyze its bit-error-rate (BER) performance. Since the proposed system uses polarization modulation and homodyne detection, it can cancel the phase noise and is attractive at a high bit-rate transmission. It is found that the receiver sensitivity of the proposed POLSK homodyne system is the same as that of POLSK heterodyne system and is much better than that of DPSK phase-diversity homodyne systems at high signal-to-noise ratio (SNR). We also cosider theoretically the effect of the fluctuation of state of polarization (SOP) on the BER performance of POLSK homodyne system.

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.

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.

We propose Polarization-Shift-Keying (POLSK) homodyne system using phase-diversity receivers and theoretically analyze its bit-error-rate (BER) performance. Since the proposed system uses polarization modulation and homodyne detection, it can cancel the phase noise and is attractive at a high bit-rate transmission. It is found that the receiver sensitivity of the proposed POLSK homodyne system is the same as that of POLSK heterodyne system and is much better than that of DPSK phase-diversity homodyne systems at high signal-to-noise ratio (SNR). We also cosider theoreically the effect of the fluctuation of state of polarization (SOP) on the BER performance of POLSK homodyne system.

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.

This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum's scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. We show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes provide signature confirmation and disavowal with the same protocol (or at the same time).

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.