bluuebunny/crossref_metadata_2025 huggingface dataset:
The key features of Japanese total quality control
Authors: Dale B. G.
Published: July 2007

This paper reports the main findings of a mission of manufacturing executives to study total quality control (TQC) in six major Japanese companies. The paper outlines why TQC is important to Japanese companies and identifies five main pillars of their TQC activities—policy deployment, organization and planning, education and training, involvement of every employee in quality improvement, and day‐to‐day quality assurance and control. Some popular misconceptions about Japanese‐style TQC are examined, including that they do not experience any difficulties in getting top management involved in TQC, that quality control circles are successful in every department and that incoming supplies are never inspected. The paper concludes by presenting some lessons for Western managements.
A new approach to reliability of commercial and military aerospace products: Beyond military quality/reliability standards
Authors: Kromholtz Gregory A. , Condra Lloyd W.
Published: July 2007

Recent changes in the commercial and military aerospace industries have caused us to question the traditional ways of measuring, predicting and assuring product reliability. These industries have been unique in that both quality and reliability have been almost completely controlled by government standards, a condition that will not survive the current upheaval in these markets. Traditional reliability prediction methods for military and commercial aerospace products use a probabilistic approach, such as that of MIL‐HDBK‐217, and Reliability Assurance relies on fixed quality levels in design and manufacture. These approaches almost uniformly assume that predicted equipment reliability is the sum of the predicted reliabilities of the electronic and electromechanical parts in the equipment and that once designed, reliability is a fixed attribute of the hardware. This paper describes a comprehensive approach to avionics reliability assurance which addresses all potential causes of unreliability. It is applicable to both commercial and military products. The approaches described here may be viewed as the next logical step beyond the traditional approach to quality and reliability found in current Military Standards.

This paper is a call to change the way we think about reliability assurance in the military and aerospace markets. Six new approaches are suggested: (1) Adopt a continuous improvement, zero‐defects mentality in the design of military and aerospace products; (2) develop a design‐to‐world‐class cost and schedule mentality; (3) adapt world‐class process control methods to low‐volume, high‐reliability manufacturing; (4) accept ownership for quality and reliability of all components and materials; (5) adapt world‐class design practices to military and aerospace products; and (6) recognize that quality and reliability of parts, materials, and systems are the responsibility of those who manufacture them.

Although ELDEC Corporation is installing a system with the above features, the implementation of these approaches will be unique to each user. The system described in this paper involves the use of many currently popular TQM methods, such as statistical process control, design of experiments and concurrent engineering. It also involves interaction of many functions within the manufacturing organization, as well as with suppliers and customers. Our listing of methods is not intended to be comprehensive, just illustrative.
Reliability simulations of the endurance performance of FLOTOX EEPROM cells using spice
Authors: Gigon F. , Papadas C. , Ghibaudo G. , Pananakakis G. , Mortini P.
Published: July 2007

A SPICE model which enables transient simulations of the programming window degradation in FLOTOX EEPROM cells to be performed is presented. The simulation enables the endurance characteristics of the memory cells to be predicted at CAD level, when provided with the memory cell geometry, the programming conditions and the tunnel oxide quality. Thereby, the optimization of the cells' geometry with respect to the endurance performance as well as the selection of the optimum programming conditions which minimize the window degradation become possible, even prior to the fabrication of the memory cells.
Failures of ALGaAs/GaAs HEMTs induced by hot electrons
Authors: Tedesco C. , Canali C. , Magistrali F. , Paccagnella A. , Zanoni E.
Published: July 2007

We present in this work the rapid and irreversible degradation of electrical characteristics induced by hot electrons in unpassivated AlGaAs/GaAs HEMTs. When devices are biased at high drain‐source voltages carriers can reach high energies and give rise to impact ionization phenomena. Devices biased in these conditions show a decrease of drain current, an increase of parasitic drain resistance and an increase of transconductance frequency dispersion. Degradation has been found proportional to the maximum electric field in the channel. Results suggest that hot electrons generate deep levels in the access region between gate and drain contacts possibly at the interfaces between the semiconductor layers in the gate‐drain region.
Use of off‐line and on‐line controls for the manufacture of quality rings for bearings—a case study
Authors: John Abraham P. , Bhadury Bikash
Published: July 2007

