Among the problems that face ITS designers, the problem of measuring the student knowledge state after concept learning in order to initially adapt a skill acquisition session according to a student's own necessities is a hard one. Typical approaches are the use of some sort of test to assess the student knowledge and choose an initial set of parameters for a session, or use, regardless the particular necessities of a student, a pre-defined set of initial parameters. We consider the fromer to be disrupting for learning and the latter too simple to deal with the broad possibilities that are faced. It is known that students show different behaviors during concept learning depending on the experience, background and actual understanding (the way a student is understanding a concept) during concept learning. Our approach here is to classify the different behaviors through fuzzy proposition and link them with a student model through fuzzy rules to use in an expert system, and with it, select the most suitable problem-solving strategy for each particular student in order to clear his misunderstandings and facilitate the learning of problem-solving skills. The use of probabilistic reasoning (i.e. Bayesian statistics) instead of fuzzy logic is not suitable for the present situation because of the rigidity and precision of the rules that do not allow a proper manipulation of the vagueness involved in the student behavior. We apply this idea to a circuit analysis ITS where the concept learning session is carried out on a Hypertext environment and the skill acquisition session on an interactive problem-solving environment. By tracing the student use of the Hypertext environment we can know the student behavior and use it as a premise in the fuzzy inference.

We modified the adaptive fuzzy classification algorithm (AFC), which allows fuzzy clusters to grow to meet the demands of a given task during training. Every fuzzy cluster is defined by a reference vector and a fuzzy cluster radius, and it is represented as a shape of hypersphere in pattern space. Any pattern class is identified by overlapping plural hyperspherical fuzzy clusters so that it is possible to approximate complex decision boundaries among pattern classes. The modified AFC was applied to recognize handwritten digits, and performances were shown compared with other neural networks.

It is shown that for a class of interval matrices we can estimate the location of eigenvalues in a very simple way. This class is characterized by the property that eigenvalues of any real linear combination of member matrices are all real and thus includes symmetric interval matrices as a subclass. Upper and lower bounds for each eigenvalue of such a class of interval matrices are provided. This enables us to obtain Hurwitz stability conditions and Schur ones for the class of interval matrices and positive definiteness conditions for symmetric interval matrices.

A modified deformable model is presented for constructing bijective topology preserving feature maps. The algorithm can solve the optimization problem in the input space as well as that in the output space. A saturating distance function alternative to the Euclid norm is employed to obtain compact space filling maps.

This paper describes the optical characteristics and static fatigue reliability of a zirconia alignment sleeve, which is a component part of an optical connector with zirconia ferrules. This combination of sleeve and ferrules hardly generates any wear debris during connector insertion and removal cycles. This has reduced the cleaning frequency of the ferrule endface during cycles and greatly improved the return loss stability of the optical connectors. The zirconia alignment sleeve enables stable return loss characteristics to be achieved over a wide temperature range as it has the same thermal expansion coefficient as the zirconia ferrule. Furthermore, the gauge retention force for the zirconia alignment sleeve is defined with a view to its practical use. This force must be between 2.0 and 3.9 N to allow stable optical connections to be made under various mechanical and environmental conditions. We also clarify the conditions for a proof test by which to prevent the occurrence of static fatigue fractures in the sleeve, and we confirm the validity of the test. The static fatigue parameters for zirconia ceramics and derived from the static fatigue theory for brittle materials and fracture testing. We use these static fatigue parameters to predict the lifetime of a zirconia sleeve under working stress. An appropriate stress level for the proof test which eliminates weak sleeves, is about 3 times greater than working stress. The strength of the sleeve as demonstrated in the proof test is confirmed by accelerative stress aging. The performance of this sleeve is superior to that of a conventional copper alloy sleeve and the proof test confirms its reliability; under 0.1 FIT for 20 years of use.

