The structural necessary and sufficient condition for "the transition-liveness means the place-liveness and vice-versa" of a subclass NII of general Petri nets is given as "the place and transition live Petri net, or PTL net, ÑII". Furthermore, "the one-token-condition Petri net, or OTC net, II" which means that every MSDL (minimal structural deadlock) is "transition and place live" under at least one initial token, i.e., II is "transition and place live" under the above initial marking. These subclasses NII, ÑII( NII), and II(ÑII) are almost the general Petri nets except at least one MSTR(minimal structural trap) and at least one pair of "a virtual MSTR or a virtual STR" and "a virtual MSDL" of an MBTR (minimal behavioral trap) in connection with making an MSDL transition-live.

In this paper, we propose a plausible software reliability growth model by applying a mathematical technique of stochastic differential equations. First, we extend a basic differential equation describing the average behavior of software fault-detection processes during the testing phase to a stochastic differential equation of ItÔ type, and derive a probability distribution of its solution processes. Second, we obtain several software reliability measures from the probability distribution. Finally, applying a method of maximum-likelihood we estimate unknown parameters in our model by using available data in the actual software testing procedures, and numerically show the stochastic behavior of the number of faults remaining in the software system. Further, the model is compared among the existing software reliability growth models in terms of goodness-of-fit.

Mean Time Between Failures (MTBF) is an important measure of practical repairable systems, but it has not been obtained for a repairable linear consecutive-k-out-of-n: F system. We first present a general formula for the (steady-state) availability of a repairable linear consecutive-k-out-of-n: F system with nonidentical components by employing the cut set approach or a topological availability method. Second, we present a general formula for frequency of system failures of a repairable linear consecutive-k-out-of-n: F system with nonidentical components. Then the MTBF for the repairable linear consecutive-k-out-of-n: F system is shown by using the frequency of system failure and availability. Lastly, we derive some figures which show the relationship between the MTBF and repair rate µorρ(=λ/µ) in the repairable linear consecutive-k-out-of-n: F system. The figures can be easily used and are useful for reliability design.

Leakage enhancement after an ESD event has been analyzed for output buffer LDD MOSFETs. The HBM ESD failure threshold for the LDD MOSFETs is only 200-300 V and the failure is the leakage enhancement of the off-state MOSFETs called as "soft breakdown" leakage. This leakage enhancement is supposed to be caused by trapped electrons in the gate oxide and/or creation of interface states at the gate overlapped drain region due to snap-back stress during the ESD event. The mechanism of the lekage can be explained by band-to-band and/or interface state-to-band tunneling of electrons. The improvement of the HBM ESD threshold has been also evaluated by using two types of drain engineering which are additional arsenic implantation for the output LDD MOSFETs and "offset" gate MOSFET as a protection circuit for the output pins. By using these drain engineering, the threshold can be improved to more than 2000 V.

In Spread Spectrum Packet Radio Networks (SS/PRNs), different spreading codes are required for different stations for transmitting packets. Therefore multihop SS/PRNs with a large number of stations would require a large number of codes and hence a large channel bandwidth. In this paper we design a code assignment algorithm which could reduce the number of codes required to about 22%. Further reducing the number of codes is found to cause little throughput degradation. The Coded Tone Sense protocol is designed for using these codes in multihop PRNs. Simulation result shows that in a 80 node network using only 5 spreading codes, the maximum network throughput is about 73% higher than the BTMA protocol.

This paper proposes a high-speed VP bandwidth control scheme for ATM networks that utilizes a distributed control mechanism. First, the characteristics of VPs are compared with those of digital paths in STM networks. A distributed control scheme is adopted for rapid control. The basic elements and the necessary distributed function, the control algorithm, and the message transmission mechanism, are elucidated. The bandwidth alteration time with the proposed algorithm is estimated by considering network element processing and queuing delay. The proposed VP bandwidth control scheme can be applied to both public networks and leased line services. Finally, this paper focuses on its application to leased line services, and discusses the resource reduction effects of the proposed scheme.

Finding DC solutions of nonlinear networks is one of the most difficult tasks in circuit simulation, and many circuit designers experience difficulties in finding DC solutions using Newton's method. Piecewise-linear analysis has been studied to overcome this difficulty. However, efficient piecewiselinear algorithms have not been proposed for nonlinear resistive networks containing the Gummel-Poon models or the Shichman-Hodges models. In this paper, a new piecewise-linear algorithm is presented for solving nonlinear resistive networks containing these sophisticated transistor models. The basic idea of the algorithm is to exploit the special structure of the nonlinear network equations, namely, the pairwise-separability. The proposed algorithm is globally convergent and much more efficient than the conventional simplical-type piecewise-linear algorithms.