The paper is a report of an investigative study carried out to evaluate the quality of rings manufactured for rolling element bearings. The rings are manufactured from 36–75 mm diameter bars of high‐carbon high‐chromium bearing steel, grade SAE‐52100 conforming to ASTM A295‐1984 in a ring plant, which essentially consists of an induction furnace and a fast‐acting hot forging machine consisting of a set of feed rolls, hot shear and four forming stations. The ring plant is capable of producing 17 million rings per annum. Thus the volume of rings produced is very large and the project was undertaken with the objective of process improvement to build in confidence during the manufacture of the product so that it can be sent out without final inspection. The project was carried out in three phases, namely use of variables charts together with the identification of the causal factors for the ovality of rings with the help of cause‐and‐effect diagrams, followed by process optimization using parameter design, and this, in turn, was followed by on‐line control procedure instituted for the control of the variable which deteriorates with time.
What's new in reliability engineering?
Authors: Coppola Anthony
Published: July 2007

Reliability engineering is responding to the trend to computer‐aided design (CAD), and the current emphasis on improving competitiveness through quality. Islands of automation addressing reliability for both hardware design and software engineering exist which are not yet connected, though government–industry teams are developing integrated software packages of reliability (and maintainability) tools. TQM (total quality management) principles are being adopted in many industries, and the U.S. Qualified Manufacturers List (QML) programme, which requires qualification of a process rather than a product, is now used for procuring microcircuits. However, government regulations remain a barrier to creating a ‘quality culture’. ISO 9000 is seen by industry as a requirement for international competitiveness, but criticized by some as counterproductive. Research and development of reliability engineering tools reflect the need for implementation in CAD frameworks, and fuzzy logic analysis has attracted the attention of the theorists.
Implementation of laser beam sensitive cells: A new approach for integrated circuits testing
Authors: Fouillat P. , Gervais‐Ducouret S. , Lapuyade H. , Dom J. P.
Published: July 2007

The use of library cells, specially designed for their sensitivity to a laser beam, is a potential solution for both ‘observability’ and ‘controllability’ problems encountered by the test engineers. The basic principle relies on the photo‐induced current generated in the laser beam‐silicon interaction. The ‘observation’ cells, when probed by the beam, are used to read directly a logic level inside the circuit, whereas the ‘control’ cells are used to force a particular node of the circuit. A test structure including a 16 bits counter with 16 ‘observation’ cells and 1 ‘control’ cell has been fabricated in BiCMOS technology in order to illustrate this new testing method.
Early detection of ageing in solder joints through laser probe thermal analysis of the peltier effect
Authors: Claeys W. , Quintard V. , Dilhaire S. , Lewis D. , Danto Y.
Published: July 2007

We have recently developed an optical contactless method for testing the quality of solder joints during accelerated thermal cycling ageing processes.1 The method was based upon the measurement of the dynamic thermal behaviour of the joint to short bursts of Joule heating. It has proved to be efficient in revealing the formation of cracks at the lead‐solder interface. We present a method to evaluate ageing at a much earlier stage in the cycling process. We have observed in earlier work,1 that before cracks appear, structural changes occur in the solder at the lead‐solder interface. The thermal response of the solder joint is recorded over time to a Peltier heat perturbation produced by flowing a current pulse through the interface where structural changes occur. The key point in this method is to discriminate the Peltier effect from the Joule thermal response because both effects generate heat. The variation of the early Peltier response in the thermal cycling ageing tests is seen as a quantitative signature of the structural changes in the lead‐solder interface.
Reliability modelling for electromigration failure
Authors: Lloyd J. R.
Published: July 2007

Electromigration has been recognized as one of the most important wearout failure mechanisms in integrated circuits. As such, the problem of extrapolating test results for the purpose of reliability predictions is very important to the industry, and the topic has understandably received considerable attention in the professional literature. Over the years, however, there have been serious problems correlating experimental results with theoretical predictions. Recently this dilemma has become resolved through a better understanding of the failure process. This paper will review these developments and the process that has led us to where we are today.
Correlation between 1/f noise and semiconductor laser degradation
Authors: Fukuda Mitsuo , Hirono Takuo , Kurosaki Takeshi , Kano Fumiyoshi
Published: July 2007

The origin of the increase in residual spectral linewidth during device degradation is experimentally and theoretically clarified in a multiple quantum well (MQW) distributed feedback (DFB) laser. Non‐radiative recombination current increases during device degradation and causes 1/f noise to increase. This current 1/f noise is the origin of the increase in the residual spectral linewidth. Through these degradation behaviours, a model showing a correlation between 1/f noise and the semiconductor laser degradation is proposed.
Best compromise test plans for weibull distributions with different censoring times
Authors: Yang Guangbin , Jin Ling
Published: July 2007

This paper presents the best compromise three‐level constant stress accelerated life test plans for Weibull distributions with different censoring times. The best compromise test plans choose the stress levels, test units allocated to each stress and censoring times to simultaneously minimize the asymptotic variance of the MLE of the mean log life at design stress and total running time. This paper also compares the test plans with existing three‐level test plans and concludes that the best compromise test plans (1) have less asymptotic variances, (2) are more robust and (3) are more cost‐effective, than the existing three‐level test plans.
Study of the influence of thermal effects on the electromigration tests
Authors: Abdeslam Saǎd , Lormand Gérard
Published: July 2007

