The byte error locating codes specify the byte location in which errors are occurred without indicating the precise location of erroneous bit positions. This type of codes is considered to be useful for fault isolation and reconfiguration in the fault-tolerant computer systems. In this paper, difference between the code function of error-location and that of error-correction/error-detection is clarified. With using the concepts of unidirectional byte distance, unordered byte number and ordered byte number, the necessary and sufficient conditions of the unidirectional byte error locating codes are demonstrated.

We propose, for the first time, highly reliable flash-type EEPROM cell fabrication using in-situ multiple rapid thermal processing (RTP) technology. In this study, rapid thermal oxynitridation tunnel oxide (RTONO) film formations followed by in-situ arsenic (As)-doped floating-gate polysilicon growth by rapid thermal chemical vapor deposition (RTCVD) technologies are fully utilized. The results show that after 5104 program/erase (P/E) endurance cycles, the conventional cell shows 65% narrowing of the threshold voltage (Vt) window, whereas the RTONO cell indicates narrowing of less than 20%. A large number of nitrogen atoms (1020 atoms/cm3) are confirmed by secondary ion mass spectrometry (SIMS), pile up at the SiO2/Si interface and distribute into bulk SiO2. It is considered that in the RTONO film stable Si-N bonds are formed which minimize electron trap generation as well as the neutral defect density, resulting in lower Vt shifts in P/E stress. In addition, the RTONO film reduces the number of hydrogen atoms because of final N2O oxynitridation. The SIMS data shows that by the in-situ RTCVD process As atoms (91020 atoms/cm3) are incorporated uniformly into 1000--thick film. Moreover, the RTCVD polysilicon film indicates an extremely flat surface. The time-dependent dielectric breakdown (TDDB) characteristics of interpoly oxide-nitride-oxide (ONO) film exhibited no defect-related breakdown and 5 times longer breakdown time as compared to phosphorus-doped polysilicon film. Therefore, the flash-EEPROM cell fabricated has good charge storing capability.

Recently, a lot of research works have been carried out regarding intelligent communication. If the final information sink is assumed as a human being, a communication channel can be used more effectively when encoders/decoders work "intelligently" or take into account of the semantics of information to be sent. We have been studying error-controlling systems based on different importance of segmental information. The system divides the information input into segments to which individual importance can be assigned. The segments are individually encoded by appropriate error-correcting codes (ECCs) which correspond to their importance among codes with different error-correcting capabilities. For the information that difference of the importance is systematically aligned, conventional UEP (unequal error protection) codes can be applied, but we treat the case that alignment of the importance of the information source is not systematically aligned. Since the system uses multiple ECCs with different (n,k,d) parameters, information regarding what length of the next codeword is required for decoding. We propose error controlling schemes using mulriple ECCs; the first scheme and the second scheme use the obvious codelength identifying information. In the second scheme, information bits are sorted so that segments with the same importance can be encoded by an ECC with the same error-correcting capability. The third scheme is a main proposal in this paper and uses Variable Capability Coding scheme (VCC) which uses some ECCs having different error-correcting capabilities and codelengths. A sequence encoded by the VCC is separable into appropriate segments without obvious codelength identifying information when the channel error probability is low. Subsequently, we evaluate these schemes by coderate when (1) error correcting capability (2) codelength identifying capability are the same. One of the feature of VCC is the capability of resuming from propagative errors because errors beyond the codelength identifying capability occur and the proper beginning of the codeword is lost in the decoder. We also evaluate this capability as (3) resynchronizing capability.

This papter proposes a new type of unidirectional error control codes which indicates the location of unidirectional errors clustered in b-bit length, i.e., unidirectional byte error in b (b2) bits. Single unidirectional b-bit byte error locating codes, called SUbEL codes, are first clarified using necessary and sufficient conditions, and then code construction algorithm is demonstrated. The lower bound on check bit length of the SUbEL codes is derived. Based on this, the proposed codes are shown to be very efficient. Using the code design concept presented for the SUbEL codes, it is demonstrated that generalized unidirectional byte error locating codes are easily constructed.

