摘要:

AbstractIn the search of data from a database using a key, it is desirable that, even if the input key or the key in the database is in error, and there is no exactly matched key, still the system lists similar keys or retrieve the closest key.This paper discusses the organization and manipulation of the file, where the keys similar to the input key are listed, or the closest key is retrieved. The basic idea is to combine the high efficiency of the B‐tree for the retrieve/insert/delete of the key, and the ability of the hierarchical file based on the class name expression for the similar key search. By such an elaboration, it is possible to realize the search of similar keys, which cannot be executed by the B‐tree, or insert/delete of the key, which is not considered in the hierarchical file based on the class name expression.An experiment is made by splitting the characters into two classes, i.e.,atomandntoz, and using 16,561 English words of length 6 to 10. The number of read‐outs from the secondary memory in the retrieve/insert/delete of the key is approximately 3, and the number of write‐ins into the secondary memory in insert/delete is approximately 1. The search for the similar keys requires approximately 7.3 to 8.5 times larger read‐ins compared to the search of the exact key. The retrieval rate is approximately 95 to 99 percent for a single error (substitution/insertion/missing). The efficiency of the use of the memory is approximately 7

ISSN:0882-1666    

DOI:10.1002/scj.4690270101

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

年代:1996

数据来源: WILEY

摘要:

AbstractThis paper considers the case where the specification and the program are modified. A method is proposed that specifies the range which is affected by the modification using the verification method and decomposition technique. By the proposed technique, the points where the modification is required or the point which may contain an error can be estimated when the program is modified. The inductive assertion is used as the verification technique.It is assumed that the specification before modification as well as the program are already verified for the correctness. The object of verification is simplified by the comparison and validation of the verification history and the object of correctness verification. The part which is left without being simplified is the range affected by the modification before the comparison and after the correctness verification, the rage which is affected by the modification as well as the range for which the validation is not satisfies can be specified.

ISSN:0882-1666    

DOI:10.1002/scj.4690270102

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

年代:1996

数据来源: WILEY

摘要:

AbstractIn solving optimization problems on Hopfield‐type neural networks, a constraint coefficient and a cost coefficient of an energy function should be appropriately determined. Until recently, the values of these coefficients were decided on the basis of experience and trial and error. As a result, solutions that satisfy the constraints could not be obtained, and the quality of the solutions was not good. In order to avoid this problem, we propose a method to control cost coefficient values automatically while keeping the constraint coefficient constant. In this method, the constraint condition for a solution is changed gradually, when the last constraint condition is satisfied, the solution is obtained. Under each constraint condition, the maximum value of cost coefficient is calculated, leading the Traveling Salesman Problem (TSP) for 10 to 30 cities, and obtained near‐optimal solutions more efficiently than an ordinary TSP algorithm. The computation time was reduced 10‐fold, compared with an ordinary TSP algo

ISSN:0882-1666    

DOI:10.1002/scj.4690270103

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

年代:1996

数据来源: WILEY

摘要:

AbstractThere have been proposed a large number of methods to extract the three‐dimensional information in image understanding. Among those, stereo‐imaging is considered interesting as a passive method that does not affect the object. The problem of stereo imaging can be reduced to the corresponding point search problem. An attempt is made to use the following method to arrive at high‐density distance information. The energy functional is defined for the disparity considering the smoothness constraint. Then, pointwise stereo matching is realized by minimizing the functional over the whole image.The active net is one such approach. This technique often is combined with the iterative solution method based on the coarse‐to‐fine strategy using the multiple resolution, but it is not easy to achieve the matching for a wide range of disparity.This paper proposes a new stereo‐matching method, where the far‐search power of the genetic algorithm and the local optimization power of the active net are combined. It is a method in which a large number of partially corresponding patterns are prepared and calculated using the active net. Then, the genetic manipulation is applied to the set of patterns, and the optimal correspondence is sought in a stable way by iterating the change of generation. The procedure has the feature that the inadequate parameters are sorted out, and the optimal parameters are select

ISSN:0882-1666    

DOI:10.1002/scj.4690270104

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

年代:1996

数据来源: WILEY

摘要:

AbstractThe α‐parameter for autoassociative neural networks is introduced here. This parameter allows the memory capacity of such networks to be derived without use of techniques such as the replica method and signal‐to‐noise analysis. The results of the derivation explain those obtained from simulation experiments, with the derivation relying simply on asymptotic analysis. In particular, after coarse approximation a ratio of 0.13 is obtained as an estimate of network memory capacity.Additionally, by considering the dynamical equations governing the α‐parameter, the dynamics of the network's state are analyzed during recollection. Of particular note is the result showing how the α‐parameter makes it possible to analyze networks consisting of continuous‐time neurons. Finally, the theoretical results are validated by comparing them with empirical data gathered from network simulati