A simple one‐dimensional thermal model of the electromigration phenomenon shows that the usual measurement methods of the temperature during lifetime tests usually lead to an erroneous determination of Black's relation parameters n and Q. The effects of the current density and the temperature estimation method on the errors on n and Q are analysed. An estimation of the temperature of the site where the flux divergence is maximum allows us to understand the behaviour of n and Q. The difference between real and apparent activation energy, at low current densities, is also calculated.
A kalman filtering process control scheme with an application in semiconductor short run manufacturing
Authors: Castillo Enrique Del , Montgomery Douglas C.
Published: July 2007

A quality control chart for monitoring a short run process during the start‐up phase is presented in this article. The chart is based on the Kalman filter recursive equations being applied to a stable process where the process variance is unknown prior to the start of the production run. The run length properties of this control scheme are discussed. It is shown that for the proposed scheme the run length properties are independent of the unknown process variance and that these properties are appropriate for monitoring a stable process during start‐up. An economic model for the optimal design of the control scheme is presented and illustrated with a wet etching process used in semiconductor manufacturing.
Upper voltage and temperature limitations of stress conditions for relevant dielectric breakdown projections
Authors: Vollertsen R.‐P. , Abadeer W. W.
Published: July 2007

Parameters and their dependence on stress conditions are discussed using a three‐dimensional model, including all possible degrees of freedom. The results, applied to breakdown data for 10 nm oxide, reveal the upper limits for stress conditions. A physical explanation for the upper voltage limit is presented. Furthermore, the thermal activation energy and the slope of lifetime distributions (e.g., the shape factor β of the Weibull distribution) are investigated as functions of electric field and temperature. The results are compared to available literature data.
Design of hardware algorithms by recurrence relations
Authors: Wakabayashi Shin'ichi , Kikuno Tohru , Yoshida Noriyoshi
Published: July 2007

With the progress in VLSI technology, a remarkable attempt, called the hardware algorithm, to realize various kinds of algorithms directly as hardware on VLSI chip has become practical. No significant result, however, has been observed on the systematic formulation of the hardware algorithm or its design method. This paper proposes a new design method for the hardware algorithm using recurrence relations. As the first step, a class C of problems is introduced which is defined by the recurrence relations with two variables. Several practically important problems such as string matching, are contained in this class. It is shown that letting the size of the problem be m, one can always construct a hardware algorithm of 0(m) steps to solve any problem in the class C. Then by imposing a certain restriction on the recurrence relation, a subclass C1 of the class C is defined. It is shown that the hardware algorithm of 0 (log m + m/log m) steps can be constructed for the subclass C1. Finally, the extension of the class C is discussed, and it is shown that its algorithm can be applied, with some modifications, to a class of recurrence relations which is wider than the class C.
Evaluating the parallelism of the feed‐forward machine and algorithms of the machine
Authors: Tomisawa Masayuki , Yamada Hidekazu , Nakamura Tadao , Shigei Yoshiharu
Published: July 2007

The feed‐forward machine (FFM) is an MISD type computer which executes more than one processing for a single‐data stream. Since more than one operational circuit operates at the same time for a set of input data in FFM, a certain degree of parallel computation can be achieved. This paper discusses such parallelism in FFM. As the first step, a data‐flow graph is used to evaluate the parallelism of FFM. Although FFM cannot utilize all parallelism inherent in the program, it can execute the program with far fewer steps than in a Neumann machine. Computation suited to FFM tends to occur with higher probability as the parallelism in the program is decreased. As an example of application to actual computation, exponent calculation and multiplication‐division of complex numbers are considered. An algorithm suited to FFM is constructed at the arithmetic computation level. Then the computational complexity is examined when several kinds of numerical computations are performed using the algorithm and the result is compared with the case of a Neumann machine, indicating the features of the proposed method.
Parallel processing system for communication control
Authors: Yamashita Masahide
Published: July 2007

This paper proposes a parallel processing system dedicated to communication control. The proposed parallel‐processing communication‐control system contains seven kinds of parallelisms‐two reflecting the hierarchical and multiple structures of the communication links, and five reflecting the mutual relations among functions realizing the link control processings. The system efficiently realizes high‐performance communication control processings. This paper outlines the system structure, derives the system including the modelling of the communication control processings, and discusses the problems in implementation. By using the communication control device based on the system, it becomes easy to construct economically a large‐scale data‐communication network system. The proposed scheme also realizes a new network service based on high‐speed communication links.
Construction of up‐down‐type and shift‐register‐type counters using ternary flip‐flop circuits
Authors: Muranaka Noriaki , Imanishi Shigeru
Published: July 2007

