We present a 44 matrix-based analysis of scattering form a two-dimensional rectangular resistive plane gratings placed on an anisotropic dielectric slab. The solution procedure used is formulated by extending the 44 matrix approach. The fields are expanded in terms of two-dimensional Floquet modes. Total fields can be given as sum of primary and secondary fields whose expression are obtained through eigenvalue problem of coupled wave matrix. Unknown currents on resistive patches are determined by applying Galerkin's method to the resistive boundary condition on resistive grating. Results are compared with other numerical examples available in the literature for isotropic cases. Further, numerical calculation are performed in the case of gratings with polar-type anisotropic slab.

In this paper, a new optimum input encoding algorithm with m-out-of-2m code which is called Half-Hot Code is presented. By applying Half-Hot Code to the input encoding in PLA-based digital system, the logic functions of the system turn out to be unate functions, thus, the number of bit-lines of PLA may be reduced. The proposed method further reduces the number of product-lines of PLA optimally. In this code assignment procedure, computed Boolean subspaces satisfying suggeset two conditions are assigned to each partitioned subset of digital input variables which are obtained by disjoint minimization or other techniques. As an experiment to evaluate the method, the state assignment for finite state machines of two-lavel implementation is considered. Specifically, the proposed Half-Hot Code assignment is compared with arbitrary Half-Hot Code assignment. The results show that the optimum encoding is superior to an arbitrary assignment up to about 24% in the number of product-lines of PLA.

Portable terminals have the potential of providing information and communication services not only to computer experts at their offices but also to many users being in a variety of daily life situations. The current user interfaces (UIs) of portable terminals are not suitable for a novice user of computers; they require some knowledge on computers from a user. To overcome this problem, the authors tried to implement their knowledge on the daily life in the design of a UI for novice users. As a result, two UI mechanisms, called Novice Interface and Graphical Metaphor Interface, which provide operations, expressions, and data structures in a way similar to those usually used in daily life are proposed. Novice Interface is to provide easy to use environment. It adopts a direct manipulation device with three buttons and a model of data structures, called Small World Model, that limits the number of functions and the depth of hierarchical menu. Graphical Metaphor Interface, being an extension of Novice Interface, is to provide services with a display screen that makes them well-understandable for any user. The proposed UI mechanisms were implemented in a prototype terminal and its software platform. The former offers several applications of the information services (like teleshopping, home banking, or database retrieval) and the communication services (like pen-based image mail, software fax, or telewriting); the latter enables those application programs to provide a consistent UI.

The complex refractive indices n-jχ of typical magnetic fluids were evaluated for the sake of utilizing them as optical materials. Transmission and reflection spectra were measured in the wavelength range of 0.6-1.6 µm by using monochromators. Magnetic fluids were put into glass cells of 2.5-14-µm thickness for transmission measurement. Due to the absorption by magnetic fluids, the transmittance decreased notably with the increase of the sample thickness. The extinction coefficient χ was evaluated from the dependence of the transmittance on the sample thickness. χ was found to vary between 0.003 and 0.03 depending upon wavelength. The refractive index n was evaluated by fitting theoretical curves to the reflectances that were measured for various incident angles. n was found to vary between 1.6 and 1.7 depending slightly on wavelength. Since a magnetic fluid is a composite of ferrite particles and a solvent, the refractive index can be calculated by using the effective medium theory. The calculated value agreed well with the experimental value. Preliminary experiment of optical switching was also demonstrated by utilizing the mobility of a magnetic fluid.

The rapid progress in semiconductor technology and chip mounting technology has made it possible to produce portable computes with high performance, such as notebook computers and PDAs. Portable computes can be used anytime and anywhere. By using the features of mobility, some cooperative works anywhere with multiple portable computers have been realized. However, present networks such as a wireless LAN or a public wireless network are too limited to permit portable computers to cooperate with each other. As the result, a new networking technology for portable computers has been highly requested. In this paper, we propose a novel network technology suitable for face-to-face communication, which we call "Wireless DAN" (Desk Area Network). Here, face-to-face communication is a communication between people who can directly see faces and hear voices with each other. In Wireless DAN, computers independently recognize the network configuration around them. Although present computer networks assume permanence and all computers must be registered before the system can be used, Wireless DAN enables a computer to communicate with computers nearby at any place the user goes without any complicated procedures or dedicated network equipment such as a base station. We also present a new support system for face-to-face cooperative work, which makes it possible to join or leave a meeting while it is in progress. We have developed an experimental system of Wireless DAN and the support system, which is comprised of notebook personal computers with an existing peer-to-peer infrared LAN card. The support system has been implemented using the functions provided by Wireless DAN and thus the system has been simplified. With the experimental system, we confirmed that Wireless DAN operates effectively for face-to-face communication.

