This paper concerns multiple-valued logical function realized by asynchronous circuit that may have feed-back loops and its completeness problems. The first aim is to give mathematical definition of an asynchronous circuit over multiple-valued logical functions and of the realization of multiple-valued logical function by means of an asynchronous circuit. For asynchronous element, the definition of circuit construction and initialization are very sensitive. A slight modification may have a considerable influence on the completeness. We consider three types of completeness (LF-, GS-, NS-completeness) for a set of multiple-valued logical functions. The LF-completeness means completeness of logical functions realized loop-free cirucit. The GS-completeness means completeness under general initialization assumption. The NS-completeness measn completeness under initialization by input assumption. The second aim is to give a completeness criterion for each type of completeness. This aim is realized for LF-completeness in general case and GS-completeness in ternary case. A completeness criteria for GS-completeness and NS-completeness are given under strong conditions.

This paper proposes a new formulation which minimizes the differential entropy for an optimal control problem. The conventional criterion of the optimal regulator control is a standard quadratic cost function E[M{x(t)}2} + N{v(t)}2], where x(t) is a state variable, u(t) is an input value, and M and N are positive weights. However, increasing the number of the variables of the system it is complex to find the solution of the optimal regulator control. Therefore, the simplicity of the solution is required. In contrast to the optimal regulator control, we propose the minimum entropy control which minimizes a differential entropy of the weighted sum of x(t) and u(t). This solution is derived on the assumptions that the linear control and x(t)u(t) 0 are satisfied. As the result, the formula of the minimum entropy control is very simple and clear. This result will be useful for the further work with multi variables of simple control formulation.

In an adaptive load balancing, the location policy to determine a destination node for transferring tasks can be classified into three categories: dynamic selection, random selection, and state polling. The dynamic selection immediately determines a destination node by exploiting the state information broadcasted from other nodes. It not only requires the overheads of collecting the state information, but may cause an unpredictable behavior unless the state information is accurate. Also, it may not guarantee even load distribution. The random selection determines a destination node at random. The state polling determines a destination node by polling other nodes. It may cause some problems such as useless polling, unachievable load balancing, and system instability. A new Sender-initiated Adaptive LOad balancing scheme (SALO) is presented to remedy the above problems. It determines a destination node by exploiting the predictable state knowledge and by polling the destination node. It can determine a good destination with minimal useless polling and guarantee even load distribution. Also, it has an efficient mechanism and good data structure to collect the state information simply. An analytic model is developed to compare with other well known schemes. The validity of the model is checked with an event-driven simulation. With the model and the simulation result, it is shown that SALO yields a significant improvement over other schemes, especially at high system loads.

In order to establish the advanced and costeffective wet cleaning technology, it is essential to reveal the mechanism of contamination adhesion and removal on Si surfaces in solutions. To reveal the mechanism of noble metal adhesion onto the Si surface in wet processes, the behavior of Cu2+ deposition onto Si surfaces in solutions was investigated. The experimental results reveal the mechanism of electrochemical metallic contamination of noble metals on Si surfaces. Moreover, it was found that, in HF solutions, Si is not directly etched in a form of SiF62- by such an oxidizing agent as Cu2+ but is first turned to oxide and then etched off. For preventing noble metal deposition on Si surfaces, it is necessary not only to keep the noble metals in the solution (i.e. to dissolve noble metals) but also to prevent oxidation/reduction reaction between Si and the noble metal ion. It is found that this oxidation/reduction reaction can be prevented by increasing the redox potential of solutions, injecting surfactants or chelating agents, and making the Si surface covered with oxide. It has been revealed that Cu deposition can be prevented by setting the redox potential of the solution at over 0.75 V vs. NHE. Cu deposition in DHF solutions can be prevented by setting the redox potential at 0.85 V vs. NHE or more. For removing Cu from the Si surface, the same conditions are found to be necessary. Moreover, it is revealed that metallic impurities included in the oxide can be removed only by etching. It is also revealed that chemicals to prevent metal deposition must be used to remove metals such as Cu which easily get redeposited on the bare Si surface. Finally, a new wet cleaning process employing ozonized ultrapure water, NH4OH/H2O2/H2O, and surfactant-injected DHF to replace the conventional RCA cleaning method is proposed.

