As to the method of multi-layer testing, up to now, the testing system (called PROVES) which testes effectively each N-layer protocol implement of SUT (System Under Test) using the functions of derail-points located between N-layer and (N+1)-layer protocol implements in a test system has been proposed. The test logic programs, which are embedded in the derail-points of the test system, play an important role to realize the protocol error test sequences in the test system. Namely, they modify, add, or delete the correct protocol commands/responses output from the protocol implement part of the lest system, sends these erroneous commands/responses to SUT and observes the output from SUT. This paper proposes the method of validating the correctness of test logic program using the structural properties of Petri nets without coding the test logic programs, where correctness means that the desired output can be obtained by sending or receiving the commands/responses within a constant time under the initial conditions determined uniquely by the test system and SUT. According to our experiment, it is seen that almost all of the logical errors included in the test logic programs used for the experiment can be detected by this method.

In communication protocols, the behaviour of a protocol entity is related to the behaviour of another protocol entity as they communicate under sets of communication rules (protocols). Thus, it is desirable to concentrate on the design of one protocol entity and generate the corresponding protocol entity automatically. Furthermore, it is desirable that the protocol is formal, precise and unambiguous that is, it is described using FDTs (Formal Description Techniques). In this paper, we propose a protocol synthesis algorithm in which, from a LOTOS specification of a single given entity, LOTOS specification of the corresponding peer entity is generated automatically. Unlike previous works, where FSMs (Finite State Machines) were used to synthesize protocols, we use LOTOS, which is one of FDTs developed by ISO, in our proposed synthesis algorithm. We prove that the generated protocol is logical errors free, collectively represented as deadlock free, if the given entity is in certain forms which are natural in the context of connunication protocols.

It is desirable to design an ATM switch that is nonblocking at the connection level by using simple connection admission control (CAC) schemes. To accomplish this goal, it is necessary to consider the relationships between CAC, cell-level quality-of-services (QOS), and the structure of multistage switches as well as switch modules. In this paper, we formulate a framework to design a multistage nonblocking ATM switch. We show that if a switch has the property of the Sufficiency of Knowledge of External Loads (SKEL), i.e., the property that its cell-level performance is robust to the distribution of incoming traffic among all inputs, then the switch is also nonblocking at the connection-level by using a simplified CAC that guarantees QOS of a connection by controlling the aggregate loads on outputs. Furthermore, we show that a Clos three-stage network using SKEL switch modules and Multipath Self-Routing (MPSR) also has the SKEL property and is a nonblocking switching network that needs CAC only at its outputs. We also demonstrate a design of multistage nonblocking ATM switches with Knockout switch modules.

A radial line slot antenna (RLSA) is a slotted waveguide planar array for the direct broadcast from satellite (DBS) subscriber antennas. A single-layered RLSA (SL-RLSA) is excited by a radially outward traveling wave. The antenna efficiency of more than 85% has already been realized. These antennas are designed on the assumption of perfectly rotationally symmetrical traveling wave excitation; the slot design is based upon the analysis of a slot pair on the rectangular waveguide model with periodic boundary walls. However, the slots perturb the inner field and the actual antenna operation is not perfectly symmetrical. This causes the efficiency reduction especially for very small size antenna. This paper presents a fundamental analysis of the inner field of the radial waveguide. It is impossible to analyze all the slot pairs in the aperture as it is and only the slots in the inner few turns are considered since these provide dominant perturbation. The calculated results are verified by the experiments and reasonable agreement is demonstrated. Some design policies are suggested for enhancing the rotational symmetry.

We predict that chemical waves can propagate as a guided mode in a reaction-diffusion system that consists of two regions with different wave speeds. In comparison with electromagnetic waveguides, unique features of the guided chemical waves can be seen in their dispersion characteristics. Conditions for supporting lowest-loss guided waves are discussed.

State space explosion is a serious problem in analyzing discrete event systems that allow concurrent occurring of events. A new method is proposed for generating reduced state spaces of systems. This method is an improvement of Valmari's stubborn set method. The generated state space preserves liveness, livelocks, and terminal states of the ordinary state space. Petri nets are used as a model of systems, and a method is shown for generating a reduced state space from a given Petri net.

This paper describes a simple system of measuring the spatial distributions of spectral intensities with AgI-421 nm and AgI-546 nm among many optical spectrums emitted from an arc discharge between separating Ag contacts. In order to detect the intensities of two optical spectrums, the prototype equipment has two sets assembled with a CCD color linear image sensor, a lens and optical filters, which are arranged on rectangularity. The intensities of two spectrums can be recorded with 2 ms time-resolution within a long arc duration on a digital memory. The recorded digital signals are processed by using a personal computer in order to reconstruct two spatial distributions of spectral intensities in a cross section of arc column with the Algebraic Reconstruction Technique.

