Abstract:Pointer is an important data type in most programming languages.It can make programs more efficient and more elegant.Unfortunately,this important concept is always notorious for its timelessness.Until now,no proper way to formalize it in temporal logic language has been found.XYZ/E is a temporal logic system as well as a programming language.It can represent almost every kind of significant features in conventional imperative languages.This paper is devoted to the representation of pointer in language XYZ/E and the verification of XYZ/SE programs with pointers.

Abstract:An investigation into the relationship between argumentation and disjunctive logic programs with explicit negation (EDLP) is conducted.By employing the coherence principle,an argumentation-theoretic framework for EDLP is presented,in which various forms of argumentation can be performed.In particular,a skeptical semantics Acc is introduced in a natural way.To provide a more suitable form of argumentation,a less skeptical semantics Mod is also defined which naturally extends the well-founded model.

Abstract:Liveness and safeness are important behavioral properties of nets (systems).Many powerful results have been derived for some subclasses of Place/Transition nets (systems).The aim of this paper is to draw a general perspective of the liveness and safeness for a subclass with Extended Free Choice net-like underlying graph but allowing weights:Weighted Extended Free Choice nets (WEFC nets).First,a brief and intuitive proof of liveness equivalent condition for WEFC nets is given.Then,for safe nets,a sufficient and necessary condition is presented.

Abstract:The study of automatic abstracting is a vital and practical information processing task in natural language processing,and becomes an important problem in domains such as Internet information retrieval.An approach based on corpus proposed by this paper provides an integration of the advantages of linguistic analysis based methods and those based on statistics.In essence,the basic idea of corpus-based method is at the expense of the cost of analysis outside the system to gain the efficiency of the algorithm inside the system.The algorithm given by the paper implements both keywording and abstracting while the former is based on a hierarchical dictionary and the latter on the corpus.

Abstract:This paper discusses and summarizes the key technologies,current status and developing trends of agent design and construction from both theory and practice views.The topics are as follows:(1) the properties,representation and reasoning of intelligent agent,(2) the joint-intention,negotiation and planning of multi-agent system,and (3) agent-oriented programming (AOP).The problems and challenges faced by the agent technology are also discussed.

Abstract:Furry surface modeling and rendering technique is a difficult problem in computer graphics.It is very hard to obtain satisfactory results for hairstyles through traditional modeling and rendering techniques,because of the fine shapes and the huge amount of human hairs.The concept of curly volumetric textures is first presented and expressed for hairs in this paper.With reference to the process of barber's hairstyle making,scalp surface is specially processed,based on the shape of human head,a simple modeling method is given for hairstyles.Then the head surface is processed and converted to a polyhedron of quadrilaterals of neighboring relationships,and the simple modeling method is modified and developed with interpolation method.Some examples of hairstyle modeling are given.The images of hairstyles are rendered with comparatively realistic effects at last.

Abstract:Evolving information filtering method presented in this paper describes user's information needs from multi-aspects simultaneously,and improves system filtering performance through a process like natural selection.Inspired by object-oriented programming language,this method also introduces concepts such as inherit and classtree,which make filtering systems easy to use.This method can shorten training time,improve filtering precision,and reduce the relevance between filtering results and training sequence.

Abstract:For a precise dataflow analysis within the framework of the computation function model,the logical relationship of branch conditions is represented as the coverage relationship of regions.In this paper,the authors discuss how to represent,compute and propagate the Ω region,Φ region of the conditional reference.Meanwhile,the methods of resolving the nondeterminism caused by conditional branch statements are also presented in order to get more precise dataflow information.

Abstract:Highest cumulative reward (HCR) is a rule for developing conventions in multi-agent systems.But it will keep system maintaining an emerged convention from evolving to more rational ones while conditions of system are developing.In this paper,the notion of conventions is defined,and the stability of them is analyzed.Furthermore,two rules called highest average reward (HAR) and highest recent reward (HRR) are introduced.They both guarantee the evolving process of stable conventions,and the convergence rate of them is better than that of HCR.

Abstract:In the previous work,some segments of secure electronic transactions (SET) are verified,and some potential problems in SET are also discussed.Based on these,all transactions in SET are strictly logically verified in this paper.Though this formal logic verification,certain problems are found to do exist in SET.Solutions to these problems are also discussed.

Abstract:The authors simulated the movement of willow's end branch blown by wind.Clearly this is not natural and real.A tree moves as a whole.Now an algorithm named depth-first numerical integral tree traversal algorithm is given.The algorithm can generate the harmonic and consistent movement of a tree,thus animates the dynamic pose of tree very well.It can also be used to animate other kinds of trees.Moreover,the authors analyzed the obstruction effect of branches and leaves reacting on wind,which including no obstruction,hole,aperture and penetration.Based on the principle of Z-buffer,these effects are processed,and the results are satisfied.