Several papers have been shown equalization in the reception side. However, equalization in transmission side that is partial response signaling (PRS) or precoding is also possible in a two-way interactive communication such as time or frequency division duplex (TDD of FDD). This paper proposes and investigates a system which includes a transmission equalization and reception equalization based on an array antenna. This system is the extension in spatial and temporal domains. The channel capacity can be improved in the super channel which includes the transmitter and receiver array antenna.

A new electron-beam wafer inspection system has been developed. The system has a resolution of 5 nm or better, and is applicable to quarter-micron devices such as 256 Mbit DRAMs. The most remarkable feature of this system is that a specimen stage is built in the objective lens and allows a working distance (WD) of 0. "WD=0"minimizes the effect of lens aberrations, and maximizes the resolving power. Innovative designs to achieve WD=0 are as follows: (1)A large objective lens of 730-mm width 730-mm depth 620-mm height that serves as a specimen chamber, has been developed. (2)A hollow specimen stage made of non-magnetic materials has been developed.It allows the lower pole piece and magnetic coile of the objective lens inside it. (3)Acoustic motors made of non-magnetic materials are em-ployed for use in vacuum.

This letter shows that a portable visual stimulator for MEG measurements can be realized using an optical fiber bundle and a CRT display system offering high brightness and high speed raster scanning, and that MEGs with neither magnetic contamination nor jitter can be measured by the stimulator.

A learning algorithm is presented for nearest neighbor pattern classifiers for the cases where mixed supervised and unsupervised training data are given. The classification rule includes rejection of outlier patterns and fuzzy classification. This partially supervised learning problem is formulated as a multiobjective program which reduces to purely super-vised case when all training data are supervised or to the other extreme of fully unsupervised one when all data are unsupervised. The learning, i. e. the solution process of this program is performed with a gradient method for searching a saddle point of the Lagrange function of the program.

We create a new version of the FEAL-N(X) cryptographic function, called FEAL-N(X)S, by introducing a dynamic swapping function. FEAL-N(X)S is stronger against Differential Cryptanalysis in the sense that any characteristic for FEAL-N(X) is less effective when applied to FEAL-N(X)S. Furthermore, the only iterative characteristics. that may attack the same number of rounds for the two versions are the symmetric ones, which have an average probability bounded above by 2-4 per round, i.e., the FEAL-N(X)S is at least as strong as DES with respect to this type of characteristic. We also show that in general the probability of an iterative characteristic for the FEAL-N(X) that is still valid for FEAL-N(X)S is decreased by 1/2 per round. Some of the best characteristics are shown. Experimental results show that the running time required by FEAL-N(X)S is around 10% greater compared to FEAL-N(X), in software; but this price is small compared to the gained strength against Differential Cryptanalysis.

In CRYPTO '94, Langford and Hellman attacked DES reduced to 8-round in the chosen plaintext scenario by their "differential-1inear cryptanalysis," which is a combination of differential cryptanalysis and linear cryptanalysis. In this paper, a historical review of differential-linear cryptanalysis, our formalization of differential-linear cryptanalysis, and the application of differential-linear cryptanalysis to FEAL-8 are presented. As a result, though the previous best method (differential cryptanalysis) required 128 chosen plaintexts, only 12 chosen plaintexts are sufficient, in computer experimentations, to attack FEAL-8.

