bluuebunny/crossref_metadata_2025_split huggingface dataset:
A hardware algorithm for computing sine and cosine using redundant binary representation
Authors: Takagi Naofumi , Asada Tohru , Yajima Shuzo 
Published: July 2007

AbstractA hardware algorithm for computing sine and cosine using redundant binary representation for internal computations is proposed. This paper considers the computation of sine and cosine of angle tH (0; 4) (rad). Our hardware algorithm is a modification of the CORDIC method, and considers gradual rotation of a point on plane orthogonal coordinates about the origin. Sinecosine are calculated by iteratively computing coordinates of the point. The sequences of numbers representing X‐ and Y‐coordinates of the point rotated and the remaining angle of rotation are expressed by a redundant binary representation, where each digit of number is an element of {‐1, 0, 1}. The direction of rotation at each step is determined based on the upper 3 digits of the remaining angle, and all the internal computations are done in the redundant binary number system. Since parallel addition and subtraction of two numbers by a combinational circuit can be done in a fixed time regardless of the number of digits in the redundant binary number system, the computation for one step can be done in a fixed time. Following this algorithm, n‐bit computation of sine‐cosine by a combinational circuit can be done in the computation time proportional to n and with the number of elements proportional to n2. Since the computation time proportional to at least n log n is required in the existing hardware algorithm based on the CORDIC method, our algorithm is more advantageous as the bit length increases. Moreover, faster computation can be done with about the same number of elements for practical bit lengths.
Pixel‐selected ray‐tracing
Authors: Akimoto Takaaki , Mase Kenji 
Published: July 2007

AbstractRay‐tracing is a very powerful method of generating realistic synthetic images. However, the conventional ray‐tracing technique requires complicated computation for each pixel in the image and a long processing time. Advantage is taken of the similarity among neighboring pixels, and ray‐tracing is executed only to certain selected pixels while using interpolation to determine the value of other pixels. A pixel‐selected ray‐tracing algorithm is proposed. This paper presents first a description of the pixel‐selected ray‐tracing concept/algorithm. Then methods of determining whether a pixel value should be calculated by ray‐tracing or by interpolation are discussed. Experiments were conducted to compare the proposed method with the standard ray‐tracing method. Experimental results indicated that the proposed method required only 20 to 63 percent of the computation time of the standard method, while rendering a comparable level of image quality.
Computer‐aided nonlinear system design and simulation
Authors: Ito Motoaki , Ishii Naohiro , Sakuranaga Masanori 
Published: July 2007

AbstractTo explain a phenomenon in a nonlinear system and to find its function, a useful method is to construct the nonlinear system in a dialogue form with a computer and to obtain its characteristics. This paper introduces the software commands to design a nonlinear system by using a dialogue form with a computer, and the method of a simulation of the subsystem constructed. The procedure of the specifications of the design of the nonlinear system is as follows: a block‐line diagram consisting of a linear system and nonlinear subsystems is constructed for the subsystems within the system, and the simulation is carried out based on this diagram. A simulation‐system command, simulation‐execution command, and supporting commands were developed for the dialogue‐type commands required for the design. Then if a subsystem is linear, its input response is specified by the z‐transformation equation; and if a subsystem is nonlinear, this is specified by the form of a polynomial of the input variables of the system. Three types of combination of the subsystems within the whole system were discussed: the series connection, parallel connection, and feedback connection. A white noise was fed into the input of the system constructed, and the first‐ and second‐order Wiener kernels, which were obtained as the Wiener‐functional and showed the characteristic of the system, were shown.
On high‐speed parallel algorithms using redundant coding
Authors: Yasuura Hiroto , Takagi Naofumi , Yajima Shuzo 
Published: July 2007

AbstractWe introduce a concept of local computability for designing high‐speed parallel algorithms on fan‐in restricted models. A function is k‐locally computable if each subfunction sepends on only at most k input variables. If k is a constant independent of n, the number of input variables, we can construct an O(1) time parallel algorithm for F on a fan‐in restricted computation model. In order to realize the local computability, we use a redundant coding scheme. We show that a binary operation of any finite Abelian group is k‐locally computable under a redundant coding scheme, where k is a constant independent of the order of the group. We also show that we can design a redundant coding scheme for a residue ring Zm of integers under which addition and multiplication can be performed in O(1) and O(log log log m) time, respectively, in parallel, when m is the product of the smallest r primes.
A method of compressing the data amount of position information of logical diagrams by the arrangement process in the fair—copy reproducing system
Authors: Minoh Michihiko , Araki Makoto , Sakai Toshiyuki 
Published: July 2007

