bluuebunny/crossref_metadata_2025 huggingface dataset:
The Concept of Software Service System (SSS)
Authors: Mori Ryoichi , Tashiro Shuichi
Published: November 2009

The software service system (SSS) is developed to protect software from unauthorized use and to encourage smooth marketing. The system does not impose any constraints on the users except for the request for the appropriate fees. The user can take the backup copy of the software, and at higher discretion, use the software stored at any position of the file system or computer network. The software can be exchanged not only through the discket but also any medium including the communication link and broadcast. The user can acquire the software on a fee basis from the medium, and may purchase the software, test or cancel if not satisfied. To realize such a free utilization scheme together with the security protection, as well as a very effective market channel aiming at the future, there must be established an automatic strict management of the propriety for the software as well as a carefully designed fee‐collecting system. To realize the automatic management of the software, common credit and the permission program are introduced. The implementation of the computer with a propriety management function together with its management operation is discussed.
Ultrasonic Reflection Mode CT with Projection Data Using A‐Mode Image
Authors: Ikegami Masiki , Yamamoto Tsuyoshi , Aoki Yoshinao
Published: November 2009

A new computerized tomography (CT) using ultrasonic reflection A‐mode as projection data is proposed. First, taking X‐ray CT, the differences between transmission‐mode projection data and reflection A‐mode projection data were examined. Thus their reconstruction can be divided into the near‐field and far‐field regions. A conventional algorithm based on the projection theory can be used for reconstructing an image in the far‐field region, but this cannot be used for the near‐field region. To overcome this difficulty, an image‐reconstruction method modified from the filter‐compensated back‐projection method is proposed. The back‐projection method has complex coordinate calculations, their amount begin considerable. This is overcome by introducing a reference table so that a reduced calculation can be carried out by a simple integer‐operation alone. Unlike the conventional method which generally uses impulse waveforms for reconstructing the reflection A‐mode images, the wideband chirp‐pulse compression method is proposed to reduce the peak power and improve the definition. The method was confirmed by underwater experiments for the far‐field region, and by computer simulations for the near‐field region.
Pattern‐Directed Programming System for Lisp
Authors: Kawamura Tetsuya , Ohta Yoshikatsu , Yoshida Yuuji , Fukumura Teruo
Published: November 2009

Lisp has flexible data structures and can manipulate programs as data. Thus, Lisp is used often as descriptive language of systems which assist the development of Lisp programs. We have developed a system which transforms input/output specification described as a sequence of pattern pairs into a Lisp program. In this paper, we describe pattern definition and transformation rules which convert description by pattern into the Lisp program. We also describe some examples of description by pattern and transform their results. As its application, we describe an example of description by pattern of a pure Lisp compiler.
Cautious Transaction Schedulers with k Versions
Authors: Takeda Makoto , Masuyama Shigeru , Ibaraki Toshihide
Published: November 2009

This paper proposes cautious schedulers CS(WW(k)) and CS(WRW(k)), which are generalizations of the recently proposed cautious schedulers CS(WW), CS(WRW) and their multi‐version models CSm(MWW), CSm(MWRW). Here, it is assumed that only k versions of each data item are available. It is shown that their completion test can be performed in polynomial time, and that their fixed point sets WW*(k) and WRW(k) form infinite hierarchies, respectively, when k is increased from 1 to ∞. It is shown also that neither CS(W(k)) nor CS(WRW(k)) exhibits cancellation anomaly. These results indicate the practical importance of the cautious schedulers proposed herein.
Game Solving Procedure SSSR is Unsurpassed
Authors: Katoh Yoshiroh , Ibaraki Toshihide
Published: November 2009

Two‐person zero‐sum games with perfect information can be represented by minimax game trees. By solving such game trees, it is possible to compute the game values that are realized when both players always choose the best moves. Various search algorithms, such as α ‐β, SSS*, dual SSS*, B*, H*, are known for this purpose. Let A and B be two search algorithms; A surpasses B if, for any game tree, the region explored by A before computing the game value is contained in the region explored by B; A strictly surpasses B if A surpasses B and the region explored by A is properly contained in the region explored by B for at least one game tree. In this paper, we prove that no search algorithm strictly surpasses SSS* or dual SSS*.
Hierarchical Estimation of Displacement Vectors in Image Sequences
Authors: Sato Makoto , Sasaki Hiroshi
Published: November 2009

