bluuebunny/crossref_metadata_2025_split huggingface dataset:
Analysis of MOS SOI transistor degradation
Authors: Berland V. , Touboul A. , Flament O. 
Published: July 2007

AbstractThis study is related to the behaviour of hardened n‐MOS transistors (SOI‐SIMOX technology). These elementary components have been irradiated by X‐ray radiation after an electrical characterization. In addition to the electrical parameters such as the threshold voltage Vt, the transconductance gm and the leakage drain current Idfo, it appears interesting to observe the channel noise level shift before and after irradiation at different doses. The particular interest of this analysis is found in the behaviour of SOI‐SIMOX technology transistors.This approach, on the basis of LF excess noise measurements, is an efficient and sensitive tool to understand the radiation‐induced mechanisms. The major effects of ionizing radiation on MOS transistors are identified as the increase of the fixed oxide charge (ΔQot) and of the interface state density (ΔQit), both mechanisms stemming from ionizing effects in the thin gate oxide. Of course, these densities control the channel current fluctuations and then the channel noise current.
Degradation behaviour of highly coherent 1‐55 μm long‐cavity multiple quantum well DFB lasers
Authors: Fukuda Mitsuo , Kano Fumiyoshi , Kurosaki Takeshi , Yoshida Jun‐Ichi 
Published: July 2007

AbstractThis paper examines the degradation behaviour of spectral characteristics, such as spectral line‐width and FM response, in a 1·55 μm highly coherent multiple quantum well (MQW) DFB laser with a long‐cavity. The possibility of long‐life MQW DFB lasers for use in optical coherent transmission systems is demonstrated by clarifying the degradation behaviours.
Very high temperature test of InP‐based laser diodes
Authors: Tesauri Monica , Chiorboli Giovanni , Cova Paolo , Fantini Fausto , Magistrali Fabrizio , Sala Danila 
Published: July 2007

AbstractThe reliability of DHBC and DFB InGaAsP/InP lasers has been evaluated by means of high‐temperature operating life tests between 80 and 110°C. The main failure mechanisms have been related to the stability of the active layer, thus demonstrating the applicability of these high temperatures to the evaluation of InP‐based lasers.
On the Astm electromigration test structure applied to Al–1%Si/TiN/Ti bamboo metal lines
Authors: de Munari Ilaria , Vanzi Massimo , Scorzoni Andrea , Fantini Fausto 
Published: July 2007

AbstractThe applicability of NIST‐ASTM electromigration test patterns when used to test ‘bamboo’ metal lines is discussed. Wafer level tests on passivated and non‐passivated samples employing the Al–1%Si/TiN/Ti metallization scheme were performed. Straight metal lines 1000 μm long and 0·9 μm or 1·4 μm wide were tested at two different current densities. j = 3 MA cm2 and j = 4·5 MA/cm2, at constant stress temperature (T = 230·C). The failures mainly occurred in the end‐segment areas and hindered the evaluation of the electromigration resistance of the ‘bamboo’ test lines. In order to avoid this problems, completely different test patterns based on different approaches must be designed.
An automaton decomposition method for program structure simplification
Authors: Hirakawa Yutaka , Okada Keiji 
Published: July 2007

AbstractWe propose a method of decomposing an automaton which represents the flow of a program into simpler automata. More specifically, we: (1) introduce a new automata model called paired synchronized automata; (2) present a polynomial time algorithm for decomposing an automaton into paired synchronized automata; (3) show the correctness proof of the algorithm; and (A) give an experimental result on the effect of the decomposition algorithm for a certain application. In the proposed model of paired synchronized automata, each automaton contains a synchronization symbol to describe the action of sending a signal to and receiving it from another automaton, and for any external input, multiple transitions are prohibited. The paired synchronized automata produced by the proposed decomposition method are much simpler than the automata produced by the previous method, and they are easy to be translated in a program.
Performance evaluation for buffer‐contained disk units
Authors: Mitsuishi Akitoshi , Mizoguchi Tetsuo 
Published: July 2007