Construction methods for ternary logic circuits and ternary tri‐stable flip‐flops, using ternary basic operational circuits composed only of CMOS‐ICs have been reported. This paper discusses the construction methods for ternary sequential circuits, such as ternary counters, using those ternary logic circuits and ternary tri‐stable flip‐flops. Among various types of ternary tri‐stable flip‐flops, this paper uses two‐stage ternary up, down and up‐down type JK flip‐flops. As the logical‐type ternary counters, up, down and up‐down type divide‐by‐10 counters are realized. Considering then, the constructions of divide‐by‐2 to 9 counters, the input equations for the ternary up‐ and down‐type JK flip‐flops are determined. The feedback‐type ternary divide‐by‐8 counter is also discussed. As the ternary shift‐register type counters, ternary ring counter, ternary Johnson counter, clockwise and counter‐clockwise cycling counters are realized.
Hierarchical routing bus
Authors: Sueyoshi Toshinori
Published: July 2007

In MIMD highly parallel processing systems, such as parallel computers and data flow computers, their capability, cost, and implementability are dependent largely on the implementation of their access mechanis m. This paper proposes a hierarchical routing bus (H‐R bus) which is useful as an access mechanism for such system s. In the H‐R bus, 3‐port bus switches, called T switches, are connected in a hierarchical fashio n. This bus has the following characteristics; (1) a modular structure, thus yielding high expandability, and when many modules are added, its access multiplicity increases; (2) when a system becomes large, its average access distance does not increase greatly; (3) in case of an access contention and collision, distributed arbitration is possible without a deadlock; (4) it requires a small amount of hardware, and a simple interfac e. It is known that any hierarchy‐structured multiprocessor system contains a bottleneck, which causes a problem for highly parallel processin g. This paper considers this issue and shows that the bottleneck effect is not so large in memory‐shared multiprocessor systems of fast access tim e. Finally, a method of removing the bottleneck of the H‐R bus by using 4‐port bus switches (called TT switches) is presented.
Data flow schemata of maximum expressive power
Authors: Matsubara Yasuo
Published: July 2007

In this paper, we propose class ADF of data flow schemata, whose expressive power is equivalent to that of class EF of effective functional s. We consider those classes of functionals that can be implemented by schemata of a class as the expressive power of the clas s. In this sense, EF has the most expressive power among the classes of program schemata known to date.

In ADF schemata, we use arbitors of data tokens and recursive procedures which are expanded as macro s. We assume that each arc holds at most one token at the same tim e. In the process of verifying the equivalence of ADF and EF, we show that Turing machines can be emulated by ADF schemata.
Real‐time range measurement device using slit‐ray projection
Authors: Yamamoto Shin , Nakano Tomoaki , Ozeki Osamu
Published: July 2007

This paper describes the construction and the performance of a real‐time measurement device for detecting the range, shape and position of a three‐dimensional object, using the slit‐ray projection method. An experimental machine part sorting system by the device is also described. The real‐time range measurement is performed as follows. The laser slit‐ray is projected on the object, scanning its surface with a high speed. In the meantime, the range to each point on the object surface is determined by triangulation. The operations are executed by a dedicated hardware. The experimental device is composed of a slit‐ray projecting unit, a slit‐ray scanning control unit, a TV camera for the imaging of the ray reflected from the object and the signal processing unit, which calculates the range and the shape of the object. The performance of the device is such that the range to the object and its shape, located in the range of 60 cm × 60 cm at the distance of 100 cm are determined for 48 points (x‐direction) × 50 points (z‐direction) in 490 ms. The accuracy of the range measurement is ±3.0 percent in the above condition. An experimental sorting system of machine parts has been developed using this method. By applying a new range gating method to this device, the sorting of three‐dimensional machine parts was realized in realtime by a simple algorithm, indicating the effectiveness of the proposed method and the device.
ALU logic synthesis using templates
Authors: Takagi Shigeru
Published: July 2007

This paper presents a method of automatic synthesis for ALU circuit based on functional specification. The ALU to be synthesized is specified by a table of functions as well as control codes indicating the selection of each function, and the bitwidth of the data. If the functional specification is expanded directly into the two‐level form, the number of conjunctive terms will become prohibitively large. As a result, the method aims at a multilevel realizaization of ALU, and a model (template) representing the essence of the logic structure of ALU is constructed. The logic expressions for parts of the template are derived from the given functional specification by modification and manipulation of logic expressions. After simplifying partial logic expressions, the lejics are combined. By the proposed method, 32‐bit ALU with 32 logic functions is realized in approximately 40 s using a computer of 2 MIPS. The synthesized logic has a quality comparable to the one by manual design. There can be various ways of defining the template, and by using different templates, various kinds of ALU's can be constructed for the same functional specification.
Describing method of music information toward its advanced computer processing
Authors: Tsuboi Kuniharu , Ishizuka Mitsuru
Published: July 2007

