This paper presents a method, called reduced scan shift, which generates short test sequences for full scan circuits. In this method, scan shift operations can be reduced, i.e., not all but part of flip-flops (FFs) are controlled and observed. This method, unlike partial scan methods, does not decrease fault coverage. In the reduced scan shift, test vectors for the combinational part of a circuit are fistly generated. Since short test sequence will be obtained from the small test vectors set, test compaction techniques are used in the test vector generation. For each test vector in the obtained test set, it is found which FFs should be controlled or observed. And then a scan chain is configured so that FFs more frequently required to be controlled (observed) can be located close to the scan input (output). After the scan chain is configured, the scan shift requirement is examined for the essential faults of each test vector. Essential fault is defined to be a fault which is detected by only one test vector but not other test vectors. The order of test vectors is carefully determined by comparing the scan control requirement of a test vector with the scan observation requirement of another test vector so that unnecessary scan shift operations only for controlling or observing FFs can be reduced. A method of determining the order of test vectors with state transition is additionally described. The effectiveness of the proposed method is shown by the experimental results for benchmark circuits.

It is shown that for a class of interval matrices we can estimate the location of eigenvalues in a very simple way. This class is characterized by the property that eigenvalues of any real linear combination of member matrices are all real and thus includes symmetric interval matrices as a subclass. Upper and lower bounds for each eigenvalue of such a class of interval matrices are provided. This enables us to obtain Hurwitz stability conditions and Schur ones for the class of interval matrices and positive definiteness conditions for symmetric interval matrices.

Gate-controlled negative differential resistance (NDR) due to interband tunneling has been observed at room temperature in a Surface Tunnel Transistor (STT). The STT consists of a highly degenerate p+-drain, an n+-doped channel with an insulated gate, and an n+-source connected to the channel. To demonstrate application as a functional device, a bistable circuit consisting of only one STT and one load resistor was organized and its operation was confirmed. The obtained valley current in the NDR characteristics of the STT, however, is relatively large and limits the device performance. In order to clarify the origin of the valley current, we fabricated p+-n+ tunnel diodes in which growth interruption was done at the pn junction, and investigated the dependence of the NDR characteristics on both the impurity concentration at the regrown interface and the temperature. These measurements indicate that the valley current is mainly caused by the excess tunneling current through traps formed by the residual oxygen at the regrown interface.

For a complex object model, a form of range restriction called specialization constraint (SC), has been proposed, which is associated not only with the properties themselves but also with property value paths. The domain and range of an SC, however, were limited to single classes. In this paper, SCs are generalized to have sets of classes as their domains and ranges. Let Σ be a set of SCs, where each SC in Σ has a set of classes as its domain and a non-empty set of classes as its range. It is proved that an SC is a logical consequence of Σ if and only if it is a finite logical consequence of Σ. Then a sound and complete axiomatization for SCs is presented. Finally, a polynomial-time algorithm is given, which decides whether or not an SC is a logical consequence of Σ.

Exact analytical solutions for the steady-state transmission and reflection characteristics of a nonlinear Fabry-Perot resonator applicable to bistable optical devices are derived. The resonator consists of a Kerr-like nonlinear film sandwiched by reflection mirrors made of a quarter-wave dielectric stack. An equivalent mirrorless model has been introduced to facilitate the analysis. For both positive and negative nonlinear coefficients, the rigorous solutions have been simply expressed in terms of Jacobian elliptic functions.

The stability of a terminated two-port network is investigated, and the stability conditions with only one inequality are obtained. Furthermore, the stability conditions with two inequalities, which are in the same form as those for the passive terminations known at the present time, are also obtained.

Fabrication of all-epitaxial high-Tc SIS tunnel junctions requires an atomically flat superconducting thin film to be grown and a proper insulating material to be selected. First, we study the initial growth mode of YBCO thin films and show that reducing the growth rate results in a very smooth surface. Second, perovskite-related compound oxides, PrGaO3 and NdGaO3, which have a small lattice mismatch with YBCO and good wetability, are shown to be promising insulating materials for all-epitaxial SIS tunnel junctions. We believe that these concepts will be useful in the development of all-epitaxial high-Tc SIS tunnel junctions with good electrical properties.

This paper proposes a repairable and diagnosable k-valued cellular array. We assume a single fault, i.e., either stuck-at-O fault or stuck-at-(k1) fault of switches occurs in the array. By building in a duplicate column iteratively, when a stuck-at-(k1) fault occurs in the array, the fault never influences the output of the array. That is, we can construct a fault-tolerant array for the stuck-at-(k1) fault. While, for the stuck-at-O fault, the diagnosing method is simple and easy because we don't have to diagnose the stuck-at-(k1) fault. Moreover, our array can be repaired easily for the fault. The comparison with other rectangular arrays shows that our array has advantages for the number of cells and the cost of the fault diagnosis.