A new approach is presented for recovering the 3-D shape from shading image. Photometric Stereo Method (PSM) is generally based on the direct illumination. PSM in this paper is modified with the indirect diffuse illumination method (IDIM), and then applied to hybrid reflectance model which consists of two components; the Lambertian reflectance and the specular reflectance. Under the hybrid reflectance model and the indirect diffuse illumination circumstances, the 3-D shape of objects can be recovered from the surface normal vector extracted from the surface roughness, the surface reflectance ratio, and the intensity value of a pixel. This method is rapid because of using the reference table, simplifies the restriction condition about the reflectance function in prior studies without any loss in performance, and can be applied to various types of surfaces by defining general reflectance function.

A continuous-wave ultrasonic Doppler system using wide field ultrasound transducers was applied to telemeter blood velocity from the carotid artery of exercising subjects. Velocity spectrogram was obtained by Hanning windowed fast Fourier transformation of the telemetered data. Distortion caused by a high-pass filter and transducers in the telemetry system was discussed in the paper. As the maximum Reynolds number in our experiment was 1478 which is smaller than the critical level of 2000, the blood flow should be laminar. Spatial velocity profiles were then reconstructed from the velocity spectrogram. In this paper, we defined a converging index Q of the velocity spectrum to measure the bluntness of the spatial velocity distribution across the blood vessel. Greater Q, the blunter the velocity profile will be. Simulation results for spatial velocity distributions of theoretical parabolic flow and Gaussian-distribution spectra with varied Q value showed that the cut-off effect by a high-pass filter of cut-off frequency fc=200Hz in our system could be ignored when the axial velocity is larger than 0.30 m/s and Q is greater than 2.0. Our experimental results, in contrast to those obtained from phantom systems by us and by Hein and O'Brien, indicate that the distribution of blood velocity is much blunter than previously thought. The Q index exceeded 10 during systole, whereas it was 0.5 in parabolic flow. The peak of Q index lagged behind that of axial blood velocity by approximately 0.02s. The phase delay of the Q index curve might be due to the time needed for the red blood cells to form the non-homogeneous distribution.

This work deals with thermal-noise modeling for silicon vertical bipolar junction transistors (BJTs) and relevant integrated circuits (ICs) operating at low currents. The two-junction BJT compact model is consistently derived from the thermal-noise generalization of the Shockley semiconductor equations developed in work which treats thermal noise as the noise associated with carrier velocity fluctuations. This model describes BJT with the Itô non-linear stochastic-differential-equation (SDE) system and is suitable for large-signal large-fluctuation analysis. It is shown that thermal noise in silicon p-n-junction diode contributes to "microplasma" noise. The above model opens way for a consistent-modeling-based design/optimization of bipolar device noise performance with the help of theory of Itô's SDEs.

In arithmetic units multiplication is a very important operation. It is a common approach to use the modified Booth's algorithm to reduce the number of partial products in a multiplication and speed it up. In this letter we show two circuits that fuse the usually separate functions of generating the partial products and selecting them. The circuits designed in DPL (Double Pass-transistor Logic) are bigger in MOS transistors, but are faster and, function at higher frequencies than a typical CMOS implementation. One of our circuits also has lower power consumption.

The MUSIC algorithm has proven to be an effective means of estimating parameters of multiple incoherent signals. Furthermore, the forward-backward (FB) spatial smoothing technique has been considered the best preprocessing method to decorrelate coherent signals. In this paper, we propose a novel preprocessing technique based upon ideas associated with the FB and adaptive spatial smoothing techniques and report on its superiority in numerical simulations.

Queries to generate a map from geographic detabases are too large and complex for users to specify all components in it. Thematic parts of the map should be described by users as ad hoc queries. However, background parts of it should be inferred from users' queries corresponding to the thematic parts. Furthermore, it is important for the map systems to lead users' constructing their ad hoc queries and to infer visualization methods applied to the data retrieved by the ad hoc queries. This paper discusses a framework to infer supplemental queries and visualization methods in order to make the retrieval results into a feasible map using geographic domain hierarchical levels, geographic domain thesauruses and existing example queries. The framework allows users to know mismatches of components in queries, inappropriate queries for maps, and deriving candidates for additional components in queries.