The problem of estimating the displacement vector for a moving object from a consecutive image sequence is one of the most important aspects of dynamic image processings in various fields such as image coding, remote sensing and robot vision. The displacement vector can be determined by the matching method, wherein the displacement vector is determined through the matching among subregions, or by the gradient method, wherein the displacement vector is estimated from the relation between the gray‐level gradient of the image and the gray‐level difference between images. Compared with the matching method, the gradient method has the advantage that the computation is simple and complex motion can be handled, although it is difficult to interpret global motion and the result is more vulnerable to noise. This paper proposes hierarchical estimation in which the advantage of the gradient method is utilized while coping with the demerits. The result is a more accurate estimation of the displacement vector. In the proposed method the hierarchical representation of the image is predetermined. The global motion estimated at a coarse level is transferred to more detailed levels of this hierarchy to compensate the previous estimation. By such a scheme, both the global and the detailed motions can be estimated with high accuracy and stability. By experiment it is demonstrated that the displacement vector can be estimated with high accuracy for image sequences for which estimation has been difficult by past methods.
Top‐Down Use of Linguistic Constraints in a Speech Understanding System
Authors: Niimi Yasuhisa , Kobayashi Yutaka , Uzuhara Shigeru
Published: November 2009

This paper proposes a method for the top‐down utilization of the linguistic constraints in the speed understanding system. In the proposed method, the syntactic constraint is represented by the context‐free grammar, and the semantic constraint is represented by the semantic marker and the case frame. The two kinds of constraints are integrated by using the definite clause grammar, which is an extension of the context‐free grammar. Based on the resulting representation, the word predictor program described by Prolog is generated by a mechanical transformation procedure. The left‐to‐right parsing scheme is assumed as the control. As the parser, a combination of top‐down and bottom‐up methods is adopted to parse utterances. This eliminates the problem in which the procedure falls in an infinite loop if a recursive rule exists, which has been serious in the traditional word predictor. The method was applied to a task, and its validity was verified. The average branching factor of the task was estimated by a simulation.
A Load Control Mechanism for Data‐Flow Machines
Authors: Takesue Masaru
Published: November 2009

The data‐flow computer is based essentially on parallel computation. Consequently, it is essential in the realization of such high‐level management and control functions as resource management to control the parallelism and parallel expansion. In the first part of this paper, the state and the transition are defined for the process in the dataflow computer, and the method for detecting the number of active state processes Na is discussed. Then a load control method is proposed whereby the processes are executed via the depth‐first approach while maintaining Na close to the predetermined threshold Nt. The compatibility between the load control and the load balancing is discussed. As a result of evaluation by the analysis and the simulation at the register transfer level, the following observations were made for the proposed load‐control method:

(1) Na in a processor is maintained between Nt− 2 and Nt−1, and the depth‐first approach is utilized while maintaining the breadth parallelism of approximately 0.75 Nt.

(2) The number of resources 0(2k) which has been considered necessary to execute a highly parallel program, is now reduced to 0(k), and the execution speed is improved by approximately 4 percent.

(3) By combining the proposed method with the load balancing, the loads are distributed uniformly with the difference of Nt among processors being 3 or less.
Relation between Attention and Characteristics of Saccade during Tracking Eye Movement
Authors: Ebisawa Yoshinobu , Minamitani Haruyuki , Yamamoto Masahiro , Takase Moriichiro
Published: November 2009

Until now a satisfactory tracking eye movement control model has not been constructed. It is understood that the tracking eye movement characteristics are affected by the attention of the subject, for which, however, no study has been made. This paper considers the visual feedback called target brightness feedback, where the information concerning the accuracy of tracking and the moving target is fed back to the subject through the change of brightness of the target. By this method, the attention of the subject tracking a moving target is invoked. The saccadic motion is especially examined in detail. The saccade is observed to decrease with the increase of attention. As a result of more detailed analysis, it was observed that the position error at the start of the saccade is increased and the ratio of the saccadic amplitude to the position error is decreased. Those properties can be accounted for on the control model as the enlargement of the saccadic dead zone, and the decrease of the adjusting gain for position error, which is a new‐control element added to the model. It was also examined at which point on the retina the target is recognized. There was observed a tendency that the tracking is made at the periphery with the increase of attention. Those phenomena are considered as due to the avoidance of saccadic suppression.
A Method for Generating Messages of the Interactive Software Based on the Individual User Model
Authors: Nagata Morio , Nakashima Satoru
Published: November 2009

Studies have been made on computer systems based on the user model reflecting the behavior of the users, aiming at the human interface which is easy to use. Recently, it has been proposed that individual models be constructed for the users, rather than a model where the only one “typical” human model represents the user in general. A case has not been observed, however, where the individual model is utilized fully in the interactive computer system which actually requires such an approach. From such a viewpoint, this paper proposes a generation of suitable messages utilizing the individual user model, by restricting the problem to the generation of the messages from the computer side in the construction of a program in the interactive programming environment. The features of the user model which will be useful in such a problem, are pointed out. The points in this study are that the skill of the user concerning the system is separated into the general understanding level and the knowledge of the individual functions; utilization of the information obtained by the operating system and for the language processor; and object‐oriented user model whose contents are always updated. A human interface was implemented experimentally which indicates the individual user, the error message from Lisp interpreter according to each situation. We have conducted an experiment by using the interface. The usefulness of our method was demonstrated by the result of experiment.
Human Interface Using Domain Knowledge Retrieval
Authors: Matsuzawa Kazumitsu , Nagano Yukari , Kaneda Shigeo
Published: November 2009

