摘要:

AbstractThis paper proposes an algebraic specification method for the compiler and presents a method which automatically generates a compiler from the specification. In the proposed description, the specification of the compiler is described by regarding the compiler as a function on an algebraic domain that contains syntactic domains of the source and the target languages as the subdomain. This approach provides a natural description to the essential part of the compiler, such as the assignment of the area to store the variables within the algebraic framework. An experiment is executed and the result is discussed, where the specification of the compiler of the programming language PL/0 is actually described, and the compiler is generated automatically from the specification.

ISSN:0882-1666    

DOI:10.1002/scj.4690230201

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1992

数据来源: WILEY

摘要:

AbstractWith the expanding use of the computer networks based on LAN, there is a rapid increase of fault generation. A tremendous amount of time and effort is required in the dissolution of those faults since the origins of those faults are physically distant and the data are difficult to obtain due to the distributed management. In addition, the prevention, as well as the early detection and remedy of faults, are required since a failure may affect a broad range.The authors have constructed a diagnosis/observation expert system LODES for LAN, by constructing a knowledgebase of the experiences in dissolving the failure. LODES discovers the violation of protocol by referring to the TCP/IP‐related protocols, automatic detection of fault (or its indication) by observing packets, and points out the abnormality/missetting of network‐related information of the host.In the diagnosis, it has the feature that the distributed cooperative problem‐solving is executed by communicating among LODES (large internetwork observation and diagnosis expert system) attached to each of the network segments. LODES is actually operated, and it is shown that the phenomena and failures which have not been detected can now be det

ISSN:0882-1666    

DOI:10.1002/scj.4690230202

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1992

数据来源: WILEY

摘要:

AbstractTo obtain a required document from the uncertain string information inputted by the user in a document retrieval system or an electronic filing system, the string most similar to the inputted string must be searched.This paper assumes the most general case, where no constraint is imposed on the input error and discusses the efficient method of search for the string in the file which is the most similar to the inputted string. The tree structure is considered to be data structure. The string in the file corresponds to the leaf of the tree. Other vertices of the tree correspond to a string constructed from the set of strings below those vertices as a representative element.The classification of the set of strings is made based on the similarity between strings. A simulation is executed using 100 to 1000 English words as the strings in the file. The search probability of the string most similar to the input string, as well as the search efficiency based on the number of similarity calculations, are examined to evaluate the usefulness of the proposed method.

ISSN:0882-1666    

DOI:10.1002/scj.4690230203

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1992

数据来源: WILEY

摘要:

AbstractA new type of universal literal circuit, in which two thresholds of the circuit are variable and controlled by external signals, is proposed herein. The circuit is designed with CMOS‐FETs, and both computer simulation by FSPICE and experiments on bread‐board with discrete elements confirm its correct operation.A new type of basic quaternary operator, quaternary U‐gate, is also introduced. The U‐gate comprises a pair of CMOS pass transistors driven by the output of the universal literal circuit. Mathematical properties of the U‐gate are derived, and synthesis procedures of quaternary logic functions using U‐gates are given. The quaternary U‐gate and quaternary constants form a complete set of quaternary operators and its mathematical properties implicate those of CP‐gate

ISSN:0882-1666    

DOI:10.1002/scj.4690230204

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1992

数据来源: WILEY

摘要:

AbstractThis paper proposes a new method to form an image of a three‐dimensional (3‐D) object from a set of slice images such as X‐ray CT and MRI by interpolating them. The 3‐D image is reconstructed by using the union of 2‐D images interpolated between adjacent sectional planes which are perpendicular to the slices. The method has features of: (1) interpolations between slices are carried out fully automatically if the image components in a region of interest are overlapped on adjacent slices, and if the region is extracted; (2) the operation of obtaining this is easy since the interpolated shape is obtained in a voxel form; (3) the method can be applied to an object with branches; and (4) the method also can be applied to an object with holes. After reviewing 3‐D interpolation methods, experiments with some artificially made objects and actual MRI images are shown to confirm the usefulness of the prop

ISSN:0882-1666    

DOI:10.1002/scj.4690230205

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1992

数据来源: WILEY

摘要:

AbstractThe hardware architecture of the high‐speed image processor named BINGO is described. By using look‐up tables and bit‐serial architecture, the following operations can be performed: (1) bit‐pattern operations expressed asZ = f(X0,X1, …,X8), whereXi(0 ≤i≤8) represent the gray levels of the pixels under a 3 × 3 mask; (2) comparisons of image data (with these operations, one derives the values of the maximum, the minimum, and the median); (3) filtering operations expressed asZ= σ(Ai. Xi), whereAiandXiare weight coefficients and gray levels of pixels, respectively. This machine is useful as a coprocessor for personal computers and can be used in flexible i

ISSN:0882-1666    

DOI:10.1002/scj.4690230206

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1992

数据来源: WILEY

摘要:

AbstractThe regularization method, which recovers three‐dimensional (3‐D) information from an image by solving the problem of minimizing an energy functional, has recently been applied to various problems in computer vision.This paper proposes an algorithm for reconstructing a detailed 3‐D shape from a contour line image and a sparse set of altitude data by adding a new constraint that points on the same contour line have the same altitude to surface reconstruction by the traditional regularization method.The problem of minimizing an energy functional defined in this paper is reduced to a problem in a very systematic way. This method is applied in practice to contour lines extracted from a real topographic map and geographic numerical information to verify that terrain surface reconstruction from a topographic map is pos

ISSN:0882-1666    

DOI:10.1002/scj.4690230207

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1992

数据来源: WILEY

摘要:

AbstractIn block coding, the original image is divided into square blocks composed ofN × Npixels, and the coding is applied to each block. When the image is coded at a low bit‐rate, however, there is often produced a block noise in the reconstructed image. When a block noise is produced in the part of the time where the change of the gray‐level is slow, the noise deteriorates the image quality greatly.To reduce the block noise, this paper proposes three methods of image division. Let the blocks in a horizontal row in the conventional divided image be called a block row. In the first method, the division is executed by moving each block row in the horizontal direction. The amount of translation is determined by a random variable. The second method divides the original image by the rectangular block, and then each block row is moved as in the first method. The third method divides the image using an octagonal block. It is verified by experiment that the block noise can be reduced by the proposed image divi

ISSN:0882-1666    

DOI:10.1002/scj.4690230208

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1992

数据来源: WILEY

摘要:

AbstractBy using competitive learning, which causes just one or a group of a small number of neurons to respond to a given input, self‐organization of entire neural networks can be achieved. When this self‐organization process is applied to various kinds of travelling salesman problems in a Euclidean space, a good approximation or the true solution is obtained. We use a sequential update which looks at the position vector of each city one at a time as the training method for a neural network arranged as a closed loop. In this case, we use symmetrical connections between neurons. The number of neurons required is approximately linear in the number of cities. In the first experiment, we carried out a quantitative comparison with the simulated annealing method using 500 sets of 30 cities and demonstrated this method's superiority. Next, we obtained a good approximation on a set of 532 U.S. cities and demonstrate its superiority with respect to the increase in the number of cities in actual (realistic) data. Further, for a generalized constrained multiple‐salesman problem, we explain this method's compactness and efficiency and give an experimental example. The computation can be adequately performed by a common workstation with a serial proc

ISSN:0882-1666    

DOI:10.1002/scj.4690230209

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1992

数据来源: WILEY