This paper discusses how to derive message sequence charts (MSCs) from a set of state transition descriptions. Recently, MSC notation has received much attention in the communications software field because it graphically shows system global behavior, So MSC handling techniques are being widely studied. These studies have recommended the design a system by a set of formal MSCs in the early stages of development and then to convert them into state transition descriptions. However, it is difficult to apply those results to existing communications software products. This is because these systems are designed based on state transition descriptions and there are no formal MSCs for them. In this paper, we propose a method of deriving MSCs based on optimized reachability analysis. This method generates MCSs that avoid state explosion. A case study using Q.931 protocol shows the feasibility of this method.

This paper designs recursive least-squares fixed-point smoother and filter, which use the observed value, the probability that the signal exists, and the covariance information relevant to the signal and observation noises, on the estimation problem associated with the uncertain observations in linear continuous-time systems.

This paper investigates the performance of an integrated voice and data transmission protocol that can be used in mobile communication networks, e.g. mobile cellular and LEOGEO satellite networks. Voice and data are concentrated at place such as base station in a cellular network. Time sensitive voices are supported by the concentrator in the manner of TDMA. Loss sensitive data are collected, stored, and transmitted using idle TDMA slots. Data users transmit data to the concentration point using ALOHA protocol. Characterization of data arrivals to the concentrator is done by the method of moment matching. The emphasis of this study is on the data performance in terms of packet loss rate, average buffer occupancy, and mean packet waiting time. It is demonstrated through numerical examples that a buffer of reasonable size is good enough to offer satisfactory performance. The analysis is also validated by computer simulations.

A CMOS fully balanced current-mode filter is presented. A fully balanced current-mode integrator which is the basic building block is implemented by adding a very simple common-mode-rejection mechanism to fully differential one. The fully balanced operation can eliminate even order distortion, which is one of the drawbacks in previous continuous current-mode filter. Moreover, the additional circuit can work as not only common-mode-rejection mechanism but also Q-tuning circuit which compensates lossy elements due to finite output impedance of MOS FET. A prototype fifth-order low-pass lad-der filter designed in a standard digital 0.8µm CMOS process achieved a cut-off frequency (fC) of 100MHz; fC was tunable from 75MHz to 120MHz by varying a reference bias current from 50µA to 150µA. Using a single 3V power supply with a nominal reference current of 100µA, power dissipation per one pole is 30mW. The active filter area was 0.011mm2/pole and total harmonic distortion (THD) was 0.73 [%] at 80MHz, 80µA amplitude signal. Furthermore, by adjusting two bias currents, on chip automatic both frequency and Q controls are easily implemented by typical tuning systems, for example master-slave tuning systems [1].

Handwritten character recognition has been increasing its importance and has been expanding its application areas such as office automation, postal service automation, automatic data entry to computers, etc. It is challenging to develop a handwritten character recognition system with high processing speed, high performance, and high portability, because there is a trade-off among them. In current technology, it is difficult to attain high performance and high processing speed at the same time with single algorithms, and therefore, we need to find an efficient way of combination of multiple algorithms. We present an engineering solution to this problem. The system is based on multi-stage strategy as a whole: The first stage is a simple, fast, and reliable recognition algorithm with low substitution-error rate, and data of high quality are recognized in this stage, whereas sloppily written or degraded data are rejected and sent out to the second stage. The second stage is composed of a sophisticated structural pattern classifier and a pattern matching classifier, and these two complementary algorithms run in parallel (multiple expert approach). We demonstrate the performance of the completed system by experiments using real data.

This letter studies the Peak Cell Rate (PCR) policing of ATM connections that consist of multiple cell flow components. It is shown that the conventional methods proposed for policing the aggregate flow do not use the network's resources efficiently. This letter proposes a simple and efficient UPC (Usage Parameter Control) mechanism based on a tandem leaky bucket for multi-component ATM connections. The results show that network resource requirements can be minimized, with reasonable hardware complexity.

