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.

This paper discusses the design of an ITS to realize a load-oriented tutoring to enhance the student's explanation understanding. In the explanation understanding, it is to be hoped that a student not only memorizes the new information from an explanation, but also relates the acquired information with his/her own knowledge to recognize what it means. This relating process can be viewed as the one in which the student structures his/her knowledge with the explanation. In our ITS, we regard the knowledge-structuring activities as the explanation understanding. In this paper, we propose an explanation, called a load-oriented explanation, with the intention of applying a load to the student's knowledge-structuring activities purposefully. If the proper load is applied, the explanation can induce the student to think by himself/herself. Therefore he/she will have a chance of gaining the deeper understanding. The important point toward the load-oriented explanation generation is to control the load heaviness appropriately, which a student will bear in understanding the explanation. This requires to estimate how an explanation promotes the understanding activities and how much the load is applied to the activities. In order to provide ITS with the estimation, we have built an Explanation Effect Model, EEM for short. Our ITS consists of an explanation planner and a self-explanation environment. The planner generates the load-oriented explanation based on EEM. The system also makes a student explain the explanation understanding process to himself/herself. Such self-explanation is useful to let the student be conscious of the necessity of structuring his/her knowledge with the explanation. The self-explanation environment supports the student's self-explanation. Furthermore, if the student reaches an impasse in self-explaining, the planner can generate the supporting explanation for the impasse.

The learning environment called IPE (Interactive Physical Environment) for Dynamics is developed on the computer. IPE can understand the simulated phenomena started from the arbitrary conditions set up by the learner. IPE has several scripts which describe the dynamical phenomena. The understanding of the simulated phenomena by IPE is obtained by matching these scripts with status list and phenomena list which are generated by the simulator using difference scheme. IPE gives the learner the explanation sentences which explain the features of simulated phenomena. This explanation strongly assist the learner in recognizing the details of result of the simulation.

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.

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.

It is important for LSI system designers to estimate computational errors when designing LSI's for numeric computations. Both for the prediction of the errors at an early stage of designing and for the choice of a proper hardware configuration to achieve a target performance, it is desirable that the errors can be estimated in terms of a minimum of parameters. This paper presents a theoretical error analysis of multiply-accumulation implemented by distributed arithmetic(DA) and proposes a new method for estimating the mean-squared error. DA is a method of implementing the multiply-accumulation that is defined as an inner product of an input vector and a fixed coefficient vector. Using a ROM which stores partial products. DA calculates the output by accumulating the partial products bitserially. As DA uses no parallel multipliers, it needs a smaller chip area than methods using parallel multipliers. Thus DA is effectively utilitzed for the LSI implementation of a digital signal processing system which requires the multiply-accumulation. It has been known that, if the input data are uniformly distributed, the mean-squared error of the multiply-accumulation implemented by DA is a function of only the word lengths of the input, the output, and the ROM. The proposed method for the error estimation can calculate the mean-squared error by using the same parameters even when the input data are not uniformly distributed. The basic idea of the method is to regard the input data as a combination of uniformly distributed partial data with a different word length. Then the mean-squared error can be predicted as a weighted sum of the contribution of each partial data, where the weight is the ratio of the partial data to the total input data. Finally, the method is applied to a two-dimensional inverse discrete cosine transform (IDCT) and the practicability of the method is confirmed by computer simulations of the IDCT implemented by DA.

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.

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.