AbstractThis paper presents a system FACORES, which recognizes, interprets and makes a fair copy of handwritten logical diagrams. In particular, the arrangement process and the compression of position information are discussed. The logical diagram is composed of graphical symbols, connecting lines and character strings, and describes the connecting relations among those elements. Consequently, the positions of those elements in the diagram are not very important. In the case of a handwritten diagram, it is difficult to write the elements arranged in positions. The authors propose a simple arrangement of the elements in the input diagram as a fair‐copy reproduction of the handwritten diagram. In the arrangement process, the intersection, corner and end points of lines are regarded as symbols, in the same way as the graphical symbols. The class ID and the priority in the arrangement are determined based on the connecting relations. Based on such information, the arrangement is made by successively placing the symbols. It was verified by experiment that the result of fair copy reproduction is satisfactory and the data concerning the position can be compressed approximately to half.
Distributed algorithms for fault diagnosis of processors
Authors: Masuzawa Toshimitsu , Hagihara Ken'Ichi , Tokura Nobuki 
Published: July 2007

AbstractThis paper considers distributed algorithms for solving the problem πp to test whether for any processor in a network, any one of the adjacent processors is faulty. First, we show that it is not solvable when processors are asynchronous or when there is no upper limit in the transmission delay along the link. Next, we define a network (PL‐synchronized network) which assumes a certain kind of synchronicity in processors and their communication. Whether or not πp is solvable in a PL‐synchronized network depends on knowledge of the network topology (for example, identifiers of adjacent processors, the number of processors in a network, and edge connectivitiy of a network) initially available at each processor. This paper examines how the knowledge available at each processor affects the conditions that πp is solvable (situation of faults of processors and links in the overall network).
Determining optical flow from sequential images
Authors: Koga Kazutoshi , Miike Hidetoshi 
Published: July 2007

AbstractAn exact method determining the optical flow is presented by means of pixel‐based mutual‐correlation analysis of dynamic images. The mutual‐correlation function is calculated between the temporal brightness change of the target pixel and that of its neighboring 16 (or 8) pixels. The local velocity of the target pixel is determined exactly through logical considerations using a reliable lag time estimated by the quadratic interpolation technique. The validity of the proposed method is confirmed by computer simulation of various dynamic images.
Fault—tolerant k—out—of—n logic unit networks
Authors: Fujiwara Eiji , Matsuoka Kohji 
Published: July 2007

AbstractFor the automatic repair of a fault in the on‐line system, and for yield improvement in LSI fabrication, a system structure must be developed where spare parts are provided and used whenever necessary. This paper considers the general logical network, which is composed of such units as gate and memory. It proposes a new switching and connection structure in order to mask the effect of faults. Thek‐out‐of‐nunit group (called a block) is operated withkunits (k≤n) being used in the normal operation and the remaining (k‐n) units being used as spares. Thenswitching units, instead of thektraditional switching units cover the faults in the switching units. Assuming this structure, a connection which theoretically minimizes the number of connections between thek‐out‐ofnand thek‐out‐of‐mblocks (m, n≥k) is described, presenting a redundant construction which improves the reliability, with minimum redundancy. The proposed construction is applied to the yield improvement of the large‐sized LSI chips, and it is shown that the method can improve the yield to any value by increasing the number of blocks, and can realize a flexible and an easy design in the redundancy structure.
Auditory compensation effects in symmetrical three‐vowel sequences and a model of perceptual phoneme boundary
Authors: Ohtomo Teruhiko , Yasuda Susumu , Ohuchi Takao , Hara Ken'Ichi 
Published: July 2007

AbstractTo recognize the continuous speech by phonemes, the coarticulation must be analyzed. This paper presents a result of psy‐choacoustic experiment for symmetrical three‐vowel sequences, which are generated by the terminal‐analog‐type speech synthesizer, indicating the auditory compensation effects in coarticulation on the phoneme perception. Using each of five Japanese vowels as a reference vowel V0, the symmetrical three‐vowel sequences, /V0‐VV0/ are formed. The distribution of the perceptual phoneme for the middle vowel is examined first. By comparing the results with the perceptual phoneme distribution for five stationary vowels, the shift of the perceptual phoneme distribution due to the auditory compensation effect is investigated. A model is proposed for the boundary shift in the perceptual phoneme distribution. In the model, the 50‐percent phoneme boundary of the perceptual phoneme distribution for five stationary vowels is approximated by straight lines on the F1 ‐ F2 logarithmic plane. The straight lines are contracted in the direction of (F1, F2) point of the reference vowel along the F1 and F2 axis. The proposed model is applied to the perceptual phoneme distributions of the middle vowels in the symmetrical three‐vowel sequences, and its usefulness is demonstrated.
Evaluation of a retrieval system using content addressable memory
Authors: Hashizume Masaki , Yamamoto Hirosuke , Tamesada Takeomi , Hanibuti Toshiaki 
Published: July 2007

