This paper discusses the design, implementation, and performance of a bus-connected multiprocessor, called Presto, for a Rete-based production system. To perform a match, which is a major phase of a production system, a Presto match scheme exploits the subnetworks that are separated by the top two-input nodes and the token flow control at these nodes. Since parallelism of a production system can only increase speed 10-fold, the aim is to do so efficiently on a low-cost, compact bus-connected multi-processor system without shared memory or cache memory. The Presto hardware consists of up to 10 processisng elements (PEs), each comprising a commercial microprocessor, 4 Mbytes of local memory, and two kinds of newly developed ASIC chips for memory control and bus control. Hierarchical system software is provided for developing interpreter programs. Measurement with 10 PEs shows that sample programs run 5-7 times faster.

This paper describes the configuration and performance of a stable, high compression video coding scheme suitable for broadcast quality. This scheme was developed for application to high quality image packet transmission in Asynchronous Transfer Mode (ATM) networks. There are two problems in implementing image packet transmission in ATM networks, namely the achievement of a compression scheme with high coding efficiency, and the achievement of an effective compensation method for cell loss. We describe a scheme which resolves both these problems. It comprises the division of a two-dimensional spectral image signal into several sub-bands. In the case of the high frequency band, block-matching interframe prediction and Discrete Cosine Transform (DCT) are applied to achieve high compression ratio, while intraframe DCT coding is applied to the baseband. This scheme, moreover, provides a stable compensation for cell loss. It is shown that, based on this system, an original image signal of 216Mbit/s is compressed to about 1/10, and a high quality reconstructed image stable to cell loss is obtained.

A new class of (m23m1,m2) 1-step majority-logic decodable double error correcting codes (1-step DEC codes) is described, where m is an odd integer. Combining this code with properly constructed (m1k1,k1) and (m,k2) 1-step DEC codes, a (m23(mk1)1,m23k1) 1-step DEC code and a (m23(mk2)1,m2) 2-step majority-logic decodable DEC code (2-step DEC code) are obtained, respectively. Considering computer memory applications, some practical 1 -and 2-step DEC codes with data-bit lengths of 24, 32, 64 and 72 are obtained by shortening the new codes, and are compared to existing majority-logic decodable DEC codes. It is shown that, for given data-bit lengths, new 2-step DEC codes have much better code rates than self-orthogonal DEC codes but slightly worse code rates than existing 2-step majority-logic decodable cyclic DEC codes (2-step cyclic DEC codes). However, parallel decoders of new 2-step DEC codes are much simpler than those of exisiting 2-step cyclic DEC codes, and are nearly as simple as those of 1-step DEC codes.

This paper presents a destributed algorithm that uses weak copy consistency to create mutual exclusion in a distributed computer system. The weak copy consistency is deduced from the uncertainty of state which occurs due to the finite and unpredictable communication delays in a distributed environment. Also the method correlates outdated state information to current state. The average number of messages to enter critical section in the algorithm is n/2 to n messages where n is the number of sites. We show that the algorithm achieves mutual exclusion and the fairness and liveness of the algorithm is proven. We study the performance of the algorithm by simulation technique.

The outputs of all gates in a circuit are assumed to be observable unber the highly observable condition, which is mainly based on the use of E-beam testers. When using the E-beam tester, it is desirable that the test set for a circuit is small and the test vectors in the test set can be applied in a successive and repetitive manner. For a combinational circuit, these requirements can be satisfied by modifying the circuit into a k-UCP circuit, which needs only a small number of tests for diagnosis. For a sequential circuit, however, even if the combinational portion has been modified into a k-UCP circuit, it is impossible that the test vectors for the combinational portion can always be applied in a successive and repetitive manner because of the existence of feedback loops. To solve this problem, the concept of k-UCP scan circuits is proposed in this paper. It is shown that the test vectors for the combinational portion in a k-UCP scan circuit can be applied in a successive and repetitive manner through a specially constructed scan-path. An efficient method of modifying a sequential circuit into a k-UCP scan circuit is also presented.

Information geometry is a new powerful method of information sciences. Information geometry is applied to manifolds of neural networks of various architectures. Here is proposed a new theoretical approach to the manifold consisting of feedforward neural networks, the manifold of Boltzmann machines and the manifold of neural networks of recurrent connections. This opens a new direction of studies on a family of neural networks, not a study of behaviors of single neural networks.

This paper examines the key technologies and applications of optical frequency division multiplexing (OFDM) systems. It is clarified that a 100-channel OFDM system is feasible as a result of multichannel frequency stabilization, common optical amplification and channel selection utilizing a tunable optical filter. Transmission limitation due to fiber four-wave mixing is also described. Major functions and applications of the OFDM are summarized and the applicability of OFDM add/drop multiplexing is examined.