It is well known that the Hopfield Model (HM) for neural networks to solve the TSP suffers from three major drawbacks: (D1) it can converge to non-optimal local minimum solutions; (D2) it can also converge to non-feasible solutions; (D3) results are very sensitive to the careful tuning of its parameters. A number of methods have been proposed to overcome (D1) well. In contrast, work on (D2) and (D3) has not been sufficient; techniques have not been generalized to larger classes of optimization problems with constraint including the TSP. We first construct Extended HMs (E-HMs) that overcome both (D2) and (D3). The extension of the E-HM lies in the addition of a synapse dynamical system cooperated with the corrent HM unit dynamical system. It is this synapse dynamical system that makes the TSP constraint hold at any final states for whatever choices of the HM parameters and an initial state. We then generalize the E-HM further into a network that can solve a larger class of continuous optimization problems with a constraint equation where both of the objective function and the constraint function are non-negative and continuously differentiable.

The coupling response of an external transient electromagnetic field to a transmission line is considered. An experiment has been conducted to verify the line equations for a transmission line excited externally by a transient near field. The model field is generated by a monopole antenna installed in the vicinity of the transmission line and driven by a step waveform. The waveform is analyzed into discrete spectrum components using a Fourier transform. The frequency-domain field components affecting the transmission line are estimated by the moment method, and then the induced frequency-domain voltage at the terminal load is converted into a time-domain voltage using an inverse Fourier transform. Comparison between the measured and the computed values provides verification of the line equations. The coupling mechanism is discussed from the experimental results. It seems equivalently that the transmission line picks up the field, generated at the feed point and the top point of the monopole antenna, at both terminal ends.

Using fundamental device and circuits, we have realized three functions required for synaptic connections in self-organizing neural networks: long term memory of synaptic weights, fixed total amount of synaptic weights in a neuron, and lateral inhibition. The first two functions have been condensed into an optical adaptive device and circuits with floating gates. Lateral inhibition has been realized by a winner-take-all circuit and a following lateral excitatory connection circuit. We have fabricated these devices and circuits using CMOS technology and confirmed the three functions. In addition, topological mapping, which is essential for feature extraction, has been formed in a primitive network constructed with the fundamental device and circuits.

The main propagation effect on interference between adjacent earth-space paths is considered to be the differential rain attenuation. In the present paper, a unified method for the prediction of rain differential attenuation statistics, valid for both single/dual polarization systems, which is based on the two-dimensional gamma distribution, in proposed. The method is particularly oriented for application to earth-space paths located in Japan and other locations with similar climatic conditions. From another point of view, the present work is considered to be the complementary aspect of the present work is considered to be the complementary aspect of the predictive analysis which uses the lognormal assumption. Numerical results are presented referring to communication systems suffering from differential rain attenuation under the hypothesis of using both single and dual polarization.

This paper clarified fundamental aspects of both triboelectric processes and electrostatic discharge (ESD) phenomena to the electronic systems. A chance for ESD can occur if a charged metal object (steel piped chair, for example) contacts or collides with another metal objects at moderate speed. At metal-metal ESD event, the metal objects act as a radiation antenna in a very short time (some 100ps, for example) which emanates impulsive electromagnetic fields with unipolarity into the surrounding space. Because of ESD at low-voltage (3kV or less) conditions, the direction of electrons movement at the spark gap is always unidirectional and fixed. The spark gap works as a momentary switch and also as a "diode." The dominant fields radiated from the metal objects are impulsive electric fields or impulsive magnetic fields which depend on the metal object's electrical and geometric conditions. This impulsive electromagnetic fields penetrate electronic systems, causing electromagnetic interference (EMI) such as malfunctions or circuit upset. The difference between EMI actions in high-voltage ESD and low-voltage ESD is experimentally analyzed in terms of energy conversion/consumption. A series of experiments revealed that EMI actions due to the metal-metal ESD are not proportional to the charge voltage nor the discharge current. In order to capture single shot impulsive electromagnetic fields very close to the ESD point (wave source), a short monopole antenna as an ultra broad-band field sensor was devised. As for signal transmissions between the short monopole antenna and the instrument (receiver), micro/millimeter wave techniques were applied. The transmission line's minimum band width DC-18.5GHz is required for time domain measurements of low-voltage ESD.

