bluuebunny/crossref_metadata_2025_split huggingface dataset:
A comparison of deterministic and statistical sampling techniques for quality analysis of integrated circuits
Authors: Ilumoka A. A. 
Published: July 2007

AbstractThere has been a great amount of publicity aboutTaguchimethods which employ deterministic sampling techniques for robust design. Also given wide exposition in the literature istolerance designwhich achieves similar objectives but employs random sampling techniques. The question arises as to which approach—random or deterministic—is more suitable for robust design of integrated circuits. Robust design is a two‐step process and quality analysis—the first step—involves the estimation of ‘quality factors’, which measure the effect of noise on the quality of system performance. This paper concentrates on the quality analysis of integrated circuits. A comparison is made between the deterministic sampling technique based on Taguchi's orthogonal arrays and the random sampling technique based on the Monte Carlo method, the objective being to determine which of the two gives more reliable (i.e. more consistent) estimates of quality factors. Results obtained indicated that theMonte Carlo method gave estimates of quality which were at least 40 per cent more consistent than orthogonal arrays.Theaccuracy of prediction of quality by Taguchi's orthogonal arrays is strongly affected by the choice of parameter quantization levels—a disadvantage—since there is a very large number (theoretically infinite) of choices of quantization levels for each parameter of an integrated circuit. The cost of the Monte Carlo method is independent of the dimensionality (number of designable parameters), being governed only by the confidence levels required for quality factors, whereas the size of orthogonal array required for a given problem is partly dependent on the number of circuit parameters. Two integrated circuits—a 7‐parameter CMOS voltage reference and a 20‐parameter bipolar operational amplifier—were employed in the investigation. Quality factors of interest included performancevariability, acceptability(relative to customer specifications) and deviation from target.
A study of a storage reliability estimation problem
Authors: Zhao M. , Xie M. , Zhang Y. T. 
Published: July 2007

AbstractStorage reliability, which describes the failure or deterioration of items in a dormant state, is considered in this paper. The study presented here is focused on the estimation of the storage reliability after a certain amount of storage time. We start with simple non‐parametric estimation of the current reliability and then study the problem of parametric estimation based on a simple Weibull distribution assumption. Both maximum likelihood estimation and graphical techniques are considered in this case. The study is useful for planning a storage environment and making a decision about the maximum length of storage. Furthermore, the information can be used in the design and improvement of products for which the storage is an important part of the product's life cycle. A numerical example is provided to enlighten the idea.
Evaluation of the hot‐carrier‐induced offset voltage of differential pairs in analogue CMOS circuits
Authors: Thewes Roland , Kivi Michael J. , Goser Karl F. , Weber Werner 
Published: July 2007

AbstractUsing a specifically developed measurement set‐up and a test structure typical for analogue applications, high precision measurements of the stress‐induced offset voltage degradation of differential pairs are presented. Extrapolation to operating conditions yields valuable information for analogue design in the sub‐micron CMOS regime.
Reconstruction of tomographic images from projections of a small number of views via mathematical programming
Authors: Kobayashi Fujio , Yamaguchi Shoichiro 
Published: July 2007

AbstractThe X‐ray CT devices presently in wide use reconstruct the tomogram of the transversal cross section of the human body. However, it often happens in the diagnosis that a longitudinal or arbitrary cross section is required. To determine the arbitrary cross section directly, it is necessary to develop an algorithm which can reconstruct the tomogram from the projection data along restricted directions. This paper presents a basic discussion for the reconstruction by mathematical programming, where the general tomogram is to be reconstructed from the projection data of a few number of views without imposing the condition of circular symmetry or periodicity. A system of linear equations is formulated from the X‐ray projections of a few number of views considering the virtual pixels passed by the X‐ray beam. Then the tomogram is reconstructed by determining the optimal solution minimizing the sum of absolute values of residual or square residuals by linear programming or by quadratic programming. By such a mathematical programming, an accurate solution is obtained by a relatively simple computation procedure and by a finite number of iterations. The relation between the number of pixels and the iterations to reach the convergence is examined. Using the model, the usefulness of the method is verified by computer simulation. The effects of the noise in the projection data and the resolution of the X‐ray detector on the reconstructed image are also examined by the simulation.
Algorithms of magnifying/reducing, rotation and border following using segmented block code
Authors: Okamoto Masayuki , Takahashi Nobuo , Kawata Kouichi 
Published: July 2007