Recognizable series is a model of a sequential machine. A recognizable series S is represented by a triple (λ,µ,γ), called a linear representation of S, where λ is a row vector of dimension n specifying the initial state, γ is a column vector of dimension n specifying the output at a state, and µ is a morphism from input words to nn matrices specifying the state transition. The output for an input word w is defined as λ(µw) γ, called the coefficient of w in S, and written as (S,w). We present an algorithm which constructs a reduced linear representation of an unknown recognizable series S, with coefficients in a commutative field, using coefficient queries and equivalence queries. The answer to a coefficient query, with a word w, is the coefficient (S, w) of w in S. When one asks an equivalence query with a linear representation (λ,µ,γ), if (λ,µ,γ) is a linear representation of S, yes is returned, and otherwise a word c such that λ (µc) γ(S, c) and the coefficient (S, c) are returned: Such a word c is called a counterexample for the query. For each execution step of the algorithm, the execution time consumed from the initial step to the current step is O(mN 4M), where N is the dimension of a reduced linear representation of S, M is the maximum time consumed by a single fundamental operation (addition, subtraction, multiplication or division), and m is the maximum length of counterexamples as answers to equivalence queries returned until that step.

In this paper, the relationship between contact materials and sticking characteristics, and stability of contact resistance to obtain excellent contacts for telecommunication relays, is studied. The contact switching current for telecommunication relay is low. Moreover, contact force and opening force in these relay are respectively several mN. Nine kinds of contact materials are selected as a experimental factor. They are Ag, Ag-Ni (Ni: 0.03 to 20%), Ag-Cu 10%, Ag-Pd 60% and Pd-Ru 10%, and are overlaid with gold except Pd-Ru 10%. In this study, contact life tests on a commercial ultra-miniature telecommunication relay by mounting above-mentioned contacts are conducted. The sticking and the contact resistance are monitored at each switching operation in the contact life test. After the life test, the contact surfaces are observed, and the depth of crater, the height of pip and projected concave area are measured, then the relationship between the sticking morphologies and the composition of each material are studied. As the result of this study, the contact sticking of telecommunication rely is assumed to be the result of mechanical locking, and the effects of the Ni content in the Ag-Ni contacts is clarified. Moreover, it is confirmed that the effects of opening force on the sticking characteristics are remarkable.

This paper describes a high-density, high-pin-count flexible SMD connector used for high-speed data buses between MCMs or daughter boards. This connector consists of a flexible film cable interconnection with accurately controlled characteristic impedance, and a contact housing composed of double-line contacts and SMD type leads. It has 98 contacts each with a pitch of 0.4 mm. The connector mounting area is 6 mm wide and 23 mm long. The flexible cable has a double-sided triple-parallel micro stripline structure with an insertion force of less than 2.9 kgf and characteristic impedance of 48 to 50 Ω. Insertion loss is -0.5 dB at 600 MHz and crosstalk noise is less than 110 mV at 250 ps rising time. This connector can be used for high-speed data transmission of up to 300 ps rising time.

We introduce a procedure to determine the discrete Fourier spectra of the band-limited function from its irregularly distributed samples. The nonuniform data of the signal are represented by the non-orthogonal basis functions (non-harmonic Fourier functions) and discrete Fourier spectra of the signal. We construct a set of orthonormal basis functions from the above mentioned non-orthogonal basis functions using the Gram-Schmidt procedure. Based on the G-S procedure and the property of the orthogonalization, the spectral components of signal can be obtained by the conjugate transpose of orthonormal basis functions, their coefficients matrix and the nonuniform samples. Thus the desired signal can be obtained by the inverse Fourier transform of the determined discrete Fourier spectra. We apply this algorithm to reconstruct a band-limited low-pass and band-pass signal and show that our method provide more stable and better reconstruction than the matrix inversion method.

In clad contacts of bonded dissimilar metals used in relays and switches, the bonding state affects the switching performance of those devices. Examining the bonding state and analyzing the relationship between the bonding state and the causes of malfunction, such as welding of the contact, leads to improvement in reliability of electromechanical devices. In this experiment we examined, with an ultrasonic microscope, the bonding state in riveted clad contacts which had been subjected to load-breaks of in-rush current, and were able to demonstrate the causal relation of the bonding state with malfunctions of the contacts. The use of the ultrasonic microscope made it possible to perform a hitherto difficult detailed analysis of the bonding state of clad contacts. It was also confirmed that this was an extremely effective method for studying the relationship with switching performance.

In the conventional protocol synthesis, it is generally assumed that primitives in service specifications cannot be executed simultaneously at different Service Access Points (SAPs). Thus if some primitives are executed concurrently, then protocol errors of unspecified receptions occur. In this paper, we try to extend a class of service specifications from which protocol specifications are synthesized by the previous methods. We first introduce priorities into primitives in protocol specification so that it always selects exactly one primitive of the highest priority from a set of primitives that can be executed simultaneously, and executes it. Then, based on this execution ordering, we propose a new protocol synthesis method which can avoid protocol errors due to message collisions, communication competitions and so on. By applying the proposed synthesis method, we can automatically synthesize a protocol specifications from a given service specification which includes an arbitraty number of processes and allows parallel execution of primitives.