This paper presents a zero-knowledge interactive protocol that demonstrates two factors a and b of a composite number n (=ab) are really known by the prover, without revealing the factors themselves. Here the factors a and b need not be primes. The security of the protocol is based on the difficulty of computing discrete logarithms modulo a large prime.

This paper proposes a new combined fast algorithm for transversal adaptive filters. The fast transversal filter (FTF) algorithm and the normalized LMS (NLMS) are combined in the following way. In the initialization period, the FTF is used to obtain fast convergence. After converging, the algorithm is switched to the NLMS algorithm because the FTF cannot be used for a long time due to its numerical instability. Nonstationary environment, that is, time varying unknown system for instance, is classified into three categories: slow time varying, fast time varying and sudden time varying systems. The NLMS algorithm is applied to the first situation. In the latter two cases, however, the NLMS algorithm cannot provide a good performance. So, the FTF algorithm is selected. Switching between the two algorithms is automatically controlled by using the difference of the MSE sequence. If the difference exceeds a threshold, then the FTF is selected. Other wise, the NLMS is selected. Compared with the RLS algorithm, the proposed combined algorithm needs less computation, while maintaining the same performance. Furthermore, compared with the FTF algorithm, it provides numerically stable operation.

For improving the RSA cryptosystem, more desirable conditions on key structures have been intensively studied. Recently, M.J.Wiener presented a cryptanalytic attack on the use of small RSA secret exponents. To be secure against the Wiener's attack, the size of a secret exponent d should be chosen more than one-quarter of the size of the modulus n = pq (in bits). Besides, it is more desirable, in frequent cases, to make the public exponent e as small as possible. However if small d is chosen first, in such case as the digital signature system with smart card, the size of e is inevitably increased to that of n when we use the conventional key generation algorithm. This paper presents a new algorithm, Algorithm I, for generating of the secure RSA keys against Wiener's attack. With Algorithm I, it is possible to choose the smaller sizes of the RSA exponents under certain conditions on key parameters. For example, with Algorithm I, we can construct the RSA keys with the public exponent e of two-thirds and secret exponent d of one-third of the size of modulus n (in bits). Furthermore we present a modified version of Algorithm I, Algorithm II, for generating of the strong RSA keys having the difficulty of factoring n. Finally we analyze the performances of Algorithm I and Algorithm II.

Checkpointing is one of the most powerful tools to operate a computer system with high reliability. We should execute the optimal checkpointing in some sense. This note shows the optimal checkpoint sequence minimizing the expected loss, Numerical examples are shown for illustration.

Kanji Laboratory is a kanji learning ICAI system. In this paper, we describe the development of Kanji Laboratory, which is designed for foreigners who are learning Japanese kanji. We have developed Kanji Laboratory under the guidelines of environmental ICAI systems, based on a kanji learning method focusing on kanji radicals. Kanji Laboratory consists of a knowledge base, a learning environment and an advisor module. The knowledge base can well-handle the knowledge of Joyo Kanji (1,945 characters). Each one is related with its radicals via their inherited attributes. In addition, this knowledge base system can search kanji knowledge quickly. The learning environment has the following features: (1) Students can construct a kanji by combining radicals and disassemble the kanji into radicals and strokes. (2) Students can use electronic tools, such as a kanji dictionary, which support kanji learning. In this way, students can learn kanji and the relations with its radicals effectively. With regard to the advisor, although it occurs that students fall in plateaus of learning in environmental CAI, the advisor module is designed to give well-timed advice to students, avoiding those plateaus, based on the observation of their learning actions.

This paper presents a novel model of optical associative memory using an optoelectronic neurochips, which detects and processes a two-dimensional input image at the same time. The original point of this model is that the optoelectronic neurochips allow direct image processing in terms of parallel input/output interface and parallel neural processing. The operation principle is based on the nonlinear transformation of the input image to the corresponding the point attractor of a fully connected neural network. The learning algorithm is the simulated annealing and the energy of the network state is used as its cost function. The computer simulations show its usefulness and that the maximum number of stored images is 150 in the network with 64 neurons. Moreover, we experimentally demonstrate an optical implementation of the model using the optoelectronic neurochip. The chip consists of two-dimensional array of variable sensitivity photodetectors with 8 16 elements. The experimental results shows that 3 images of size 8 8 were successfully stored in the system. In the case of the input image of size 64 64, the estimated processing speed is 100 times higher than that of the conventional optoelectronic neurochips.