This paper proposes a symbolic description of music information, which includes folk music. The method aims at the high‐level music information processing in the future with a high describing ability and a description handled easily by human ability.
Fundamental concepts of language processor generator MYLANG
Authors: Anzai Hiroyuki , Yamanoue Takashi
Published: July 2007

This paper describes the fundamental concepts of the language processor generator MYLANG. The language machine in the classical automaton theory is used as the practical model. An algebra is introduced to handle the model easily, and a machine is constructed which can synthesize the model as an algebraic computation. As the algebra for the machine model, the semilinear algebra, i.e., an algebra close to the linear algebra on the language semiring is introduced. The hierarchy of the classes or machine models described by that algebra is examined. The machine model realizing the language processor generated by MYLANG and also realizing MYLANG itself are located at the highest hierarchy, and are constructed in a hierarchical way from the machine models in the lower classes. First, the multiple sequential‐transducer system is given as the syntax‐directed translator. Then some additional mechanisms are combined with this class of machines. Its generator is given as the class of machines of that kind. Finally, the attributes are introduced, and the class of machines aimed at is given as the attributed syntax‐directed translator. Its generator is specified as the class of machines of that kind.
Control circuit synthesis system
Authors: Takagi Shigeru
Published: July 2007

This paper presents a systematic and automatic synthesis procedure based on the behavior specifications and the data path. The system automatically determines the control of the data path components and quasiminimizes the hardware complexity of the control circuit. The major contents are as follows: (1) the control circuit is of the Mealy‐type finite‐state sequential circuit; (2) data path is analyzed, and the components to be controlled and the control signals are determined in order to realize the basic manipulations such as operation and data transfer described in the behavior specifications; (3) concurrent operation of the data path is considered, and the control signals to the nonconcurrent component are encoded or shared; (4) the state used in the specification is encoded into the internal states of the control circuit. The code is determined so that the number of product terms in the state‐transition function or the control output function is quasi‐minimized; (5) based on the result of (3) and (4), the state‐transition function and the control output function representing the data path control condition are determined; (6) the state‐transition function and the control output function are realized by PLA and other devices.
Speaker identification based on frequency distribution of vector‐quantized spectra
Authors: Shirai Katsuhiko , Mano Kazunori , Ishige Shunichi
Published: July 2007

At present, one of the most important problems in speech recognition and speaker recognition is the extraction of individual information from the speech waveform. This paper describes the extraction of individual information by the vector‐quantization and the text‐independent speaker information based on that method. A feature vector is proposed for the first time which is the quantized distribution by the frequency of the vector‐quantization code to represent the individual features of the speaker. The properties of the feature vector are investigated, and effectiveness is verified by an actual speaker‐identification experiment. The quantization distribution is a feature representing the distribution density in the space for the acoustic features, e.g., the spectrum uttered by the individual. As the acoustic feature parameters, the cepstrum for stationary part, and the change of the cepstrum, are used to construct the quantization distribution. The identification rates are compared. As a result of the identification experiment for 10 speakers, an identification rate of 100 percent was achieved by the quantization distribution of cepstrum for 10 input words, which are different from the training samples. In the experiment using 200 speakers, an identification rate of 88 percent was achieved for the first candidates, and a cumulative identification rate of 95 percent was achieved for up to the second candidate.
A presentation method of a traveling image for the sensory feedback for control of the paralyzed upper extremity
Authors: Izumi Takashi , Hoshimiya Nozomu , Fujii Akio , Handa Yasunobu
Published: July 2007

Functional electrical stimulation (FES) is applied to restore the holding function of the upper extremity of quadriplegics whose condition is due to spinal chord injury. In that case, the feedback concerning the state of a patient's finger is needed. As a realistic sensory feedback method, the information transmission by surface electrical stimulation to the shoulder of a patient with remaining sensation is considered. Experiments were performed for a normal subject and for quadriplegics, and the psychophysical characteristics were examined. The following observations were made: By using the stimulus with a time‐varying intensity pattern, a phantom sensation (PS) moving on the surface between two electrodes is produced; by extending the idea to the case of three channels, PS is produced which moves around over a wide range on the shoulder. Then a discrimination experiment was performed for the range of PS movement, and it is shown that PS can be used as a practical method of sensory feedback.
Image registration method using adaptive nonlinear filter
Authors: Morishita Koichi , Yokoyama Tetsuo
Published: July 2007