It is known that the uniquely decodable code pairs (C1, C2) for the two-user binary adder channel relates to the maximum independent set of a graph associated with a binary code. This paper formulates the independence number of a class of graphs associated with binary linear codes, and presents an algorithm of the maximum independent set for those graphs. Uniquely decodable code pairs (C1, C2)'s are produced, where C1 is a linear code and C2 is a maximum independent set of the graph associated with C1. For the given C1, the transmission rate of C2 is higher than that by Khachatrian, which is known as the best result as so far. This is not rather surprising because the code C2 is a maximum independent set in this paper but not be Khachatrian's.

A closure test MCT (meet-in-the-middle closure test) has been introduced to analyze the algebraic properties of cryptosystems. Since MCT needs a large amount of memory, it is hard to implement with an ordinary meet-in-the-middle method. As a feasible version of MCT, this paper presents a switching closure test SCT based on a new memoryless meet-in-the-middle method. To achieve the memoryless method, appropriate techniques, such as expansion of cycling detection methods for one function into a method for two functions and an efficient intersection search method that uses only a small amount of memory, are effectively used.

This paper investigates a method of dynamically adjusting inter-packet gaps in accordance with network conditions, and demonstrates that the number of dropped packets is a critical parameter for adjusting inter-packet gaps. This technique, known as rate flow control, can prevent overruns in high-speed, low-delay, low-error-rate networks.

Multiple-site diversity systems are foreseen for earth to satellite paths operating at frequencies above 10GHz in localities with high rain-induced attenuation. In some severe cases double-site protection can be proved to be inadequate and consequently triple-site diversity becomes indispensable. In the present paper, an approach for the prediction of the triple-site diversity performance based on an appropriate three-dimensional gamma distribution is proposed. The model is oriented for application to earth-space paths located in Japan and other locations with similar climatic conditions. Numerical results are compared with the only available set of experimental data taken from some parts of the United States. Some useful conclusions are deduced.

According to the development of optical communication technologies, it is getting easier to handle new devices, such as optical fibers, semiconductor light sources, guided wave devices, and optical integrated circuits. These devices have recently given considerable impact on the optical sensing field. The optical sensing shares the optical devices and the concepts of signal processing or system configuration with the optical communication. In this paper, the advanced lightwave sensing technology is discussed, considering the relation to the advanced optical communication technology. Distributed fiber sensors and the application of coherence characteristics of semiconductor light sources are the topics to be mainly discussed. In the distributed fiber sensors, the fiber plays both a role of low-loss transmission line and a role of lengthwise deployed sensing element. According to the change of characteristics of light propagating in the fiber, distribution of various physical parameters can be measured, such as the fiber loss, temperature, and strain. Optical Time Domain Reflectometry is employed to determine the location. Another tendency in the lightwave sensing field is the use of coherence characteristics of various semiconductor light sources. Low coherent source provide a highly sensitive inertial rotation sensor, that is, interferometric fiber optic gyroscope. Another type of optical gyroscope, optical passive ring-resonator gyro, has been studied as an application of a high coherence source. Frequency tunability of the semiconductor laser, especially that of tunable DFB or DBR lasers, can provide new ways in signal processing in the sensors. Optical coherence function can be synthesized also by utilizing the tunability. In conjunction with the progress in optical communication, lightwave sensing fields are steadily increasing.

Serious failures of the latest electronic equipments occur easily due to electrostatic discharge (ESD) , which can be caused frequently by the electrification phenomena of human-body walking on the floor. The number of the above damaging incidents has significantly been increasing with an increased use of integrated semiconductor elements with lower operation power. The most effective measures against the ESD consist in preventive ones, which are to obtain dynamic behaviors of the electric charge before the ESD happens, thereby preventing the charge accumulation. From this point of view, this paper describes new approaches for measurement of the static electricity directed toward preventing the ESD. First, a two-dimensional measurement method for visualizing charge distributions is described. This principle is based on visualizing the potential distribution induced in the array electrodes from the electrostatic fields. For showing usefulness of the visualization measurement, a prototype was built and attempts were made on the visualizations for the static electricity distributions of charged bodies. Second, a potential calculation of the human body charged by walking on the floor is described. A model was shown for analyzing the human-body potential on the floor, and the theoretical equation for describing the potential attenuation process was derived in the closed form in the Laplacian transformation domain. In order to obtain the typical half-life of the human-body potential, numerical computations were performed using a reverse Laplacian transformation. The experiments were also conducted for confirming the validity of the computed results. Finally, a new method is described for estimating dynamic behaviors of the occurrence charges of the human body electrified by walking-motions. Statistical measurements of the charges and potentials were made for the fundamental walking-motions specified here. The pace transitions of the potentials due to continuous walking and stepping were also measured and their results were explained from the electrification properties for the fundamental walking-motions.