AbstractBecause of the improvements in LSI technology, larger‐scale CAM's can now be developed at low cost. However, as the amount of data to be handled becomes larger, storing the totality of the data to be searched in CAM's ceases to be cost‐effective. A practical solution is to store the data in other storage devices and partition the full data set into blocks for transfer into the CAM. In such a hierarchical memory system there will occur data transfer bottlenecks and overhead for operations other than searching; furthermore, it is not known what search speed is achievable. In this paper, we therefore make model of such a CAM‐based memory system in order to determine the data transfer overhead, evaluate system performance, and investigate ways of reducing search time. It is concluded that: (1) data transfer time can be reduced more effectively by using a large‐capacity bus or by rapid data access than by using a large, high‐speed CAM; (2) there exists an optimum CAM size and configuration for rapid search; (3) the speed of the control mechanism that transfers the data blocks into the CAM is not critical to system performance.
Successive environment perception using spatial matching by a mobile robot
Authors: Zheng Jiang Yu , Tsuji Saburo 
Published: July 2007

AbstractImportant themes in research of autonomous mobile robots are recognition of environment and navigation planning. This paper describes the vision system of a mobile robot for recognizing the indoor environment. Line segments in the environment are found and their three‐dimensional (3‐D) positions are determined by using a binocular stereo method and a motion stereo method. It is difficult to acquire complete 3‐D information by a single observation from a point in space. Consequently, a series of observations is made at different points and, by combining the results, the 3‐D world model is updated successively. The indoor navigation of the robot is made by iterating the cooperative motion and observation. Correspondences of line segments among the observed images are established by using a competition matrix based on the similarity of segments. Based on the obtained incomplete 3‐D world model, the image viewed at the next point is predicted which makes the correspondence easier. In addition, the accurate motion of the robot is estimated, guided by the prediction of the image.
Design of a Highly Parallel Ultrahigher‐Valued Logic Network Based on a Bio‐Device Model
Authors: Kameyama Michitaka , Member Takafumi Aoki Associate , Member Tatsuo Higuchi 
Published: July 2007

AbstractIf the multiple‐valued digital system can be extended to an ultrahigher‐valued digital system, the potential advantages of high information density and simple hardware algorithms by direct multiple‐valued coding of the processed data will be obtained. This paper presents a highly parallel ultra‐higher‐valued logic network composed of bio‐devices based on specificity of enzymes, i.e., the high‐level, multiple‐valued discrimination function. First, the multiple‐valued coding of varieties of organic molecules is presented, regarding the molecules as logic values. Then, basic bio‐devices are defined which can switch the molecular logic values. It is shown that any multiple‐valued logic function can be constructed in two‐stage structure by the proposed bio‐devices. Finally, the systematic synthesis method of the network is presented aiming at the minimization of the network. Since one of the most distinctive features of the proposed system is that there is no physical order relation among the logic values, the simplification of logic networks without a constraint due to the adjacency of the logic values is discussed anew.
A high‐speed test‐generation method using a test generation circuit
Authors: Hirose Fumiyasu , Takayama Koichiro , Kawato Nobuaki 
Published: July 2007

AbstractThis paper discusses the test‐generation circuit which automatically generates a test pattern for a combinational circuit. The test‐generation circuit is designed so that two algorithms of automatic test generation and fault simulation can be executed by the circuit. The test pattern for the circuit under test is generated at a high speed by simulating the operation of the test‐generation circuit using the dedicated logic simulation machine SP. As a result of performance evaluation for the well known benchmark circuits, the test‐generation circuit was constructed with eleven times the number of SP elements on the average compared with the circuit under test. By a simulation using only one SP processor, the operation of the test‐generation circuit could be simulated at 6 kHz on the average. Thus, it is seen that the test pattern for the circuit under test can be generated with a high fault coverage with a speed surpassing the software on a large‐scale computer. The method proposed herein is to apply effectively the architecture of the dedicated machine for a high‐speed logic simulation to the search problem such as test generation. Thus, the validity of the idea was verified.
Large‐vocabulary spoken word recognition using time‐delay neural network phoneme spotting and predictive lr‐parsing
Authors: Minami Yasuhiro , Sawai Hidefumi , Miyatake Masanori 
Published: July 2007

AbstractThis paper proposes a large‐vocabulary speech recognition system using a phoneme spotting method by a time‐delay neural network (TDNN) and a predictive LR parser. This is the first attempt to recognize large vocabulary speech using neural networks. The prediction of phonemes in words is performed by a predictive LR parser. Time alignment between predicted phonemes by the predicted LR parser and phoneme spotting results via TDNN is realized using a DTW (dynamic time warping) method. Speaker‐dependent recognition for a 5240‐word vocabulary using 2620 test words uttered by a male announcer resulted in a rate of 92.6 percent for the top choices, rates of 97.6 and 99.1 percent for the second and fifth choices, respectively.
Fault‐tolerant computer system with stepwise negotiating voting
Authors: Kanekawa Nobuyasu , Maejima Hideo , Kato Hatsuhiko , Ihara Hirokazu 
Published: July 2007