Single-crystal LiNbO3 and LiTaO3 piezo-electric resonators were developed for surface-mount technology (SMT) used in electronic equipment manufacturing. Using an energy-trapping design, a shear-mode piezoelectric resonator chip is bonded directly to the board with conductive resin and covered with a ceramic cap. The process occasionally produces nonlinear resonators, however, which led us to study the frequency characteristics of impedances for the abnormal samples. Their input impedances at the resonant frequency depended on the driving voltage. The insulator between the thin film metal electrode on the crystal strip or the thick film electrode on the ceramic base, in conjunction with silver balls in the adhesive resin, apparently caused the problem. Assuming that the insulator makes diode contacts, which show stable nonohmic phenonena or cause a discharge in a conductor causing a drastically changing in the impedance, we proposed the following corrective action：subject the nonohmic contacts to a high-voltage frequency-swept signal near the resonant frequency. The samples subjected to the high voltages recovered metalic contact and maintained even after severe thermal cycle testing.

This paper describes small AlGaAs/GaAs HBT's for low-power and high-speed integrated circuits. The device fabrication is based on a new bridged base electrode technology that permits emitter width to be defined down to 1 µm. The new technology features oxygen-ion implantation for emitter-base junction isolation and zinc diffusion for extrinsic base formation. The oxygen-ion implanted emitter-base junction edge has been shown to provide a periphery recombination current much lower than that for the previous proton implanted edgs, the result being a much higher current gain particularly in small devices. The zinc diffusion offers high device yield and good uniformity in device characteristics even for a very thin (0.04 µm) base structure. An HBT with emitter dimensions of 12.4 µm2 yields an fT of 103 GHz and an fmax of 62 GHz, demonstrating that the new technology has a significant advantage in reducing the parasitic elements of small devices. Fabricated one-by-eight static frequency dividers and one-by-four/one-by-five two-modulus prescalers operate at frequencies over 10 GHz. The emitters of HBT's used in the divider are 12.4 µm2 in size, which is the smallest ever reported for AlGaAs/GaAs HBT IC's. These results indicate that the bridged base electrode technology is promising for developing a variety of high-speed HBT IC's.

Many methods, based on the concept of key-lock-pair have been proposed for access control in computer protection systems. However, the proposed methods still either lack of dynamic ability or need quite a lot of computation in performing requests of deleting users/files, inserting users/files, or updating access rights of users to files. In this paper we propose a two-key-lock-pair access control method that is based on the unique factorization theorem and a time stamp mechanism. Our method is dynamic and needs a minimum amount of computation in the sense that it only updates at most one key/lock for each access request, which has not been achieved before.

We developed a simple, practical, adaptive data compression algorithm of the LZ78 class. According to the Lempel-Ziv greedy parsing, a string boundary is not related to the statistical history modeled by finite-state sources. We have already reported an algorithm classifying data into subdictionaries (CSD), which uses multiple subdictionaries and conditions the current string by using the previous one to obtain a higher compression ratio. In this paper, we present a practical implementation of this method suitable for any kinds of data, and show that CSD is more efficient than the LZC which is the method used by the program compress available on UNIX systems. The CSD compression performance was about 10% better than that of LZC with the practical dictionary size, an 8k-entry dictionary when the test data was from the Calgary Compression Corpus. With hashing, the CSD processing speed became as fast as that of LZC, although the CSD algorithm was more complicated than LZC.

This paper presents the M-LCELP (Multi-mode Learned Code Excited LPC) speech coder, which has been developed for the next generation half-rate digital cellular telephone systems. M-LCELP develops the following techniques to achieve high-quality synthetic speech at 4kb/s with practically reasonable computation and memory requirements: (1) Multi-mode and multi-codebook coding to improve coding efficiency, (2) Pitch lag differential coding with pitch tracking to reduce lag transmission rate, (3) A two-stage joint design regular-pulse codebook with common phase structure in voiced frames, to drastically reduce computation and memory requirements, (4) An efficient vector quantization for LSP parameters, (5) An adaptive MA type comb filter to suppress excitation signal inter-harmonic noise. The MOS subjective test results demonstrate that 4.075kb/s M-LCELP synthetic speech quality is mostly equivalent to that for a North American full-rate standard VSELP coder. M-LCELP codec requires 18 MOPS computation amount. The codec has been implemented using 2 floating-point dsp chips.