Learning correctly from queries" is a formal learning model proposed by Angluin. In this model, for a class Γ of language representations, a learner asks queries to a teacher of an unknown language Lq which can be represented by some GqΓ, and eventually outputs a language representation GΓ which represents Lq and halts. An algorithm (leaner) A is said to learn a class of languages represented by Γ in the weak definition if the time complexity of A is some polynomial of n and m, where n is the minimum size of the lagunage representations in Γ which represent Lq, and m is the maximum length of the counterexamples returned in an execution. On the other band, A is said to learn represented by Γ in the strong definition if at any point τ of the execution, the time consumed up to τ is some polynomial of n and m, where n is the same as above, and m is the maximum length of the counterexamples returned up to τ. In this paper, adequacy of the model is examined, and it is shown that both in the weak and strong definitions, there exist learners which extract a long counterexample, and identify Lq by using equivalence queries exhaustively. For example, there exists a learner which learns the class CFL of context-free languages represented by the class CFG of context-free grammars in the weak definition using only equivalence queries. Next, two restrictions concerning with learnability criteria are introduced. Proper termination condition is that when a teacher replies with yes" to an equivalence query, then the learner must halt immediately. The other condition, called LBC-condition, is that in the weak/strong definition, the time complexity must be some polynomial of n and log m. In this paper, it is shown that under these conditions, there still exist learners which execute exhaustive search. For instance, there exists a learner which learns CFL represented by CFG in the weak definition using membership queries and equivalence queries under the proper termination condition, and there also exists a learner that learns CFL represented by CFG in the strong definition using subset queries and superset queries under LBC-condition. These results suggest that the weak definition is not an adequate learning model even if the proper termination condition is assumed. Also, the model becomes inadequate in the strong definition if some combination of queries, such as subset queries and superset queries, is used instead of equivalence queries. Many classes of languages become learnable by our extracting long counterexample" technique. However, it is still open whether or not CFL represented by CFG is learnable in the strong definition from membership queries and equivalence queries, although the answer is known to be negative if at least one of (1) quadratic residues modulo a composite, (2) inverting RSA encryption, or (3) factoring Blum integers, is intractable.

In this paper we propose a new algorithm for recognizing 3-D objects from 2-D images. The algorithm takes the multiple view approach in which each 3-D object is modeled by a collection of 2-D projections from various viewing angles where each 2-D projection is called an object model. To select the candidates for the object model that has the best match with the input image, the proposed algorithm computes the surface matching score between the input image and each object model by using Hopfield nets. In addition, the algorithm gives the final matching error between the input image and each candidate model by the error of the pose-transform matrix proposed by Hong et al. and selects an object model with the smallest matching error as the best matched model. The proposed algorithm can be viewed as a combination of the algorithm of Lin et al. and the algorithm of Hong et al. However, the proposed algorithm is not a simple combination of these algorithms. While the algorithm of Lin et al. computes the surface matching score and the vertex matching score berween the input image and each object model to select the candidates for the best matched model, the proposed algorithm computes only the surface matching score. In addition, to enhance the accuracy of the surface matching score, the proposed algorithm uses two Hopfield nets. The first Hopfield net, which is the same as that used in the algorithm of Lin et al., performs a coarse matching between surfaces of an input image and surfaces of an object model. The second Hopfield net, which is the one newly proposed in this paper, establishes the surface correspondences using the compatibility measures between adjacent surface-pairs of the input image and the object model. the results of the experiments showed that the surface matching score obtained by the Hopfield net proposed in this paper is much more useful for the selectoin of the candidates for the best matched model than both the sruface matching score obtained by the first Hopfield net of Lin et al. and the vertex matching score obtained by the second Hopfield net of Lin et al. and, as the result, the object recognition algorithm of this paper can perform much more reliable object recognition than that obtained by simply combining the algorithm of Lin et al. and the algorithm of Hong et al.

Circuit techniques for realizing fast cycle time of DRAM are described. 1) A high-speed and high-efficiency word-line level Vpp supply can be obtained by a unique static CMOS double-boosted level generator (SCDB) which controls the Vpp charge supply gate. 2) A new write-control scheme eliminates the timing overhead of a read access time after write cycle in a fast page mode operation. 3) A floor plan that minimizes the load of signal paths by employing the lead-on-chip (LOC) assembly technique. These techniques are implemented in an address-multiplexed 16 Mbit CMOS DRAM using a 0.5-µm CMOS technology. A 31-ns RAS cycle time and a 19-ns fast page mode cycle time at Vcc3.3 V, and also even at Vcc1.8 V, a 53-ns RAS cycle time and a 32-ns fast page mode cycle time were achieved. This DRAM is applicable to battery-operated computing tools.

High temperature superconductors are eminently suitable for use in high frequency devices because of their large energy gap. We fabricated weak link Josephson junctions connected in series. The junctions were constructed of EuBa2Cu3O7-x (EBCO) superconducting thin films on bicrystal MgO substrates. We measured their microwave broadband detection (video detection) characteristics. The responsivity (Sr) of the junctions depended on the bias current and their normal state resistance. The array junctions were effective in increasing normal state resistance. We obtained a maximum Sr of 22.6 [V/W].

