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 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 rigorous radar cross section (RCS) analysis of a two-dimensional parallel-plate waveguide cavity with three-layer material loading is carried out for the E- and H-polarized planc wave incidence using the Wiener-Hopf technique. Introducing the Fourier transform for the scattered field and applying boundary conditions in the transform domain, the problem is formulated in terms of the simultaneous Wiener-Hopf equations satisfied by the unknown spectral functions. The Wiener-Hopf equations are solved via the factorization and decomposition procedure together with rigorous asymptotics, leading to the efficient approximate solution. The scattered field in the real space is evaluated by taking the inverse Fourier transform and applying the saddle point method. Representative numerical examples on the RCS are given for various physical parameters. It is shown that the three-layer lossy material loading inside the cavity results in significant RCS reduction over broad frequency range.

Optical WDM (Wavelength Division Multiplexing) technology is a method of exploiting the huge bandwidth of optical fibers. Local lightwave networks which use fixed wavelength transmitters and receivers can be built in a multihop fashion. In multihop local lightwave networks, packets arrive at their destination by hopping a number of intermediate nodes. The channel sharing schemes for multihop lightwave networks have been proposed for efficient channel utilization, but those schemes result in the degradation of network capacity and the user throughput. In this paper, we propose an improved WDM channel sharing scheme using the logically bidirectional perfect shuffle interconnection pattern, achieving smaller number of average hops for transmission and better channel utilization efficiency. Better channel utilization efficiency is obtained without much deteriorating the network capacity and the user throughput. TDMA (Time Division Multiple Access) protocol can be used to control the sharing of channels, and time delay and lost packet probability analysis based on TDMA is performed.

This paper addresses a method for constructing surface representation of 3D structures from a sequence of cross-sectional images. Firstly, we propose cell-boundary representation, which is a generalization of PVP method proposed by Yun and Park, and develop an efficient surface construction algorithm from a cell-boundary. Cell-boundary consists of a set of boundary cells with their 1-voxel configurations, and can compactly describe binary volumetric data. Secondly, to produce external surface from the cell-boundary representation, we define 19 modeling primitives (MP) including volumetric, planar and linear groups. Surface polygons are created from those modeling primitives using a simple table look-up operation. Since a cell-boundary can be obtained using only topological information of neighboring voxels, there is no ambiguity in determining modeling primitives which may arise in PVP method. Since our algorithm has data locality and is very simple to implement, it is very appropriate for parallel processing.

The paper discusses properties of YBaCuO thick films produced by screen printing method and followed sintering of a paste made from pre-annealed powder on Yttrium Stabilized Zirconia (YSZ) and MgO substrates. The prepared films have been studied by X-ray diffraction, scanning electron microscopy (SEM) and resistance vs. temperature measurements.

Dynamic programming based one dimensional-two dimensional adaptive pattern matching methods were investigated. In these methods, the reference pattern is represented as a sequence of directional vectors and the input pattern as two dimensional dot pattern. The input pattern needs no preskeletization or local feature analysis, and thus stroke order free top-down pattern matching is carried out. As the starting point, Rubber String Matching algorithm using fixed direction vectors was newly investigated. At latter stages, the reference pattern vectors were permitted some freedom in their directions to cope with abrupt aberrations in input pattern line segments, improving the flexibility of matching. Two cases were considered, allowing 45and approximately 20deviations from the vector directions. The 20version gave the best recognition score.

A new steepest descent linear adaptive algorithm, called the proportion-sign algorithm (PSA), is introduced and its performance analysis is presented when the signals are from zero-mean jointly stationary Gaussian processes. The PSA improves the convergence speed over the least mean square (LMS) algorithm without overly degrading the steady-state error performance and has the robustness to impulsive interference occurring in the desired response by adding a minimal amount of computational complexity. Computer simulations are presented that show these advantages of the PSA over the LMS algorithm and demonstrate a close match between theoretical and empirical results to verify our analysis.

This paper proposes a new subband adaptive filtering algorithm for adaptive FIR filters. The number of taps for each subband filter is adaptively controlled based on a sum of the absolute coefficients or the coefficient power in conjunction with the subband signal power. Keeping the total number of taps constant, redundant taps are redistributed to subbands where the number of taps is insufficient. Simulation results with a white signal show that the number of taps in each subband approaches an optimum as each subband filter converges. For a colored signal, tap assignment by the new algorithm is as stable as for a white signal.

