It is of great importance to propose the appropriate quantitative measures for assessing the software performance in software reliability. During the software development phase, a software system is tested to eliminate software errors, which can be detected by a test tool and corrected in accordance with standardized procedures. Then, of our interest is the following: How many statements or steps including the software errors can be corrected up to time t in a program? We consider a software failure process by describing two distinct processes, i.e., the error detection and error correction processes. That is, each software error detection takes place with the counting process on time axis and the error correction can be described by the cumulative process in which the number of the statements or steps corrected for each error detection obeys a Poisson distribution. The stochastic behavior of such a model can be analyzed by applying the theory of cumulative processes. We propose two models based on the nonhomogeneous Poisson process and the De-Eutrophication process. Several useful quantitative measures associated with the total number of statements or steps corrected up to time t are derived. The numerical examples of these measures are shown and two models are compared.
Optimum topologies for the realization of symmetrical bandpass filters with minimum capacitors and minimum opamps are proposed. The derivation of them is largely based on some important results of the GVCS synthesis proposed previously by the author. Design equations for the realization of fourth, sixth and eighth order elliptic bandpass filters are presented in detail and generalized to high order synthesis. Finally the low sensitivity property of the proposed topologies is demonstrated through design examples. Furthermore, some suboptimum topologies, which design equations are much simpler than that for the corresponding optimum topologies, are also presented.
Authors derived an electromagnetic theory of the contactless measuring method of electric conductivity of nonmagnetic semiconductor circular wafer referring to the arrangement shown in Fig. 1, and have got the result for d'd:(16)where V is electromotive force induced along measuring coil due to the eddy current in the wafer induced by exciting coil, for the lower frequency range:f
Shigenori SHIMIZU Misao KITAGAWA
It is well known in a multiprocessor system that the reduction of the system throughput is chiefly attributable to its memory access conflicts. A new method has been proposed which can avoid the memory access conflicts by means of realizing a conflict-free data mapping through a new technique of reorganizable memory structure. On the other hand, whether or not a parallel processing system is successful does deeply depend on the software design. Most of the algorithms for numeric computations are not suitable for the parallel processing, but usually for the sequential one; accordingly, it is important to develop such an algorithm that takes account of its parallelism. This paper describes some examples of parallel processing algorithms suitable for the proposed multiprocessor system with reorganizable memory structure. The application problems described in this paper involve the fast Fourier transform and the matricx processing, but these are only an example or two out of many application problems. By the use of algorithms as mentioned in this paper, the multiprocessor system with reorganizable memory system can demonstrate its effectiveness and perform the parallel processing without any memory access conflicts.
In this paper, a generalized voltage-current simulation (GVCS) of doubly resistively terminated LC bandpass filters, with minimum capacitors that can be equal-valued and minimum opamps is proposed. With the proposed GVCS, some new minimum capacitor minimum opamp topologies for the realization of bandpass filters are derived. The improved sensitivity performance of the derived circuits over that of the cascade design is demonstrated through practical design examples. Furthermore, it is also shown that all of the derived circuits can always be designed to have good dynamic range.
A synthesis of RC active filters based on the simulation of doubly terminated LC filter is presented. In this method, single amplifier grounded immittances (inductors, FDNR's) are used to simulate both floating and grounded elements. The method is quite suitable for simulating bandpass filters with attenuation poles. The design example of 6th order elliptic filter shows low sensitivity characteristics, especially in the passband, that inherit the low-sensitivity nature of LC ladder filters.
Shigenori SHIMIZU Misao KITAGAWA
In a multiprocessor system where the number of processors composing the system is increased, and the memory utilization is raised by improving the execution rate of each processor, the reduction of system throughput caused by the memory access conflicts has to be considered substantially. This paper describes the discussion on such an approach that implements a conflict-free data mapping by the use of some sophisticated address translation between logical and physical addresses. This new addressing scheme of a reorganizable memory structure provides the function that allows each processor easily to distribute the operands to be accessed to completely different memory modules, by interlaying the address translation mechanism called address organizer between logical and physical addresses. This approach permits the memory structure to reorganize so as to make it adaptive to the parallelism contained in the problems themselves, and thus also to accomplish the suppression of memory access conflicts spontaneously. Furthermore, conflict-free data mapping being eventually accomplished through an interface of such a hardware as address translation mechanism, this approach has an advantage that the user's logical address space will not be affected in the least.
Splice loss arising from differences in fiber structural parameters such as outer diameter, core diameter, and refractive index difference is studied experimentally and theoretically. Practical formulation for splice loss is made as a function of parameter differences between fibers to be spliced. It is found that the experimental splice loss for conventional graded-index fibers is estimated within an error of 0.1 dB. Considering the fabrication yield rate of fibers as well as splice loss, tolerances of the fiber parameter deviations from the optimum values are determined.
The improvement made by the scanning diversity reception on the cochannel interference performance of a digital FM land mobile radio is analyzed in the Rayleigh fading signal environment. The results are verified by the laboratory simulation test.
Hideo UCHIDA Tetsuya SUGIYAMA Tadatsugu ITOH
By means of partially ionized MBE (PI-MBE), n+/p silicon solar cells have been fabricated. The surface layer epitaxially grown on a p-type bulk silicon substrate (ps0.540.0 ohm-cm) could be heavily doped (p1.01.0-3 ohm-cm; 5.01019 cm-3 carrier concentration) using As with the substrate temperature higher than or equal to 700. The cells were evaluated with IV characteristics under AM1 illumination and spectral responses obtained by a computer aided proofreading method. It has been found that the cell conversion efficiency η and the fill factor F. F. are 11.012.0% and 0.700.75, respectively.
Tsuneo KINOSHITA Tai SATO Jun IWAMURA Masamichi SUGAI
The T88000 is a 16 bit microprocessor realized by the use of silicon-on-sapphire (SOS) LSI technology. SOS technology and architectural innovations, such as pipelining, prefetch buffering, 2-port register file, barrel shifter, multiplier etc., are key T88000 features.
The Horn set is the set of Horn clauses. The Horn clause is the set of literals which contains at most one positive literal, where a positive literal means a literal without negation sign. The satisfiability problem of the Horn set in propositional logic is one of P-complete problems, although the satisfiability problem of the formula in propositional logic is one of typical NP-complete problems. In propositional logic, unit and input resolutions, proposed by C. L. Chang, are complete inference rules used to detect the satisfiability of the Horn set. In this paper, we formulate a Restricted Linear (RL) deduction, extending unit and input resolutions. The RL deduction is formed by layering linear deductions each of which corresponds to an input resolution refutation, and is called by another name, a Linear Layered Resolution deduction based on Input resolution (an LLRI deduction). Next, we formulate a Nonlinear Layered Resolution deduction based on Input resolutions (an NLRI deduction). By means of the LLRI and NLRI deductions, we propose some classes of extended Horn sets in propositional logic for which the satisfiability problems are solvable by LLRI and NLRI deductions in deterministic polynomial time; and, thus, so are P-complete. Also we propose algorithms to determine whether a given set of clauses is in the proposed classes of extended Horn sets.
Akinori WATANABE Hirokazu ANDO Yasuo OHMORI
The mechanisms of the conventional spring driving types of the wire dot print heads having been studied, a new mechanism is proposed. The new mechanism is designed on the principle of the center of percussion of a body, and has the merits of good characteristics and low cost. In order to design the new mechanism reasonably, the collision vibrations are analyzed by the wave equation. It is shown in the analysis that impact printing characteristics of the new mechanism are determined by three parameters: printing medium stiffness, armature stiffness and mass ratio of the armature to the wire. The design targets are also represented by these three parameters. The relation between the center of percussion and the center of rotation of the armature is clarified on a standpoint of the collision vibration. This analysis can be applied to various mechanisms of wire dot print heads. Calculated results agree with experimental results. The new mechanism was proved to be much better than that of the conventional leaf spring by experiments.
An investigation is made of the performance characteristics of frequency-division multiplexed transmission of TV signals using both electronic and optical power combining. Intensity-modulated light sources and avalanche photodiode detectors with optimized gains are considered. The allowable transmission loss, inter-repeater spacing and total transmission distance are investigated. Optical combining becomes more advantageous as the number of transmitted channels is increased. This technique might allow the use of optical analogue IM transmission in trunk line applications.
Haruhisa ICHIKAWA Masaki ITOH Yasuyuki YOSHIDA
A service specification description method for communication control machines (CCM), called the multilogue-set method", is proposed. This method is well suited for the discussion of the CCM renewal in response to service addition requests.
Takanori OHIRA Teizo AIDA Keiichi UCHIMURA
Typical circuit for quenching the contact-arcs is the capacitor C-resistor γ series circuit. In order to quench the bounce-arcs on contact closure, the upper limit of C, Cmax, has to be decided, so that Cmax was introduced and its validity was confirmed by using Hinge type relays.
Hallen's type integral equation derived by Mei for a curved wire antenna is applied to a system composed of many arbitrarily bent wires with arbitrary excitation. The simplification of kernels
This paper presents consize proof rules for procedure calls in Pascal-like programs. Procedures which we deal with may contain recursive calls and have both variable parameters and value parameters. For simplicity, we place two restrictions on procedures. (1) Non-local variables are not allowed to appear in any procedures. (2) All parameters of procedures are of integer type. We have attempted to make the proof rules clear, understandable, and easy to apply to program verification. Our proof rules are readily used to aid in generating verification conditions in mechanical verifiers. We present several examples so as to show how these proof rules can be used to facilitate varification of programs with procedure calls.
This paper describes some representations of a mapping and their simplification. Any mapping from a finite set into another can be represented by a sequence of Boolean functinos if we encode its domain and range to finite binary sequences. The complexity of the representation depends on the encoding. We present a problem of finding an algorithm that derives one of the simplest representations of a given mapping, and solve it in a case where the complexity measure is determined according to the number of literals in disjunctive forms.
Akio KAWANA Toshihito HOSAKA Tetsuo MIYA
Uniform bending losses of single-mode fibers are experimentally studied. The effects of a dip in the refractive index at the center of the core, bending radius and fiber parameters on the bending losses were investigated. An experimental equation for the bending loss of a single-mode fiber with a small dip have been obtained as an exponential function of the bending redius and the fiber parameters. It essentially agrees with the theoretical equation.