WEN Dong-chan , WANG Dingxing , ZHANG ning
Abstract:COOL(concurrent object-oriented language) is a kind of highly efficient concurrent programming language.In this paper,a concurrent object model(concurrent C++,CCPP)and its language are presented.In this model,all objects are concurrent,and they communicate through asynchronous message sending.Concurrent objects are svnchronized using a wait-when-necessary policy,and the synchronization constrains among concurrent threads within an object are described by path expressions.CCPP is an extension of C++,implemented by a precompiler.CCPP allows sequential/concurrent rode retuse.
Abstract:The BBP -PVM is a dialect of PVM for a scalable parallel computer cluster system that based on Bus Bridge Protocol. The inter machine communication protocol the BBP -PVM is called BBP -MPL, the message passing layer protocol of the bus bridge protocol. The BBP -PVM is compatible with the original PVM version 3.3.4 and above, but it has a more effective communication mechanism than the original version.
JIN Li-jie , ZHANG Jian-jun , LI Wei
Abstract:The BBP_PVM is a dialect of PVM for a scalable parallel computer cluster system that based on Bus-Bridge-Protoc01.The inter-machine communication protocol the BBP-PVM is called BBP-MPL,the message passing layer protocol of the bus bridge pro-toc01.The BBP-PVM is compatible with the original PVM version 3.3.4 and above,but it has a more effective communication mechanism than the original version.
Abstract:In this paper,the core of condition attributes with respect to decision attributes in rough sets theory is used for selection of attributes in multivariate tests.A new concept of generalization of one equivalence relation with respect to another one is introduced and used for construction of multivariate tests.The comparison between multi-variate decision tree and univariate decision tree is done through an example.The results show that the former is more simple than the latter.The basic comparison among several multivariate decision trees iS fulfilled.
Abstract:In natural language processing,temporal is an important situation.In order to understand temporal situation in the text,this paper presents a hierarchical temporal semantic structure independent of the surface description in sentences.The surface semantic structure formalizes the description of temporal situation;The deep semantic structure describes the dynamic attributes and the existing characteristic of the event in a given temporal situation.This temporal semantic representation model allows to express Doint in time as well as time intervals.It provides means to indicate time basic point with respect to“an absolute physical time”, as well as time basic point relatively to the speaker’s time.A universal calculation method of the temporal semantics provided in this paper localizes the temporal entities in all languages into the temporal axis.This enables to interpret combinations of verb tense, temporal adverbs and connective.In the mean-while.within this model some constructs enable to express tense,aspectual properties Of verbs as well as the semantic calculation of temporal relationship among events in the text.
ZHANG Chendong , CHEN Huowang , LIU Fenqi
Abstract:In order that the probabilistic logic reasoning under uncertainty can be used for 1arge scale knowledge-base,this paper presents a clustering-algorithm for decomposi-tion of probabilistic logic formula set based on the general consistence assigning algorithm for Drobabilistic logic and the experience of developing the knowledge-base in an practical expert system. It ensures that the united-model of Dantzig-Wolfe decomposition can be used for probabilistic logic reasoning on probabilistic logic knowledge-base with different background,provided the formula set hold certain hierarchical structure.Experiments show that the algorithm performs successfully on instances with dozens of variables and clauses.
ZHANG Huajie , QIANG Fangzuo , YUAN Guobin
Abstract:Through the research on COBWEB and CLASSIT,this paper presents a new representation method of numeric attributes.This method represents numeric attributes based on its value distribution.The relative problems and properties of clustering in this representation are discussed in detail.This paper also proposes a clustering evaluation function which can deal with both symbolic attributes and numeric attributes uniformly.A concept formation system CFLS(concept formation learning system)has been implemented and applied to geological classification area.CFLS is also introduced in this paper.
DONG Sheqin , GAO Guoan , CHEN Shuang
Abstract:Applying VHDL to support the design of embedded system is a way to extend VHDL to support system level design.In this paper,the authors observe several typical specification languages which supporting system level design,all the languages integrated VHDL into their methodologies.Based on the observation,the authors summarize the basic key points of a specification language which supporting system level design,and point out that combining formal methods with VHDL can produce an effective design assis-tant tool.
Abstract:This paper proposes an algorithm for modeling and recovery of three dimensional hierarchical branching arborescent patterns. The algorithm can estimate the structure parameters of tree images using model prediction and recover the geometrical properties of 3D patterns of these plants from a single image.
ZHANG Lenian , ZHOU Laishui , ZHOU Rurong
Abstract:By researching on NURBS modelling method, the authors have successfully realized a new modeling function in NURBS bi skinning surface via complex curves on SuperMan CAD/CAM integrated system, and a CAD/CAM system which is full based on NURBS method is set up. It is proved by the various examples coming from engineering application that the new NURBS method is a flexible and effective method, which is suitable for production designing and manufaction with complex external forms.
MA Jun , Kazuo Iwama , MA Shaohan
Abstract:Let G=(V,E),|V|=n,|E|=m, be an undirected simple graph, NC algorithms are given for following problems: (1) finding a shortest circuit in G ; (2) finding a shortest circuit of even (odd) length in G ; and (3) finding a C k , k =3,4, where C k is the circuit in G of k edges.