bluuebunny/crossref_metadata_2025_split huggingface dataset:
Frequency dependence of degradation and breakdown of thin SiO2 films
Authors: Nafria M. , Yelamos D. , Suñe J. , Aymerich X. 
Published: July 2007

AbstractThin oxide MOS capacitors are subjected to bipolar voltage stresses of different amplitudes and frequencies. According to a previously proposed breakdown model, the evolution of the current with the stress time has been considered to be due to the degradation of the oxide, i.e. to the generation and partial occupation of electron traps. When log(J) is represented versus the stress time, the slope of the plot and the magnitude of the current (which tends to decrease during constant‐voltage tests) are taken as indicators of the oxide degradation rate and degradation level, respectively. Our results suggest lower degradation rates, and consequently lower degradation levels for the same stress times, at high frequencies. This is consistent with the increase of time‐to‐breakdown with stress frequency observed by other authors, and confirms that, also for dynamic stresses, the relation between degradation and breakdown is fundamental to understand the physics of these phenomena. The slower degradation rates confirm the improvement of oxide reliability under dynamic AC stress conditions.
A list‐processing‐oriented data flow machine architecture and its evaluation
Authors: Hasegawa Ryuzo , Mikami Hirohide , Amamiya Makoto 
Published: July 2007

AbstractThis paper describes some issues of parallel list processing under data flow control. Also a new type of list‐processing oriented data flow machine is presented which achieves pipelined processing among activated functions. Performance evaluation through software simulation gave the following conclusions.(1) This machine can utilize a high degree of parallelism even for simple programs due to the partial function‐body execution and lenient cons effects.(2) Parallel processing overhead does not affect the processing time.(3) Memory contention is reduced by dividing the structure memory into many banks and by uniformly distributing cons operations in each bank.
A high‐performance architecture for variable length instructions
Authors: Matsumoto Hidekazu , Bandoh Tadaaki , Hirasawa Kotaro , Kato Takeshi 
Published: July 2007

AbstractThis paper considers a high‐performance architecture for Variable Length Instructions (VLI) and its evaluation. The VLI studied here are characterized by a multioperand which can treat several independent operands, and orthogonality which can specify the operand address independently of the operation code. This architecture consists of the pipeline processing method suitable for multioperand instruction format, instruction/data separate‐type dual cache memory configuration to obtain memory throughput necessary for efficient operation of pipeline, and the operand location‐free microprogramming method with virtualized operand interface. The basic ideas of the pipeline processing method are the operand specifier (OSP) based pipeline processing which is realized by Inter‐OSP based pipeline processing and two simultaneously processing OSPs. From the mixed value analysis and the simulation result, it is clarified that this architecture makes it possible to improve the performance 1.8 times faster than without it. The additional hardware increase for this architecture is 33%.
A coding method of gray‐valued pictures using density contour lines
Authors: Nakajima Masayuki , Agui Takeshi , Takeda Masahiro 
Published: July 2007

AbstractFirst, the concept of density contour lines is introduced for gray‐valued pictures. Its application for pattern recognition has already been reported. However, in this paper it is considered for description and restoration of gray‐valued pictures via the extraction of density contour lines as well as for coding gray‐valued pictures by assigning priority to the density contour lines. Furthermore, a method for sequential restoration of pictures from general information is described.In this paper, sequential restoration from the main contour' lines and experimental restoration of gray‐valued pictures using only a part of the density contour lines are demonstrated. These results illustrate a new coding method of gray‐valued pictures which facilitates the coding of the high information content of original pictures by only about 20% of the contour lines. Finally, the effectivity of the present method is shown for the fast search of pictures.
A border‐following algorithm of three‐dimensional digitized binary pictures
Authors: Matsumoto Tetsuya , Toriwaki Jun‐Ichiro , Yokoi Shigeki , Fukumura Teruo 
Published: July 2007

AbstractThis paper proposes a border‐following method for three‐dimensional digitized pictures. The method is applied to actual data and the results are discussed. Then the proposed algorithm is applied to the analysis of pictures. Up to now, of the few researches and proposals concerning the border‐following algorithms for three‐dimensional binary pictures, that by Herman et al. has as its goal the display of a three‐dimensional picture. Here the pair of 0‐ and 1‐voxels is traced in a way which is an extension of the edge‐tracing in the border‐following for two‐dimensional pictures. However, in their method, the number of voxels to be traced becomes larger, compared with the method which traces only 1‐voxel. The connective relations among voxels are also difficult to extract in a direct way. The method proposed here adopts the procedure corresponding to the pixel‐tracing in the border‐following of two‐dimensional picrures, i.e., tracing of border‐voxels of value 1. The paper includes the border‐following algorithm applicable to any of 6‐, 18‐, and 26‐connected figures, together with the algorithm to reconstruct the original picture from the list of border voxels. These algorithms are compared with the algorithm by Herman et al. A method is also shown which can extract the surrounding relations among three‐dimensional figures during execution of the proposed algorithm.
Reduced‐gate design of totally self‐checking checkers for unordered codes
Authors: Izawa Nobuyoshi 
Published: July 2007