We propose a new structure of antenna system to enhance the horizontal plane gain and control the antenna pattern, using passive loading. Our proposed structure can be applied to various kinds of antennas on a handset. We discuss the case of a λ/4 monopole antenna on a handset in this paper. In a new structure of λ/4 monopole antenna system, we show that, 1) the increase of the average gain about 5dB in the horizontal plane can be realized by an optimum load, 2) the antenna pattern can be controlled by changing the value of the passive load so as to have some desirable shapes, and 3) the antenna size can be made smaller by about 6% than the one with no loading because the optimum loading makes the resonant frequency lower. These results were confirmed by the calculations using the method of moments for the EFIE and the measurements.

This paper presents a new line extraction method to capture vectors based on contours and skeletons from line drawing raster images in which the lines are touched by characters or other lines. Conventionally, two line extraction methods have generally been used. One is a thinning method. The other is a medial line extraction method based on parallel pairs of contours. The thinning method tends to distort the extracted lines, especially at intersections and corners. On the other hand, the medial line extraction method has a poor capability as regards capturing correct lines at intersections. Contours are able to maintain edge shapes well, while skeletons preserve topological features; thus, a combination of these features effectively leads to the best fitting line. In the proposed method, the line which best fits the original image is selected from among various candidate lines. The candidates are created from several merged short skeleton fragments located between pairs of short contour fragments. The method is also extended to circular arc fitting. Experimental results show that the proposed line fitting method is effective.

A feedback pattern recognition method using an inverse recall neural network model is proposed. The feedback method can adjust processing parameter values adaptively to individual patterns so as to produce reliable recognition results. In order to apply an adaptive control technique to such pattern recognition processings, the evaluation value for recognition uncertainty is determined to be a function with regard to an input pattern and processing parameters. In its feedback phase, the input pattern is fixed and processing parameters are adjusted to decrease the recognition uncertainty. The proposed neural network model implements two functions in this feedback recognition method. One is a discrimination as a kind of multi-layer feedforward model. The other is to generate an input modification so as to decrease the recognition uncertainty. The modification values indicate parts which are important for more certain recognition but are missed in the original input to the nerwork. The proposed feedback method can adjust prcessing parameter values in order to detect the important parts shown by the inverse recall network model. As explained in this paper, feature extraction parameter values are adaptively adjusted by this feedback method. After the inverse recall model and the feedback function are implemented, features are extracted again by using the modified feature extraction parameter values. The feature is classified by the feedforward function of the network model. The feedforward and feedback processings are repeated until a certain recognition result is obtained. This method was examined for hadwritten alpha-numerics with rotation distortion. The feedback method was found to decrease the rejection ratio at the same substitution error ratio with high efficiency.

Let S(n) be a space constructible function such that S(n) log n. In this paper, we show that AuxSpTu (S(n),T(n)) NSPACE (S(n)log T(n)), where AuxSpTu (S(n),T(n)) is the class of languages accepted by nondeterministic auxiliary pushdown automata operating simultaneously in O(S(n)) space and O(T(n)) turns of the auxiliary tape head.

Pitch frequency is a basic characteristic of human voice, and pitch extraction is one of the most important studies for speech recognition. This paper describes a simple but effective technique to obtain correct pitch frequency from candidates (pitch candidates) extracted by the short-range autocorrelation function. The correction is performed by a neural network in consideration of the time coutinuation that is realized by referring to pitch candidates at previous frames. Since the neural network is trained by the back-propagation algorithm with training data, it adapts to any speaker and obtains good correction without sensitive adjustment and tuning. The pitch extraction was performed for 3 male and 3 female announcers, and the proposed method improves the percentage of correct pitch from 58.65% to 89.19%.

It is well known that weather conditions affect the performance of satellite broadcasting receiving systems. For example, snow accretion on antennas degrades the receiving performance seriously because it reduces received signal power and also can increase antenna noise. Since effects of the weather are considered to differ for various types of receiving antenna, an investigation on this phenomenon is very important. A study on weather effects to three types of satellite broadcasting receiving antenna, a planar antenna, a center-fed parabolic reflector antenna, and an offset parabolic reflector antenna, is presented in this paper. Since the performance of receiving antennas can be determined by a parameter G/T, a long-term and continuous measurement of G/T must be performed. Furthermore, the measurement of more than one receiving system should be performed simultaneously. Also, the measurement should be performed in a snowy area (in winter) and a rainy area (in the other seasons) to evaluate the effect of the weather. To fulfil the criterion, a continuous measurement system of G/T has been built in Hokkaido University, Sapporo. Sapporo, which is located at latitude 42 degrees north, has a long and snowy winter, and also has rainy days in the other seasons so that we can evaluate the effect of weather. Using this measurement system, cumulative distributions of measurement results are obtained so that the performance of different types of receiving system can be evaluated. In this paper, some considerations on the noise level are also discussed briefly to evaluate the performance degradation of the receiving systems.