A Wavelength Division Multiaccess (WDMA) network with buffer sharing among stations is studied. All stations in the network are connected to a passive optical star coupler and each station has a different fixed wavelength laser for transmitting packets. Each station in the network reports its packet backlog to a scheduler which computes and then broadcasts a transmission schedule to all the stations through a control channel in each time slot. A transmission schedule includes two types of assignments: 1) assign a maximum number of stations for conflict-free transmissions, and 2) assign the relocation of packets from congested stations to uncongested relaying stations through idling transceivers for distributed buffer sharing. The first assignment aims at maximizing throughput and the second assignment aims at minimizing packet loss. Simulation results show that as much as 75% of the buffers can be saved with the use of buffer sharing when 50% of the packets are of the non-sequenced type.

We have systematically grown and characterized (Bi, Pb)2Sr2CaCu2Oy (BPSCCO) single crystals, and investigated the tunneling properties and the intrinsic Josephson effects of the single crystals as a function of the nominal composition of Pb, x. It was observed that Pb atoms (ions) were monotonically substituted for Bi atoms (ions) in the (Bi, Pb)-O layers of the crystals with increasing x in a region of 0x0.5, while the modulation structure was maintained in a range of 0x0.3, but disappeared in x0.3, accompanying the decrease of c-lattice parameter and Tc. Moreover, it was found that the energy gaps Δ of BPSCCO depend hardly on x for x0.5, which are about 24 meV, so that the Pb-induced electronic change in the (Bi, Pb)-O layer do not perturb the electronic states in this superconducting system. And it was confirmed that the currentvoltage characteristics of the BPSCCO single crystals had multiple resistive branches corresponding to a series array of several hundreds Josephson junctions, and showed Shapiro steps and zero-crossing steps with the voltage separation of the order of mV resulting from the phase locking of about a hundred Josephson junctions among them under microwave irradiation. The estimated number of junctions gave the concept that the intrinsic Josephson junctions consist of the superconducting block layers and the insulating layers in the BPSCCO single crystals.

An annoying problem encountered in automatic seal imprint verification is that for seal imprints may have a lot of variations, even if they are all produced from a single seal. This paper proposes a new automatic seal imprint verification system which adds an imprint quality assessment function to our previous system in order to solve this problem, and also examines the verification performance of this system experimentally. This system consists of an imprint quality assessment process and a verification process. In the imprint quality assessment process, an examined imprint is first divided into partial regions. Each partial region is classified into one of three quality classes (good quality region, poor quality region, and background) on the basis of characteristics of its gray level histogram. In the verification process, only good quality partial regions of an examined imprint are verified with registered one. Finally, the examined imprint is classified as one of two types: a genuine and a forgery. However, as a result of quality assessment, if the partial regions classified as poor quality are too many, the examined imprint is classified as ambiguous" without verification processing. A major advantage of this verification system is that this system can verify seal imprints of various qualities efficiently and accurately. Computer experiments with real seal imprints were performed by using this system, previous system (without image quality assessment function) and document examiners of a bank. The results of these experiments show that this system is superior in the verification performance to our previous system, and has a similar verification performance to that of document examiners (i.e., the experimental results show the effectiveness of adding the image quality assessment function to a seal imprint verification system).

A superconducting multichip module using Nb/Polyimide on a mullite multilayer ceramic substrate has been developed for Josephson LSI circuits. The Nb/Polyimide stacked layers on the mullite multilayer ceramic substrate makes it possible to fabricate superconducting off-chip wiring for control signal line. We named the MCM "SuperMCM". The superconducting transmission line is designed to have the characteristic impedance of 14 Ω to match with the Josephson devices. The superconducting critical temperature, critical current density and critical current at a via hole are 8.5 K, 8.2105 A/cm2 and 2.5 A, respectively. The SuperMCM also provides matching circuits employing quarter wavelength striplines for driving Josephson LSI circuits at a microwave frequency, and DC bias circuits in the mullite multilayer ceramic substrate. The characteristics of the matching circuit is measured in the frequency range up to 3.6 GHz and the microwave current gain of 20 dB is obtained at 1.2 GHz, which revealed that the SuperMCM has the ability to drive the Josephson LSI circuits at more than 1.2 GHz clock speed.

Almost stoichiometric YBa2Cu3O7-δ(110) or (103) and SrTiOx(110) films, and multilayer films consisting of them have successfully been grown epitaxially on hot SrTiO3 substrates by 90off-axis rf magnetron sputtering with facing targets. Their whole composition, compositional distribution in depth, crystallinity and surface morphology were examined by inductively coupled plasma spectroscopy, Auger electron spectroscopy, reflection high-energy electron diffraction, and scanning tunneling microscopy or atomic force microscope, respectively. When any YBa2Cu3O7-δ film was exposed to air after deposition, a Ba-rich layer was formed in a near surface region of the film. However, such a compositional distribution in depth of the film was improved by in situ deposition of a SrTiOx film on it. Moreover, the surface roughness of the YBa2Cu3O7-δ film was improved by predeposition of a SrTiOx film under it. On the basis of these results, both YBa2Cu3O7-δ/SrTiOx/YBa2Cu3O7-δ/SrTiO3(sub.) and YBa2Cu3O7-δ/SrTiOx/YBa2Cu3O7-δ/SrTiOx/SrTiO3(sub.) multilayer films with average surface roughness of 3 nm were grown reproducibly, which had uniform compositional distribution throughout the depth of the film except a near surface region of the top YBa2Cu3O7-δ layer. A new 222 structure described by Sr8Ti8O20 (Sr2Ti2O5) with a long range ordered arrangement of oxygen vacancies was formed in the SrTiOx films deposited epitaxially on YBa2Cu3O7-δ films.