AbstractThis paper describes algorithms of magnifying/reducing, rotation, and border following for binary document images by using a segmented block code. Document images such as facsimile images are composed of a large number of binary data. Thus it is difficult for a small‐sized conventional computer to process efficiently a whole document image in a pixel‐by‐pixel manner. Our algorithms described herein use segmented block coded data instead of pixel data. In the segmented block coding scheme, blocks which are two‐dimensional contiguous black pixel areas are extracted and coded by their locations and shapes. Since this coding scheme compresses the amount of data required to process and produce the data form which is suitable to deal with by conventional computer, our algorithms using this coded data work efficiently. Also, there is another advantage in that the results of magnifying/reducing or rotation of images are obtained in the form of a segmented block code. This means that we can manage document images in a unified manner.
English cai: A user—initiative cai system with machine translation techniques
Authors: Kudo Ikuo , Chung Moonkyung , Nonmembers Hideya Koshino, 
Published: July 2007

AbstractThis paper describes a construction of a new CAI model for language education employing a machine translation system. The model includes the machine translation and the error correction mechanisms. By the machine translation mechanism, the system can receive the input from the student and return the translation or instruct the syntax. When an incorrect sentence is given from the student, the machine utilizes the error‐correction mechanism to analyze the sentence and instruct how the error is produced. The curriculum for the CAI system is placed outside the system as a dedicated text, and the user is free to choose the test. Based on such a model, the authors have developed a CAI system (English CAI) to teach English to the junior high school student. The system is actually operated in an educational situation. A field test is demonstrated in which the mechanisms for machine translation and error‐correction functioned effectively as a means to answer questions, providing a good assistance to learning.
Spotting Phonemes and Syllables for Continuous Speech Recognition Using Time‐Delay Neural Networks
Authors: Sawai Hidefumi , Miyatake Masanori , Nonmember Alex Waibel, , Shikano Kiyohiro 
Published: July 2007

AbstractPhoneme or syllable spotting if reliably achieved provides a good solution to the spoken word and/or continuous speech recognition problem. We would like to extend the encouraging performance of TDNN to word/continuous speech recognition. We show techniques for spotting Japanese phonemes/CV‐syllables in input speech based on TDNNs. We constructed the TDNN which can discriminate a single phoneme or CV‐syllable. Phoneme and syllable spotting experiments show excellent results, including phoneme and syllable spotting rates of 92 percent and 96.7 percent, respectively. These spotting techniques are proved to be a step toward continuous speech recognition.
A behavioral model of cracks and its applications to cg
Authors: Chiba Norishige , Wada Seiichi , Kaino Keimei , Muraoka Kazunobu 
Published: July 2007

AbstractCracks produced by drying mud‐like materials exhibit various patterns of form (including the crack patterns that occur on plate glass and on the ground) according to the stickiness of the materials. It is very interesting and important to develop a behavioral model of cracks, which produces realistic crack patterns, from not only a theoretical but a practical view, e.g., realistic image synthesis in CG.In this paper, we first analyze the typical two crack patterns produced in different materials, one of which is only slightly sticky and the other is very sticky. We then show some basic assumptions useful for constructing a behavioral model of cracks.Next, we present the behavioral model having one parameter of stickiness; and presenting several simulated crack patterns, we show that the constructed model is effective for visual simulation of crack patterns.We then present CG images, synthesized by employing texture mapping techniques, of marble objects, china teacups, and a china vase, all of which have many cracks on their surfaces. Finally, we discuss further improvements for extending the model to one which works on any curved surface and produces more realistic crack patterns according to the shapes of the surfaces.
Coarse grain parallelism detection scheme of a fortran program
Authors: Honda Hiroki , Kasahara Hironori 
Published: July 2007

AbstractThis paper proposes a scheme for the automatic detection of parallelism among coarse grain tasks (macrotasks) in a Fortran program. In this scheme parallelism is represented as the EXECUTION START CONDITION for each macrotask in a program. This condition is represented by a logical expression that states when, in relation to other macrotasks, the execution of a certain macrotask can be started. This representation aids in scheduling a set of macrotasks onto processors.To construct such an expression, a novel concept calledco‐control dependenceis introduced. Analyzing co‐control dependence together with control dependence and data dependences among macrotasks, the scheme detects and describes successfully the parallelism among all macrotasks in a program.
Position‐measuring method using omnidirectional image sensor with conic mirror
Authors: Yagi Yasushi , Kawato Shinjiro 
Published: July 2007

AbstractIntensive work has already been done on vision‐based navigation of autonomous mobile robots. This paper proposes a new omnidirectional image sensor COPIS (COnic Projection Image Sensor) for guiding navigation of a mobile robot.In addition, a conic projection image sensor (COPIS) is described along with its application to estimate locations of static objects relative to the robot. The COPIS system acquires an omnidirectional view around the robot in real‐time by using a conic mirror. Its feature is passive sensing of the omnidirectional environment in real‐time using a conic mirror. Because the conic mirror is used, its image is under conic projection. Here, the azimuth of each point in the scene appears in the image as its direction from the image center.Under the assumption of constant motion of the robot, locations of objects around the robot can be estimated by detecting their azimuth changes in the omnidirectional image. Using this method, the robot generates an environmental map of an indoor scene while it is moving in the environment.
Backprojection with fourier series expansion and FFT
Authors: Makoto  , Yamamoto Hiroshi , Ueda Mitsuhiro 
Published: July 2007