AbstractThe rotation delay of a disk caused by RPS‐miss, which is larger than what is usually assumed to be, is nonnegligible in. systems of heavy load. A method is proposed to cope with this delay by improving the response time and throughput: a buffer‐contained disk unit. Its performance evaluation is shown by simulation. The buffer‐contained disk unit has a small amount of buffer (some tens of kB). Data transmission between a buffer and a disk control unit and disk rotation occur asynchronously, which considerably reduces the delay time. In writing operation, the seek time is overlapped by data transmission time, and seek and rotation delay time appear to be zero. In simulation, an access pattern of real system is used which is obtained by tracing the disk input/output operation. Hence, the response and throughput are clearly improved by 1.7±3.8 times and by 2.0±3.3 times, respectively. The method can be applied to a large variety of disks with great performance improvement and little add‐on hardware.
Descriptive powers of synchronized shuffle grammars and synchronized production systems
Authors: Araki Toshiro , Uoi Hirotaka , Kosai Shoji , Tokura Nobuki 
Published: July 2007

AbstractAs models to describe the concurrent systems with synchronized mechanism, synchronized shuffle grammar and synchronized production system (SPS) have been proposed. The synchronized shuffle grammar is defined by the triplet composed of a shuffle grammar G, synchronizing language LC and a homeomorphism h. The language generated by is defined as L(G) = h (L(G) LC). As a subclass of the synchronized shuffle grammar, this paper considers a class syncRSG (sync ERSG), where G is an (extended) regular shuffle grammar and Lc is an arbitrary regular language. SPS can also be defined as a pair of extended context‐free grammar and a state‐transition machine. This paper considers as its subclass, the context‐free SPS which is a pair of a context‐free grammar and a finite automaton. It is shown that there exist some subclass.es in syncRSG (sync ERSG) and context‐free SPS, which generate the same class of formal languages. It is also shown that there exists a certain hierarchical relation, and the full descriptive powers of syncRSG (syncERSG) and context‐free SPS are the equivalent to that of Petri net.
A class of SEC‐DED‐SBED codes for semiconductor memory
Authors: Kaneda Shigeo 
Published: July 2007