AbstractSelf‐checking logic has been proposed as a means of highly efficient fault‐detection in a logical circuit. As the checking circuit (checker), the design of a totally self‐checking checker (TSCC) has been investigated for various kinds of codes. The author has considered the unordered codes which include M‐out‐of‐N codes and Berger codes, and proposed a design method by the transformation, from the logical function with code‐disjoint (CD) derived based on the property of the unordered codes, to the logical function with self‐testing (ST) based on the design conditions of the entire codewords. This paper is based on the above transformation of a logical function, and presents a design method for the unordered codes TSCC with a reduced number of gates. In the proposed method, the absorption law for the logical function is applied to eliminate the redundant terms in the logical function with CD, and the function is transformed into the logical function with ST, utilizing a new condition defined for the codeword sets obtained by bi‐partitioning the code. It is shown that by this method, the number of gates is reduced in correspondence to the small strictness of the condition for ST. By extending the method, the number of gate levels is also reduced, leading to the design of 2‐ and 3‐level TSCC, which is conjectured as the minimum possible number of levels structure.
A graphical structure extracting method from an urban map using parallel vector tracers
Authors: Nakajima Masayuki , Agui Takeshi , Iituka Hisato 
Published: July 2007

AbstractWe have been studying computer processing of urban maps. As a first step of data processing of urban maps, we proposed an automatic extraction algorithm for built‐up areas using topological variances by pyramid structures. In this paper we propose an algorithm for extracting road information using parallel vector tracers as a second step.A graph structure extracting method for urban maps is introduced using parallel vector tracers and an analysis method for intersection structures. Results obtained from experiments applying the proposed method to real urban maps are given. From the experimental results it became clear that a search could be done correctly even for an intersection with eight edges. This method is efficient for extracting graph structures from various figures.
Network analysis by hierarchical tearing method
Authors: Asai Hideki , Mori Shinsaku 
Published: July 2007

AbstractDiakoptics is a kind of hybrid analysis. It has a problem wherein the calculation of the inverse of the admittance sparse submatrix for the subnetwork produces a non‐sparse impedance submatrix and the sparsity of the submatrix is not utilized effectively for a large‐scale network. From such a viewpoint, tearing methods have recently been proposed which consider the sparsity of sub‐matrices. In the methods proposed till now, however, a complex sparsity technique is required for the processing of submatrices, which is different from the tearing algoriithm. For these kinds of algorithms, the computational complexity is difficult to evaluate, and the optimal tearing based on evaluation has not been considered. This paper avoids the hybrid analysis and proposes a method of network analysis which provides a nonsingular hierarchical tearing of subnetworks so that the decomposed sub‐matrix is always of admittance type. As a result, the node conductance matrix is of a block diagonal structure with bordered block‐diagonal matrices as the blocks. By iterating the hierarchical tearing, each block is reduced further to the bordered block‐diagonal structure with denser sub‐matrices as blocks. By this method, the preprocessing of tearing and LU decomposition can be separated, making the sparsity technique of the submatrices unnecessary. Based on the evaluation of the computational complexity, almost optimal tearing can be performed.
An in‐betweening method of gray‐valued images using density contour lines
Authors: Agui Takeshi , Saito Minoru , Nakajima Masayuki 
Published: July 2007

AbstractSome studies have been made on the generation of in‐between images, by interpolating two different images. However, most of those methods consider the line figure or binary image, and there has been little study on in‐between gray‐valued images. This paper proposes a method of generating the in‐between gray‐valued image by interpolating the density contour lines extracted from the two gray‐valued images. The density contour line is defined as a boundary of a black area and a white area of a binary image, which is made from a gray‐valued image using a threshold. It is a description of the density distribution of the gray‐valued image by a binary line image. As an actual generation of the in‐between image from two gray‐valued images, an in‐between image was obtained for the rotating plaster statue.
Interframe tri‐level differential coding technique on narrow band transmission for video conference system
Authors: Tominaga Hideyoshi , Takeuchi Shohei , Kondo Hiroaki 
Published: July 2007

