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.

This paper considers algebraic basic processes, a subset of communicating processes in CCS by Milner, and presents a synthesis algorithm to infer a process that satisfies the properties of the process, represented as fomulae in Hennessy-Milner Logic. The validity of the proposed algorithm can be stated that it synthesizes a process in the limit, which cannot be distinguished from the target one with respect to the strong equivalence.

The authors have studied mechanism of transition from metallic phase to gaseous phase in contact break arc. For further elucidation of the mechanism, we have carried out spectroscopic measurement. The spectrum measurement system which had high time resolution was composed using two monochromators and a bifurcated image fiber, which had one input port and two output ports. The input port received the arc light, and the two monochromators received the arc light from the two output ports, respectively. The spectral sensitivity of the two monochromators was corrected with a standard lamp. We have measured simultaneously two spectra of break arc for Ag in laboratory air, under the condition where source voltage E=48 V, load inductance L=2.3 mH, and closed contact current I0=6 A. As a result, the time-varying tendency of spectrum intensity is similar for the same element, even if the wavelength is different. And from the comparison of time average spectrum intensity, it is clarified that average intensity for gas spectrum does not attain to 10% of that for metallic atomic spectrum (Ag I, 520.91 nm). In addition, the decrease point of Ag II (ion) spectrum has been found to correspond with the peak of Ag I (atom) spectrum.

Parallel processing in speech recognition is described, which is carried out at each frame on time axis. We have already proposed a parallel processing algorithm for HMM (Hidden Markov Model)-based speech recognition using Markov Random Fields (MRF). The parallel processing is realized by modeling the hidden state sequence by an MRF and using the Iterated Conditional Modes (ICM) algorithm to estimate the optimal state sequence given an observation sequence and model parameters. However this parallel processing with the ICM algorithm is applicable only to the standard HMM but not to the improved HMM like the linear predictive HMM which takes into account the correlations between nearby observation vectors. In this paper we propose a parallel processing algorithm applicable to the correlation-considered HMM, where a new deterministic relaxation algorithm called the Generalized ICM (GICM) algorithm is used instead of the ICM algorithm for estimation of the optimal state sequence. Speaker independent isolated word recognition experiments show the effectiveness of the proposed parallel processing using the GICM algorithm.

A multiple instruction stream-multiple data stream (MIMD) computer is a parallel computer consisting of a large number of identical processing elements. The essential feature that distinguishes one MIMD computer family from another is the interconnection network. In this paper, 2 representative types of interconnection networks are dealt with the chordal ring network and the mesh connected network. A family of regular graphs of degree 3, called chordal rings is presented as a possible candidate for the implementation of a distributed system and for fault-tolerant architectures. The symmetry of graphs makes it possible to determine message routing by using a simple distributed algorithm. Another candidate having the same property is the mesh connected networks. Arbitrary data permutations are generally accomplished by sorting. For certain classes of permutations, however, there exist algorithms that are more efficient than the best sorting algorithm. One such class is the bit permute complement (BPC) class of permutations. The class of BPC permutations includes many of the frequently occurring permutations such as bit reversal, bit shuffle, bit complement, matrix transpose, etc. In this paper, we evaluate the abilities of the above networks to realize BPC permutations. In this paper, we, first, develop algorithms required 2 token storage registers in each node to realize an arbitrary BPC permutaion in both chordal ring networks and mesh connected networks. We next evaluate the ability to realize BPC permutations in these networks of an arbitrary size by estimating the number of required routing steps.

A technique for pulse code modulation (PCM) encoding using a T-Model neural network is described. Performance evaluation on both the T-Model and the Hopfield model neural-based PCM encoders is carried out with PSpice simulations. The PSpice simulations also show that the T-Model neural-based PCM encoder computes to a global minimum much more effectively and more quickly than the Hopfield one.

A modified deformable model is presented for constructing bijective topology preserving feature maps. The algorithm can solve the optimization problem in the input space as well as that in the output space. A saturating distance function alternative to the Euclid norm is employed to obtain compact space filling maps.

Several distances between trees have been proposed. However, most of the reports on distances have dealt with rooted and ordered trees. This paper proposes two distances between unrooted and cyclically ordered trees (CO-trees) and their computing methods. A CO-tree is a tree embedded in a plane. These distances are defined based on Tai's mapping (TM) and a strongly structure preserving mapping (SSPM) between CO-trees. The time complexities to compute the distances between two CO-trees Ta and Tb are OT (N 2aN 2b) for the distance based on a TM and OT(mambNaNb) for that on an SSPM, respectively, where ma(mb) and Na(Nb) are the largest degree of a vertex and the number of vertices of Ta(Tb), respectively. The space complexities of both methods are Os(NaNb). Those distances can be applied to the clustering of CO-trees.