AbstractThe filtered backprojection (FBP) method has recently been used for almost all the practical CT scanners because of its simple principle and high accuracy in reconstruction of images. However, it is difficult to use this method for some applications such as a real time display in which images are adjusted during displaying images, since a backprojection of the FBP method requires a very large amount of computation.This paper introduces a method of backprojection in which the projection data compensated by a filter are expanded using Fourier series, and the sum of the series is evaluated by a high‐speed synthesis algorithm of complex exponential using Gaussian functions and the fast Fourier transform (FFT) method. The theory is explained based on a conventional FBP method; then the usefulness of the proposed method is demonstrated. The results show that the proposed method can realize interpolations with various frequency characteristics requiring about one‐sixth the amount of computation compared with a conventional backprojection using a linear interpolation.
Acquiring omnidirectional range information
Authors: Ishiguro Hiroshi , Yamamoto Masashi , Tsuji Saburo 
Published: July 2007

AbstractThis paper describes a method of obtaining a precise omnidirectional view and coarse ranges to objects by rotating a single camera. The omnidirectional view is obtained by arranging image data taken through a vertical slit on the image plane while the camera rotates around the vertical axis. The omnidirectional view contains precise azimuth information determined by the resolution of the camera rotation. The range is obtained from two omnidirectional images taken through two slits when the camera moves along a circular path. This range estimate contains errors due to a finite resolution of the camera rotation system, while a conventional binocular stereo method contains errors due to quantization of images. The representation of an environment, “panoramic representation,” by the omnidirectional view and range information is useful for a vision sensor of a mobile robot.
Design of an ultrahigher‐valued biocomputing system based on set‐valued logic networks
Authors: Aoki Takafumi , Kameyama Michitaka , Higuchi Tatsuo 
Published: July 2007

AbstractIf multiple‐valued digital systems can be extended to higher‐valued digital systems, potential advantages of high information density and efficient multiple‐valued hardware algorithms will be utilized.This paper presents set‐valued logic networks based on biodevices to construct ultrahigher‐valued digital systems. The biodevices detect specific substrate molecules in solution using specificity enzymes and broadcast specific molecules to perform computation.To design biodevice networks systematically, the concept of set‐valued logic is developed in which molecular information is considered a set of logic values characterized by varieties of molecules. The set‐valued logic enables 2r‐valued computation to be achieved usingrkinds of substrate molecules. It is shown that arbitrary set‐valued logic functions can be realized by highly parallel and very regular biodevice networks. Consequently, an approach to a parallel computing system without the restriction of interconnection problems is presented.
Headreader: Realtime motion detection of human head from image sequence
Authors: Mase Kenji , Watanabe Yasuhiko , Suenaga Yasuhito 
Published: July 2007

AbstractHuman motion plays a very important role in daily communication. If computers can directly read the meaning of human motion, man‐machine interaction will be improved. This paper presents a three‐dimensional head motion detection system called “headreader.” A simple but very fast algorithm is used which exploits the contrast of hair and face to recognize face orientation. The system extracts the head and face area and then estimates the head motion parameters from the change in position of each area centroids. The head motion is computed at nearly seven frames per second on an SUN4 workstation.
Data model generation in image database systems
Authors: Sakauchi Masao , Satoh Shin'ichi 
Published: July 2007

AbstractThere has been increased interest in the development of a next‐generation image database with advanced capabilities suitable for use with a variety of practical applications and also for modeling mixed image data. The important aspects of such an image database are discussed, and a new method for model generation is described, emphasizing automatic model acquisition. First, the method for specifying the data model and the corresponding method for entering the image recognition capabilities are integrated into a procedure called DataBase Vision. Next, a framework is proposed for the generation of an adaptive image recognition data model procedure. This procedure generates the data model structure in a stepwise manner with increasing complexity by adaptively combining image recognition from image subobject level recognition. In addition to this framework, two model generation examples are given: the first example treats object recognition levels as states within a bottom‐up/top‐down state‐transition model abstraction, and the other is an auxiliary image recognition tool used in conjunction with the data models for an existing database application. The techniques presented should provide insight into data model generation within an image database.
Three‐dimensional helical‐scan computed tomography using cone‐beam projections
Authors: Kudo Hiroyuki , Saito Tsuneo 
Published: July 2007