AbstractThis paper describes the “Interframe Tri‐Level Differential Coding Technique,” where two thresholds are prepared for interframe pixels. A differential trinary plane is constructed, and the information volume is suppressed by transmitting its boundary line information. The proposed coding technique incorporates a dynamic threshold setting algorithm and a coding algorithm for expressing the boundary line of the differential trinary plane by a tree structure. The simulation results are shown. Since this coding method smoothes the source information in capacity‐limited narrow‐band transmission line, its resolution worsens when the image is moving. However, accurate images soon are obtained when a still image is input. This method is suitable for a TV‐conference and a TV‐lecture integrated in the telematique service of 64 × N Kbps ISDN.
A bottom‐up parsing method for complete context‐free tree languages
Authors: Aoki Kyota , Matsuura Kazumi 
Published: July 2007

AbstractThis paper proposes a bottom‐up parsing method for complete context‐free tree grammar. The complete context‐free tree grammar is an extension both of one‐dimensional context‐free grammar and regular tree grammar. This parsing method is an extension of the parsing method of Cocke‐Kasami‐Younger for one‐dimensional context‐free languages, and is the base of an error‐correcting parser for complete context‐free languages. The parsing method is divided into two steps. In the first step, the structure of the parsing table is generated. In the next step the input tree is parsed using the structure of the parsing table and a complete context‐free tree grammar. Both time and space complexities of generating the structure of a parsing table are fourth order of the number of nodes of the input tree. Those in step two are fourth and third order of the number of nodes of the input tree, respectively. This parsing method includes the use of the right‐hand context‐free tree grammar as a special case. Here, both complexities decrease by one order. Also, both complexities are the same as those of a top‐down parsing method for right‐hand context‐free tree grammar. Finally, this paper shows implementation of the parsing method and experimental results.
Correction method for collimator effect of ECT
Authors: Iwata Satoshi , Yoshida Chiaki , Nakajima Masato , Ogawa Koichi , Yuta Shinichi 
Published: July 2007

AbstractOne of the factors in the deterioration of the reconstructed image of the single‐photon emission CT (SPECT) is the respective characteristics of the collimator used in the detection of the γ‐ray. The characteristics depend on the shape and material of the collimator, and produce shiftvariant blurs on the reconstructed image. This kind of error cannot be eliminated by the deconvolution, which regards the blur as shift‐invariant. This paper discusses the effect in the spatial frequency domain, and it is shown that the effect of the blur by collimator can be approximated analytically by a shift‐invariant blur on the annular ring determined for each frequency. A method of improving the quality of the reconstructed image is proposed utilizing this property. By the numerical simulation using a computer, it is verified that the proposed method is effective independently of the attenuation and quantization noise.
Photomask pattern data processing system of bit‐map method
Authors: Koide Hideki , Kim Choi , Shono Katsufusa 
Published: July 2007

AbstractThis paper describes the photomask pattern data processing system (MAPPS‐III) for MOS IC, using a general‐purpose microcomputer, MAPPS‐III is composed of figureinput and edit program, check program using design rules, logic extraction and simulation program, and conversion program into drawing format. Photomask patterns for layers are stored in the main memory as bit‐maps, and the major data processings are performed by bit operation, logic operation and counting. As a result, a systematic real‐time data processing of the photomask pattern is realized by a microcomputer. MAPPS‐III was developed for MOS IC with four photomasks, but it can be expanded to the process using a larger number of masks and to bipolar or CMOS IC.
Reconstruction of object on outdoor scene based on vanishing point
Authors: Nakatani Hiromasa , Kitahashi Tadahiro 
Published: July 2007

AbstractWhen we analyze outdoor scenes in which there are distant objects, their shape and spatial relations are distorted perspectively in two‐dimensional images. In this paper, we will discuss the reconstruction of three‐dimensional information such as shape and size of objects by exploiting the knowledge about perspective projection. We will present a process that reconstructs, the frontal view of a building from its perspective image as a practical application of the three‐dimensional shape reconstruction. We use the location of a vanishing point as a cue to calculate the distance of a point on a planar surface. In addition to that, we will show that we can determine the three‐dimensional shape of corners on the object plane by using the constraints imposed by vanishing points. That means we can do more than reconstruct a frontal view from a monocular image, although partially at this stage, we can analyze three‐dimensional structure of an object.
Detection of auditory evoked potentials in human sleep
Authors: Ueda Yoshikazu , Ishii Naohiro , Terashima Masayoshi 
Published: July 2007

