In this paper, we will clarify the problem of consecutively lost customer due to buffer overflow in an IPP, M/M/l/K queueing system including an M1, M2/M/l/K queueuing system as a special case. We define a length of a consecutive loss as the number of customers consecutively lost due to buffer overflow. And, we obtain individual distributions of the lengths of consecutive losses for the IPP- and Markov-sources. From analytical and numerical results, it is shown that either they are geometrical or they can be approximated by a geometric distribution. Also, from numerical examples, we show some properties of the length of consecutive customer loss.

High speed simulation of neural networks can be achieved through parallel implementations capable of exploiting their massive inherent parallelism. In this paper, we show how this inherent parallelism can be effectively exploited on parallel data-driven systems. By using these systems, the asynchronous parallelism of neural networks can be naturally specified by the functional data-driven programs, and maximally exploited by pipelined and scalable data-driven processors. We shall demonstrate the suitability of data-driven systems for the parallel simulation of neural networks through a parallel implementation of the widely used back propagation networks. The implementation is based on the exploitation of the network and training set parallelisms inherent in these networks, and is evaluated using an image data compression network.

When orignal signals are contaminated by both additive and signal-dependent noise components, the test statistics of locally optimum detector are obtained for detection of weak composite signals based on the generalized Neyman-Pearson lemma. In order to consider the non-additive noise as well as purely-additive noise, a generalized observation model is used in this paper. The locally optimum detector test statisics are derived for all different cases according to the relative strengths of the known signal, random signal, and signal-dependent noise components. Schematic diagrams of the structures of the locally optimum detector are also included. The finite sample-size performance characteristics of the locally optimum detector are compared with those of other common detectors.

This paper proposes a new method for automatic improvement in image quality through adjusting the image sharpness. This method does not need prior knowledge about image blur. To improve image quality, the sharpness must be adjusted to an optimal value. This paper shows a new method to evaluate sharpness without MTF. It is considered that the human visual system judges image sharpness mainly based upon edge area features. Therefore, attention is paid to the high spatial frequency components in the edge area. The value is defined by the average intensity of the high spatial fequency components in the edge area. This is called the image edge sharpness" value. Using several images, edge sharpness values are compared with experimental results for subjective sharpness. According to the experiments, the calculated edge sharpness values show a good linear relation with subjective sharpness. Subjective image sharpness does not have a monotonic relation with subjective image quality. If the edge sharpness value is in a particular range, the image quality is judged to be good. According to the subjective experiments, an optimal edge sharpness value for image quality was obtained. This paper also shows an algorithm to alter an image into one which has another edge sharpness value. By altering the image, which achieves optimal edge sharpness using this algorithm, image sharpness can be optimally adjusted automatically. This new image improving method was applied to several images obtained by scanning photographs. The experimental results were quite good.

The discrete time analysis of logic circuits is usually more efficient than the continuous time analysis, but the preciseness of the discrete time analysis is not guaranteed. The paper shows a method to decide a unit time for a logic circuit under which the analysis result is the same as the result based on the continuous time. The delay time of an element is specified with an interval between the minimum and maximum delay times, and we assume an analysis method which enumerates all possible delay cases under the deisrete time. Our main theorem is as follows: refine the unit time by a factor of 1/2, and if the analysis result with a unit time u and that with a unit time u/2 are the same, then u is the expected unit time.

The performance of ASIPs (Application Specific Integrated Processors) is heavily affected by the design of their instruction set architecture. In order to maximize the performance of ASIP, it is essential to design an architecture that has an optimum instruction set. This paper descibes a new method that automates the design of optimum instruction set of ASIP. This method solves the Instruction set implementation Method Selection Problem(IMSP). IMSP is to be solved in the instruction set architecture design. Frse, the IMSP is formalized as an integer programming problem, which is to maximize the perfomance of the CPU under the constraints of chip area and power consumption. Then, a branch-and-bound algorithm to solve IMSP is described. According to the experimental results, the proposed algorithm is quite effective and efficient in solving the IMSP. The presented method automates a complex part of the ASIP chip design and is also a good design tool that enables designer to predict the performance of their design before completion.