ISSN:0882-1666    

DOI:10.1002/scj.4690270105

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

年代:1996

数据来源: WILEY

摘要:

AbstractThis paper presents a method to construct the Delaunay triangulation for creating a polygon patch model, which is used as a graphic model for applications such as computer graphics and virtual reality. This method is based on the conventional incremental method to construct the Voronoi diagram, but has two characteristics that are especially suitable for a three‐dimensional geometric modeling. One of these characteristics is that a point can be removed from the mesh. This feature is useful for the interactive modeling application in which points are often removed and moved. The other is that a line, which lies between two points, can be constrained to be an edge of the mesh. This is necessary for creating an accurate three‐dimensional model. Without this feature, the mesh usually obtained has totally different three‐dimensional structure from the real object. A process to apply this method to a radial range image is described as well as the details of this method. Experimental results and evaluation of this method are also

ISSN:0882-1666    

DOI:10.1002/scj.4690270106

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

年代:1996

数据来源: WILEY

摘要:

AbstractThis paper deals with clock truncation coding for gray‐scale images. An image region is segmented into unequal‐sized square blocks according to local luminance variations and luminance values in the block are approximated by triangular plane patches constructed from the luminance values at the four vertices of the block. Computational complexities of the unequal‐sized block segmentations are discussed. Segmentations are classified into three types: top‐down splitting; bottom‐up merging; and generalized split‐and‐merge method. It is derived from the theoretical model that initial block size in the split‐and‐merge method for a given image of size 256 × 256 is 17 × 17. Segmentation by accumulated square error is preferred to human visual sensitivity. Experimental results using a standard image have clarified that the segmentation by the accumulated square error improves the quality of approximated image to 1 to 2 dB compared with segmentation by the mean square error. Moreover, it is confirmed that the approximation by triangular plane patches is superior to JPEG for the compression of the images that h

ISSN:0882-1666    

DOI:10.1002/scj.4690270107

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

年代:1996

数据来源: WILEY

摘要:

AbstractIn an attempt to propose a robust method for understanding natural language (NL) interface commands, a scheme is proposed that infers intentions from an indirect speech‐act that does not express users' real intentions explicitly. This method classifies the real intentions of the indirect speech‐act into: 1) refusal; 2) reversal; 3) restriction; 4) benefit; and 5) disability. Further, concepts are abstracted for operations, e.g., displaying, moving, and deleting information systems; and constructing the operation knowledge base. This knowledge based comprises operational concepts and the relationships between them. These relationships are assigned the foregoing classifications for intentions. In addition, we construct the knowledge base of objects for the target of operations, e.g., files, figures, strings. This knowledge base contains the relationships: a) antonym; b) exclusive; c) part‐of, between the objects; and uses these relations to infer the transitions between the objects. An algorithm is the proposed to infer concepts for operations and concepts for target objects of operations that may represent the user's actual intentions.This proposal scheme was tested with requests on UNIX and a commercially available Japanese Word Processor. The system successfully inferred the intentions for approximately 80 percent of the user's indirect speec

ISSN:0882-1666    

DOI:10.1002/scj.4690270108

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

年代:1996

数据来源: WILEY

摘要:

AbstractThis paper proposes a method optically to inspect the state of each soldered lead of a semiconductor package. The surface of the soldered lead is recorded using a CCD camera from a direction perpendicular to it and illuminated from the same direction as the camera. The features of the pattern and the distribution of the brightness on soldered lead are extracted from the recorded image, so that the quality of the soldering is judged from them. It has already been proven that the method is effective to inspect bumps on a soldered part. This paper proves experimentally that the method is also effective to inspect soldered leads. The images of soldered leads have more variations than those of bumps. Therefore, the determination of condition that correctly represent the features and sections of an image is the key in this experiment. After the best conditions have been found, the experimental results using 508 samples (including 175 defective samples) show a 100 percent detection rate for defective samples and 95.7 percent of normal solderings. These results agree with those gained from human visual inspections.

ISSN:0882-1666    

DOI:10.1002/scj.4690270109

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

年代:1996

数据来源: WILEY

摘要:

AbstractYao et al. have proposed the Dynamic‐Static Neural network (DS‐net) which includes the Tank and Hopfield model for linear programming problems as its special case. This paper proposes a modified DS‐net which is capable of solving optimization problems with quadratic constraints. Because the 3‐satisfiability problem of Boolean formula can be transformed to problems of this type, the model is applied to the problem. The simulation experiments using a digital computer show that this formulation bring the merit of greedy methods to the neural network solution and the initial state satisfying constraints is excellent for obtaining the optimal s

ISSN:0882-1666    

DOI:10.1002/scj.4690270110

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

年代:1996

数据来源: WILEY