This paper describes a noise resistant algorithm for estimating 3-D rigid motion from optical flow. We first discuss the problem of constructing the objective function to be minimized. If a Gaussian distribution is assumed for the niose, it is well-known that the least-squares minimization becomes the maximum likelihood estimation. However, the use of this objective function makes the minimization procedure more expensive because the program has to go through all the points in the image at each iteration. We therefore introduce an objective function that provides unbiased estimators. Using this function reduces computational costs. Furthermore, since good approximations can be analytically obtained for the function, using them as an initial guess we can apply an iterative minimization method to the function, which is expected to be stable. The effectiveness of this method is demonstrated by computer simulation.

Plating is applied to protect contact surfaces of contact devices such as switch, relay and connector from contaminations of oxidization and sulfuration etc. Furthermore it is known that the contact resistance can be reduced when there exist plated layers on the contact surfaces which have enough thickness and low resistivity compared with substratum materials. In this paper, contact resistance between plated conductors are calculated using three dimensional finite element method. Similariry, current density distribution in a contact spot with various resistivity of plated layers are shown and relative conductance depends on the contact area fraction with thickness of plated layers are presented.

This paper describes a preconstrained compaction method and its application to the direct design-rule conversion of CMOS layouts. This approach can convert already designed physical patterns into compacted layouts that satisfy user-specified design rules. Furthermore, preconstrained compaction can eliminate unnecessarily extended diffusion areas and polysilicon wires which tend to be created with conventional longest path based compactions. Preconstrained compaction can be constructed by combining a longest path algorithm with forward and backward slack processes and a preconstraint generation process. This contrasts with previously proposed approaches based on longest path algorithms followed by iterative improvement processes, which include applications of linear programming. The layout styles in those approaches are usually limited to a model where fixed-shaped rectilinear blocks are moved so as to minimize the total length of rectilinear interconnections among the blocks. However, preconstrained compaction can be applied to reshaping polygonal patterns such as diffusion and channel areas. Thus, this compaction method makes it possible to reuse CMOS leaf and macro cell layouts even if design rules change. The proposed preconstrained compaction approach has been applied to direct design-rule conversion from 0.8-µm to 0.5-µm rules of CMOS layouts containing from several to 10,195 transistors. Experimental results demonstrate that a 10.6% reduction in diffusion areas can be achieved without unnecessary extensions of polysilicon wires with a 39% increase in processing times compared with conventional approaches.

In a distributed system, the protocol entities must exchange some data values and synchronization messages in order to ensure the temporal ordering of the events described in a service specification for the distributed system. It is desirable that a correct protocol specification can be derived automatically from a given service specification. In this paper, we propose an algorithm which synthesizes automatically a correct protocol specification from a service specification described as a Marked Graph with Registers (MGR) model and resources (registers and gates) allocation information. This model has a finite control modeled as a marked graph. Therefore, parallel events can be described. In our method, to minimize the number of the exchanged messages, we use a procedure to calculate an optimum solution for 0-1 integer linear programming problems. The number of the steps which each protocol entity needs to simulate one transition in the service specification is also minimized. Ways to avoiding conflict of registers are also described. Our approach has the following advantages. First, parallel events can be described in a service specification. Secondly, many practical systems can be described in the MGR model. Finally, at the protocol specification level, we can understand what events can be executed in parallel.

A W-graph is a partially known graph which contains wild-components. A wild-component is an incompletely defined connected subgraph having p vertices and p-1 unspecified edges. The informations we know on a wild-component are which has a vertex set and between any two vertices there is one and only one path. In this paper, we discuss the properties of circuits in a W-graph (called W-circuits). Although a W-graph has unspecified edges, we can obtain some important properties of W-circuits. We show that the W-ring sum of W-circuits is also a W-circuit in the same W-graph. The following (1) and (2) are proved: (1) A W-circuit Ci of a W-graph can be transformed into either a circuit or an edge disjoint union of circuits, denoted by Ci*, of a graph derived from the W-graph, (2) if W-circuits C1, C2, , Cn are linearly independent, then C1*, C2*, , Cn* obtained in (1) are also linearly independent.

Given a sorted set S of n points in the plane, the prefix convex hulls problem of S is to compute the convex hull for every prefix set of S. We present a parallel algorithm for this problem. Our algorithm runs in O(logn) time using n/logn processors in the CREW PRAM computational model. The algorithm is shown to be time and cost optimal. One of the techniques we adopt to achieve these optimal bounds is the use of a new parallel data structure Array-Tree.