The integration of both real-time systems and fault-tolerant systems has been emerged as one of the greatest challenges of this decade. It is called a responsive system, which has the objective to optimeze both timeliness and reliability. The performance measure in responsive systems is responsiveness that tells how probable a system executes correctly on time with faults occurred. While there have been some achievements in communication protocols and specification, we believe that scheduling problems in responsive systems are not understood deeply and sufficiently, yet. In this paper, we discuss the scheduling problem in responsive systems. At first, we investigate the issues in the scheduling and propose the precise definition of the responsiveness. We also suggest a scheduling algorithm called Responsive Earliest Deadline First (REDF) for preemptive aperiodic tasks in a uniprocessor system. We show that REDF is optimal to obtain the maximum responsiveness, and the time complexity is analyzed to be (N 2N). By illustrating a contradictory example, it is shown that REDF can be enhanced if a constraint on tasks is released.

The pendulum equation with a periodic impulsive force is investigated. This model described by a second order differential equation is also derived from dynamics of the stepping motor. In this paper, firstly, we analyze bifurcation phenomena of periodic solutions observed in a generalized pendulum equation with a periodic impulsive force. There exist two topologically different kinds of solution which can be chaotic by changing system parameters. We try to stabilize an unstable periodic orbit embedded in the chaotic attractor by small perturbations for the parameters. Secondly, we investigate the intermittent drive characteristics of two-phase hybrid stepping motor. We suggest that the unstable operations called pull-out are caused by bifurcations. Finally, we proposed a control method to avoid the pull-out by changing the repetitive frequency and stepping rate.

In the program development process, it is ofren necessary for programmers to know the differences between two programs, or two different versions of a program. Since programs have structures such as iteration statement and selection statement, applying text-based tools such as UNIX diff to identify the differences may produce unsatisfactory results. In this paper, we exploit a tree as the internal representation of a program, obtain the mapping between two trees and display the program differences visually based on the mapping and pretty-printing technique so that the structural differences can be identified immediately.

This paper is concerned with synthesizing VLSI array processors from iterative algorithms. Our primary objective is to obtain the highest processor efficiency but not the shortest completion time. Unlike most of the previous work that assumes the index space of the given iterative algorithm to be boundless, the proposed method takes into account the effects of the boundaries of the index space. Due to this consideration, the pseudo-dependence relations are excluded, and most of the independent computations can therefore be uniformly grouped. With the method described in this paper, the index space is partitioned into equal-size blocks and the corresponding computations are systematically and uniformly mapped into processing elements. The synthesized VLSI array processors possess the attractive feature of very high processor efficiency, which, in general, is superior to what is derived from the conventional linear transformation methods.

In the paper a problem of wave scattering from a local penetrable inhomogeneity inside a planar dielectric waveguide is studied. The surface potentials method is applied for the problem and the set of systems of BIE is obtained and analyzed from the view-point of their numerical solution. The effective numerical algorithm based on the Nyström method is proposed. The equations for a scattering diagram and mode conversion coefficients are derived.

The main purpose of this paper is to give a new representation method of the convergence characteristics of the LMS algorithm using tap-input vectors. The described representation method is an extended version of the interpretation method based on the orthogonal projection. Using this new representation, we can express the convergence characteristics in terms of tap-input vectors instead of the eigenvalues of the input signal. From this representation, we consider a general method for improving the convergence speed.

The radiation and scattering characteristics of a metal-strip grating of finite extent printed on the surface of a dielectric waveguide are analyzed within a two-dimensional model. The diffraction properties are obtained from a solution to the problem of surface mode scattering by a finite number of metal strips, taking into account their mutual couplings. The analysis is based on the electromotive force technique which does not require a grating to be periodic. Obtained results concern the antenna applications of radiating gratings excited by the dominant TE or TM surface mode of the wavegude. The proposed approach can be applied not only to the design of radiators but also filters based on periodic strip gratings.