The character binarization method MTC is developed for enhancing the recognition of characters in general outdoor images. Such recognition is traditionally difficult because of the influence of illumination changes, especially strong shadow, and also changes in character, such as apparent character sizes. One way to overcome such difficulties is to restrict objects to be processed by using strong hypotheses, such as type of object, object orientation and distance. Several systems for automatic license plate reading are being developed using such strong hypotheses. However. their strong assumptions limit their applications and complicate the extension of the systems. The MTC method assumes the most reasonable hypotheses possible for characters: they occupy plane areas, consist of narrow lines, and external shadow is considerably larger than character lines. The first step is to eliminate the effect of local brightness changes by enhancing feature including characters. This is achieved by applying mathematical morphology by using a logarithmic function. The enhanced gray-scale image is then binarized. Accurate binarization is achieved because local thresholds are determined from the edges detected in the image. The MTC method yields stable binary results under illumination changes, and, consequently, ensures high character reading rates. This is confirmed with a large number of images collected under a wide variety of weather conditions. It is also shown experimentally that MTC permits stable recognition rate even if the characters vary in size.

Poled polymer films doped with novel nonlinear organic materials, α-cyano unsaturated carboxylic acid (α-CUCA) derivatives, are prepared. Linear and second-order nonlinear optical properties are investigated. It is found that as the value of hyperpolarizability of the derivatives increases, the second-order nonlinear susceptibility of the film increases. Cerenkov-type second harmonic generation (SHG) of Nd: YAG laser is realized in a poled polymer waveguide doped with the α-CUCA material with a slight absorption at doubled wavelength.

String grammars (languages) have been extensively studied from 60's. On the other hand, the transformational grammar, proposed by Chomsky, contains the transformation from the set of derivation trees of context-free language to the surface set. And the grammar regarded a tree as an input sentence to some transducer. After that from latter half of 60's, the studies of acceptor, transducer, and so on, whose input is a tree, have been done extensively. In this paper we propose, as a model, a new type of transducer which translates trees into trees and investigate its fundamental properties. The model proposed here is the pushdown tree transducer (for shortly PDTT) that is an extension of the finite state tree transducer discussed by J. W. Thacher, W. C. Rounds, J. Engelfriet, and so on. The main subjects discussed here (we consider only top-down case (t-PDTT)), are as follows: (1) final state t-PDTT translation is equivalent to empty stack t-PDTT translation and vice versa, (2) for any t-PDTT, a single state t-PDTT which is equivalent to it always exists, (3) as a standard form the symmetric stack form t-PDTT is proposed and based on this, it is shown that any single state t-PDTT can be always converted into a linear stack t-PDTT, and so on.

High performances of CMOS/SOI inverter by simulations of analytical model, reducing the poly-Si gate thickness (tm), and experiments are verified and proposed. It is shown that the tm and gate oxide thickness(tox) are correlated to gate fringing capacitance, which largely influences on the Propagation Delay Time(TPD). Contributions of gate fringing capacitance to CMOS/SIMOX inverter time delay in deep submicrometer gate devices are propounded. Measurements of the fifty-one stage ring oscillator's TPDs are completed for comparison with analytical model. Simulation results by the analytical model, including Time-Dependent Gate Capacitance (TDGC) model, agree well with the experimental results at the same conditions. Simulation results are also predicted that SOI technology is promising for speed enhancement by reducing the poly-Si gate thickness, while the tox remains constant. It is concluded that the TPDs by reducing the tm to zero are improved up to about two times faster than typically fabricated ring oscillator at 350 nm of the tm in deep-submicrometer gate CMOS/SIMOX inverters at room temperature.

An analysis of wave guidance by surface-relief grating waveguides is presented for the case of oblique propagation. This analysis is based on the first-order differential equations expressing the coupling of the space harmonics and an improved differential method is applied to solve the equations in the grating region with arbitrary profile. The propagation constants are calculated for isotropic grating waveguids with sinusoidal profile and the calculated results indicate that the accurate solutions can be obtained by increasing the number of expansion terms and the number of segments. Moreover, this method is extended to the case of the analysis of obliquely propagating waves and it is shown that peculiar leaky waves and stop bands appear owing to the coupling between TE and TM waves.

