Laser module fabricated with silicon platform technology is very attractive for low-cost modules. The technology enables passive optical alignment of an LD to an optical fiber. Our marker design for passive alignment allows positioning accuracy within 1 µm of LD. However, coupling efficiency is a key issue because that by conventional butt coupling scheme is low with about 10 dB coupling loss. We investigated optical coupling characteristics in various types of coupling scheme: conventional flat end fibers, cone fibers, integrated GRIN rod lenses on the platform and the coupling with new-type LDs integrated with spot size transformer. Improvement of coupling efficiency with 3 dB and 7.5 dB compared to flat-end fiber is achieved by using the cone fiber and the GRIN rod lens, respectively, although 1-dB coupling tolerances for alignment deteriorated with these schemes. We obtained high efficient coupling with 3.5 dB coupling loss and wide alignment tolerance of 2.3 µm simultaneously with a new-type LD integrated with spot size transformer owing to its expanded spot size characteristics.

We proposed a new marker design for passive alignment of a laser to a fiber on a silicon waferboard. Our fiducial marker is simple form and easy to fabricate. With a unique marker design, high accurate positioning of the laser chip is easily achieved using a conventional flip-chip bonder. We have successfully fabricated laser modules with uniform coupling, within 1 dB for a flat end single-mode fiber and within 2 dB for a hemispherical end fiber. This assembly method offers the potential for low-cost optical module packaging.

A novel delivery management system using a new lot sampling scheduling (LSS) method has been developed. The method involves the concepts of "virtual line" and "marker lot," and the system consists of an on-line scheduler executing short-period scheduling for lot-tracking and an off-line scheduler executing long-period scheduling for delivery date simulation. The LSS method can hugely increase the maximum number of lots to simulate the delivery date and also control TAT more effectively compared to conventional dynamic scheduling. Lot progress is controlled by varying the resource allocation ratio for each virtual line. This method is effective for precise delivery date control of lots with various priorities in ASIC production or development lines.

This paper introduces a new class of machines called multihead marker finite automata, and investigates how the number of markers affects its accepting power. Let HM{0}(i, j)(NHM{0}(i, j))denote the class of languages over a one-letter alphabet accepted by two-way deterministic (nondeterminstic) i-head finite automata with j markers. We show that HM{0} (i, j) HM{0}(i, j1) and NHM{0}(i, j) NHM{0}(i, j+1) for each i2, j0.

A case structure expression is one of the most important forms to represent the meaning of the sentence. Case structure analysis is usually performed by consulting case frame information in a verb dictionary. However, this analysis is very difficult because of several problems, such as word sense ambiguity and structural ambiguity. A conventional method for solving these problems is to use the method of selectional restriction, but this method has a drawback in the semantic marker (SM) method --the trade-off between descriptive power and construction cost. In this paper, we propose a method of case structure analysis based on examples in case frame dictionary This method uses the case frame dictionary which has some typical example sentences for each case frame, and it selects a proper case frame for an input sentence by matching the input sentence with the examples in the case frame dictionary. The best matching score, which is utilized for selecting a proper case frame for a predicate, can be considered as the score for the case structure of the predicate. Therefore, when there are two or more readings for a sentence because of structural ambiguity, the best reading of a sentence can be selected by evaluating the sum of the scores for the case structures of all predicates in a sentence. We report on experiments which shows that this method is superior to the conventional, coarse-grained SM method, and also describe the superiority of the example-based method over the SM method.