AbstractDue to background noise and other factors, the biological signal is always accompanied by the fluctuations of signal amplitude and time. The waveform extraction problem in the biological signal is to estimate the signal in the fluctuations. This paper considers the signal extraction in the brain wave evoked by auditory stimulus during sleep, aiming at describing the relation between the evoked potential and the sleep stage. An adaptive averaging method is proposed which can extract the evoked potential in the fluctuations by a simple procedure, compared with the traditional averaging method and adaptive correlation filter. The effectiveness of the signal extraction by the proposed method was verified by simulation, and the method was applied to the evoked potential signal extraction in the actual brain wave during sleep. As a result, a quantitative relation was indicated between the evoked potential and the sleep stage.
A visibility—oriented construction system for logic diagrams
Authors: Hasegawa Takumi , Kadokura Toshio , Fukazawa Yoshiaki 
Published: July 2007

AbstractThe automation of each stage in the design and manufacture of computer systems is now being considered. The design language simulators, physical design systems and test systems are already in practical use. At present, however, the required verification of each stage is mostly performed manually. In consideration of this, the authors designed and developed an automatic system for constructing logic circuit diagrams (RADICS) aiming at easy manual verification and documentation. Seven criteria are specified for the visibility, which include the signal flow from input to output as well as the criteria adopted in the previous placement and routine system. This paper describes the aims and outlines of each algorithm in RADICS. The algorithms are then analyzed and evaluated.
Performance analysis of the acknowledging ethernet
Authors: Shen Zaiming , Muro Shojiro , Hasegawa Toshiharu 
Published: July 2007

AbstractA modified Ethernet designated “Acknowledging Ethernet,” which essentially provides higher reliability, was proposed by Tokoro et al. They evaluated its performance by means of simulation. In this paper, the performance of the Acknowledging Ethernet is analyzed theoretically. The average throughput, the average number of times of retransmission, and the average data packet transmission delay are approximately obtained. The accuracy of the approximation analysis is examined by comparison with the simulation results. It was found also that the performance of the Ethernet is only slightly degraded with the introduction of the acknowledging mechanism in the Acknowledging Ethernet.
Evaluation of the chromatin for cell images
Authors: Kondo Akira , Taniguchi Keiji 
Published: July 2007

AbstractThis paper describes a method of evaluating the difference in chromatin content of cervical cancer cells and normal cells by applying image processing techniques. Among the various methods for texture analysis, this paper adopts structural analysis to achieve high accuracy. The analysis procedure is as follows. (1) The location of chromatin is determined by extracting the pixel where the gray level is locally maximum. (2) The image is segmented by any of Volonoi neighborhood, area expansion by a difference direction, or directed tree. (3) Threshold processing is applied to the segmented subimages. (4) The size and gray level of the extracted areas are determined. A feature extraction experiment for the cell is perormed by the above procedure. From these results, the following observations are obtained. (i) The method of local maximum is useful in determining the chromatin location. (ii) The extraction can be improved by local thresholding. (iii) The mean, variance and mean gray level of the cell in the extracted chromatin area, as well as the mean and variance of the minimum distance among local maxima, are seen to be useful feature parameters in the discrimination of normal and malingnat chromatins.
Relaxation operators
Authors: Ejima Toshiaki , Kimura Masayuki 
Published: July 2007

AbstractThis paper discusses the correction (relaxation) operator in the stochastic relaxation model. The purpose is to arrive at a more useful relaxation operator by examining the relaxation process. Numerous studies have been made on the relaxation method in relation to the image processing and image interpretation. However, only a few studies have been made on the relaxation operator itself, which plays an important role in the relaxation method. This paper defines first the relaxation operator in general in the stochastic relaxation model. A concept is then introduced whereby the relaxation operator is adaptive, and the necessary and sufficient condition is shown for the operator to be adaptive. By constructing the actual relaxation operator satisfying the condition, it is shown that the relaxation operator proposed by Rosenfeld can also be derived as a special case of the operator satisfying the condition. The relaxation mechanism is described using the principle of spring force. Finally, using various kinds of adaptive relaxation operators, the evaluation experiment for the stochastic model is presented, arriving at the relaxation operator, which is more useful than those in the past.
A design approach to self‐checking processors
Authors: Nanya Takashi , Kawamura Toshiaki 
Published: July 2007

AbstractA self‐checking system in general denotes a logic system which has the fault‐detection function for concurrent faults in its own system. Especially, a self‐checking system is called strongly fault‐secure (SFS) if it continues to produce correct code words even though a fault occurs, until a noncode word is produced as the output. This paper proposes a new construction of the SFS processor considering the fault‐secure property and error propagation of the internal interfaces. The result of applying this concept to an SFS processor is described with an 8‐bit i8080 microprocessor considered as the target architecture. In this construction no part of the processor is duplicated and only four checking circuits are required for the whole processor. In terms of gates, the hardware complexity is increased by only 38% compared with the processor with the same architecture without SFS. It is theoretically shown that the processor is SFS against a single fixed fault of the gate output. It is also verified that the system is actually SFS for most unilateral multiple fixed faults.