This paper introduces an adaptive distributed routing algorithm for the faulty star graph. The algorithm is based on that the n-star graph has uniform node degree n-1 and is n-1-connected. By giving two routing rules based on the properties of nodes, an optimal routing function for the fault-free star graph is presented. For a given destination in the n-star graph, n-1 node-disjoint and edge-disjoint subgraphs, which are derived from n-1 adjacent edges of the destination, can be constructed by this routing function and the concept of Breadth First Search. When faults are encountered, according to that there are n-1 node-disjoint paths between two arbitrary nodes, the algorithm can route messages to the destination by finding a fault-free subgraphs based on the local failure information (the status of all its incident edges). As long as the number f of faults (node faults and/or edge faults) is less than the degree n-1 of the n-star graph, the algorithm can adaptively find a path of length at most d+4f to route messages successfully from a source to a destination, where d is the distance between source and destination.

An experiment is reported comparing six pen input strategies for selecting a small target using five diffenent sized targets (1, 3, 5, 7 and 9 dot diameter circles respectively, 0. 36 mm per dot). The results showed that the best strategy, in terms of error rate, selection time and subjective preferences, was the "land-on2" strategy where the target is selected when the pen-tip touches the target for the first time after landing on the screen surface. Moreover, "the smallest maximum size" was determined to be 5 dots (1. 8 mm). This was the largest size among the targets which had a significant main effect on error rate in the six strategies. These results are important for both researchers and designers of pen-based systems.

This paper presents an integrated network configuration of wired and wireless access systems for nomadic computing and discusses the virtual LAN on a wireless access system. Furthermore, different types of ad hoc networks are summarized to delineate nomadic computing styles. In terms of user mobility, the integrated network provides a seamless connection environment, so a user can move between wireless and wired networks without dropping data communication sessions. This function is critical for nomadic computing users. By defining the integrated network and employing a virtual LAN, a nomadic computing environment can be realized. This paper reviews the key issues to realize integrated networks. They are mobile management including mobile IP, virtual IP and Logical Office, a high performance MAC, and security control.

In this paper, we extend the Gnaedig's results on termination of order-sorted rewriting. Gnaedig required a condition for order-sorted signatures, called minimality, for the termination proof. We get rid of this restriction by introducing a transformation from a TRS with an arbitrary order-sorted signature to another TRS with a minimal signature, and proving that this transformation preserves termination.

Multi-lingual handwriting means the script written with more than one language. In this paper, a hierarchical hidden Markov model network-based approach is proposed for on-line recognition of multi-lingual cursive handwritings. Basic characters of language, language network, and intermixed use of language are modeled with hierarchical relations. Since recognition corresponds to finding an optimal path in such a network, recognition candidates of each language are combined with probability without special treatment. Character labels of handwriting, language modes, and segmentation are obtained simultaneously. However, several difficulties caused by multiple language occurred during recognition. Applied heuristic methods are Markov chain for language mode transitions, pairwise discrimination for confusing pairs, and constrained routines for side effects by language related preprocessing methods. In spite of the addition of other language, recognition accuracy of each language drops negligibly on experimental results of multi-lingual with Hangul, English, and Digit case.

K-randomness and Martin-Lof randomness are among many formalizations of randomness of infinite sequences, and these two are known to be equivalent. We can naturally modify the former to the definition of partial randomness. However, it is not obvious how to modify the latter to the definition of partial randomness. In this paper, we show that we can modify Martin-Lof randomness to a definition of partial randomness that is equivalent to the definition obtained by naturally modifying K-randomness. The basic idea is to modify the notion of measures used in the definition of Martin-Lof tests.

This paper studies the routing algorithms for multi-destination connections where each destination may require different amount of data streams. This asymmetric feature can arise mostly in a large and/or heterogeneous network environment. There are mainly two reasons for this. One is that terminal equipments may have different capabilities. The other is that users may have various interests in the same set of information. We first define the asymmetric multicast problem and describe an original routing method for this type of multicast. The method is then employed in the presented routing algorithms, which can be run in multi-cluster environment. The multi-cluster architecture is considered to be effective for running routing in the networks, where a variety of operating methods might be applied in different clusters but global network performance is required. Our algorithms are designed based on some classical Steiner tree heuristics. The basic goal of our algorithms is to make routing decisions for the asymmetric multicast connections with minimum-cost purpose. In addition, we also consider delay constraint requirements in the multicast connections and propose correspondent algorithms. We compare the performance between SPT (Shortest Path Tree)-based algorithms and the presented algorithms by simulations. We show that performance difference exists among the different types of the algorithms.