This paper proposes a new algorithm called the fast Projection algorithm, which reduces the computational complexity of the Projection algorithm from (p+1)L+O(p3) to 2L+20p (where L is the length of the estimation filter and p is the projection order.) This algorithm has properties that lie between those of NLMS and RLS, i.e. less computational complexity than RLS but much faster convergence than NLMS for input signals like speech. The reduction of computation consists of two parts. One concerns calculating the pre-filtering vector which originally took O(p3) operations. Our new algorithm computes the pre-filtering vector recursively with about 15p operations. The other reduction is accomplished by introducing an approximation vector of the estimation filter. Experimental results for speech input show that the convergence speed of the Projection algorithm approaches that of RLS as the projection order increases with only a slight extra calculation complexity beyond that of NLMS, which indicates the efficiency of the proposed fast Projection algorithm.

We propose an equivalent circuit model described by the Rössler equation. Then we can consider a coupled Rössler system with a physical meaning on the connection. We consider an oscillatory circuit such that two identical Rössler circuits are coupled by a resistor. We have studied three routes to entirely and almost synchronized chaotic attractors from phase-locked periodic oscillations. Moreover, to simplify understanding of synchronization phenomena in the coupled Rössler system, we investigate a mutually coupled map that shows analogous locking properties to the coupled Rössler System.

Secure communications via chaotic synchronization is experimentally demonstrated using 3-pieces of commercial integrated circuit phase-locked loops, MC14046. Different from the conventional chaotic synchronization secure communication systems where one channel is used, our system uses two channels to send one signal to be concealed. Namely, one channel is used to send a synchronizing chaotic signal. The other channel is used to send the informational signal superimposed on the chaotic masking signal at transmitter side. The synchronizing chaotic signal is applied as a common input to two identical PLL's located at both transmitter and receiver sides. It has been shown previously by us that the VCO inputs of almost identical two PLL's driven by a common chaotic signal become chaotic, and synchronized with each other. This synchronization is only possible for those who knows exact internal configuration and exact parameter values of the PLL at transmitter side. Therefore, we can use the synchronized VCO input signal as a masking signal which can be used as a key for secure communications. The advantage of this method compared to the previous one channel method is that informational signal frequency range does not affect the quality of recovered signal. Our experiments demonstrate good masking and recovery characteristics for sinusoidal, triangular, and square waves.

A folded short in parallel-plate waveguide is investigated using the Fourier transform and the mode-matching. A fast-converging series solution for scattering from the folded short is obtained and its characteristics are presented. Our solution for the E-plane short agrees well with measurements and is numerically more efficient than the existing moment-method solution. The presented scattering characteristics are useful for the design of the E- and H -plane shorts in rectangular waveguide.

The concept of a new visual communication environment is proposed. The proposed system is a shared and interactive multi-user virtual space that consists of a CG-based virtual space structure and video-based objects. Human interface design issues are discussed from the view point of creating a new reality for enhanced communication.

We propose a new high-performance message router for k-ary n-cube multicomputer systems, called the Tokky router. The router utilizes a small number of queues at the outputs of its communication ports to allow fully adaptive routing, misrouting to prevent deadlocks and randomization to prevent livelock. Uncongeste network performance is improved by the inclusion of the packet expressway. Accurate models are developed to predict the switch and buffer performance of routers for varying radix and dimension and these models can be used in the design of routers for networks other than those investigated here. The simulated performance of the router exceeds that of published results for oblivious routers and is equal to or exceeds those reported for other adaptive routers. These performance predictions are especially encouraging when the simplicity of the control structures required to implement the router are taken into consideration.

One of the major open issues in neural network research includes a Network Designing Problem (NDP): find a polynomial-time procedure that produces minimal structures (the minimum intermediate size, thresholds and synapse weights) of multilayer threshold feed-forward networks so that they can yield outputs consistent with given sample sets of input-output data. The NDP includes as a sub-problem a Network Training Problem (NTP) where the intermediate size is given. The NTP has been studied mainly by use of iterative algorithms of network training. This paper, making use of both rate distortion theory in information theory and linear algebra, solves the NDP mathematically rigorously. On the basis of this mathematical solution, it furthermore develops a mathematical solution Procedure to the NDP that computes the minimal structure straightforwardly from the sample set. The Procedure precisely attains the minimum intermediate size, although its computational time complexity can be of non-polynomial order at worst cases. The paper also refers to a polynomial-time shortcut to the Procedure for practical use that can reach an approximately minimum intermediate size with its error measurable. The shortcut, when the intermediate size is pre-specified, reduces to a promising alternative as well to current network training algorithms to the NTP.

We present that event-transition diagrams are useful to analyze event concurrent response visually. Event-transition diagrams are dual for state-transition diagrams in graph theory. As an example of an usage of an event-transition diagram, a simple model of a railroad crossing is presented.