An efficient algorithm is presented for finding all solutions of piecewise-linear resistive circuits. In this algorithm, a simple sign test is performed to eliminate many linear regions that do not contain a solution. This makes the number of simultaneous linear equations to be solved much smaller. This test, in its original form, is applied to each linear region; but this is time-consuming because the number of linear regions is generally very large. In this paper, it is shown that the sign test can be applied to super-regions consisting of adjacent linear regions. Therefore, many linear regions are discarded at the same time, and the computational efficiency of the algorithm is substantially improved. The branch-and-bound method is used in applying the sign test to super-regions. Some numerical examples are given, and it is shown that all solutions are computed very rapidly. The proposed algorithm is simple, efficient, and can be easily programmed.

This paper is concerned with an ITS designed for augmenting a student's capability in problem solving. Discussions are concentrated on helping students acquire strategic knowledge and assisting them to build it in their heads. In this paper, many kinds of strategies are treated from a unified point of view. Based on this consideration, a teaching paradigm of strategic knowledge is presented. The paradigm is realized in an ITS as a training environment for strategic knowledge. Assisting students to learn strategic knowledge, the system sets up an appropriate environment and gives them some appropriate advice in each environment. It is realized as a function of giving them appropriate problems and hints about it. In general, strategic knowledge is a kind of heuristics so that it is not easy to describe their application conditions deterministically and explicitly. For this reason, an ITS for strategic knowledge is required to be designed so as to cover not only the case where expertise is represented explicitly as an executable model but also the case where it is represented only implicitly. To realize this teaching paradigm, situation-dependent knowledge called reminding pattern is prepared in the system. It is represented by a triple of a strategy, a situation, and a key symbol in the situation. It denotes that the key usually reminds students of the strategy in the situation. The system gives students problems including positive/negative examples of applications of each strategy in its problem solving process and hints which remind them of an appropriate strategy and makes them resume the problem solving when they fall into an impasse. In this paper, the structure of the system realizing this teaching paradigm is explained in the domain of proving propositional formulas.

It is recognized in Japan that reformation of the national research institutions is urgently necessary. Present situation and constraints are shown and the action items are discussed.

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.

New focused ion beam (FIB) methods for microscopic cross-sectioning and observation, microscopic crosssectioning and elemental analysis, and aluminum film microstructure observation are presented. The new methods are compared to the conventional methods and the conventional FIB methods, from the four viewpoints such as easiness of analysis, analysis time, spatial resolution, and pinpointing precision. The new FIB methods, as a result, are shown to be the best ones totally judging from the viewpoints shown above.

This paper applies the principle of radar polarimetry to the synthetic aperture frequency modulated continuous wave radar. First, the principle of monochromatic wave radar polarimetry using scattering matrix and polarization ratio necessary for introducing polarimetric imaging is given. In order to accommodate this principle to a wideband radar, a scattering matrix must be introduced, because FM-CW radar utilizes a wideband signal. This paper points out that the polarimetric target reflection coefficient obtained by the synthetic aperture FM-CW radar works as the scattering matrix element. This replacement, i.e., polarimetric reflection coefficient = the scattering matrix element, was verified by an experiment based on the polarization ratio which maximizes and minimizes a target. A radar system operative in the microwave X-band was successfully applied to the polarimetric detection of a metallic pipe of different orientations, demonstrating the validity of FM-CW radar polarimetry, and indicating an establishment of full polarimetric radar system.

When we use the finite-difference time-domain (FD-TD) method to study time-domain electromagnetic fields in the unbounded surroundings, we frequently use a radiation boundary condition (RBC) by means of one-way wave equations. The reflection coefficient by the RBC is independent of frequency, but the reflection coefficient of the finite difference approximation for the RBC depends on a frequency also; this study examines how the reflection characteristics are affected by the frequency, and the study presents the coefficients used in the RBC which gives expected reflection characteristics for a frequency, and presents the application to simulation of the matched termination of a rectangular waveguide.

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 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.