A fiber Bragg grating, which has periodical perturbation of the refractive index in the fiber core, acts as a wavelength selective reflection filter and steep optical spectrum can be realized by forming more than ten thousand of gratings along the fiber core. Owing to capability of making steep optical spectrum, fiber Bragg gratings has been expected to be introduced practical use as multiplexing or demultiplexing filters in dense WDM transmission systems. On the other hand, radiation mode loss, reflection side mode and temperature dependence of Bragg wavelength, should be improved to put the fiber Bragg grating to practical use in dense WDM transmission systems. In this paper, an optimum design and performance of the fiber Bragg grating for dense WDM systems are described. The photosensitive cladding fiber realized less than 0. 2 dB insertion loss at transmitted signal channels and less than 0. 1 dB splicing loss with standard single-mode fibers. An adequate apodization technique in the refractive index distribution suppressed reflection side modes. A temperature compensating package, which gives longitudinal strain with negative temperature dependence to a fiber Bragg grating, minimized temperature dependence of Bragg wavelength less than 0. 001 nm/. Thermal decay of Bragg grating was also investigated and adequate annealing condition was estimated to obtain sufficient stability for practical use in dense WDM transmission.

Planar lightwave circuits (PLCs) provide various important devices for optical wavelength division multiplexing (WDM) systems, subscriber networks and etc. This paper reviews the recent progress and future prospects of PLC technologies including arrayed-waveguide grating multiplexers, optical add/drop multiplexers, programmable dispersion equalizers and hybrid optoelectronics integration technologies.

This paper describes the design of polarization insensitive InP-based arrayed waveguide gratings (AWGs), and the characteristics of fabricated devices. The use of a deep-ridge waveguide structure made the fabrication of compact polarization-insensitive AWGs possible. As a result, a low crosstalk (-30 dB) 8-channel AWG and a large-scale (64 channel) AWG with 50 GHz channel spacing could be fabricated. An integrated circuit containing an 8-channel AWG with photodetectors is also described.

High- and low-reflection Bragg gratings with a flat-top spectral response free from ripples are proposed. Add/drop filters are created based on gratings photoinduced on planar waveguides by using the new design schemes. The measured spectral responses for the high and low reflection gratings are in good agreement with the calculated ones, and show the flat-top spectral responses.

Well-defined wavelength distributed feedback laser diodes (DFB-LDs) are required in WDM network systems. Since the EDFA gain bands have been expanded, even more wavelengths are needed for large-capacity dense-WDM transmission systems. A precisely pitch-controlled Bragg grating fabricated by electron beam (EB) lithography is very attractive for realizing these DFB-LDs. This paper describes this precise pitch- and phase-controlled grating delineated by a novel method called weighted-dose allocation variable-pitch EB-lithography (WAVE). In this method, an EB-dose profile for the grating is precisely controlled by a combination of the allocation and weighting of multiple exposures. This enables us to fabricate a precise fixed-pitch grating as well as a flexible grating with a continuously chirped structure. The stitching error at the exposure field boundary, the grating pitch, and the phase shift were evaluated by using a moire pattern generated by superimposing the microscope raster scan and the grating on a wafer. We also estimated amounts of the stitching errors from fabricated and calculated lasing characteristics, and clarified that the affect of the errors on the single-mode stability of LDs is negligible. Precise wavelength controlled λ/4 phase shifted DFB-LDs were successfully demonstrated as a result of both the WAVE method and the highly uniform MOVPE crystal growth.

Recent technologies of organic film devices are reviewed. New technologies of fabrication and characterization of organic thin films, electro-mechanical conversion materials, and applications for electrical and optical devices are discussed. In this review paper, especially organic light emitting diodes, tunneling junctions using polyimide Langmuir-Blodgett films, tunneling spectroscopy and high-density recording, plastic actuators using conducting polymers, molecular self-assembly process for fabricating organic thin film devices are reviewed.