We modified the adaptive fuzzy classification algorithm (AFC), which allows fuzzy clusters to grow to meet the demands of a given task during training. Every fuzzy cluster is defined by a reference vector and a fuzzy cluster radius, and it is represented as a shape of hypersphere in pattern space. Any pattern class is identified by overlapping plural hyperspherical fuzzy clusters so that it is possible to approximate complex decision boundaries among pattern classes. The modified AFC was applied to recognize handwritten digits, and performances were shown compared with other neural networks.

This paper presents a novel and successful logic synthesis method for optimizing ternary logic functions of any given number of input variables. A new optimization algorithm to synthesize and minimize an arbitrary ternary logic function of n-input variables can always lead this function to optimal or very close to optimal solution, where [n (n1)/2]1 searches are necessary to achieve the optimal solution. Therefore, the complexity number of this algorithm has been greatly reduced from O(3n) into O(n2). The advantages of this synthesis and optimization algorithm are: (1) Very easy logic synthesis method. (2) Algorithm complexity is O(n2). (3) Optimal solution can be obtained in very short time. (4) The method can solve the interconnection problems (interconnection delay) of VLSI and ULSI processors, where very fast and parallel operations can be achieved. A transformation method between operational and polynomial domains of ternary logic functions of n-input variables is also discussed. This transformation method is very effective and simple. Design of the circuits of GF(3) operators, addition and multiplication mod-3, have been proposed, where these circuits are composed of Josephson junction devices. The simulation results of these circuits and examples show the following advantages: very good performances, very low power consumption, and ultra high speed switching operation.

We have studied in detail the effect of gas flow rates on the film properties of low-temperature (300) polycrystalline silicon (poly-Si) films prepared by conventional plasma enhanced chemical vapor deposition (13.56 MHz) with SiF4/SiH4/H2 gases. The effect of SiH4 flow rate on crystallization is shown to be large. A small amount of SiH4 with high SiF4 and H2 flow rates (50[H2]/[SiH4]1200, 20[SiF4]/[SiH4]150, 1[H2]/[SiF4]16) is important to form poly-Si films. The poly-Si films deposited under such optimized conditions had shown preferential 〈110〉-orientation and the crystalline fraction is estimated to be more than 80%. The deposition rates are in the range of 5-30 nm/min. The conductivity is in the range of 10-8-10-6 S/cm. Further, the electrical conduction indicates an activation type, and the activation energy is in the range of 0.5-0.6 eV.

Nonmonotonic reasoning is a logical inference system which attempts to approximate human commonsense reasoning and is characterized as defeasible: having reasonably drawn a conclusion from some premises we may be forced to retract that conclusion upon learning new facts. This paper introduces a Petri net model for nonmonotonic reasoning with nonmonotonic rules generated by annotated logic programs and the unless operator. In the Petri net model, a fixpoint of a nonmonotonic theory can be represented as a maximal and consistent support of a firing sequence. We propose a structural method for finding extensions (coherent consequences) for a given set of nonmonotonic logic rules. It is based on the T-invariant technique for testing fireability of a goal transition in the Petri net model of Horn clause logic programs.

A new optical path cross-connect system architecture (OPXC) based on delivery and coupling matrix switches is described. This OPXC provides the maximum compatibility for a wavelength path (WP) network and a virtual wavelength path (VWP) network. In other words, the proposed architecture easily evolves from WP-OPXC to VWP-OPXC. This salient feature can not been achieved with conventional OPXCs. Another attractive feature of this OPXC is its high modularity for OPXC capacity expansion.

Experimental optical gain characteristics of an erbium-doped fiber amplifier have not been explained well by conventional laser schemes in the case of two-channel amplification. Modified simple laser schemes including cross relaxation among degenerate levels were valid for the explanation of the optical gain dependence on input signal power and on the erbium-doped fiber length.

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.

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.

A globally and quadratically convergent algorithm is presented for solving nonlinear resistive networks containing transistors modeled by the Gummel-Poon model or the Shichman-Hodges model. This algorithm is based on the Katzenelson algorithm that is globally convergent for a broad class of piecewise-linear resistive networks. An effective restart technique is introduced, by which the algorithm converges to the solutions of the nonlinear resistive networks quadratically. The quadratic convergence is proved and also verified by numerical examples.

Reliability of an electric contact can be defined by two parameters, contact resistance and wear, and the parameters of contacts operated in arcing condition are governed by the arc discharge. Thus the measurement on the relationship between the parameters and arc phenomena is necessary to improve the contact performance. The parameters for arcing electric contacts and problems were reviewed, and new concept for electric contact testing systems was proposed. Measurement with such an advanced system should be concurrent parallel measurement, quantitative measurement of degradation, systematic measurement, and analysis of arc discharge phenomena. Some examples of advanced measurement systems and new data obtained with such systems were described. Systematic results on relationships between condition and performance parameters were obtained by systematic measurement with systematically settled conditions, such as opening speed or material condition. A measurement method for the metallic phase arc duration was developed by the authors, and role of the metallic phase arc on contact performance parameters was found from interpretation of obtained data. The real-time surface profile measurement of an operating contact and the optical transient spectrum analyser for arc light radiated from breaking contact were also described.

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.