AbstractIn the conventional fault‐tolerant system, it is difficult to satisfy both requirements of long system life and safety. This paper proposes a method in which the output data from subsystems is selected based on the reliabilities of the data processings in the redundant subsystems, which are estimated by the self‐ and mutual checks of each subsystem. By the proposed method, a new fault‐tolerant system can be realized. This system contains both the long life, as a feature of the stand‐by redundant method, and a highly reliable data processing, as a feature of the majority redundant method. It is expected that the proposed method will be applied to the satellite computer.In the proposed method, the trade‐off between the life and the reliability of the data processing can easily be achieved according to the purpose of application, by adequately defining the required level for the reliability. The method can cope with any multiplicity, making it applicable to various problems.
A proposal on approximate reasoning based on revision principle and fixed value law
Authors: Ding Liya , Mukaidono Masao 
Published: July 2007

AbstractWhen a rule P Q and a fact P' that is an approximation of P are given, how to obtain the conclusion Q' approximately is an interesting topic on approximate reasoning. This paper proposes a new approach based on the revision principle and fixed value law. The basic idea on revision principle is to deduce Q' from Q based on the deviation of P' from P.When the revision principle is applied on fuzzy set, there are two laws for obtaining a deviation from P' to P. The first law is called the fixed point law. Its basic idea is to fix an element × in the universe of discourse × of P and P' to obtain the deviation between the membership functions m̈p(x) and m̈p(x). The second law is called the fixed value law. Its basic idea is to fix a value such that the membership functions m̈p(x)= m̈p(x') to obtain the shift from point × to x' on the universe of discourse X.According to the fixed value law, it will become possible to deduce Q' from Q by shifting the membership function. As an example of the fixed value law, a set of linear revising formulas will be given.
Analysis of facial expressions using a three‐dimensional facial model
Authors: Choi Chang Seok , Takebe Tsuyosi , Harashima Hiroshi 
Published: July 2007

AbstractThis paper proposes a method which analyzes an expression from a facial image using a three‐dimensional facial model and then extracts the facial expression.First, the head motion and the facial actions (such as those of eyebrows, eyes, and lips) are separated from the facial image. This is realized by estimating the three‐dimensional motion of the face based on the three‐dimensional facial model and by compensating the motion.Next, the expression information is extracted from the separated facial actions in two ways. One is the method to extract successively the facial expressions considering the characteristics of the facial actions based on the facial muscles. The other is the method to estimate the facial expression as a whole using the least‐square method and regarding the facial actions by the facial muscles as a vector. Those methods are combined with the expression synthesis rules. This makes it possible to reconstruct the original expression from the extracted facial expression parameters.Finally, the result of the analysis of the facial expression from the actual image is compared to the result of evaluation by a psychologist to demonstrate the usefulness of the proposed method. The image reconstructed from the result of analysis also is compared with the original image.
Islamic-Iranian Studies and Studies Concerning Iran in the Islamic Period in German-speaking Countries: Federal Republic of Germany, German Democratic Republic, Austria, and Switzerland
Authors: Fragner Bert G. 
Published: July 2007

This contribution is dedicated to the memory of Fritz Wolff, author of the famous and voluminousGlossary of Ferdawsi's Shāh-nāmeh.This glossary was offered by the National-Socialist government as the official German present to Iran on the occasion of the Ferdawsi Commemoration Festivities in the year 1935. Fritz Wolff, not having been allowed to participate in these festivities, died a few years later in a Nazi concentration camp.In contrast to the situation in most countries, in German-speaking countries the study of Iran is not concentrated in one academic discipline. As a result, the attempt to “reconstruct” the history of Iranian Studies inevitably involves various disciplines. The individual results of these together form the kaleidoscopic spectrum of studies on Iranian themes in Germany, Austria, and Switzerland.The only academic discipline in the German language area that includes the name “Iran” is the one called “Iranistics” (German “Iranistik”).
DEVELOPING A GRADUATE DIPLOMA IN THE FIELD OF SUBSTANCE ABUSE: OBJECTIVES AND DILEMMAS
Authors: Crawley Jim , Sharpe Lionel 
Published: July 2007

AbstractEarlier this year, a decision was taken by the Council of Phillip Institute of Technology that planning should proceed for the introduction of a new Graduate Diploma in Applied Science (Drug Dependence). This paper describes the planning process to date, outlines the objectives for the course and identifies a number of dilemmas encountered in curriculum development. The experiences and issues described may be of interest to others concerned with developing courses or in‐service training programs in this area.The authors would like to stress that this paper, hurriedly prepared, represents their perspective on an exercise still in progress. The subjective nature of the contents should particularly be borne in mind when reference is made to the views of the Course Advisory Committee.