This paper presents an overview of the SDC-I (Super Database Computer I) developed at the University of Tokyo, Japan. The purpose of the project was to build a high performance SQL server which emphasizes query processing over transaction processing. Recently relational database systems tend to be used for heavy decision support queries, which include many join, aggregation, and order-by operations. At present high-end mainframes are used for these applications requiring several hours in some cases. While the system architecture for high traffic transaction processing systems is well established, that for adhoc query processing has not yet adequately understood. SDC-I proved that a parallel machine could attain significant performance improvements over a coventional sequential machine through the exploitation of the high degree of parallelism present in relational query processing. A unique bucket spreading parallel hash join algorithm is employed in SDC, which makes the system very robust in the presense of data skew and allows SDC to attain almost linear performance scalability. SDC adopts a hybrid parallel architecture, where globally it is a shared nothing architecture, that is, modules are connected through the multistage network, but each module itself is a symmetric multiprocessor system. Although most of the hardware elements use commodity microprocessors for improved performance to cost, only the interconnection network incorporates the special function to support our parallel relational algorithm. Data movement over the memory and the network, rather than computation, is heavy for I/O intensive database processing. A dedicated software system was carefully designed for efficient data movement. The implemented prototype consists of two modules. Its hardware and software organization is described. The performance monitoring tool was developed to visualize the system activities, which showed that SDC-I works very efficiently.

We propose a new structure of antenna system to enhance the horizontal plane gain and control the antenna pattern, using passive loading. Our proposed structure can be applied to various kinds of antennas on a handset. We discuss the case of a λ/4 monopole antenna on a handset in this paper. In a new structure of λ/4 monopole antenna system, we show that, 1) the increase of the average gain about 5dB in the horizontal plane can be realized by an optimum load, 2) the antenna pattern can be controlled by changing the value of the passive load so as to have some desirable shapes, and 3) the antenna size can be made smaller by about 6% than the one with no loading because the optimum loading makes the resonant frequency lower. These results were confirmed by the calculations using the method of moments for the EFIE and the measurements.

Stored channel simulation for mobile radio channel can be the common base of the development of future world wide personal radio communication systems, especially for high bit-rate digital system. This paper proposes a mobile radio channel database which is suitable for the laboratory channel simulation using a simple stored channel simulator, also proposed by the author. The database enables the establishment of a mobile radio channel database containing worldwide channel data in a few discs of compact disc.

The issue about document structure recognition and document understanding is today one of interesting subjects from a viewpoint of practical applications. The research objective is to extract the meaningful data from document images interpretatively and also classify them as the predefined item data automatically. In comparison with the traditional image-processing-based approaches, the knowledge-based approaches, which make use of various knowledge in order to interpret structural/constructive features of documents, have been currently investigated as more flexible and applicable methods. In this paper, we propose a totally integrated paradigm for understanding table-form documents from a viewpoint of the architectural framework.

Nested relational models were proposed as natural extensions of the relational model to support new emerging database applications. Prototype implementations of nested relational database systems (NRDBSs) have been done by some research groups. However, there remain many research issues on nested relations. One important issue is query processing, in particular query optimization. In NRDBSs, efficient execution of queries involving hierarchical data structures inherent in nested relations is required. In this paper, we focus on two join-type operations on nested relations: nested join and embed, and propose an algorithm to derive a cost optimal execution sequence of nested joins and embeds for a given query graph. The cost optimality of the derived sequence is formally proved. The complexity of the algorithm is proved to be O(N 2), when N nested relations are included in the query graph.

An experimental SAR (Specific Absorption Rate) estimation system based upon the thermograph method using a thermograph camera and newly developed homogeneous dry-phantom human models are presented. Experiments are conducted using this system and UHF fields to obtain SAR distributions in the human head irradiated by hand-held portable radios. Experiment results show that the estimated peak SAR's due to the radiation waves from radios of 1W transmitting power are lower than 2W/kg and so conform to the recommendations of the radio-frequency radiation safety guidelines. The developed system enables the surface SAR distributions on the phantom model to be precisely estimated; a function not available with the original system. System parameters required for providing precise estimations are discussed first, and then experiments are conducted to estimate SAR's in the human head exposed to a UHF hand-held portable radio's near field. Finally, estimated data are examined from the viewpoint of radio-frequency exposure safety guidelines.