Advanced Traveller Information Systems (ATIS) and Advanced Traffic Management Systems (ATMS) require real-time traffic data to observe and control the trafic flow. Still, there is a lack of proficient traffic monitoring systems. One method to collect such data is using particular equipped vehicles, called probes, transmitting experienced travel times to base stations which in turn are connected to a traffic control center. In this paper we analyse the performance of a radio network for collecting real-time traffic data from probes. The results reveal that random transmission of traffic reports is a (spectrum) efficient, inexpensive and flexible method for collecting road traffic data that can provide reliable traffic monitoring.

A method for extracting and recognizing character strings from unformed document images, which have inclined character strings and have no structure at all, is described. To process such kinds of unformed documents, previous schemes, which are intended only to deal with documents containing nothing but horizontal or vertical strings of characters, do not work well. Our method is based on the idea that the processes of recognition and extraction of character patterns should operate together, and on the characteristic that the character patterns are located close to each other when they belong to the same string. The method has been implemented and applied to several images. The experimental results show the robustness of our method.

This paper presents an algorithm for string searching in a character lattice. A character lattice, which is obtained through a character recognition process, is a general and flexible data structure that represents many hypothesized strings in a document image. In this paper, the authors propose a simple and efficient algorithm; it consists of a single loop of some set-operations and scans the character lattice only once. The authors also describe two actual implementations of the algorithm; one uses Bit-Arrays and the other a Trie. Owing to its bir parallelism, the Bit-Array approach is able to search for a single pattern faster than the Trie approach, and is easily extended to complex matchings such as an approximate one. It is suited for document retrieval systems that need to search for a keyword as fast as possible. A hashed compact version of the character lattice is also useful to increase the speed of the search for a single pattern. In contrast, the Trie approach is able to search for a large number of patterns simultaneously, and is suited for document understanding systems that need to extract words from the character lattice. The experimental results have shown that both approaches achieve high performance.

The demand for mobile communication services is rapidly increasing, because the mobile communication service is synonymy of an ideal communication style realizing communication in anytime, anywhere and with anyone. The development of economic and social activities is a primary factor of the increasing demand for mobile communication services. The demand stimulates the development of technology in mobile communication including personal communication services. Thus mobile communication has been one of the most active research in communications in the last several years. There exist various problems to which graph & network theory is applicable in mobile communication services (for example, channel assignment algorithm in cellular system, protocol in modile communication networks and traffic control in mobile communication ). A model of a cellular system has been formulated using a graph and it is known that the channel assignment problem is equivalent to the coloring problem of graph theory. Recently, two types of coloring problems on graphs or networks related to the channel assignment problem were proposed. Mainly, we introduce these coloring problems and show some results on these problems in this paper.

The studies on the biological effects of ELF electric fields conducted in Japan are reviewed. Among international studies, they are characterized as the studies from the viewpoint of bioengineering. In early studies, the safety standard of high voltage transmission lines was determined by a distinct biological effect, i.e., the sensation of the spark discharge caused by electrostatic induction. In numerical analysis, the field coupling to both animal and human bodies became well understood. Some new measurement techniques were developed which enabled us to evaluate the field exposure on a human body. A system was developed to realize the chronic exposure of an electric field on mice and cats. An optical telemetry technique was developed to measure the physiological response of an animal when it was exposed to an electric field. An ion-current shuttle box was developed to investigate the behavioral change of a rat when it was exposed to an ion-current as well as an electric field. In animal experiments, a mechanism of sensing the field was investigated. The cause of the seasonal change of field sensitivity was found. In cases of chronic exposure, suppression of growth was suspected. In shuttle box studies, an avoidance behavior from an ion-current was quantified. To find whether there are any adverse or beneficial effects of the field exposure on human beings, further study is required to clarify the mechanisms of the biological effects.

There have been several interesting investigations on the space functions constructed by one-dimensional or two-dimensional Turing machines. On the other hand, as far as we know, there is no investigation about the space functions constructed by three-dimensional Turing machines. In this paper, we investigate about space constructibility by three-dimensional deterministic Turing machines with cubic inputs, and show that the functions log*n and log(k)n, k1, are fully space constructible by these machines.