Beam-steering devices are attractive for spatial optical interconnections. Those devices are essential not only for fixed connecting routed optical interconnections, but for flexible connecting routed optical interconnections. The flexible connecting routed optical interconections are more powerful than the conventional fixed connecting routed ones. Structures and characteristics of beam-steering devices, a beam-scanning laser diode and a fringe-shifting laser diode, are reported for those interconnections. Using these lasers, the configurations of several optical interconnections, such as optical buses and optical data switching links as examples of fixed and flexible connecting routed optical interconnections are discussed.

For systems in which the probability that an incorrect output is observed differs with input values, we adopt the redundant usage of n copies of identical systems which we call the n-redundant system. This paper presents a method to find the optimal redundancy of systems for minimizing the probability of dangerous errors. First, it is proved that a k-out-of-n redundancy or a mixture of two kinds of k-out-of-n redundancies minimizes the probability of D-errors under the condition that the probability of output errors including both dangerous errors and safe errors is below a specified value. Next, an algorithm is given to find the optimal series-parallel redundancy of systems by using the properties of the distance between two structure functions.

Koblitz and Miller proposed a method by which the group of points on an elliptic curve over a finite field can be used for the public key cryptosystems instead of a finite field. To realize signature or identification schemes by a smart card, we need less data size stored in a smart card and less computation amount by it. In this paper, we show how to construct such elliptic curves while keeping security high.

We extend the concept "optical instanton" to arbitrary dielectric media. For these general cases the exact analytical approach is no longer available. We derive an approximate analytical solution that would be valid in the vicinity of the light cone. A comparison is made between the analytical and the numerical solutions.

The beam propagation method (BPM) is a powerful and manageable method for the analysis of wave propagation along weakly guiding optical waveguides. However, the effects of reflected waves are not considered in the original BPM. In this paper, we propose two simple modifications of the BPM to make it relevant in characterizing abrupt discontinuities in weakly guiding waveguides at which a significant amount of reflection is expected to be observed. Validity of the present modifications is confirmed by the numerical results for abrupt discontinuities in step-index slab waveguides and butt-joints between different slab waveguides.

Observations of rain depolarization characteristics were conducted using the CS-2 and CS-3 beacon signals (19.45GHz, circular polarization, elevation angle=49.5) during seven years of 1986-1992 at Neyagawa, Osaka. The mean cross-polar phase relative to the co-polar phase of each rainfall event is distributed in a comparatively wide range from -100 to -150. This large variation is suggested to be caused by the difference of raindrop size distribution (DSD) in addition to that of rain intensity. The effects of DSD are examined by rain attenuation statistics for specific months, together with direct measurements of raindrop diameters on the ground for several rainfall events. Compared with representative DSD models, the effects of the Joss-drizzle type with relatively small raindrops primarily appear in "Baiu (Tsuyu)" period, while the effects of the Marshall-Palmer type which represents a standard type are enhanced in "Shurin (Akisame)" period. On the other hand, the effects of the Joss-thunderstorm type with comparatively large raindrops do not indicate a very clear seasonal variation. Possible improvements of XPD performed by differential phase shifters are generally found to be lower than 10dB for the rain depolarization due to the effect of residual differential attenuation after the cancellation of differential phase shift. Such XPD improvements are, however, very sensitive to the type of DSD, and it is suggested that the improvements are at least greater than 6dB for the Joss-drizzle type, whereas they are less than 6dB for the Marshall-Palmer and Joss-thunderstorm types. The effects of the XPD improvements are thus related to rainfall types, i.e., the type of DSD, and the improvements are considerably dependent upon the seasons in which each rainfall type frequently appears.

The Akebono satellite observed the Australian Omega signals when it passed about 1000km over the Omega station. In this paper, we compare the observed Omega signal intensities with the values obtained using a full wave calculation and we discuss a mechanism of modulation of the signals. The relative spatial variations of the calculated Omega intensities are quite consistent with those observed, but the absolute calculated intensities themselves are several dB larger than the observed intensities. This difference in intensity may be due to the horizontal inhomogeneity of the D region, which is not modeled in the full wave calculation, or to an incorrect assumption about radiation characteristics of the Omega antenna. It is found that modulation of the observed signals is caused by the interference between the waves with different k vectors.