This paper proposes and investigates a tap selectable Viterbi equalizer for mobile radio communications. When the multipath channel is modeled by a tapped delay line only, the taps which may seriously affect the data sequence estimation are selected and used to calculate the trellis metric in the Viterbi algorithm. The proposed equalization algorithm can reduce the number of path metric calculations and the number of path selections in the Viterbi algorithm. Moreover, we propose an extended equalizer which has antenna diversity. This equalizer calculates the path metric using the antenna outputs and results of channel estimators. Computer simulation is used to evaluate the BER performance of the proposed equalizer in a multipath radio channel.

This paper addresses approaches to enhancement of performance of the CMA (Constant Modulus Algorithm) adaptive array antenna in multipath environments that characterize the mobile radio communications. The cost function of the CMA reveals that it has an AGC (Automatic Gain Control) procedure of holding the array output voltage at a constant value. Therefore, if the output voltage by the initial weights is different from the object value, then the CMA may suffer from slow convergence because suppression of the multipath waves is delayed by the AGC behavior. Our objective is to improve the convergence characteristics by adopting the differential CMA for the adaptive array algorithm. First, the basic performance of the differential CMA is clarified via computer simulation. Next, the differential CMA is incorporated into the eigen-beamspace system in which the eigenvectors of the correlation matrix of array inputs are used in the BFN (Beam Forming Network). This BFN creates the optimum orthogonal multibeams for radio environments and works helpfully as a preprocessor of the differential CMA. The computer simulation results have demonstrated that the differential CMA with the eigen-beamspace system has much better convergence characteristics than the conventional CMA with the element space system. Furthermore, a modified algorithm is introduced which gives the stable array output voltages after convergence, and it is confirmed that the algorithm can carry out more successful adaptation even if the radio environments are changed abruptly.

In this paper, we analyze the convergence behavior of the CMA (Constant Modulus Algorithm) adaptive array working under the steepest decent method, and investigate how to achieve the highest possible output SINR (Signal to Interference plus Noise Ratio). In multipath radio environments, CMA sometimes suppresses the desired signal (stronger one) and selects to receive the interference (the weaker one) resulting in the low output SINR. This is one of the problems met in an optimization system under a nonlinear control equation where there are two or more local minima of the cost function and the final state depends on the initial condition. The study can be done only numerically by starting from various initial values. In our analysis of the CMA adaptive array in multipath radio environments, we will assume that there are two waves which are radiated from the same source and try to find out what conditions may affect the convergence behavior. In this process, we discover the effect of the neglected factor by the previous papers and revise the initial condition to guarantee the reception of the desirable wave. In conclusion, we propose the prescription of the initial weights of the array elements as well as the choice of preferable arrays.

This paper proposed a practical method of program validation for state-based reactive concurrent systems. The proposed method is of particular relevance to plant control systems. Plant control systems can be represented by extended state transition systems (e.g., communicating asynchronous transition systems). Our validation method is based on state space analysis. Since naive state space analysis causes the state explosion problem, techniques to ease state explosion are necessary. One of the most promising techniques is the partial order method. However, these techniques usually require some structural assumptions and they are not always effective for actual control systems. Therefore, we claim integration and harmonization of verification (i.e., state space analysis based on the partial order method) and simulation (i.e., conventional validation technique). In the proposed method, verification is modeled as exhaustive simulation over the state space, and two types of simulation management techniques are introduced. One is logical selection (pruning) based on the partial order method. The other is heuristic selection based on priority (a priori precedence) specified by the user. In order to harmonize verification (logical selection) and conventional simulation (heuristic selection), we propose a new logical selection mechanism (the default priority method). The default priority method which prunes redundant state generation based on default priority is in harmony with heuristic selection based on the user's priority. We have implemented a practical validation tool, Simulation And Verification Environment for Reactive Concurrent Systems (SAVE/RCS), and applied it to chemical plant control systems.