This paper surveys the researches on biological and electeromagnetic environments in RF (radio frequency) and microwave regions in Japan. Publicized research reports on biological objectives, evaluation of exposure rate, electromagnetic environments and guideline for the protection from radio wave nuisances are briefly introduced. Some researches on the evaluation of the exposure rate caused by the near field effect of portable radio transceiver are reviewed. Radio frequency exposer protection guidelines in Japan are also described.

In this paper, I investigate a property of self-organizing feature map (SOFM) in terms of reference vector density q(x) when probability density function of input signal fed into SOFM is p(x). Difficulty of general analysis on this property is briefly discussed. Then, I employ an assumption (conformal map assumption) to evaluate this property, and it is shown that for equilibrium state, q(x)p(x)s holds. By giving Lyapunov functioin for time evolution of reference vector density q(x) in SOFM, the equilibrium state is proved to be stable in terms of distribution. Comparison of the result with one which is based on different assumption reveals that there is no unique result of a simple form, such as conjectured by Kohonen. However, as there are cases in which these assumptions hold, these results suggest that we can consider a range of the property of SOFM. On the basis of it, we make comparison on this property between SOFM and fundamental adaptive vector quantization algorithm, in terms of the exponent s of the relation q(x)p(x)s. Difference on this property between SOFM and fundamental adaptive vector quantization algorithm, and propriety of mean squared quantization error for a performance measure of SOFM, are discussed.

The stability conditions and stability factors of terminated active two port networks are investigated. They are expressed with the S parameters of active devices and the radii and centers of the circles defined by source and load terminations. The stability conditions are applied to specific cases. Some of the results correspond to the stability conditions expressed in Z, Y, H or G parameters and one of the other stability conditions of terminated two port network is similar to that for passive terminations which is expressed in S parameters. The various results derived in this paper are very useful for checking the stability of amplifiers, because both stability conditions and stability factors are simply calculated by using the S parameters without using the graphical method or transforming S parameters to Z, Y, H or G parameters. These stability conditions can be also used even if negative input or output resistance appears and even if the real part of source or load immittance is negative.

A family of new generalized LR parsing algorithms are proposed which make use of a set of ancestors tables introduced by Kipps. As Kipps's algorithm does not give us a method to extract any parsing results, his algorithm is not considered as a practical parser but as a recognizer. In this paper, we will propose two methods to extract all parse trees from a set of ancestors tables in the top vertices of a graph-structured stack. For an input sentence of length n, while the time complexity of the Tomita parser can exceed O(n3) for some context-free grammars (CFGs), the time complexity of our parser is O(n3) for any CFGs, since our algorithm is based on the Kipps's recognizer. In order to extract a parse tree from a set of ancestors tables, it takes time in order n2. Some preliminary experimental results are given to show the efficiency of our parsers over Tomita parser.

This paper proposes a new combined fast algorithm for transversal adaptive filters. The fast transversal filter (FTF) algorithm and the normalized LMS (NLMS) are combined in the following way. In the initialization period, the FTF is used to obtain fast convergence. After converging, the algorithm is switched to the NLMS algorithm because the FTF cannot be used for a long time due to its numerical instability. Nonstationary environment, that is, time varying unknown system for instance, is classified into three categories: slow time varying, fast time varying and sudden time varying systems. The NLMS algorithm is applied to the first situation. In the latter two cases, however, the NLMS algorithm cannot provide a good performance. So, the FTF algorithm is selected. Switching between the two algorithms is automatically controlled by using the difference of the MSE sequence. If the difference exceeds a threshold, then the FTF is selected. Other wise, the NLMS is selected. Compared with the RLS algorithm, the proposed combined algorithm needs less computation, while maintaining the same performance. Furthermore, compared with the FTF algorithm, it provides numerically stable operation.

In this paper, we study the knowledge tightness of zero-knowledge proofs. To this end, we present a new measure for the knowledge tightness of zero-knowledge proofs and show that if a language L has a bounded round zero-knowledge proof with knowledge tightness t(|x|) 2 - |x|-c for some c 0, then L BPP and that any language L AM has a bounded round zero-knowledge proof with knowledge tightness t(|x|) 2-2-O(|x|) under the assumption that collision intractable hash functions exist. This implies that in the case of a bounded round zero-knowledge proof for a language L BPP, the optimal knowledge tightness is "2" unless AM = BPP. In addition, we show that any language L IP has an unbounded round zero-knowledge proof with knowledge tightness t(|x|) 1.5 under the assumption that nonuniformly secure probabilistic encryptions exist.