This is a full text of my presentation titled "Evaluation of Maintenability Improvement by Systems Reliability Growth" at the First Beijing International Conference on Reliability Maintenability and Safety (BICRMS'92). This thesis describes evaluation methods of reliability growth for field working systems by surveying maintenability improvement. And it also touch upon customer satisfaction. As unavailability is suitable for measuring reliability, I use in this thesis a decrease in unavailability per month as a means to evaluate reliability and its growth. "Maintenability" is broadly defined as a system's capability to maintain, repair and recover its functions with the aid of failsoft and RAISIS. The term "Customer satisfaction" is difficult to define, but on the practical market basis it can be fairly easily and objectively measured by examining the cancel rate by customers. This thesis includes topics such as: (1) When a system is in disorder it can restore its original functions although, strictly speaking, such system changes are classified as another systems statistically. (2) Despite this, we need to evaluate a specific system's reliability continously, and study reliability growth, industrial life, and customer satisfaction. Unavailability can be reduced by improving systems through upgrading component.

This paper presents an experimental environment of an intelligent tutoring system called EXPITS. In this environment, users learn functions and the structure of the intelligent tutoring system and characteristics of knowledge processing. EXPITS provides facilities for investigating internal processes and internal states of the intelligent tutoring system. These facilities include visualization tools and controllers of internal processes. Because the internal states and behavior of ITS depend on student's understanding states, one cannot get total understanding of ITS without information about student's knowledge states. To solve this problem, we introduce a pseudo student which simulates a human student in order to visualize explicitly all information which affects ITS behavior. Target users of EXPITS are school teachers, who are users of intelligent tutoring systems, university students who are studying artificial intelligence and postgraduate students who are specially studying intelligent tutoring systems. We have designed EXPITS to achieve different learning objectives for these three kinds of users. The learning objective for school teachers is to understand the differnce between intelligent tutoring systems and traditional CAI systems. University students are expected to understand characteristics of knowledge processing and rule based systems. Lastly, EXPITS provides postgraduate students who are studying intelligent tutoring systems with a test bed for examining ability and efficiency of the system in different configurations by changing parameters and by replacing constituents of the system. To achieve these purposes, EXPITS has experimental facilities for the following four themes; relationship between the domain knowledge representation method and teaching activities, the selection method of teaching paradigms, relationship between problem solving processes and teaching activities, and student modeling.

This paper points out that there are two types of claw free families with respect to a level of claw freeness. We formulate them as weak claw free families and strong claw free families. Then, we present sufficient conditions for each type of claw free families. (A similar result is known for weak claw free families.) They are represented as some algebraic forms of one way functions. A new example of strong claw free families is also given.

A new effect of barrier metal laid under 1st aluminum layer on electromigration has been found in interconnect vias. This effect can be explained by Si nodules at vias. Stress induced open failure occurred at viaholes and depends on the size of the vias. Stress-migration at vias can be prevented by TiN barrier metal between 1st and 2nd metals. Reliability of electro- and stress-migration at interconnect vias can be explosively improved by using TiN barrier metal.

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.

The connection admission control is one of preventive traffic control in ATM networks. The one objective of connection admission control is to keep the network load moderate so as to achieve a performance objective associated with quality of services (QOS). Because the cell loss rate is more sensitive to offered load than the average queuing delay in ATM networks, QOS requirement associated with cell loss rate is considered. The connection admission control acts as one of the major roles in traffic control. The job of connection admission control is to make an acceptance decision for connection set-up request to control the network load. This paper proposed and evaluated a connection admission control method. The proposed method is suitable for real time operation even in large diversity of connection types, because the amount of calculation for connection admission control is reduced remarkably compared to conventional algorithms. Moreover, the amount of calculation for the algorithm does not increase even when the number of connection types increases. The proposed method uses probability function for the number of cells transferred from multiplexed connections and uses recursive equations in estimating cell loss rate.

The student model component of intelligent tutoring systems (ITSs) used to be considered central: it was the means by which the ITS could individually adapt the learning experience to suit the learner's perceived needs. However, the practical difficulty of building reliable student models, the evolution away from the knowledge communication style of ITSs towards a more constructivist philosophy, and the development of new media to support learning interactions have all combined to question the role (if any) for student models in current interactive learning environments (ILEs). In this paper we will explore the new role of student models by considering the lessons learned from five Lancaster projects (SAFE, EPIC, PEOPLEPOWER, CLORIS and SMILE). The main issues revolve (as usual) around the questions of control and learning objectives.

This paper is concerned with the problem of (exactly) representing given functions by fuzzy reasoning. We consider function representation by the fuzzy reasoning method using linguistic truth values, which is a generalization of fuzzy reasoning due to Zadeh. Some conditions for functions to be representable are given, by which it is shown that very large class of functions can be representable by this method. Some examples illustrating how to find "if-then rules" for fuzzy reasoning are shown. Further, in the appendix an example is given to show that the generalization is significant for the problem of function representation.