Showing papers in "Journal of Computer Science and Technology in 1989"
Journal Article•
TL;DR: In this paper, the authors present a technique by which solutions to reflexive domain equations can be found in a certain category of complete metric spaces, where the objects in this category are the (nonempty) metric spaces and the arrows consist of two maps: an isometric embedding and a non-distance-increasing left inverse to it.
Abstract: This paper presents a technique by which solutions to reflexive domain equations can be found in a certain category of complete metric spaces. The objects in this category are the (non-empty) metric spaces and the arrows consist of two maps: an isometric embedding and a non-distance-increasing left inverse to it. The solution of the equation is constructed as a fixed point of a functor over this category associated with the equation. The fixed point obtained is the direct limit (colimit) of a convergent tower. This construction works if the functor is contracting , which roughly amounts to the condition that it maps every embedding to an even denser one. We also present two additional conditions, each of which is sufficient to ensure that the functor has a unique fixed point (up to isomorphism). Finally, for a large class of functors, including function space constructions, we show that these conditions are satisfied, so that they are guaranteed to have a unique fixed point. The techniques we use are so reminiscent of Banach's fixed-point theorem that we feel justified to speak of a category-theoretic version of it.
97 citations
TL;DR: In comparison with A* search, the hypothesis, performance and computational complexity of SA are discussed and the principle and performance of the statistical beuristic search algorithm SA are unraveled.
Abstract: In order to further unravel the principle and performance of the statistical beuristic search algorithm SA, in this paper, in comparison with A* search, the hypothesis, performance and computational complexity of SA are discussed.
6 citations
TL;DR: In this system, based on some local properties of digital image, the shape and minutiae features of fingerprint can be extracted from the grey level image without binarizing and thinning.
Abstract: A new automated fingerprint identification system is proposed. In this system, based on some local properties of digital image, the shape and minutiae features of fingerprint can be extracted from the grey level image without binarizing and thinning. In query, a latent fingerprint can be matched with the filed fingerprints by shape and/or minutiae features. Matching by shape features is much faster than by minutiae.
6 citations
TL;DR: Using computers to store GuQin notations and recover the same to typesetting and printing and the prospective application of computer technique to Chinese traditional music is discussed.
Abstract: GuQin (
Open image in new window
literally, ancient Qin) is one of the oldest Chinese musical instruments. GuQin has its own apecial way of making notations. Existing GuQin notations incorporate a valuable heritage of Chinese traditional music. Using computers to store GuQin notations and recover the same to typesetting and printing is briefly described in this paper. The prospective application of computer technique to Chinese traditional music is also discussed.
5 citations
TL;DR: A semi-input-memory finite automaton with input alphabetY and output alpha-betX is a feedforward inverse with delay 2 if and only if there exists a cycleC of state diagram of Mα such that ƒ(yo, ...,yc, λα (t)) can be expressed in the form of yc for any statet in C andyo, yl, ... yc inY.
Abstract: LetM′ = C(M α, ƒ) be a semi-input-memory finite automaton with input alphabetY and output alpha-betX. IfX=Y={0, 1}, thenM′ is a feedforward inverse with delay 2 if and only if there exists a cycleC of state diagram ofM α such that ƒ(y o , ...,y c , λα (t)) can be expressed in the form of ƒ(1) (y 0, ...,y c − 1,y α (t)) ⊕y c for any statet inC andy o, yl, ... yc inY; or of ƒ(2) (y 0, ...,y c − 2,y α (t)) ⊕y c − 1 for any statet inC andy o, yl, ..., yc inY; or for any statet inC andy o, yl, ..., yc, inY, y o yl ... yc satisfies the D [t] condition. The socalledy o yl ... yc satisfying the D [t] condition is that: for somei, j, (i, j)∈{(1,2), (1, 3), (2,1), (2,2), (3,1), (3,2)}, there exists a (c+2−k)—ary functionf (k), k=1, 2, 3, such that the Equation (1) and Equation (2) hold simultaneously for ally c −2/′ , ...,y c +1/′ ∈Y.
Open image in new window
where\(\hat t = \delta _\alpha \left( t \right)\); and if (i, j)=(1,2), then one and only one of the following conditions C1 and C2 holds for ally c −1/′ ,y c ′ ,y c +1/′ ∈Y.
5 citations
TL;DR: It is revealed that a nerve net excellent in pattern separating function is obtained when the stochastic parameters are selected properly and enhanced by controlling the firing rate of the second layer to a small value.
Abstract: In this paper, we derive a theory for investigating the pattern separating function in the nerve net. Then, we consider some effects of the stochastic parameters constructing the nerve net, firing rates of the second layer and input patterns on the pattern separating function through the theory. As a result, we reveal that a nerve net excellent in pattern separating function is obtained when the stochastic parameters are selected properly. We also show that the pattern separating function is enhanced by controlling the firing rate of the second layer to a small value. Furthermore, the input patterns are separated largely when the firing rates of them are large.
4 citations
TL;DR: A new attribute-based Learning algorithm GS, utilizing cycles of generalization and specialization, is introduced, which is simple, efficient and easy to implement.
Abstract: A new attribute-based Learning algorithm GS, utilizing cycles of generalization and specialization, is introduced. GS is simple, efficient and easy to implement. A comparison with existing algorithms AQ11 and ID3 shows that GS has some advantages over them.
4 citations
TL;DR: A difference method for computing vertices of the polygon inscribed in a conic section can be applied to computer graphic package or to plotter to generate conic sections and its form remains invariant under homogeneous affine transformations.
Abstract: This paper presents a difference method for computing vertices of the polygon inscribed in a conic section. It can be applied to computer graphic package or to plotter to generate conic sections. This method is simpler and more efficient than traditional ones, and its form remains invariant under homogeneous affine transformations. The stability of the method and its relationship with its matrix counterpart are also discussed.
4 citations
TL;DR: CEMS is a solid modelling system used for the fields of spatial planning, architectural plan, CAD/CAM for machining, structure analysis, but it is also fundamental for developing the practical system of simulation, computer vision, robotics and so on.
Abstract: GEMS is a solid modelling system running on CAD workstation or 32 bits microcomputer with graphics terminal. Complex solid objects are built from transformation and set operations upon box, cylinder, cone, sphere, torus, sweeping object and other primitives. CEMS has explicit features, e. g. hierarchical modular structure, interactive user interface, intuitional input, screen menu driven by data table, defining and instancing object in network construction, storage bases on CSG (Constructive Solid Geometry) and BReps (Boundary Representations), regularized set operations, transformation pipeline consistent with PHIGS graphics standard, various transformations, cutting object with two sections in arbitrary angle, patrolling to view the inside of an object, mapping patterns onto surfaces of an object etc.. Not only can it be used for the fields of spatial planning, architectural plan, CAD/CAM for machining, structure analysis, but it is also fundamental for developing the practical system of simulation, computer vision, robotics and so on.
4 citations
TL;DR: It is proved that anyN degree Bezier triangular patch can be turned into a part ofN×N degree bezier rectangular one; anyN×M degree BeZier rectangular patch can been converted into twoN+M degree beZier triangular patches.
Abstract: This paper proves that anyN degree Bezier triangular patch can be turned into a part ofN×N degree Bezier rectangular one; anyN×M degree Bezier rectangular patch can be converted into twoN+M degree Bezier triangular patches. Some simple and efficient algorithms have also been given.
3 citations
TL;DR: Based on Batcher’s principle of bitonic merging, the bitonic selection network is proposed, and the varying rule of the pivots in all successive ranks of the network is repeals through the observation to the data transfer property in the network.
Abstract: The so-called (m, n) selection problem is defined as the selection of them smallest (or largest) numbers fromn given numbers (n>m). Solving this problem in parallel mode has been successful on the networks, but it is seldom studied on the multiprocessor systems. This paper first, based on Batcher’s principle of bitonic merging, proposes the bitonic selection network. Then it repeals the varying rule of the pivots in all successive ranks of the network through our observation to the data transfer property in the network. Finally, according to this rule, the parallel selection algorithm with running timeO (lognlogm)1) onn processors is presented.
TL;DR: A logic design automation system (LODAS) implemented on APOLLO DOMAIN workstation that can generate VLSI logic diagram from the hardware description and translates the functional description into register transfer equations, Boolean equations and state transition equations automatically.
Abstract: This paper discusses a logic design automation system (LODAS) implemented on APOLLO DOMAIN workstation. LODAS can generate VLSI logic diagram from the hardware description. The system accepts many kinds of input description such as DDL or AHPL language description, functional array (truth table), covering array, Boolean equations or state transition tables. The system first simulates the functional description to verify the functional description of the system designed, then the translator translates the functional description into register transfer equations, Boolean equations and state transition equations automatically. Logic synthesis software partitions the translation result into a series of blocks, and transforms every small block into a multi-level NAND/NOR network according to the fan-in and fan-out restriction.
TL;DR: A tableau—like decision procedure for network satisfiability in temporal—spatial logic is presented and used in the synthesis of communicating skeletons of CSP—like programs by explicitly introducing communication network in the logic system.
Abstract: Temporal—spatial logic is a propositional logic with temporal and spatial modalities asserting on a network. In this paper, a tableau—like decision procedure for network satisfiability in that logic is presented and used in the synthesis of communicating skeletons of CSP—like programs. By explicitly introducing communication network in the logic system, our approach has some advantages over the temporal one.
TL;DR: It is concluded that although it is believed that a hypercube is generally superior to hyper-rings in performance, this is not always the case, particularly for locally constrained applications, where communications occur mostly among neighboring nodes.
Abstract: The well-known torus and its variants, which we call hyper-rings, as well as hypercube architectures are further studied and evaluated as interconnection networks for multicomputers. Comparisons are made among hyper-rings and between hyper-ring and hypercube networks under different communication patterns. It is concluded that although it is believed that a hypercube is generally superior to hyper-rings in performance, this is not always the case, particularly for locally constrained applications, where communications occur mostly among neighboring nodes.
TL;DR: Various factors which have impact on the manager’s decision making, the details of the program using the GURU environment, and the major roles of the human experts and the knowledge engineer are described.
Abstract: In this paper, an expert system for estimating capital requirement is briefly illustrated, including the essential construction of the simulation model. Then various factors which have impact on the manager’s decision making, the details of the program using the GURU environment, and the major roles of the human experts and the knowledge engineer are described.
TL;DR: With the analysis of the speedup of a concurrent non-DO loop, a simple and useful approximate formula is deduced, which is just the mathematical limit of speedup when the number of iterations is approaching infinity.
Abstract: In this paper, we present an approximate formula for calculating the speedup of a concurrent non-DO loop The execution pattern of a concurrent non-DO loop is analyzed As a result, the optimal concurrent step for a non-DO loop is presented and proved With the analysis of the speedup of a concurrent non-DO loop, a simple and useful approximate formula is deduced, which is just the mathematical limit of speedup when the number of iterations is approaching infinity
TL;DR: A monolingual methodology and an embryo of MONOL which uses a uniform scheme to describe software development process is presented and it is shown that software development is considered as stepwise abstract-implementation process in software like cycle.
Abstract: The software development is considered as stepwise abstract-implementation process in software like cycle. This paper presents a monolingual methodology and an embryo of MONOL which uses a uniform scheme to describe software development process.
TL;DR: This paper shows how static modifications of Warren code can be achieved by adding a few instructions and a little extra information to the code.
Abstract: The Warren Abstract Machine is an efficient execution model for Prolog, which has become the basis of many high performance Prolog systems. However, little support for the implementation of the non-logical components of Prolog is provided in the WAM. The original Warren code is not modifiable. In this paper, we show how static modifications of Warren code can be achieved by adding a few instructions and a little extra information to the code. The implementation of the code manager is discussed. Algorithms for some basic operations are given.
TL;DR: Wu et al. as mentioned in this paper described Wu as an eminent computer scientist, logician and philosopher who epitomized ancient and modern Chinese culture, and they found that Wu introduced into Chinese scholarly life very commendable features.
Abstract: Professor Wu Yunzeng epitomized ancient and modern Chinese culture. Professor Wu Yunzeng was an eminent computer scientist, logician and philosopher. Professor Wu Yunzeng won innumerable friends for China. We are many, in the West, who were very fond of him. His visit to Denmark made positive, and lasting impressions. We found, also, that Professor Wu Yunzeng introduced into Chinese scholarly life very commendable features. The way he guided his students and colleagues was an example to be followed by us all.
TL;DR: A multi-class macro-scheduler that periodically determines the number of jobs from each class that should be activated to minimize a weighted sum of the mean system residence time without saturating the system.
Abstract: A multi-class macro-scheduler is described in this paper. The scheduler periodically determines the number of jobs from each class that should be activated to minimize a weighted sum of the mean system residence time without saturating the system. The computation is based on the estimated system workload in the next interval. Thus it is adaptive to workload variation. The service provided to each class (specifically, the mean response time) may be adjusted by changing the weight associated with the job class.
TL;DR: The E-R data model of SIB and its integration with Data Flow Diagram tool are emphatically described and the functions, structures, and a Data flow diagram tool are introduced.
Abstract: Software information base is the main technique of the integration of software engineering environment. Data flow diagram tool is an important software tool to support software requirement analysis phase. This article introduces the functions, structures of a Software Information Base (SIB), and a Data Flow Diagram tool first. The E-R data model of SIB and its integration with Data Flow Diagram tool are emphatically described.
TL;DR: This paper proposes a new graph model for multibus multiprocessor system based on the link representation of cut set of the hypergraph, ring sum and its algebraic properties, and can directly calculate the degrees of bus-fault-tolerance and processor-faults for any multibus multi-processor system.
Abstract: This paper proposes a new graph model for multibus multiprocessor system. based on the link representation of cut set of the hypergraph, ring sum and its algebraic properties, we can directly calculate the degrees of bus-fault-tolerance and processor-fault-tolerance for any multibus multiprocessor system. Algorithms are listed and all the theorems and proofs are stated.
TL;DR: A polynomial algorithm, called Reduction, is presented to discover natural laws by analysing a set of experimental data, instead of a heuristic exploration which, when adopted in BACON, can only lead to rediscovering simple laws.
Abstract: A polynomial algorithm, called Reduction, is presented to discover natural laws by analysing a set of experimental data, instead of a heuristic exploration which, when adopted in BACON, can only lead to rediscovering simple laws. A complex law with multiple variables involved can be discovered by reducing it to a binary law involving only two variables. Discovering a binary law is accomplished by a generate and test search. This search is so efficient that it does not need any backtracking and is able to cover most of possible laws. A reduction-based discovery system, called DISCOVER 2. 0 was developed with a flexible knowledge base and an ability of dealing with imperfect data. The system has been verified to be valid computationally practically, and theoretically, by discovering a great number of complex laws, and can be also viewed as a learning engine embodied in any intelligent systems to improve their performance by obtaining a general rule from the accumulated data.
TL;DR: The purpose of this work is to explore and analyse possibilities to reduce the required memory space through elimination of superfluous grammar rules created during the process of recognition.
Abstract: With the high developed hardware from the PC’s today, there arise possibilities to implement programming environments on such kind of computers. To reduce the amount of calculation time and required memory space from implemented algorithms, new optimization approaches in the algorithm design are demanded. The purpose of this work is to explore and analyse possibilities to reduce the required memory space through elimination of superfluous grammar rules created during the process of recognition.
TL;DR: In this paper the conflict between the null constraints and the set of functional dependencies is defined and some rules for determining the conflicts and a method for processing the conflicts are obtained.
Abstract: In this paper the conflict between the null constraints and the set of functional dependencies is defined. Some rules for determining the conflicts and a method for processing the conflicts are obtained.
TL;DR: This is an attempt to use continous algebras to describe the semantics of CSP—continuity being used to solve recursive definitions of processes as infinite objects.
Abstract: This is an attempt to use continous algebras to describe the semantics of CSP—continuity being used to solve recursive definitions of processes as infinite objects. By so doing, we combine the algebraic specifications of abstract data types with CSP to make up 2 new language, which is recommended as a promising candidate of specification language for designing and developing communicating systems.
TL;DR: The system can transform software functional specifications written in a graphical specification language GSPEC to executable programs automatically and the equivalence between a specification and its corresponding program can be guaranteed by the system, and the correctness of the specification can also be validated.
Abstract: This paper describes the design and implementation of an experimental software automation system (NDAUTO) By combining the transformational and procedural approaches in software automation, the system can transform software functional specifications written in a graphical specification language GSPEC to executable programs automatically The equivalence between a specification and its corresponding program can be guaranteed by the system, and the correctness of the specification can also be validated The main new points of the work lie in the design of the specification language, the transformation mechanism and the correctness validation of the specification
TL;DR: The file management algorithm with its implicit redundancy allows software fault-tolerant technique and not only guarantees the consistency and integrity of the shared file, but also supports optimal parallelism.
Abstract: A concurrent control with independent processes from simultaneous access to a critical section is discussed for the case where there are two distinct classes of processes known as readers and writers. The readers can share the file with one another, but the interleaved exccution with readers and writers may produce undesirable confliets. The file management algorithm proposed in this paper is the activity of avoiding these results. This algorithm not only guarantees the consistency and integrity of the shared file, but also supports optimal parallelism. The concept of dynamic virtual queue is introduced and serves the foundation for this algorithm. Our algorithm with its implicit redundancy allows software fault-tolerant technique.
TL;DR: A window system, named NITWS, is presented, which features satisfactory performance and a new system architecture and a systematic way of development of the window system is presented.
Abstract: A window system, named NITWS, is presented, which features satisfactory performance and a new system architecture. A systematic way of development of the window system is also presented.
TL;DR: The result of this paper is: graph τ2 (G) is 2-edge-connected as |V(G) ≥3, at the same time, the best lower bounds about vertex number and minimum degree of graphτ2(G).
Abstract: Because of the widespread applications of tree and tree graph in computer science, we are interested in studying the tree graph. M. Farber, B. Richter and H. Shank in [1] showed that the graph τ2 (G) is connected. The result of this paper is: graph τ2(G) is 2-edge-connected as |V(G) ≥3, at the same time, we will show the best lower bounds about vertex number and minimum degree of graph τ2(G).