This paper proposes the domain knowledge retrieval method aiming at the realization a smooth man‐machine interface in the speech interactive service. The method is to reduce the ambiguities in the input produced in the recognition by utilizing the dependence among the input information. By the use of the proposed system, the naturalness of the interaction is improved since the input acknowledge by the user can be omitted. More precisely, a retrieval matching is proposed where the data retrieval corresponding to the user is made on the service side to restrict the recognition dictionary and to identify the final service information with a high probability. Various applications are shown from the viewpoint of the order of restriction. To guide the design of the retrieval matching, a quantitative evaluation method is presented based on the modelings of the recognition system and the service data.
Design Approach of BTRON Human Interface
Authors: Sakamura Ken
Published: November 2009

There can be several approaches to the discussion of the human interface. It is important to consider whether or not the model (or world view) is easily understandable to humans or how to guide the design at crucial points. Apart from those problems, however, which deal with the performance of the human interface itself, it is also important to consider the range of interface applications, i.e., how many working environments the interface can handle in a unified way. This paper discusses the design approach in the human interface in BTRON, where the design and realization are considered separately so that the unified human interface is realized even if a different implementation is made independently.
Job‐Dispatching Problem in Multiprocessor System for Image Processing
Authors: Shimojo Shinji , Miyahara Hideo
Published: November 2009

When a picture is to be generated in a multiprocessor system for image processing, the picture generation time can be reduced by dividing the picture into several subpictures, which are then assigned to the processors for parallel processing. In such a scheme, there exists a trade‐off relation between the parallelism of the subpicture processing and the overhead for assignment. When the number of subpictures is increased, the parallelism is enhanced, while the time of the subpicture assignment is increased. By contrast, when the number of subpictures is small, the time for the subpicture assignment is reduced, while the parallelism is decreased. This paper discusses this tradeoff relation. In other words, discussions are made of the effect of the number of processors composing the multiprocessor system for image processing and the number of subpictures to be processed by the system, on the time for picture generation and the system efficiency. First, a discrete approximate solution for the picture generation time is derived using the Markov process. Then an approximate solution by the queuing network theory is presented. Those methods are applied to actual examples to derive numerical solutions, indicating that there exists the optimum number of subpictures minimizing the picture generation time. A simulation was performed, and the result indicated that the two methods of analysis agree well, further indicating the validity of the approximations introduced in the course of the analysis.
Corner Detection and Curve Representation Using Cubic B‐Splines
Authors: Yasumoto Yoshio , Medioni Gerard
Published: November 2009