AbstractIn this paper, we propose an image reconstruction method and computed tomography (CT) equipment with high resolving power that generates three‐dimensional CT images at a high speed. In the proposed method, an X‐ray source that irradiates conical X‐rays and a two‐dimensional detector which consists of fan‐beam detector arrays stacked in the direction of the object's axis rotate continuously at the same time the bed carrying the object translates in the visual field. This method is called a helical scan because the object is fixed and the X‐rays move on a helix and the same measurement data are obtained. We have previously proposed a scanning method in which the X‐ray source moves on a helix [4, 6]. However, the physical implementation of the previous proposal was difficult because it was assumed that the X‐ray beam completely covers the object. In this paper, in order to solve this problem, the implementation of a helical scan is based on a practical model that combines continuous rotation of an X‐ray source and a two‐dimensional detector and translation of the object. We derive an approximate reconstruction method based on the convolution/back‐projection method for fan‐beam projections. We also perform simulation tests based on a model of the human head and demonstrate the effectiveness of the proposed method.
Fundamental properties of multivalued kleenean functions
Authors: Takagi Noboru , Mukaidono Masao 
Published: July 2007

AbstractIn the real world, there are many propositions which cannot be determined to be true or false. In order to treat such propositions, multivalued logic systems which are permitted to take more than true (1) or false (0) values have been developed. In this paper, we will describe fundamental properties of multivalued Kleenean functions, which are effective for treating ambiguity. First, we will introduce a partial order relation into the set of truth values {0, 1/(m‐ 1), …, (m‐ 2)/(m‐ 1), 1}. It will be shown that any multivalued Kleenean function is monotone for this partial order relation. Next, it will be shown that any multivalued Kleenean function can be determined uniquely for inputs {0, 1/2, 1} only. Finally, we will describe P‐type logic functions for multivalued Kleenean functions which are capable of correcting input failures.
A method of landmark tracking for an autonomous vehicle
Authors: Chamnongthai Kosin , Ozawa Shinji 
Published: July 2007

AbstractAn autonomous vehicle to carry parts, etc., in an industrial plant must run on an orbit composed of straight lines and curves, all the while determining its positions.This paper considers the case where the orbit is constructed using landmarks which are relatively easy to recognize in determining the run distance. Also, an autonomous vehicle system is developed which selects one of the landmarks to note and navigates on the orbit toward the object point.In the autonomous vehicle based on the image processing, if there exists an error due to the quantization of the image, the orbit may not be determined accurately. A case may also exist where the vehicle goes out of the orbit due to an external disturbance such as a slip.This paper also proposes a method which accurately determines the orbit for the vehicle and guides the run of the vehicle smoothly. In the proposed method, the range of the error in the image quantization is utilized positively and the object point is determined on the image with the accuracy of 0.5 pixel to determine the orbit on which to approach the next object point.As the vehicle runs, the locus of the object point on the image is predicted based on the determined orbit; and the result is compared to the actual locus on the image. By this comparison, the orbit is corrected for each frame when the vehicle goes out of the orbit. In addition, when there exists an obstacle, the method is applied to guide the run so that the vehicle avoids the obstacle. The usefulness of the method is demonstrated by the result of an experiment.
High Status Immigrants: A Statistical Profile of Iranians in the United States
Authors: Bozorgmehr Mehdi , Sabagh Georges 
Published: July 2007

Iranians constitute one of the most numerous new immigrant groups from the Middle East, and one of the highest status foreign-born groups in the United States. Yet there are few published studies documenting their immigration to the United States, and their characteristics. An understanding of different aspects of Iranian adaptation to the United States requires a basic knowledge of their immigration history, and demographic, social and economic characteristics.This paper presents the first systematic and comprehensive profile of Iranians in the U.S. based on the most recent available statistical data. The sources for this analysis are: (1) all available published reports from the Immigration and Naturalization Service (INS) and from the 1980 U.S. Census; (2) INS data tapes on Iranian immigrants admitted to the U.S.from 1972 to 1986; and (3) the 5 percent sample tape from the 1980 U.S. Census of population.
Invisible Occidentalism: Eighteenth-Century Indo-Persian Constructions of the West
Authors: Cole Juan R. I. 
Published: July 2007

Kublai Khan does not necessarily believe everything Marco Polo says when he describes the cities visited on his expeditions, but the emperor of the Tartars does continue listening to the young Venetian with greater attention and curiosity than he shows any other messenger or explorer of his. In the lives of emperors there is a moment which follows pride in the boundless extension of the territories we have conquered, and the melancholy and relief of knowing we shall soon give up any thought of knowing and understanding them.—Italo Calvino, Invisible CitiesMarco Polo's encounter with Kublai Khan, which Italo Calvino made the framework for his exploration of the fantastic in urban life, stands as a useful parable for the nature of the interaction of West and East in the period between 1200 and 1700, when myriads of Europeans produced journals and accounts of their journeys into the rest of the world.