This paper describes the effective countermeasures for exfoliation of large-sized ceramic capacitors, deterioration of dummy resistors and developement of a spark sensor with UVtrons at 300-500 kW transmitting stations. Cracks and exfoliation were found at the electrode of large-sized ceramic capacitors in the output circuit of the 500 kW transmitter. The exfoliation was caused by the temperature rise and the thermal fatigues at the electrode with the Nickel plating including Irons. A pure Nickel-plated electrode including no Irons and a new soldering method using disk-typed solder with a large adhesive area are employed in order to reduce the temperature rise. The temperature rise of the improved capacitor was 18 lower than the conventional one. Deterioration of ELEMA resistors of the 300 kW dummy antenna was discovered. The damage of the resistor was caused by the concentration of the electric current followed by the thermal stress cycle which made mechanical exhaustion at the electrode. Therefore, oval-shaped type resistors with much longer electric current path (20% up) to suppress the concentration of current flow and much slower temperature rise are newly developed. In case that sparks occurred at DC or RF high voltage impressed sections of the high power transmitting equipment, the discharged points could be seriously damaged by the transmitter energy itself. In orded to prevent this, a spark detector using UV (Ultra violet) trons is developed and installed at the matchign circuit of the 500 kW transmitter. Conventional UV sensors with only one UVtron could not detect feeble discharges and sparks with a duration time of less than 150 ms because of false outputs by the back ground noise. Since choosing three out of four UV trons system is employed, possibility producing a false output will be just one to 445 years theoretically. This means extremely reliable and sensitive spark detection system are constructed. These countermeasures have improved reliability of the transmitting equipment greatly. No damages have been found in the transmitters ever since.

In this paper, we present some novel concepts and photonic devices for use in optical interconnects. First, we review the progress of surface emitting lasers while featuring materials and performances including thresholds, power output, RIN, linewidth, and so on. Advanced technology for aiming at spontaneous emission control, photon recycling, polarization control, wavelength tuning, integration etc. will be considered. Then we touch on some other possible devices for optical interconnects. Lastly, we discuss on lightwave subsystems applying these devices and concepts.

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.

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.

Expressions for electromagnetic fields generated by vertical and horizontal electric dipoles located in the air or in a lossy half-space near its boundary with air are obtained from Hertz vectors by the method of operators under the condition |n|31, where 1/n is the refractive constant of the lossy space. These can be applied up to the near fields under the additional conditions, |n|21 and cos2θ1, where θ is the zenith angle of the point of observation. As for recent works inclusive of expressions of lateral waves their weak points are pointed out.

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.

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.

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.

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.

In this paper, we investigate the knowledge complexity of interactive proof systems and show that (1) under the blackbox simulation, if a language L has a bounded move public coin interactive proof system with polynomially bounded knowledge complexity in the hint sense, then the language L itself has a one move interactive proof system; and (2) under the blackbox simulation, if a language L has a three move private coin interactive proof system with polynomially bounded knowledge complexity in the hint sense, then the language L itself has a one move interactive proof system. These results imply that as long as the blackbox simulation is concerned, any language L AM＼MA is not allowed to have a bounded move public coin (or three move private coin) interactive proof system with polynomially bounded knowledge complexity in the hint sense unless AM = AM. In addition, we present a definite distinction between knowledge complexity in the hint sense and in the strict oracle sense, i.e., any language in AM (resp. IP) has a two (resp. unbounded) move public coin interactive proof system with polynomially bounded knowledge complexity in the strict oracle sense.

Reflection type optical switches with intersecting waveguides and curved electrodes are newly proposed. The guided incident mode is expanded into an infinite spectrum of plane wavelets. The effects of light tunneling into the transmission port is taken care of by treating the 3-layer structure and using its reflection and transmission coefficients in estimation of the extinction ratios. It is found that the electrode curved in the form of an exponential spiral provides remarkably improved power reflectivity. This is because it poses a constant angle of incidence (smaller than the critical angle) to all variously oriented impinging wavelets. In this way, all plane wavelets are made to undertake total reflections. These total reflections result in considerably high extinction ratios to be achivable at the transmission port. It is also shown that the electrode length is shorter and the intersection angle is wider than those corresponding to a straight electrode. Therefore, it is concluded that the curvature of the electrode improves the switching characteristics of the device.

A new pattern synthesis method for multibeam reflector antennas is described. The Directional Constrained Minimum Power (DCMP) method, which was developed as an adaptive array algorithm, has been applied to reflector antennas with cluster feeds. The main objective of this pattern synthesis is to optimize the excitation distribution of the cluster primary feed in order to reduce the sidelobe level and to attain a high main beam gain. A desired contour beam pattern has also been attained by modifying this method. Furthermore, this paper describes other applications of this method, such as pattern optimization taking account of the frequency characteristics and the change in the radiation pattern due to an antenna pointing system, cross-polarization reduction, and monopulse pattern synthesis for an RF sensor.