1994, 5(3):1-11.
Abstract:In light of the deficiency of the original model of Probabilistic Logic Neuron (PLN)network, this paper presents a revised model and shows that its robustness and speed are improved. The authors also indicate that the original model of PLN network,the Hopfield's learning rule and the evolution rule of Boltzman machine are special cases of the new model. Finally, the application of the generalized PLN network to associative memory is given. The computer simulation results show that robustness and convergence speed of the new model are much better than the original one.
1994, 5(3):12-21.
Abstract:his paper considers the problem of sorting m×n maze (m>1, n>1 ) and proves an sufficient and necessary condition that anoriginal state can be changed into specified-target state in finite step for m×u maze, then presents a sorting algorithm for m×n maze, its time complexity is O(mn (m+n)), its space complexity is O (mn), finaly, this paper gives a lower bound and shows that the algorithm is optimal where m=n.
Yang Guogui; , Wang Sheng; , Zhang Huoju a , Quanyuan
1994, 5(3):22-28.
Abstract:Main Memory Data Base Management System makes the best use of current hardware and advanced architecture benifits, eg., the emerging large volume memory,massive parallel computer architecture, Client/Server model and network computer. Storing its data in main physical memory to get very high speed access, MMDB validates its use for some on -line or real time applications. Coventional database systems are optimized for the particular characteristics of disk storage mechanisms. MMDB, on the other hand, use different optimizations to structure and organize data, as well as to make it reliable.The major techniques and their usage in some designed or implemented MMDB systems will be surveyed in this paper.
1994, 5(3):29-36.
Abstract:n this paper, general AND/OR graphs of a new type are defined on triangle norm. The backward heuristic search algorithm BHAO for general AND/OR graphs is presented, in terms of newly-defined heuristic function h(n,x) and the principle that every subtree of the optimum solution tree is also optimum solution one. The admissibility of algorithm BHAO is proved. Based on two newly - defined monotone restrictions for heuristic function h (n, x), the characteristic of monotone restrictions for algorithm BHAO is also investigated, and the comparison between two BHAO algorithms is also discussed.
1994, 5(3):37-42.
Abstract:Closure dependencies, or CDs, are introduced to capture formally transitive closure relationships between attributes of a relational schema. The problem of a finite complete axiomatization for the interaction of CDs with functional dependencies (FDs) is investigated, leading to a negative result for the existence of a k-ary axiomatization for CDs and FDs taken together, in which every rule is k-ary for some fixed k.
1994, 5(3):43-48.
Abstract:As a new generation of parallel computer,data flow computer has developed very quickly, but because of its own deficiency,it is very difficult to build dataflow computers for commercial use. In this paper, by analysing the operating words and non-operating words of computation, modifying the firing rule of traditional dataflow model, introducing variables in the model, they will define a Coarse granularlty Data Flow Model CDFM.
Jin Hai; , Li Zhiyong; , Zhang Yunzhen; , Yang Fumin , Yin Hai
1994, 5(3):49-54.
Abstract:ELNF calculus is a functional/logic calculus system which based on LNF calculus by extending it to include logic programming ability. It is the base of the functional/logic programming language RFUNLOG. This paper introduces the interpreter implementation technique of ELNF calculus, include data structure, system structure and the design idea of each modular. At last, the run time of several typical programs under this interpreter system is also presented.
1994, 5(3):55-64.
Abstract:This paper discusses the hierarchies of some classes of recursive functions. A simple equivalent definition of original Grzegorczyk's hierarchy is presented at first. Then the authors define by the generalization of Ackermann's function a sequence of recursive functions {A_{ｎ}｝_{ｎ∈ω}, based on which they define hierarchy, {Z_{ｎ}｝_{ｎ∈ω}(the Z-hierarchy)of a class of recursive functions which is much larger than the class of primitive recursive functions.The first level Z_{０} of this hierarchy is just the class of primitive recursive functions.For all n, Z_{n+1} contains the universal function of its predecessor Z_{n}. A refinement {Z_{ｎ}^{i}｝_{ｎ,i∈ω}of Z-hierarchy is defined at last by the natural hierarchy of each Z_{n}. The refinement on Z_{O} is same as the original Grzegorczyk's hierarchy. This shows that their Z-hierarchy and its refinement are really a natural extension of Grzegorczyk's hierarchy.