In this paper, we propose a novel power distribution method which can be adopted in case of the nonuniform distribution for mobiles in DS/CDMA distributed power cellular system. DS/SS distributed power cellular system has been proposed for achieving RAKE reception in micro-cellular environment. In forward link of this system, optimum power distribution method which can minimize the required total transmitting power has been discussed. The performance of this system has been shown in case of the uniform distribution for mobiles. In this paper, first, we propose a novel method in case of the nonuniform distribution. In the proposed method, replacing the path and its combinations of signals from base stations successively, we can find a new condition of less power distribution which is passed over in a conventional distribution method. We adopt simple distribution models for mobiles and compare the proposed method with the other methods by computing the total transmitting power and the quantity of calculations. As a result, we show that it is possible to almost obtain optimum power distribution by using the proposed method. Next, we adopt a nonuniform distribution model, in which the difference of the number of users exists only in the center cell. Using this model, we compare the proposed method with the other methods by computing the total transmitting power, the quantity of calculations, and a probability of impossible power distribution. Finally, in order to simplify and decrease the quantity of calculations of the proposed method, we propose a modified calculation algorithm which is applicable in case of that a new mobile station has increased. And we show the performance of this algorithm.

IDDQ testing, or current testing, is a powerful method which detects a large class of defects which cause abnormal quiescent current, by measuring the power supply current. One of the problems on IDDQ testing which prevent its full practical use in manufacturing is that the testing speed is slow owing to time-consuming IDDQ measurement. One of the solutions to this problem is test pattern compaction. This paper presents an efficient method for generating a compact test set for IDDQ testing of bridging faults in combinational CMOS circuits. Our method is based on the iterative improvement method. Each of random primary input patterns is iteratively improved through changing its values pin by pin selected orderly, so as to increase the number of newly detected faults in the current yet undetected fault set. While our method is simple and easy to implement, it is efficient. Experimental results for large ISCAS benchmark circuits demonstrate its efficiency in comparison with results of previous methods.

The advantage of random testing is that test application can be performed at a low cost in the BIST scheme. However, not all circuits are random pattern testable due to the existence of random pattern resistant faults. In this paper, we present a method for improving the random pattern testability of logic circuits by partial circuit duplication approach. The basic idea is to detect random pattern resistant faults by using the difference between the duplicated part of a circuit and the original part. Experimental results on benchmark circuits show that high fault coverage can be achieved with a very small amount of hardware overhead.

This paper presents a test generation method for sequential circuits under IDDQ testing environment and the identification of untestable faults based on the information of illegal states. We consider a short between two signal lines, a short within one gate and a short between two nodes in different gates. The proposed test generation method consists of two techniques. First technique is to use weighted random vectors, and second technique is to use test generator for stuck-at faults. By using the two techniques together, high fault coverage and short computational time can be achieved. Finally experimental results for ISCAS89 benchmark circuits are presented.

This paper newly proposes the CMT/IM/DD system for universal radio access networks where radio base stations (RBSs) and an optic backbone network are universally available among different radio services and providers. In the proposed system, the Chirp Fourier transformer at an RBS, converts the received FDM multiple radio service signals into optical TDM format signals, then transfers them over the optic fiber-link. This paper is focused on the discussion about the performance on the up-link of the CMT/IM/DD system. A new type of the configuration of CMT and the direct demodulation for the CMT signal are also proposed, and the SNR considering inter-symbol and inter-channel interferences caused by the CMT is theoretically analyzed. Analysis results show that the overall SNR performance of the CMT system is superior to the conventional SCM system when the number of radio channels is more than 26.

Cellular automata (CA) implementations are expected as potential test-pattern generators (TPGs) for Built-In Self-Testing of VLSI circuits, in which highly random parallel patterns ought to be generated with simple hardware. Objective here is to design one-dimensional, binary, and linear CA implementations with cyclic boundary conditions that can operate on maximum length of period. To provide maximum period of operations, it is necessary to bring some irregularities into the configurations. It is also expected for TPGs to make maximum or sufficiently long period of operations to prevent re-initialization. Our approach is to generate transition matrices based on fast parallel implementations of LFSRs which have trinomials as characteristic polynomials and then to modify the diagonal components. Some notable properties of diagonal vectors were observed.

Multicolor light emitting diodes (LEDs) which emit red (R), green (G) and blue (B) light have been realized by stacking a two-color emission part on a single-color emission part. The former part consists of two emissive layers of red and blue light, which can be selected by changing the polarity of applied field. The latter part consists of a single-color emission part which emits green light. The emission from the diode in the whole visible spectral range can be modulated by the combination of applying various voltages to the two-color and to the single-color emission parts, separately.