Radar signals fluctuate because of the incoherent scattering of raindrops. Dual-polarization radar estimates rainfall rates from differential reflectivity (ZDR) and horizontal reflectivity (ZH). Here, ZDR and ZH are extracted from fluctuating radar signals by averaging. Therefore, instrumentally measured ZDR and ZH always have errors, so that estimated rainfall rates also have errors. This paper evaluates rainfall rate errors caused by signal fluctuation. Computer simulation based on a physical raindrop model is used to investigate the standard deviation of rainfall rate. The simulation considers acquisition time, and uses both simultaneous and alternate sampling of horizontal and vertical polarizations for square law and logarithmic estimators at various rainfall rates and elevation angles. When measuring rainfall rates that range from 1.0 to 10.0mm/h with the alternate sampling method, using a logarithmic estimator at a relatively large elevation angle, the estimated rainfall rates have significant errors. The simultaneous sampling method is effective in reducing these errors.

In this paper, we proposes a novel fuzzy control for parameter scheduling of the Hopfield neural network. When a combinatorial optimization problem, such as the traveling salesman problem, is solved by Hopfield neural network, it is efficient to adaptively change the parameters of the energy function and sigmoid function. By changing the parameters on purpose, this network can avoid being trapped at a local minima. Since there exists complex relations among these parameters, it is difficult to analytically determine the ideal scheduling. First, we investigate a bad scheduling to change parameters by simple experiments and find several rules that may lead to a good scheduling. The rules extracted from the experimental results are then realized by fuzzy control. By using fuzzy control, we can judge bad scheduling from vague network stages, and then correct the relations among the parameters. Computer simulation results of the Traveling Salesman Problem (TSP) is considered as an example to demonstrate its validity.

This paper describes highly parallel analog image coding and decoding by cellular neural networks (CNNs). The communication system in which the coder (C-) and decoder (D-) CNNs are embedded consists of a differential transmitter with an internal receiver model in the feedback loop. The C-CNN encodes the image through two cascaded techniques: structural compression and halftoning. The D-CNN decodes the received data through a reconstruction process, which includes a dynamic current distribution, so that the original input to the C-CNN can be recognized. The halftoning serves as a dynamic quantization to convert each pixel to a binary value depending on the neighboring values. We approach halftoning by the minimization of error energy between the original gray image and reconstructed halftone image, and the structural compression from the viewpoints of topological and regularization theories. All dynamics are described by CNN state equations. Both the proposed coding and decoding algorithms use only local image information in a space inveriant manner, therefore errors are distributed evenly and will not introduce the blocking effects found in DCT-based coding methods. In the future, the use of parallel inputs from on-chip photodetectors would allow direct dynamic quantization and compression of image sequences without the use of multiple bit analog-to-digital converters. To validate our theory, a simulation has been performed by using the relaxation method on an 150 frame image sequence. Each input image was 256256 pixels whth 8 bits per pixel. The simulated fixed compression rate, not including the Huffman coding, was about 1/16 with a PSNR of 31[dB]35[dB].

This paper describes a pipelining universal system of discrete time cellular neural networks (DTCNNs). The new relaxation-based algorithm which is called a Pipelining Gauss Seidel (PGS) method is used to solve the CNN state equations in pipelining. In the systolic system of N processor elements {PEi}, each PEi performs the convolusional computation (CC) of all cells and the preceding PEi-1 performs the CC of all cells taking precedence over it by the precedence interval number p. The expected maximum number of PE's for the speeding up is given by n/p where n means the number of cells. For its application, the encoding and decoding process of moving images is simulated.

A stochastic system represented by an input-output model can be described by mainly two different types of state space representation. Corresponding to state space representations innovation models are examined. The relationship between both representations is made clear systematically. An easy transformation between them is presented. Zeros of innovation models are the same as those of an ARMA model which is stochastically equivalent to innovation models, and related to stable eigenvalues of generalized eigenvalue problem of matrix Riccati equation.

We present an 8-dimensional trellis-coded 8-PSK with a symbol transition constraint that is similar to that of π/4-shift quadrature phase shift keying (QPSK). This scheme can achieve a coding gain of 1.6 to 2.4 dB at the same rate of π/4-shift QPSK on Gaussian channel, and it has also an immunity against the integer multiples of 90 phase ambiguities. In order to label the constellation of the proposed scheme, a constellation partitioning algorithm is presented. This algorithm, on the basis of set partitioning, can be used to label the signal constellation with no coset structure.