The subtraction technique is applied widely in various fields. It performs the subtraction between images with different imaging conditions. In medicine, angiography called DSA is well known. However, it has a problem in the alignment of images to cope with the motion of the patient. The authors have developed a highly accurate alignment registration method to cope with such changes of position. This method is based on template matching and uses the adaptive filter in the preprocessing. However, the problem with template matching is that the accuracy of the positioning as well as the image quality is degraded in the region (flat region) where the gray‐level variation of the image is small. This paper proposes a system in which the boundary such as that of the vessel is emphasized in the pre‐processing, and the highly accurate registration is realized in the entire region of the image. To determine the filter which is effective in the preprocessing, a quantitative evaluation was made for the traditional differential filter and the frequency‐domain filter. The adaptive filter based on local statistics is applied, and it is shown that, compared with the traditional filter, the error caused by misregistration can be reduced to 1/2 ‐ 1/7. Then it is shown experimentally that the optimum window size (W) and the optimum emphasis factor (α) are W = 3 ‐ 7 and α ≥ 10 (5122 pixel size), respectively, and a high‐speed processing comparable to the speed of the differential filter can be realized.
Test effort‐dependent software reliability growth models and comparisons of goodness‐of‐fit
Authors: Yamada Shigeru
Published: July 2007

Testing in software development is very important since it is the final refining stage before realizing the software to the user and requires a large amount of development resources. In this paper, the time‐dependent behavior of the test effort, such as the manpower spent in the testing process, is represented by exponential and Rayleigh functions, and the software reliability growth model is discussed, which includes the test‐effort functions. The nonhomogeneous Poisson process is assumed as the stochastic principle describing the software error‐detection phenomenon in the testing procedure. Especially, the variance analysis is discussed to determine the significance of the estimation of the test‐effort function by the least‐square method, as well as the prediction of the test effort invested at an arbitrary testing time. It is shown that the software reliability measure derived from the proposed model is a function of the invested test effort. Not only is the point estimation presented, but also the interval estimation. Examples are shown where the proposed model is applied to the actually observed test data, and the goodness‐of‐fit is compared with the existing software reliability growth models. As a result, the goodness‐of‐fit of the proposed model is verified, where the effect of the invested test effort is considered.
Multivalued input, two‐valued output logical element as a two‐valued universal logic module
Authors: Haga Takahiro , Fukumura Teruo
Published: July 2007

This paper proposes to use a multiple‐valued (p‐valued) input, 2‐valued output logical element ((p, 2)‐logical element) for the construction of a 2‐valued ULM (Universal Logic Module). The (p, 2)‐logical element can conveniently be programmed to work as an expected 2‐valued logical function by appropriately selecting two input values among p values. The (p, 2)‐logical element as a ULM also has some preferable points such that the interconnections between ULM's can be decreased in VLSI, compared with the ULM in usual 2‐valued logic.
An extended syllogistic system with conjunctive and complementary terms, and its completeness proof
Authors: Nishihara Noritaka , Morita Kenichi
Published: July 2007

Aristotle's (Categorical) Syllogism is a logic system in which a new proposition is derived from several propositions stating the relation among “terms” (corresponding to common nouns). It can directly treat a term itself, and has a unique character different from predicate logic where its semantics is constructed based on “individuals”. Therefore, syllogism has several advantages as a logic system for processing a general knowledge such as one expressed by a natural language. However, the expressive ability of classical syllogism is poor. In particular, it can treat only atomic terms as primitive objects. Previously, we proposed an extended syllogistic system with the term operator of conjunction. This paper is a further extension of that system. We introduce a syllogistic system which can treat compound terms produced by using the term operators of conjunction, disjunction and complementation. A set of axioms and an arithmetic interpretation for this system are given, and its completeness is proved.
A fast digital search algorithm using a double‐array structure
Authors: Aoe Jun‐Ichi
Published: July 2007

This paper presents an efficient digital search algorithm by introducing a new internal array structure called a double‐array that combines the fast access of a matrix form with the compactness of a list form. Each arc of a digital search tree called a DS‐tree can be computed from the double‐array inO(1) time; that is, the worst‐case time complexity for retrieving a key becomesO(k)for the lengthkof that key. The double‐array is modified to make the size compact while maintaining fast access and algorithms for retrieval, insertion and deletion are presented. Suppose that the size of the double‐array isn+cm, wherenis the number of nodes of the DS‐tree,mis the number of input symbols, andcis a constant depending on each double‐array. Then it is proved theoretically that the worst‐case times of deletion and insertion are proportional tocmandcm2, respectively, independent ofn. From the experimental results of building the double‐array incrementally for various sets of keys, it is shown that the constantchas an extremely small value, ranging from 0.17 to 1.13.
A virtual optical disk method to realize rewritability and revision control on a write‐once optical disk
Authors: Member Takashi Yokozeki Associate , Namiki Mitarou , Nakagawa Masaki , Members Nobumasa Takahashi
Published: July 2007