AbstractThe SEC‐DED‐SbED code is capable of correcting a single‐bit eror, detecting a random double‐bit error and detecting a b‐bit block error. It is expected to be widely used for highly reliable semiconductor memory systems composed of memory devices with b‐bit output.In this paper a new theoretical construction method for SEC‐DED‐SbED codes is proposed. The proposed class of codes is so characterized that, with byte length b, it is constructed from conventional SEC‐DED‐SbED codes of byte length b/2 and the weight of the column vector of its parity check matrix H (the number of l's) is odd. The bit length n of the code is given as n _ b2(r‐b) . r/2Cb/2 bits, when the check bit length r and the byte length b are even. It has the longest bit length among the known code classes in a large range of byte lengths.
3‐D reconstruction of coronary artery from cine‐angiograms based on left ventricular model
Authors: Iwai Shinichi , Yachida Masahiko , Tsuji Saburo 
Published: July 2007

AbstractThere is an increasing demand for coronary angiography, corresponding to the recent increase of such ischemic cardiac diseases as myocardial infarction. At present, the obtained angiograms must be read by specialized doctors and require a large amount of time. Still it is usually difficult to arrive at a three‐dimensional understanding of the coronary artery. From such a point of view, this paper aims at the automatic analysis of the angiogram and describes a method which can determine the correspondence between vessels in the coronary artery angiograms taken along two directions. In the proposed system the three‐dimensional information is used in establishing the correspondence, which is difficult for human observers to utilize. As the first step, a straight line connecting a branch point of a vessel and the X‐ray source is considered and the projection of that line onto another image (called an epi‐polar line) is determined. Points close to that line are used as candidates for the correspondence. Then, using the vessels with established correspondences, a three‐dimensional model is constructed for determination of the correct candidates. Then a prohibited region in the three‐dimensional model is specified where there cannot exist a vessel. The vessels with established correspondence are represented in three dimensions and evaluation of the left ventricle is performed. From the results of experiment, the validity and the problems of the proposed system are pointed out.
A flexible structured multimicroprocessor using general‐purpose CPU chips
Authors: Taniguchi Tadakatsu 
Published: July 2007

AbstractThis paper discusses the design of a simple multimicroprocessor system to be built into the dedicated instrument, and also discusses the design for the system. The 8‐bit processor sometimes makes it difficult to realize the required function or necessitates a sophisticated technique or experience to realize the function. However, this paper demonstrates that there exist techniques that can easily be incorporated into the processor in the system to realize the required function and performance. The hardware discussed in this paper is flexible so that the result of functional analysis can be realized directly as the structure. The problems of parallel processing that will inevitably arise in this kind of approach are then solved by queue and synchronized registers. Hence, the hardware structure (number and connections of processors and memories) is determined according to the result of structured programming, and parallel processing programs are designed to be performed along the lines of the past single‐stream system. The performance of the system can be modified by modifying the number of processors and the hardware structure without completely changing the program, only by reassignment of the memory. From the practical viewpoint, 80‐type CPU (Intel 8085A), most widely used at present, is adopted. The result of experimental set‐up and simple application examples are shown.
Traffic flow measurement system using image processing
Authors: Kudo Yasuo 
Published: July 2007

AbstractThis paper discusses the traffic flow measurement system (TMS) based on the idea of vehicle cluster. TMS is an experimental system which aims at the accurate real‐time measurement of the traffic flow parameters (location of vehicle, speed, congestion, location of the queue tail, etc.) which is spread in space, using the image processing technique. As image processing techniques, the line‐differentiation and the clustering based on the idea of vehicle cluster are used. By this scheme, traffic flow phenomena in the region of measurement can be measured directly. By introducing the idea of vehicle cluster, the measurement can adaptively be performed, observing the individual vehicle in low traffic and a set of vehicles in heavy traffic. As a result of the traffic flow measurement experiment using the proposed system, the following observations are made: (1) the measurement can be performed throughout the day; (2) the real‐time measurement with 200‐ms intervals can be performed; (3) the recognition rate for vehicle cluster is 97 percent or more for the range of measurement 150 m. The accuracy of vehicle speed measurement is ±13 percent (for the range of measurement 40 m); (5) the accuracy of vehicle height measurement is within ±10 percent (for the range of measurement 100 m an when the observation of individual vehicles is possible); and (6) the tail of the queue can be identified.
Partial contour processing using curvature function‐assembly of jigsaw puzzle and recognition of moving figures
Authors: Nagura Kazuhiko , Sato Kenji , Maekawa Hitoshi , Morita Tatsuya , Fujii Katsuhiko 
Published: July 2007

AbstractThis paper proposes a method of partial contour processing by a curvature function and an adaptive integral filter. The filter parameter is determined by the length of the zero‐crossing segment of the curvature function both to enhance the concavo‐convex parts of the contour and to eliminate the quantization noise of the raw curvature function. Partial matching of contours is performed precisely and efficiently using the filtered curvature function. Three tasks were accomplished by the abovementioned method: assembly of a jigsaw puzzle, discrimination of overlapping and rotating figures, and tracking of a moving object which overlaps the background figures.
Direct estimation of 3‐d motion parameters from image sequence and depth
Authors: Yamamoto Masanobu 
Published: July 2007

AbstractThe methods to estimate the three‐dimensional motion parameters of a moving object from image sequence can roughly be divided into the two‐stage estimation based on the correspondence between the successive images and the direct estimation based on the time‐difference images. By applying the direct estimation method to the 3‐D motion, not only the motion information but also the 3‐D geometrical information can theoretically be acquired. It is difficult, however, to obtain a solution with a high accuracy, due to the nonlinearity of the computation and the assumption of small variation between successive images. The simplicity of the algorithm, which is the merit of the method, is also lost. From such a viewpoint, this paper first derives the linear equation and its solution for the direct estimation of the 3‐D motion parameters from the image sequence, by utilizing the depth information which is given by some range finder. Then the condition for the uniqueness of the solution of the equation is discussed. The necessary and sufficient condition is derived in geometrical terms for the image pattern to satisfy, so that the motion can be interpreted uniquely. The proposed method is applied to the actual image sequence, verifying that the 3‐D motion parameters can be estimated with a high accuracy.
Automatic drawing reader ‐ TOSGRAPH
Authors: Tsunekawa Shou , Shimotsuji Shigeyoshi 
Published: July 2007

AbstractA general‐purpose reader for circuit drawings (TOSGRAPH) has been developed. TOSGRAPH has the following features: (1) preprocessing is unified in a line segment tracking method and high speed and generality are realized by firmware control; (2) a drawing is described by a set of segments separated by feature points; (3) segments are grouped into candidate symbols by an estimation model; (4) symbols are recognized by matching with a model; (5) using hierarchical data (i.e., segment description ‐ thin line drawing ‐ original image), the feature measuring routines together with a blackboard system enhance the generality and processing speed; and (6) a flexible model is used to describe local geometric structure, connective relations and relative positional relations. A facsimile scanner is used for input and the image stored in the frame memory is processed. Experimental evaluation of symbol recognition results in a reject rate of 30/3972 (0.8%) and error rate of 22/3972 (0.6%). The processing time for the most common diagram of size A3 was approximately two minutes, confirming the pracical utility of the reader.
Automatic template selection technique for the local pattern matching method
Authors: Kashioka Seiji , Shima Yoshihiro , Ejiri Masakazu 
Published: July 2007

AbstractOne of the effective means of detecting the position of the object by image processing is by local pattern matching which uses only a part of the image as the template. It is required for the implementation of this method to select a unique part of the image to be used as the template. This paper discusses the automatic selection of a template. As the first step, the causes of mismatching are discussed, and the distribution of matching error between the template and local patterns extracted from the image is analyzed. Based on the result, an evaluation function is defined which represents the uniqueness in the selection of the template. Auxiliary evaluation functions are also defined for pre‐selection and reduction of computation time. These evaluation functions are both for determining the appropriateness of the template, and can be implemented on a simple dedicated circuit with practical processing time.
A digital signature scheme based on polynomial operations
Authors: Okamoto Tatsuaki , Shiraishi Akira 
Published: July 2007

AbstractThe RSA scheme is considered as one of the most promising as a digital signature, i.e., the signature for document for digital information. However, the method has a problem in that the processing speed is slow. A method by high‐speed hash function is proposed as a solution to this problem, but the improvement is not remarkable for brief documents. To solve this problem, this paper proposes a new high‐speed digital signature scheme based on a congruent polynomial of lower degree. In this scheme, large prime numbers p and q are used as the secret information and n = p2q is used as the public information. A random number is used in the generation of the signature, and an equality is used in the verification. It is shown that the security of the proposed scheme is of the same order as the difficulty of the prime factorization of n. The processing speed and transfer/retained information of the proposed scheme are evaluated, indicating that the processing speed for a brief document is more than 100 times the RSA scheme, and the method requires larger secret information to be retained than in RSA scheme.
An automatic visual inspection method for a plastic surface based on image partitioning and gray‐level histograms
Authors: Shima Yoshihiro , Kashioka Seiji , Kato Kanji , Ejiri Masakazu 
Published: July 2007

AbstractThe outlook examination in fabrication of plastic products in the past has been performed mainly by visual inspection. The automation of the procedure is now considered to be important. This paper discusses a simple automatic detection method for defects on the surface of plastic electronic components such as integrated circuits. As the first step, optical properties of the defect such as flaw, pin‐hole and bulge on the surface of the plastic components are discussed. This indicates problems in the detection of those defects. Then the illumination method using a planar light source is discussed to obtain a stable image against surface inclination. The procedure for practical detection of defects is developed in this paper as follows. First, to separate the image of the component surface from the background, the projection distribution of the gray‐level histograms is constructed. The boundary of the component surface is extracted based on the histogram. Then the surface image is partitioned into subareas. The gray‐level histogram is constructed for each partitioned subarea. Based on the maximum and the most‐frequent value of the gray‐level histogram, the existence or nonexistence of a defect in the subarea is determined. The experiment for the defect detection was performed using typical plastic components which are determined good or no‐good. It is demonstrated that a correct defect detection can be performed for all kinds of components.
Fast reconstruction algorithm for fan‐Beam CT system
Authors: Horiba Isao , Iwata Akira , Yamagishi Nobutoshi , Suzumura Nobuo 
Published: July 2007

AbstractThird generation CTs which acquire projection data using wide fan‐beam X‐rays that cover the cubic surface of the test object have two widely used tomogram reconstruction algorithms: i.e., the direct method and the arrangement method. The direct method applies fan‐like back projection directly in Cartesian coordinates. The arrangement method rearranges data to transform them into parallel fan beams. This paper proposes a new fast reconstruction algorithm in which polar coordinates are established that are spatially synchronous with the measurement geometry, reconstructed images are obtained by performing back projection in the polar coordinates and coordinate transformation is achieved from the polar coordinates to Cartesian coordinates. The features of this method are (1) computation is fast because the results of the many calculations are tabulated; (2) the remaining calculations are only product sums; and (3) it is easy to implement this method in hardware. The quality of images produced by the direct method is compared with that of the arrangement method and the present method using both computer simulation data and clinical data. The comparison shows that (1) spatial resolution of images produced by this method is better than that of the arrangement method, but almost equal to that of the direct method; and (2) the number of artifacts generated by calculations is small.
Representation and interpretation of overlapped line segments for automatic recognition of lsi cell drawings
Authors: Shimada Shigeru , Kakumoto Shigeru , Ejiri Masakazu 
Published: July 2007

AbstractOne of the important items in the automatic recognition of LSI cell drawings is the representation and interpretation of the overlapped part (overlap portion) composed of more than one line, different colors, or solid and dashed lines. This paper discussed first the representation of the overlap portion, and proposes a new representation method which has less ambiguity in the automatic interpretation of the overlap portion and makes the drawing easy for the designer. The algorithm is proposed which automatically interprets the overlap portion by this representation. The algorithm is composed of three parts: recognition of overlap symbol, search of the boundary of the overlap portion, and estimation of the overlapped paths. In particular, the estimation of the overlapped paths includes the rule‐type description for the major part and a heuristic method, which estimates the paths by adaptively enlarging the range of search. A program based on the proposed algorithm is combined into the cell‐drawing input device. The result of recognition for an actual cell drawing is presented.
A method for generating optimum decision tree for image retrieval
Authors: Yanagihara Yoshio , Tamura Shinichi , Tanaka Minoru 
Published: July 2007

AbstractFor retrieval of image databases there is a method in which image retrieval is based on similarity image input. This retrieval method uses the contents (features) of the input exhibition image as the key for retrieval. However, since much calculation time is required to process the images and to extract features from them, the increase in overall retrieval time poses a problem. Thus, a method is proposed which represents the process of image searching as a decision tree and executes retrieval on the tree. This is an efficient method for reducing the retrieval time since the number of features used for classification therein is small on the average. It also has the merit of decreasing retrieval errors by deleting nodes on which there are many retrieval errors with new nodes with fewer errors. In this paper we consider decision trees for similarity image retrieval, attempt to construct an appropriate decision tree which has a shorter retrieval time and which produces fewer retrieval errors from two given inputs [(1) a set of similarity errors used for retrieval and (2) the retrieval object set of an image database] and perform classification (retrieval) experiments.