This paper proposes RSA-type cryptosystems over elliptic curves En(O, b) and En(a, O),where En(a, b): y2 x3+ax+b (mod n),and n is a product of from-free primes p and q. Although RSA cryptosystem is not secure against a low exponent attack, RSA-type cryptosystems over elliptic curves seems secure against a low multiplier attack. There are the KMOV cryptosystem and the Demytko cryptosystem that were previously proposed as RSA-type cryptosystems over elliptic curves. The KMOV cryptosystem uses form-restricted primes as p q 2(mod 3)or p q 3(mod 4), and encrypts/decrypts a 2log n-bit message over varied elliptic curves by operating values of x and y coordinates. The Demytko cryptosystem, which is an extension of the KMOV cryptosystem, uses form-free primes, and encrypts/decrypts a log n-bit message over fixed elliptic curves by operating only a value of x coordinates. Our cryptosystems, which are other extensions fo the KMOV cryptosystem, encrypt/decrypt a 2log n-bit message over varied elliptic curves by operating values of x and y coordinates. The Demytko cryptosystem and our cryptosystems have higher security than the KMOV cryptosystem because from-free primes hide two-bit information about prime factors. The encryption/decryption speed in one of our cryptosystems is about 1.25 times faster than that in the Demytko cryptosystem.

This paper describes a new method for joining BiSrCaCuO superconductors (BSCCO) which realizes low microwave loss and high mechanical strength. This method consists of two processes. In the first the BSCCO surface is metallized with Ag and in the second a joint is formed by using thermally curable Ag paste. With this method, we obtained a joint with a loss of 0.3 dB around 1.1 GHz with the co-axial cavity techniques. Furthermore, the mechanical strength of the joint was greater than that of the BSCCO sample. From the results of DC resistance measurements and SEM observations, we attribute this good performance to the adhesion and continuity of the metallized Ag with the BSCCO surface.

The performance of multi-pulse pulse position modulation (MPPM) consisting of m slots and 2 pulses, denoted as (m, 2) MPPM, with imperfect slot synchronization is analyzed. The word error probability of (m, 2) MPPM in the presence of timing offset is analyzed, and the optimum symbol sets of (m, 2) MPPM minimizing the symbol error probability are assigned. When an unassigned symbol is detected, the receiver decodes the unassigned symbol as one of the assigned symbols having the highest probability of transition from the assigned symbol to the unassigned symbol. The bit error probability of (m, 2) MPPM in the presence of the timing offset is analyzed, and the bit error probability of (m, 2) MPPM is compared with that of PPM for the same transmission bandwidth and the same transmission rate. Moreover, the bit error probability of (m, 2) MPPM synchronized by a phase-locked loop (PLL) is also analyzed. It is shown that a word with two continuous pulses has better performance than a word with two separate pulses. It is also shown that when the timing offset occurs, and when the slot clock is synchronized by a PLL, (m, 2) MPPM performs better than PPM because (m, 2) MPPM has the optimum assigned symbols, and can decode detected words more correctly than PPM.

An automatic zip code recognition system for Japanese mail is proposed in this paper. It is assumed that a zip code is composed of three numerals and requited to be written in a specified frame. In actual images, however, the three numerals sometimes extend outside the specified frame and are not clearly separated. Considering this situation, the authors devised a system with two stages, the segmentation stage and the recognition stage. The segmentation stage consists of five steps: setting and adjusting of initial areas for numeral images (figures), calculation of the center of gravity of each figure, search for the horizontal and vertical boundaries of each figure, determination of the final area for each figure, and normalization of the figure in each final area. In the recognition stage, the Localized Arc Pattern Method (Arc method) proposed by Yoshimura et al. (1991) is implemented hierarchically; that is, a simple Arc method is applied first to each figure and a more complex one is applied subsequently unless the figure is identified in the first step. In the recognition process, every figure is judged as a numeral or otherwise rejected. The proposed system was applied to a database provided by the Institute for Post and Telecommunications Policy (IPTP). The segmentation algorithm yielded an adequate result. The recognition algorithm yielded scores as high as 90.6% in correct recognition rate and 0.7% in error rate. The best score of the precision index (P-index) specified by the IPTP was as low as 15.7 for the above mentioned IPTP database, while the score for another IPTP database was 16.9.