This paper proposes a virtual optical disk method which uses the write‐once optical disk as a rewritable secondary memory on existing operating systems. The method also provides revision history of all files on an optical disk. The virtual disk method realizes a virtually rewritable disk (virtual disk), using the write‐once optical disk. The rewriting is simulated using the disk sector as the unit. It completes re‐writability and revision control without additional rewritable memory devices such as magnetic disks. The method is actually built into an OS for a personal computer, and the access speed of a virtual disk is made almost equal to that of a floppy disk by adding an optical disk cache memory. The virtual disk method has a merit in that it can cope with write‐errors in a write‐once optical disk, which may occur consecutively at writing process. Thus, it is seen that the virtual optical disk method is a useful means of this medium management.
Note on the efficiency of methods to generate quasi‐random sequences
Authors: Yamamoto Hiroaki
Published: July 2007

There have been several researches on how to generate quasi‐random sequences from semirandom sources (SRS). Recently, SRSs have been studied and generalized such that they output an element over an arbitrary finite set. However, the existing generator outputs one element from ω ((logn)2) inputs and uses ω ((logn)2) SRSs. This paper presents more efficient methods to generate quasi‐random sequences. This method uses ω (logn) inputs to make one output.
Learning of linear associative mapping by latticed network circuits
Authors: Utsugi Akio , Ishikawa Masatoshi
Published: July 2007

A latticed network circuit is proposed for realizing learning of linear associative mapping as a method to realize analog implementation of neural network algorithms. Latticed network circuits considered herein have a structure in which one end of the current source arranged in a line is connected with a neighboring current source via register lines and the other end is grounded. It is shown that a latticed network circuit with nonuniform register distribution gives a solution to the Dirichlet‐type boundary value problem of a Poisson equation discretized by unequal spacing as its node voltage. From this and the aquation corresponding to Green's Theorem, an equation is derived to obtain a linear sum for input current distribution as the difference of boundary current. Based on this equation, a latticed network for computing linear mapping is constructed. Next, a procedure is obtained for learning an optimal linear associative mapping by altering the delta rule. Finally, comparison is made with the existing circuit for computing linear associative mapping.
Gray‐level image recognition based on multiple cell‐features
Authors: Sano Mutsuo , Meguro Shinichi , Ishii Akira
Published: July 2007

This paper proposes a gray‐level image recognition algorithm based on multiple cell‐features for general‐purpose model matching using the generalized Hough transform, which removes the instability of conventional edge‐segment‐based feature description and simplifies its feature matching.

Image features are derived in terms of four basic representations: density; edge direction; edge density; and global edge configuration. These are integrated into a multidimensional feature vector for each “cell,” which is a sampled subregion of the image. This method provides powerful and stable description since it describes contour and area properties as well as local and global features. It also allows the effective use of generalized Hough transform matching.

Multiple cell features are extracted systematically by combining three fundamental operations. These consist of two feature extraction operations, extended convolution and radial traverse probing, and a data compression operation which converts pixel features to cell features by calculating a histogram of extracted features for each cell. Feature dimensionality is decreased efficiently by selecting feature kinds and salient cell positions based on the F‐ratio calculated from training samples. Using the gray‐level images of prepaid telephone cards, a recognition experiment with 20 different card images and a positioning experiment with overlapping cards has been carried out.
Decentralized priority encoder and its applications
Authors: Maeda Toshiyuki , Sato Yoichiro , Yokohira Tokumi , Okamoto Takuji
Published: July 2007

This paper contains the realization of the decentralized priority encoder (DPE) and presents two application examples. DPE is constructed by placing a module for each device issuing a request and by connecting the outputs from the modules using wired‐OR. Each module has the function to modify the priority dynamically. The request signal from the corresponding device is connected to the input of the module.

When the priority of the module M issuing the request is higher than those of any other modules issuing requests, M produces the priority of its request as a binary code on the bus. A data selector can be constructed using DPE, since the data with the highest priority can be selected from a set of data with priorities. This data selector is suited especially to the data selector for image data in the enhanced multiwindow system. Using DPE as the priority comparator, a decentralized independent‐request arbiter with priority is obtained.
Parallel processing scheme of a basic block in a fortran program on oscar
Authors: Honda Hiroki , Kasahara Hironori , Kasahara Hironori , Narita Seinosuke
Published: July 2007

With the development of the supercomputer with multiprocessors, the parallel processing of a Fortran program on the multiprocessor system is considered interesting.

This paper proposes a parallel processing scheme for the Fortran program where the assignment unit (task) to the processor is the processing of an arithmetic substitution statement. The implementation and performance evaluation of the proposed scheme on the actual system are reported.