In this paper, an ARMA order selection method is proposed with a fuzzy reasoning method. In order to identify the reference model with the ARMA model, we need to determine its ARMA order. A less or more ARMA order, other than a suitable order causes problems such as; lack of spectral information, increasing calculation cost, etc. Therefore, ARMA order selection is significant for a high accurate ARMA model identification. The proposed method attempts to select an ARMA order of a time-varying model with the following procedures: (1) Suppose the parameters of the reference model change slowly, by introducing recursive fuzzy reasoning method, the estimated order is selected. (2) By introducing a fuzzy c-mean clustering methed, the period of the time during which the reference model is changing is detected and the forgetting factor of the recursive fuzzy reasoning method is set. Further, membership functions used in our algorithm are original, which are realized by experiments. In this paper, experiments are documented in order to validate the performance of the proposed method.

Physical optics (PO) is an approximation method for high-frequency scattering and diffraction problems. But PO fields are inaccurate in the shadow region where the source is screened by the scatterer. It has been difficult to extract the mechanism of this error because PO includes numerical integration. In 2-D problems, PO fields are analytically and accurately expressed in terms of PO equivalent edge currents (PO-EECs) which represent the leading contributions of PO original integration. Comparison of PO in this form and geometrical theory of diffraction (GTD) which gives accurate fields in the shadow region, clarifies the cause of PO errors. For a scatterer with a corner, PO errors are mainly due to the rays emanating from the invisible edges. For a curved surface scatterer, the contributions penetrating the scatterer are small and main PO errors generally consist in PO-EECs itself.

A simple method for separating the dissipation factors associated with both conductor losses and dielectric losses of printed circuit boards in microwave frequencies is presented. This method utilizes the difference in dependence of two dissipation factors on the dimensions of bounded stripline resonators using a single printed circuit board specimen as a center strip conductor. In this method, the separation is made through a procedure involving the comparison of the measured values of the total dissipation factor with those numerically calculated for the resonators. A method, which is based on a TEM wave approximation and uses Green's function and a variational principle, is used for the numerical calculation. Both effective conductivity for three kinds of industrial copper conductor supported with a substrate of polymide film and dielectric loss tangent of the substrates are determined using this method from the values of the unloaded Q measured at the 10 GHz region. Radiation losses from the resonator affecting the accuracy of the separation are discussed, as well as the values of the effective conductivity of metals on the polyimide substrate which is calculated using the above method. The resulting values of the effective conductivity agree with those using the triplateline method within 10%.

Transmission characteristics of CPW bends having various curvatures and a fixed bend angle were measured. It was found that the transmission level shows dips at some particular frequencies, and that the dips are less pronounced as the radius of curvature becomes larger.

Optical recording has been performed successfully by the preirradiation of light upon the precursor of poly (arylene vinylene) conducting polymers such as poly (p-phenylene vinylene) (PPV) and poly (1,4-naphthalene vinylene) (PNV) and subsequent thermal treatment. The effect has been tentatively interpreted in terms of the deterioration of the irradiated area of the precursor polymer in which polymerization is suppressed. Furthermore, an orange electroluminescent (EL) diode utilizing PNV has been demonstrated for the first time and the EL properties of PNV are discussed in comparison with those of EL diode utilizing PPV. The EL emission of these two devices are discussed in terms of radiative recombination of the singlet polaron exciton formed by the injection of electrons and holes, the difference of effective conjugation length and the interchain transfer of polaron excitons.

In this paper, the relationship between the recursive least square (RLS) method with a U-D decomposition algorithm and ARMA lattice filter realization algorithm is presented. Both the RLS method and the lattice filter realization algorithm are used for the same applications, such as model identification, etc., therefore, it is expected that the lattice filter algorithm is in some ways related to the RLS. Though some of the proposed lattice filter algorithms have been derived by the RLS method, they do not express the relationship between RLS snd ARMA lattice filter realization algorithm. In order to describe the relation clearly, a new structure of ARMA lattice filter is proposed. Further, based on the relationship, a method of model identification with frequency weighting (MIFW), which is different from a previous method, is derived. The new MIFW method modifies the lattice parameters which are acquired without a frequency weighting and obtain the parameters of an ARMA model, which is identified with frequency weighting. The proposed MIFW method has the following restrictions: (1) The used frequency weighting is FIR filter with a low order. (2) By using the parameters of the ARMA lattice filter with ARMA (N,M) order and the frequency weighting with L order, the new ARMA parameter with the frequency weignting is with ARMA(N-L,M-L) order. By using the proposed MIFW method, the ARMA parameters estimated with the frequency weighting can be obtained without starting the computation again.