Abstract:In this paper,based on multi-agent,a task-oriented self-organization architecture IRASO (intelligent robotic architecture with self-organization) is proposed.Using the coordination model “event-situation-state”,it can adjust the collaboration of Agents to respond to the change of environment.The computer system which realizes the architecture is discussed in detail.System characteristic is analyzed through simulation.

Abstract:A fast method for face recognition based on eigencurves is presented in this paper.First all faces with different poses and sizes are located and normalized.Then several kinds of eigencurves are built to describe characteristics of faces.And finally,the dominant characteristics are extracted which are composed of representative vectors of faces through analyzing the eigencurves using Fourier describer.This method has been tested on 1300 facial images and shown a good performance of speed and accuracy,and the result also shows it is robust for various head poses and expressions.

Abstract:The maximum entropy approach is one of the most important threshold selection methods in image processing.Many researchers avoid the problem of computationally prohibitive when the maximum entropy criterion is applied to multi-level threshold selection.This paper proposes to deal with this problem using ICM (iterated conditional modes) algorithm.Comparing the ICM algorithm with the simulated annealing algorithm proposed by H.D.Cheng et al,the experimental results show the effectiveness of ICM algorithm fully.

Abstract:Based on the shared-nothing construction,the various factors which may affect the query responding time of parallel join algorithms are analyzed.A cost analysis model is proposed to calculate the average task execution time on each processor and the total query responding time.The execution efficiencies of different parallel Hash algorithms based on the variation of memory are compared.The presented model and the analysis method have provided a feasible way to evaluate and choose parallel join algorithms.

Abstract:According to Ada 95 reference manual(E),some concepts and design ideas implemented in distributed Ada Language system are introduced in the paper,and the detailed implementation of the partition communication subsystem is given.With the interfaces of partition communication subsystem and some pre-processings,the remote procedure calls in distributed Ada language system are implemented.Finally,an example is given.

Abstract:Based on the thought of quasiphysical and quasisociological,the Solar algorithm is an efficient algorithm for solving SAT problems.It is proved by the theoretical analysis and experimental results that the algorithm is naturally suitable for parallel computing.The efficiency of solving SAT problems can be greatly improved by taking a simple method that parallelizes the Solar algorithm.

Abstract:The structure and allocation of the register file is a key factor affecting the performance of software pipelining.To support software pipelining of nested loops,a novel register file,partly-shared leaping pipeline register file,is presented and its allocation is discussed.The register file effectively addresses the special problems in software pipelining nested loops,i.e.,intra- and inter-level register renaming,and iteration discontinuity.Three allocation styles are designed for flexible application:single,pipeline and groupe register styles.Pipeline registers effectively supports intra-level register renaming with deterministic lifetime.A variable,which generally has deterministic lifetime,may have non-deterministic lifetime in software pipelining nested loops.Group registers address such a problem.To make a paused iteration continue execution again,a leaping operation provides quick data transmission between registers.The engineering practice has proved the efficiency of the structure and its allocation method.

Abstract:In this paper,a temporal logic language XYZ/E is used to formalize several common architectural styles.Before the styles described,the relationship among them is analyzed based on the relationships among components and connectors,and then the complete formal descriptions of the architectural styles are derived from the compositions of specific components and connectors.

Abstract:Simulated annealing and multigroup parallel evolution are two helpful methods which can improve the performance of genetic algorithm.These two ideas are well combined in this paper,and a new algorithm is derived,that is the multigroup parallel genetic algorithm based on simulated annealing method.Simulation results show that this method not only quickens the computation,but also improves the convergence efficiency,thus produces more satisfactory results.

Abstract:Communication problem between groups is an important problem which must be taken into account in the research of Group Decision Support System (GDSS).At present,the implementation of group communication is mainly using universal GroupWare product.But because the coordinate communication of the GroupWare product is slow,not flexible and not convenient for system integration,it's not fit for the coordinate communication of emergency GDSS.In order to find a way to accelerate the speed of the coordinate communication of emergency GDSS,the authors study a kind of combination GDSS network communication structure,and then develop a new protocol based on TCP/IP protocol-GDSS communication protocol (GDSSTP),after analyzing the GDSS coordinate communication function.At the same time,the authors give out a solution to process GDSS network concurrent request problem.The implementation of GDSS communication component with OOP (object-oriented programming) is also described.