In the proposed scheme, the arithmetic substitution statement in the basic block is defined as the task, and the precedence constraints among the tasks due to data dependencies are determined. Based on the derived constraints, the allocation of the tasks to the processors as well as the execution order are determined at the compiling stage, using the multiprocessor scheduling algorithm. Then the codes for the processors are generated and the parallel processing is executed.

The proposed scheme was implemented on an actual system and the performance was evaluated. The effect of the parallel processing is manifested. In the conventional loop parallel processing, the effect of the parallel processing cannot be expected for the basic block in the loop or for the basic block of the scalar operation unit outside the loop. On the other hand, it was verified that the parallel processing of those blocks can be realized by applying the proposed method.
Learning of neural networks using their adjoint systems
Authors: Matsuoka Kiyotoshi
Published: July 2007

The backpropagation method is well known in the neural network and was proposed originally as a learning algorithm for the layered network composed of static nonlinear units. On the other hand, for problems such as those in control and signal processing where the time series is considered, the learning must be discussed in the network composed of dynamic units and containing feedback loops.

Pearlmutter discussed such a case and showed that a learning algorithm can be derived by introducing the adjoint system for the system obtained by linearizing the network. This is a natural extension of the ordinary backpropagation method.

This paper extends the method further and shows that a powerful learning algorithm is obtained for a very general neural network and evaluation function. By employing the proposed method, it is possible to realize the network with connection coefficients with a spatial structure, to determine the initial state of the network and to execute the learning for the input, not only for the connection coefficients.
A Method of Information Integration by Multilayer Neural Networks and Its Theoretical Study
Authors: Yonekura Tatsuhiro , Yokoi Shigeki , Toriwaki Jun‐Ichiro
Published: July 2007

This paper proposes a method for concentrating multivariate data (dimensionality reduction) using a neural network model. Specifically, a pulse‐input pattern‐output network (PPN), i.e., a multilayer network in which the input is presented as a pulsed input (a single true input with the others being held to zero Here, by pulsed input, we mean that only one component of the input vector is presented with a value of 1 and has no connection with pulsed signals in the time domain.), is employed and the N‐dimensional training pattern is presented at the outputs. Using backpropagation learning in a PPN, it is demonstrated mathematically that subject to a certain set of conditions, the dimension of the sample space can be reduced arbitrarily while preserving optimality. That capability is compared with principal component analysis (K‐L expansion), and it is demonstrated that the nonlinear dimensionality reduction capabilities of the model by means of a component analysis experiment employ the iris data—a data set which is well known in the field of multivariate analysis.
Functional model‐based assistance for modifying software
Authors: Yamada Hiroyuki , Tezuka Yoshikazu
Published: July 2007

When a part of software is modified, the side effect due to the modification is propagated to other parts, necessitating the reexamination of the whole software. As a result of this situation, it is not easy to reuse the software by modification.

This paper assumes the situation where the side effect due to modification (interaction) is produced by the functional relations among the modules (objects) composing the software and discusses the whole framework (representation of interaction information and the assist mechanism) for the modification‐assist by specifying the interactions due to those relations.

The proposed form for representation (functional model) explicitly represents the functional relations among the objects, using the node to represent the object and the link to represent the functional relation. At each node, the concept related to the interaction can be described directly to realize the modification‐assist facility. By this scheme, the information can be described at a higher concept level, which simplifies the human description of the functional model.

In this approach, the object of description is restricted to the functional relations among the objects. Since the object of description is clearly specified, it is easy to construct a knowledge‐base for the software. A system was constructed which can specify the interaction based on the functional model at the time of the software modification. Through a modification example of ferry simulation software, the usefulness of the proposed system is demonstrated.
A restoration method of medical x‐ray images based on an extended regression analysis method
Authors: Ohta Mitsuo , Ikuta Akira , Mitani Yasuo , Kodera Yoshie , Ogawa Masaaki , Fujita Minoru , Wada Takuro
Published: July 2007

In this paper, a restoration method for the X‐ray images with optical blurs and quantum mottles is proposed by considering each physical mechanism of the medical X‐ray image formation. More specifically, the optical blurs are first deterministically cleared away by using the transfer characteristic of the laser scanner, the characteristic curve of the film, the logarithmic transformation of the optical density and a pseudo‐inverse filter based on the point spread function. Next, as a restoration method for remaining quantum mottles, a new extended regression model that may have a little information lack and a simple experimental regression model are derived on the basis of a Bayes' theorem. Thus the quantum mottles were statistically removed. Finally, the restoration method of X‐ray images proposed in this paper is applied to those of the actual dental images, and dentists visually evaluate and confirm the effectiveness of these processed images.