A new transmit permission control scheme applicable in multi-cell communication systems is proposed. In this scheme, by prohibiting the transmissions from the users with relatively high propagation loss to their connecting hub stations, level of multiple access interference is decreased, and hence throughput characteristics are improved. Moreover, we continue our discussion to propose two adaptive forms of the transmit permission control scheme, in which the prohibition condition becomes more intelligent by considering the level of the offered traffic loads to hub stations. These methods are utilized in a slotted Aloha random transmission of the spread spectrum packets, and on the uplinks of a low earth orbit satellite communication system as an example of the multi-cell systems. It is shown that the adaptive schemes exhibits significantly improved characteristics at all offered traffic loads in these systems.

The purpose of this paper is to provide a practical tool for performing a shift operation in orthonormal compactly supported wavelet bases. This translation τ of a discrete sequence, where τ is a real number, is suitable for filter bank implementations. The shift operation in this realization is neither related to the analysis filters nor to the synthesis filters of the filter bank. Simulations were done on the Daubechis wavelets with 12 coefficients and on complex valued wavelets. For the latter ones a real input sequence was used and split up into two subsequences in order to gain computational efficiency.

This paper proposes an adaptive modulation system with a punctured convolutional code for land mobile communications to achieve high quality, high bit rate, and high spectral efficient data transmission in multipath fading environments. The proposed system adaptively controls the coding rate of the punctured convolutional code, symbol rate, and modulation level according to the instantaneous fading channel conditions. During good channel conditions, the modulation parameters are selected to increase the transmission rate as much as possible with satisfying a certain transmission quality. As channel conditions become worse, lower rate modulation parameters are applied or transmission is stopped. The performances in fading environments are evaluated theoretically and by computer simulations. The results show that the proposed system can realize higher quality transmission without the degradation in average bit rate compared to conventional adaptive modulation systems.

We deal with a fixpoint semantics for normal logic programs by means of an algebraic manipulation of idempotent substitution sets. Because of the negation, the function associated with a given normal logic program, which captures the deductions caused by the program, is in general nonmonotonic, as long as we are concerned with 2-valued logic approach. The demerit of the nonmonotonic function is not to guarantee its fixpoint well, although the fixpoint is regarded as representing the whole behaviour. The stable model as in [6] is fixpoint of nonmonotonic functions, but it is referred to on the assumption of its existences. On the other hand, if we take 3-valued logic approach for normal logic programs as in [5], [9], [11], [14] we have the monotonic function to represent resolutions and negation as failure, and define its fixpoint well, if we permit the fixpoint not to be constructive because of discontinuity. Since the substituitions for variables in the program are essentially significant in the deductions for logic programming, we next focus on the representations by means of substitutions for the deductions, without usual expressions based on atomic formulas. We examine the semantics in terms of abstract interpretations among semantics as surveyed in [9], where an abstraction stands for the capability of representing another semantics. In this paper, in 3-valued logic approach and by means of the substitution manipulation, the semantics is defined to be an abstraction of the semantics in [5], [9]. To construct a semantics based on the idempotent substitution set, the algebraic manipulation of substitutions is significant, whereas the treatment in [10] for the case of definite clause sets is not available because of the restriction of substitutions to some variable domain as most general unifications.

This paper presents implicit representation of binary decision diagrams (implicit BDDs) as a new effecient data structure for Boolean functions. A well-known method of representing graphs by binary decision diagrams (BDDs) is applied to BDDs themselves. Namely, it is a BDD representation of BDDs. Regularity in the structure of BDDs representing certain Boolean functions contributes to significant reduction in size of the resulting implicit BDD repersentation. Since the implicit BDDs also provide canonical forms for Boolean functions, the equivalence of the two implicit BDD forms is decided in time proportional to the representation size. We also show an algorithm to maniqulate Boolean functions on this implicit data structure.