In this paper, a novel Y-junction type demultiplexer utilizing a stratified-waveguide configuration in the branching region is proposed for the purpose of improving the extinction ratio. A high extinction ratio of about 20 dB is achieved at 0.6328 µm and 0.83 µm operation wavelengths both for the TE and TM modes. The properties of the new type branchig waveguides which consist of the diffused waveguide and the striploaded waveguide are described to explain the operation principle. Simulation results by the BPM are also shown to check the designed values of the waveguide parameters.

The characteristics of an open-boundary Cherenkov laser for an electromagnetic wave with a continuous frequency spectrum are numerically analyzed. A given power spectral density for the input wave is found to get concentrated around the frequency where the spatial growth rate is maximum, as it grows along the electron beam. In addition, the frequency for the maximum growth rate is found to shift gradually to higher values. Furthermore, by gradually increasing the permittivity of the dielectric waveguide along it, we can always get the maximum power spectral density at the frequency where the spatial growth rate initially becomes maximum at the input.

The antennas for subsurface radar are usually covered with a conducting cavity to prevent the radiation field from affecting the electromagnetic environment and to protect the received field from external noises. Furthermore, radiowave absorber is attached to the interior wall of the cavity in order to suppress the multiple reflections in the cavity. In this paper, the characteristics of the two-dimensional cavity-backed antenna having the absorber and the over-all properties of this subsurface radar due to buried objects are numerically analyzed by the Finite-Difference Time-Domain method. It is shown that the pulse propagation in the ground is confined to the narrow region due to the cavity. It is also shown that the multiple reflections in the cavity are effectively suppressed by choosing the suitable absorber, and so that the distinctive pulse echo can be obtained.

For each two positive integers r, s, let [1DCM(r)-Time(ns)] ([1NCM(r)-Time(ns)]) and [1DCM(r)-Space(ns)] ([1NCM(r)-Space(ns)]) be the classes of languages accepted in time ns and in space ns, respectively, by one-way deterministic (nondeterministic) r-counter machines. We show that for each X{D, N}, [1XCM(r)-Time(ns)][1XCM(r+1)-Time(ns)] and [1XCM(r)-Space(ns)][1XCM(r+1)-Space(ns)]. We also investigate the relationships between one-way multicounter machines and cooperating systems of one-way finite automata. In particular, it is shown that one-way (one-) counter machines and cooperating systems of two one-way finite automata are equivalent in accepting power.

The fast and highly reliable method reported here uses two techniques to detect all types of defects, such as unsoldered leads, solder bridges, and misalignes leads in the minute solder joints of high density mounted devices. One technique uses external force applied by an air jet that vibrates or shifts unsoldered leads. The vibration and shift is detected as a change in the speckle pattern produced by laser illumination of the solder joints. The other technique uses fluorescence generated by short-wavelength laser illumination. The fluorescence from a printed circuit board produces a silhouette of the solder joint and this image is processed to detect defects. Experimental results show that this inspection method detects all kinds of defects accurately and with a very low false alarm rate.

This letter presents a new method for adaptive control of nonminimum phase discrete-time systems with disturbances based on the technique of pole-zero placement. The long division method is used to decompose apolynomial into a stable polynomial and an unstable one. Finally, the results of computer simulation are presented to illustrate the effectiveness of the proposed method.

In this paper, an exact algorithm for finding minimum test set which detects all testable stuck-at faults of a given combinational circit is presented. So far several heuristic algorithms for this problem are proposed, but no efficient exact algorithms are known. To solve this exactly, minimum test set problem is formalized as a minimum set covering problem, and then implicit manipulation technique using binary decision diagrams(BDDs) is applied. The algorithm presented in the paper has two contributions. One is utilization of maximal compatible fault set, which can drastically reduce the number of candidates for minimum test set. A new BDD based algorithm for extracting all maximal compatible fault sets is shown. The other is a new implicit manipulation technique handling with huge covering matrix. Actually, the algorithm using this technique can handle minimum set covrering problem with over ten thousand columns in a few minutes. Experiments using ISCAS benchmark circuits show that the algorithm is quite efficient for small(100-300 gates) circuits. A computational complexith of minimum test set problen is much higher than that of ordinary test pattern generation problem, so that practical signifcance of this method is not high. But the algorithm is still useful for evaluation of other heuristic algorithms. furthermore, this implicit manipulation technique can also be applied to other minimumset covering problems.