Information technology equipment connected to telecommunications line can be a source of electromagnetic interference. Two sources of interference have been under evaluation. One is the digital pulses in the switching regulator and the clock oscillator, and the other is the signal's common mode voltage. In this paper, the interference-inducing mechanism for the signal's common mode voltage and a method for measuring the interference are described. An equivalent circuit representing both the equipment and the line is derived on the basis of the interference-inducing model. A method for estimating the signal's common mode voltage from the differential mode voltage and the line unbalance is obtained using the equivalent circuit. It is confirmed that the level difference between the estimated and the measured common mode level is less than 3dB.

Recent progress in electromagnetic compatibility (EMC) technology has created a need for small and wideband antennas that can be used to measure the quality of EMC measurement facilities and to measure electric field strength for immunity tests and human hazard studies. Antennas using fiber optics are being developed because this kind of antenna has the wideband property and can eliminate the influence of the coaxial cable. This paper first summarizes the development of fiber optic antennas for EMC measurement and the construction of practical fiber optic antennas. It then describes the recent progress that has been made in Japan. This progress includes the electromagnetic source and the electric field sensor using a spherical dipole antenna with O/E or E/O converters, and it includes a wideband electric field sensor using electro-optical crystals.

A Discrete Event System (DES) is a system that is modeled by a finite automaton. A Cooperating Discrete Event System (CDES) is a distributed system which consists of several local DESs which are synchronized with each other to accomplish its own goal. This paper describes the automatic synthesis of a CDES from a modular temporal logic specification. First, MPTS (Modular Practical Temporal Specification language) is proposed in which the new features (modular structure and domain specification) are appended to temporal logic. To overcome the "state explosion problem", which occurs in generating a global automaton in former synthesis methods using temporal logic, a compositional synthesis is proposed where automata are reduced at every composition step.

LOTOS is a language developed within ISO for the formal description of communication protocols and distributed systems. In LOTOS, requirements for a distributed system are called a "service specification". Each node exchanges synchronization messages to ensure the temporal ordering for the execution of events in a service specification. The actions of each node are described as a "protocol specification". This paper gives a survey for a method to derive protocol specifications from a service specification written in a LOTOS based language. In order to derive the protocol specifications, we make the syntax tree of a given service specification and give some attributes for each node in the tree. The protocol specifications are derived automatically by evaluating these attributes. The derived protocol specifications satisfy the given service specification. We also explain a LOTOS simulator for the execution of derived protocol specifications. The related works are also summarized.

A new model for a computer simulation of RF capacitive type hyperthermia has been developed by taking account of the following points. Blood flow is usually determined by many physiological parameters, but is regarded as a function of only blood temperature under some conditions. The temperature dependence of blood flow of tumors and normal tissues is assumed by referring the data obtained by Song et al. and Tanaka. The blood temperature which is elevated by externally applied power significantly affects temperatures of the body and the tumors. The transport of heat from the body surface is studied by considering air convection. These points are examined by experiments on a computer with simple phantom models and real patients. The results of simulation on the patient have shown a good agreement with clinical inspection based on CT images and a temperature of the stomach.

It is sometimes required to change the frequency characteristics of a digital filter during its operation. In this paper a new synthesis of variable even-order IIR digital filters is proposed. The cut-off frequency of the filter can be changed by a single parameter. The fundamental filter structure is a cascade of second-order sections. The multiplier coefficients of each section are determined by using the Taylor series expansion of the lowpass to lowpass frequency transformation. For this method any second-order section can be used as a prototype, but here in this paper only the direct form and the lattice form are described. Unlike the conventional method, any transfer functions can be used for the proposed method. Finally a designed example shows that the proposed filter has wider tuning range than the conventional filter, and the advantage of the proposed filters is confirmed.

The aim of this article is to show the effectiveness of exploiting separability in numerical analysis of nonlinear systems. Separability is a valuable property of nonlinear mappings which appears with surprising frequency in science and engineering. By exploiting this property, computational complexity of many numerical algorithms can be substantially improved. However, this idea has not been received much attention in the fields of electronics, information and communication engineerings. In recent years, efficient algorithms that exploit the separability have been proposed in the areas of circuit analysis, homotopy methods, integer labeling methods, nonlinear programming, information theory, numerical differentiation, and neural networks. In this article, these algorithms are surveyed, and it is shown that considerable improvement of computational efficiency can be achieved by exploiting the separability.