This paper describes Kleenean coefficients that are a subset of Kleenean functions for use in representing multiple-valued logic functions. A conventional multiple-valued sum-of-products expression uses product terms that are the MIN of literals and constants. In this paper, a new sum-of-products expression is allowed to sum product terms that also include variables and complements of variables. Since the conventional sum-of-products expression is complete, so also is the augmented one. A minimization method of the new expression is described besed on the binary Quine-McCluskey algorithm. The result of computer simulation shows that a saving of the number of implicants used in minimal expressions by approximately 9% on the average can be obtained for some random functions. A result for some arithmetic functions shows that the minimal solutions of MOD radix SUM, MAX and MIN functions require much fewer implicants than those of the standard sum-of-products expressions. Thus, this paper clarifies that the new expression has an advantage to reduce the number of implicants in minimal sum-of-products expressions.

This paper proposes a new emphasizing three-dimensional pointing device considering user friendliness and lack of cable clutter. The proposed method utilizes five degrees of freedom via the medium of non-verbal voice of human. That is, the spatial direction of the sound source, the type of the voice phoneme and the tone of the voice phoneme are utilized. The input voice is analyzed regarding the above factors and then taking proper effects as previously defined for human interface. In this paper the estimated spatial direction is used for three-dimensional movement for the virtual object as three degrees of freedom. Both of the type and the tone of the voice phoneme are used for remaining two degrees of freedom. Since vocalization of nonverbal human voice is an everyday task, and the intonation of the voice can be quite easily and intentionally controlled by human vocal ability, the proposed scheme is a new three-dimensional spatial interaction medium. In this sense, this paper realizes a cost-effective and handy nonverbal interface scheme without any artificial wearing materials which might give a physical and psychological fatigue. By using the prototype the authors evaluate the performance of the scheme from both of static and dynamic points of view and show some advantages of look and feel, and then prospect possibilities of the application for the proposed scheme.

This paper proposes a Japanese continuous speech recognition mechanism in which a full-sentence-level context-free-grammar (CFG) and one kind of semantic constraint called dependency relationships between two bunsetsu (a kind of phrase) in Japanese" are used during speech recognition in an integrated way. Each dependency relationship is a modification relationship between two bunsetsu; these relationships include the case-frame relationship of a noun bunsetsu to a predicate bunsetsu, or adnominal modification relationships such as a noun bunsetsu to a noun bunsetsu. To suppress the processing overhead caused by using relationships of this type during speech recognition, no rigorous semantic analysis is performed. Instead, a simple matching with examples" approach is adopted. An experiment was carried out and results were compared with a case employing only CFG constraints. They show that the speech recognition accuracy is improved and that the overhead is small enough.

An invertible length preserving transducer is called a weakly invertible finite automaton (WIFA for short). If the first letter of any input string of length τ + 1 is uniquely determined by the corresponding output string by a WIFA and its initial state, it is called a WIFA with delay τ. The composition of two WIFAs is the natural concatenation of them. The composition is also a WIFA whose delay is less than or equal to the sum of the delays of the two WIFAs. In this paper we derive various results on a decomposition of a WIFA into WIFAs with smaller delays. The motivation of this subject is from theoretical interests as well as an application to cryptosystems. In order to capture the essence of the decomposability problem, we concentrate on WIFAs such that their input alphabets and their output alphabets are identical. A WIFA with size n of the input and output alphabet is denoted by an n-WIFA. We prove that for any n > 1, there exists an n-WIFA with delay 2 which cannot be decomposed into two n-WIFAs with delay 1. A one-element logic memory cell is a special WIFA with delay 1, and it is called a delay unit. We show that for any prime number p, every strongly connected p-WIFA with delay 1 can be decomposed into a WIFA with delay 0 and a delay unit, and that any 2-WIFA can be decomposed into a WIFA wiht delay 0 and a sequence of k delay units if and only if every state of the 2-WIFA has delay k.