A new algorithm for digital representation of a curve is developed using B‐spline functions. This algorithm is applicable to both corner detection and curve representation. When used in conjunction with the previously developed subpixel precision edge detection algorithm, it provides an effective tool for interesting point detection, stereo matching, and motion parameter extraction. Beside corners, portions of a curve with significant change in curvature are detected as significant points (SCP's); B‐spline fitting through these points provides an efficient representation of the curve. The algorithm renders accurate corner detection and curve representation while compressing the data.
Feature Extraction and Classification of Cell Morphology in Response to the Cell Cycle
Authors: Tomura Motohisa , Kumaki Yoshinari , Minamitani Haruyuki , Nonmember Tsutomu Horikoshi,
Published: November 2009

The cancer cell exhibits a cyclic change in its morphology, and the discussion of the cyclic change in cell morphology is very important in cytology, considering the relation between the cell growth and the distribution of the protein granules. At present, this kind of analysis is made by human observation through a microscope. This paper describes a method which recognizes the cyclic morphological changes of the cancer cell by image processing. First, various feature parameters of the nucleus and the cytoplasm are calculated by computerized image processing. In the extraction of the cell image from the original image, the binarization rather than ternarization is applied separately to the nucleus and the cytoplasm. Based on the calculated feature parameters, three decision criteria are set based on the discriminant analysis to recognize the cell morphology. As a result of experiment, the recognition rate of 93.9 percent was achieved for the training data, indicating that the cell morphology can be recognized by a computer.
Self‐Organization of Recognition Cell Groups in Nerve Fields
Authors: Ikeda Nobuhiko , Torioka Toyoshi
Published: November 2009

This paper proposes a basic model for the self‐organization of the recognition cell group in the nerve field. The model is composed of nerve cell layers with mutual lateral inhibition. Also described is the condition for the self‐organization of the recognition cell groups for the n‐dimensional input and, based on that condition, the properties of the model are discussed. Then the behavior of the model is verified through computer simulation. As a result, the following observations are made. When a certain condition is satisfied, recognition cells are formed in a group. These cells respond only to the particular set of input patterns. By varying the training parameters, the recognition cell group is formed depending on the similarity between input patterns. For highly similar patterns, the recognition cell groups are formed in nearby locations in the nerve field. The recognition cell group is formed according to the frequency of the input pattern and its norm.
Network Performance of the Prodigy Parallel AI Machine
Authors: Suzuoka Takashi , Tanabe Noboru , Nakamura Sadao , Fujita Sumikazu , Oyanagi Shigeru
Published: November 2009

This paper analyzes the network performance of the Prodigy parallel AI machine, which is currently being developed. This machine is a multiprocessor system focusing on knowledge information processing problems with fine‐grain parallelism, and thus it is adequate for solving the problems whose structures can be treated as networks. A base‐m n‐cube network is proposed as an appropriate interconnection network for these problems and the proposed network is employed for the Prodigy interconnection network. It deals with the suitability of the base‐m n‐cube network to the Prodigy machine and the possibility of making a large system in addition to network performance through comparisons with binary n‐cube and mesh networks, where the performance figures are measured by simulation. The results of the comparison show that the base‐m n‐cube network is better than others for the Prodigy machine.
Analysis of a Road Image as Seen from a Vehicle
Authors: Zen Heitou , Sakurai Katsumi , Kobayashi Tetsuya , Ozawa Shinji
Published: November 2009

This paper proposes a method to record three‐dimensional (3‐D) geometry of a road from a single‐eye image. Although generally it is impossible to obtain a 3‐D information from a single image of a road edge, this becomes possible by adding information of the road from its design conditions. This paper describes a method to calculate the model parameters from the edge of a traffic lane in an image of a road, after presenting a 3‐D model of a road based on its design conditions. In the proposed model it is assumed that the shapes of the center line of a road seen in horizontal and vertical planes consist of alternative straight lines and curves. The 3‐D shape of a road using this assumption can be classified into four categories. First, the parameters for a pair of parallel straight lines connected to an adjacent curve are calculated. Then the parameters of the curve connected to the straight lines are calculated. A model having such synthesized road edges was computer‐simulated, giving the maximum relative error of the parameters of 12 percent. Images of road edges photographed from a vehicle on an actual road were processed manually for comparison, giving a maximum relative error of 21 percent with reference to the design data of the road.
Aliasing Probabilities and Weight Distributions of Several Codes
Authors: Iwasaki Kazuhiko , Nishimukai Tadahiko
Published: November 2009

Signature testing is proposed for integrated circuit testing. One of the problems in signature testing is that not all the errors contained in the test response from the tested circuit can be detected (aliasing error). In this paper, the following results are shown: (1) utilizing the property of the maximum distance separable code, the aliasing probability of the multiple‐input signature register (MISR) is formulated. It is shown that the aliasing error probability of the MISR does not depend on the selected polynomial. In addition, it is shown that there is no fluctuation as is observed in the case of single‐input linear feedback shift registers (LFSR); (2) the aliasing error of the multiplexed MISR based on the primitive polynomials is analyzed using the weight distribution of the Reed‐Solomon codes. It is also shown that there is no fluctuation as is observed in single‐input LFRS; (3) the aliasing probability for single‐input LFSR is analyzed using a computer program. It is verified that the aliasing probability of single‐input LFSRs has different properties depending on the selected primitive polynomial. The fluctuation in the aliasing probability is observed.
A Note on Image Registration Based on Geometric Correspondence between Two Levels of Extended Pyramid Structure
Authors: Sone Mitsuo , Sakauchi Masao , Onoe Morio
Published: November 2009

The approach based on the pyramid structure of an image is used widely in image re‐registration. However, in the traditional pyramid structure, 2×2 pixels are placed in correspondence to a pixel in the immediate upper level, which deprives the flexibility of the image size compression. Hence, this paper presents an extended pyramid structure where m × n pixels are placed in correspondence to a pixel in the immediate upper level. Restricting the correspondence between levels to be geometric, not the similarity correspondence, the upper‐left candidate position and the best upper‐left position are defined for the template image at each level, and the range of search at each level is discussed. Then the image in each level is defined. A method is presented wherein the proposed method is applied to the registration of images.
Finding a Feasible Schedule on a Tree‐Connected Processor System
Authors: Kawaguchi Tsuyoshi , Kyan Seiki , Onaga Kenji
Published: November 2009

A tree‐connected processor system (TPS) is a system in which m processors are connected in the form of an in‐tree or out‐tree. Each job arriving at a TPS flows on a directed path, from a processor specified for the job to the root (or on a directed path from the root to a processor specified for the job), and is processed by processors lying on the directed path. This paper discusses the feasibility decision problem on a TPS. It is a problem to decide whether or not each job can be processed within its deadline from its arrival time, and to find a schedule if the processing is feasible which realizes the processing. As a result for general TPS's, it is shown that the problem can be solved in O(mn log n) time for jobs with unit processing times, where m is the number of processors and n is the number of jobs. Especially, an algorithm proposed for TPS with an in‐tree structure is on‐line and can be used even when the information concerning jobs is obtained only at their arrivals.
A Design Method of Network Operating Systems Based on the Concept of an Object
Authors: Takahashi Kaoru , Ohta Yoshiyuki , Shiratori Norio , Noguchi Shoichi
Published: November 2009

This paper aims at an improvement of the software productivity of the system and proposes a software design method for network Os. In this paper the network Os is defined as a system composed of the following two functions:

(1) The function constructed on the existing OS, realizing a uniform access to the distributed resources; and (2) the interface between the forementioned function and In the proposed design, (called network Os kernel) is composed as a set of objects existing in the problem domain related to the network Os. As a result of the design, the actual structure of the system and the actual objects are reflected directly on the software design which improves the understanding and the maintenance of the system.

The interface between the network Os kernel and the existing Os is introduced to achieve the portability of network Os kernels. It is expected that by applying the design method based on the forementioned principle, the software productivity of the network Os will be improved. As an application example of the proposed design method, an LAN‐oriented network Os was designed and implemented experimentally.
A Coding Method of Multicolored Images Using Dynamic Pattern Generator
Authors: Ishii Ikuo , Kagaya Yoshimi , Yamato Junji , Makino Hideo
Published: November 2009

The mosaic method and geometric method have been used for coding the multicolored image. This paper proposes a dynamic pattern generation method aiming at a more faithful image representation. In the proposed method, the color boundary is extracted from the original picture. The result is divided into smaller blocks, and the pattern code is generated for each block.

A different set of patterns is defined according to the joining state of the color boundary to the adjacent already‐encoded blocks. By this scheme, a variety of patterns can be generated by a limited coding complexity. When patterns with high occurrence frequencies are encoded by 4 bit and those with low frequencies by 8 bit, approximately 9500 kinds of patterns can be provided. Approximately 90 percent of the actually appearing patterns belong to the patterns encoded by 4 bit, and the coding efficiency is improved.

The color of the region surrounded by the color boundaries should be specified only for the case where the color cannot be determined from the joining relation from the adjacent blocks. Consequently, the color specification data occupies only 10 percent of the total code. Since a large number of patterns can be prepared, an image faithful to the original picture can be restored.
An Algorithm Using Modular Arithmetic for the Subset Sum Problem
Authors: Tachibana Toshiro , Nakano Hideo , Nakanishi Yoshiro , Nakao Mitsuru
Published: November 2009

In this paper, an algorithm is developed for the subset sum problem in connection with public key cryptosystems. It is known that the subset sum problem based on a super‐increasing sequence of numbers can be solved simply and in a polynomial time. It is known also that the subset sum problem based on general sequences of numbers is NP‐hard, and the difficulty of the problem varies especially depending on the density.

Thus, this paper proposes an algorithm using modular arithmetic for the subset sum problem based on general sequences of numbers. The basic idea of this algorithm is that “the largest number in a sequence of numbers A= (a1, …, an) is transformed to a super‐increasing number by modular arithmetic.” The advantages of the algorithm are investigated by experiment, and it is shown that by the properties of problems used, this algorithm is an effective method for the subset sum problem based on general sequences of numbers, especially “the case where the density is close to 1,” where the existing method is weak.
Point Source Illumination Stereo for Objects with Uniform Reflectance
Authors: Iwahori Yuji , Kamei Hiroyuki , Yamaguchi Sholchiro
Published: November 2009

In an earlier report, a point source stereo method was proposed which determines the distance from the viewpoint to the surface element as well as the inclination of the element surface for the completely diffusive surface based on five density images obtained by a point source illumination. The present paper proposes a new method along the line which can determine accurately the distance distribution for the measurement in the general environment from the illumination equation with the intensity resolution of some 8 bits. A diffusive surface is considered which may contain any inclination but has a uniform reflectance over the entire surface. The distance distribution is determined by the following two procedures.

In procedure 1, the common reflectance is determined by selecting the surface element with the maximum luminance in each image and combining the data.

In procedure 2, the uniform reflectance is used as the constraint, and the distance distribution is determined for each surface element.

The proposed method is called the solution by combined maximum luminance surface elements. An algorithm (three‐source stereo method) was developed for the case of the continuous surface, where t h e distance distribution can be determined using only three images. An experiment was made for the proposed method using an 8‐bit quantized image for a diffusive object. As a result, it is shown that both five‐source and three‐source methods can determine accurately the distance distribution with accuracy within 1 percent from the quantized intensity image data, for the measurement in the general environment.
A Simple Algorithm for Finding a Maximum Clique and Its Worst‐Case Time Complexity
Authors: Shindo Miklo , Tomita Etsuji
Published: November 2009

This paper proposes a new algorithm MAXCLIQUE which finds a maximum clique in an undirected graph with n vertices, and shows that its worst‐case time complexity is O(2n/2.863). For the dual problem of finding a maximum independent set of vertices, Tarjan et al. already have proposed an algorithm of worst‐case time complexity O(2n/3) [2]. However, by comparison, our algorithm is remarkably simpler, and it was confirmed that it runs faster when two algorithms were used for several random graphs and their average running times were measured.
A Highly Parallel Processor CAP
Authors: Ishii Mitsuo , Ikesaka Morio , Ishihata Hiroaki
Published: November 2009

The aim of this study is to apply the unprecedented high‐speed computing made possible by parallel processing to a wide range of problems such as computer graphics. A highly parallel cellular array processor, the CAP‐256 has been developed in which 256 high‐performance processors, called cells, are connected together. The CAP‐256 includes a function by which a generated image is displayed in real‐time, as well as a function to construct various kinds of [inter‐processor] communication networks (topologies). A VLSI chip has been developed which integrates the communication and synchronization functions required for parallel processing, as well as the I/O function for the image. Using this VLSI chip, the cell was implemented in a compact form, and a small‐sized high‐performance parallel computer was implemented.

To operate the cell, software called the cell OS (operating system) was developed. The software environment which has been implemented makes it possible to easily develop and efficiently execute application programs based on message communication. An image was generated using parallel ray‐tracing which has three to four times higher performance than that of the general‐purpose FACOM M‐380 mainframe computer. The authors are also attempting to develop applications for CAD problems such as automatic wiring as well as scientific calculations. The versatility of the CAR‐256 has been verified.
Reconstruction Algorithm for Cone‐Beam X‐Ray CT Using Inverse Filtering
Authors: Matsuo Hiroshi , Iwata Aklra , Suzumura Nobuo , Horiba Isao
Published: November 2009

This paper proposes a reconstruction method for the 3‐D distributional image of the absorption coefficient of the object. In the method, a cone‐beam X‐ray source and a 2‐D detector array are placed in confronting positions on the opposite sides of the object. By rotating them 360 deg., the projection data are acquired, and then the inverse filtering is applied. This is a reconstruction problem from an incomplete projection data.

In this paper, the compound image is constructed by backprojecting the projection image directly along the locus of projection. The inverse filtering is applied to the result to determine the 3‐D distribution image of the absorption coefficient of the object. In the defined geometrical system for the measurement, the inverse filtering cannot essentially be applied since the impulse response is space variant. Consequently, a nonuniform sampling coordinate system is defined to make the impulse response space invariant.

The inverse filter function is derived from the Hankel function by utilizing the symmetry of the impulse response in regard to the axis of rotation. Furthermore, to stabilize the inverse filtering, a window function is employed which considers the space‐dependence of the incompleteness of the projection image in the frequency domain. Finally, the usefulness of the proposed reconstruction method is verified by a computer simulation.
A HIGH‐Speed LAN Model Using an Information‐Updating Algorithm
Authors: Saitoh Akinori , Tsushi Takeshi , Tsujino Yoshihiro , Tokura Nobuki
Published: November 2009

Local area networks (LANs) such as Ethernet provide cheap, high‐speed communications. Here we present a new high‐speed local area network model in which the LAN is configured with node‐processors which halt and/or recover asynchronously. We also propose an algorithm for dealing with the problem of information‐updating with a proof of the correctness of the algorithm.
Universal Fault‐Tolerant Hypercube Architecture without a Switching Mechanism
Authors: Ishikawa Tsutomu
Published: November 2009

This paper proposes a new universal fault‐tolerant hypercube architecture. This architecture is obtained by constructing a basic fault‐tolerant hypercube and expanding it using the product of graphs. The basic cube is constructed by partitioning all processing elements (PEs) into subsets with weak connectivity using the Hamming distance between PE numbers and by connecting all PEs in each subset to a spare PE through buses. This architecture can maintain the original network topology and size without the addition of any switching hardware and can be applied to any size hypercube. Moreover, because the number of spare PE ports is equal to or fewer than the number of original PE ports, the same kind of PE can be used for both original PEs and spares.
A Method of Extracting Similar Figures Using Polar Features
Authors: Nagao Tomoharu , Agui Takeshi , Nakajima Masayuki
Published: November 2009

Recently, there has been active research on image recognition technology using computers. It is necessary for image recognition to extract some elements automatically, such as straight lines, circles, numerical letters and symbols from a picture. There are many cases where the extraction of such elements is not easy because some overlap others. This paper describes a method of extracting overlapped elements separately from a binary picture.

The method can extract an element which has a constant shape with arbitrary size or rotation angle, or with both an arbitrary size and an arbitrary angle. Also, it uses both a single key point and several feature points on the model of a figure to be processed. The extraction is carried out by checking if there are several pixels corresponding to the feature points, when each pixel is regarded as a key point of the model.

This paper describes the algorithm of the method, a method of extracting some important straight lines and circles in the picture using the algorithm, and experimental applications of the method to mechanical drawings. The results of the experiments demonstrate a successful extraction of straight lines, circles, arrows, and numerical letters, and this confirms the usefulness of the proposed method.
A State Assignment for p‐Valued Sequential Machines
Authors: Nagata Yasunori , Zukeran Chotel , Afuso Chushin
Published: November 2009

For p‐valued synchronous sequential machines a new method of state assignment is proposed. In this method, a given sequential machine is expressed by a state transition table and then codes with low Hamming weight are assigned to the internal states with high frequency of appearance. This process yields the state transition functions which express transition to the states with low frequency of appearance, thereby attaining the state transition functions with the minimum number of terms in the principal disjunctive canonical form. All the procedures can be expressed in a simple straightforward algorithm and therefore can be processed fast. Experiments on a computer for p = 3 show that the truth‐table densities of the state transition matrices are about 80 to 90 percent compared with those obtained by the triangle method [1, 2] which is one of the existing methods. The results compare favorably with those obtained by other methods even after simplification by the extended Quine‐McCluskey method.
A Parallel Branch‐and‐Bound Algorithm for a Torus Machine
Authors: Kawaguchi Tsuyoshi , Maeda Tamotsu
Published: November 2009

Torus is one of the most promising interconnection topologies for multiprocessor systems with a large number of processors. This paper presents a parallel branch‐and‐bound algorithm for a torus machine with additional global links. Using the torus network, processors send subproblems to adjacent processors to balance their loads. Global links are used for broadcasting the newly obtained temporary solution to all processors. Using simulation experiments, the performance of the proposed algorithm was compared with that of another algorithm implemented on an improved tree machine called the DON system. These experiments showed that the speed‐up rate obtained by the proposed algorithm is always greater than the speed‐up rate obtained by the algorithm implemented on the DON system.
The Pulse Extension Method for the Variable Neighborhood Distance Transformation of 2‐ and 3‐Dimensional Digitized Pictures
Authors: Okabe Naoki , Toriwaki Jun‐Ichiro
Published: November 2009

This paper proposes a variable neighborhood distance transformation algorithm for two‐ and three‐dimensional (2‐D and 3‐D) digital binary pictures which is based on a new concept called path extension. The properties and performance of the method are experimentally evaluated. An algorithm was constructed using path extension which calculates the variable neighborhood distance for all one pixels in a 2‐D picture, using a sequence of four and eight neighborhoods composed in an appropriate way.

In previous distance transformation algorithms, the distance for the central pixel under consideration is calculated uniquely from the distances of several neighborhood pixels, while the distance transformation in the path extension algorithm is executed by determining the distances of several neighborhood pixels from the distance of the central pixel under consideration.

This paper proposes a serial path extension algorithm and two parallel path extension algorithms for both 2‐D and 3‐D pictures. For comparison of performance, one serial and one parallel algorithm, which are modifications of the traditional fixed neighborhood algorithms, are further analyzed. Finally, the results of an experimental evaluation are presented for computation time in the five proposed algorithms.
A New Recognition Method for Stamped and Painted Alphanumerals
Authors: Nakano Tomoaki , Yamamoto Shin , Takeda Norio
Published: November 2009

In the automobile production system, the recognition technique for the stamped character stamped on the painted surface is indispensable in part labelling and production control. When a stamped character is painted over, it often happens that undulations and humps are produced on the character contour. This paper discusses a recognition method for such stamped characters. In order to make the method robust toward variations in the character contour, the contour shape data is constructed viewing the character from the circumscribed rectangle of the character. Then, the contour features inherent to the character are extracted after smoothing, to perform the recognition.

The method was applied to stamped and painted 1000 samples of ten kinds of alpha‐numerals and the recognition rate was examined. It is seen that the proposed method exhibits a higher recognition rate for all character types than the multiple similarity method. According to the experiment in which the experimental system based on the proposed method was applied to 3000 samples of 15 kinds of alphanumerals, the correct recognition rate was 99.8 percent. Although there were seven samples which were rejected, there were no misclassifications. Thus, the usefulness of the method was verified.
Parallel Processing Description in the Concurrent Object‐Oriented Language ABCL/1
Authors: Yonezawa Akinori
Published: November 2009

This paper outlines the object‐oriented language ABCL/1 and its framework. The results of recent research associated with the language are also presented.
Automated Design of Circuits from Recursion Equations Using Theorem‐Proving Technique
Authors: Harao Masateru , Iwanuma Kouji
Published: November 2009

This paper aims at establishing the automated design for a circuit by the theorem‐proving technique, by formulating the circuit design as a transformation from the specification description (recursion equation) to the circuit model FN (functional network based on dataflow operation).

First, rules for circuit construction and transformation rules are formulated, which are used as the inference knowledge in the theorem‐proving system. Then the circuit realization language is designed based on the modal logic, where the syntax corresponds to the FN structure, and the computation corresponds to the circuit operation. It is shown that the processing system for such a language can be realized by a technique similar to the derivation principle for the first‐order predicate logic.

The theorem‐proving system for automated circuit design can be realized as a program on the circuit realization language, where the element composing the circuit is used as the declarative knowledge, and the transformation rule is used as the inference knowledge.

When the design specification (recursion equation) is given as the goal clause, the automated circuit design system decides on the possibility of design, and the circuit structure information is extracted from the proof process. The behavior of the circuit can be simulated also in the process.
Functional and radiological outcome after delayed fixation of femoral neck fractures in pediatric patients
Authors: Varshney Manish Kumar , Kumar Ashok , Khan Shah Alam , Rastogi Shishir
Published: November 2009

Background

Complications that develop after femoral neck fracture in children—especially osteonecrosis—have been retrospectively attributed to inadvertent delayed fixation and fracture type. Prospective evaluation of results after delayed fixation of femoral neck fractures in children beyond the first 24 h is not reported in the literature and requires evaluation to increase our understanding of the procedure and improve fixation methods. Also, the role of capsular decompression in initial management needs to be elucidated.

Materials and methods

Radiological and functional evaluation was done for delayed fixation (>24 h) of displaced fractures in the femoral neck in 21 children (21 hips) treated over 11 years. Mean patient age was 11.8 (median 12, range 5–15) years. Extraphyseal fixation was done using partially threaded cannulated cancellous screws after closed or open reduction. Patients were allowed full weight bearing after 12–18 weeks. Results were assessed on the basis of modified Ratliff criteria. Patients were followed for a mean of 81 (range 66–129) months.

Results

All fractures united at a mean duration of 12 (range 10.6–14) weeks. Three (14.3%) patients had osteonecrosis of the hip, which was significantly related to poor outcome (r = 0.495; P = 0.022). There was a significant correlation (r = 0.52) between development of osteonecrosis and delayed fracture fixation of >10 days (P = 0.016) and open reduction (P = 0.016).

Conclusions

Outcome following temporal delay in fracture fixation of the femoral neck is primarily affected by osteonecrosis of the femoral head, whereas restriction of movements, shortening, and premature physeal closure has no significant influence. Osteonecrosis is primarily linked to delay and open reduction, whereas fracture type, age, and sex seem insignificant factors. Capsular decompression does not seem to affect the outcome in delayed presentations and may hinder definitive treatment.
The Spectrum of Plant and Animal Sterols in Different Oil‐Derived Intravenous Emulsions
Authors: Forchielli Maria Luisa , Bersani Germana , Tala Sara , Grossi Gabriele , Puggioli Cristina , Masi Massimo
Published: November 2009

Intravenous lipid constituents have different effects on various biological processes. Some of these effects are protective, while others are potentially adverse. Phytosterols, in particular, seem to be implicated with parenteral nutrition‐associated cholestasis. The aim of this study is to determine the amount of plant and animal sterols present in lipid formulations derived from different oil sources. To this end, animal (cholesterol) and plant (β‐sitosterol, campesterol, and stigmasterol) sterols in seven different commercially available intravenous lipid emulsions (ILEs) were quantified by capillary gas chromatography after performing a lipid extraction procedure. The two major constituents of the lipid emulsions were cholesterol (range 14–57% of total lipids) and β‐sitosterol (range 24–55%), followed by campesterol (range 8–18%) and stigmasterol (range 5–16%). The fish oil‐derived formulation was an exception, as it contained only cholesterol. The mean values of the different sterols were statistically different across ILEs (P = 0.0000). A large percentage of pairwise comparisons were also statistically significant (P = 0.000), most notably for cholesterol and stigmasterol (14 out of 21 for both), followed by campesterol (12 out 21) and β‐sitosterol (11 out 21). In conclusion, most ILEs combined significant amounts of phytosterols and cholesterol. However, their phytosterols:cholesterol ratios were reversed compared to the normal human diet.