Histogram-based methods are widely used in computer vision and there are many histogram comparison algorithms to increase the performance of information retrieval.However,histogram comparison algorithms for 3D model retrieval are seldom studied.Therefore,we use histogram of oriented gradients to extract features of 3D models and then propose a histogram comparison algorithm for 3D model retrieval.The experimental results show that the histogram comparison algorithm does improve the retrieval performance of some classes of models from Princeton Shape Benchmark.

Bioinformatics research requires the use of advanced computational tools to deal with a large number of biological vague and uncertain data. With the advantages of low cost, solving complex search problems fast, accurately and reasonably, swarm intelligence optimization algorithms become a group of heuristic algorithms which can be used to get a better solution to the bioinformatics problems. An overview of swarm intelligence optimization algorithms and their applications in bioinformatics are provided in this paper.

The decays J/psi -> p (p) over bar and J/psi -> n (n) over bar have been investigated with a sample of 225.2 x 10(6) J/psi events collected with the BESIII detector at the BEPCII e(+)e(-) collider. The branching fractions are determined to be B(J/psi -> p (p) over bar) = (2.112 +/- 0.004 +/- 0.031 x 10(-3) and B(J/psi -> n (n) over bar) =(2.07 +/- 0.01 +/- 0.17) x 10(-3). Distributions of the angle theta between the proton or antineutron and the beam direction are well described by the form 1 + alpha cos(2)theta, and we find alpha = 0.595 +/- 0.012 +/- 0.015 for J/psi -> p (p) over bar and alpha = 0.50 +/- 0.04 +/- 0.21 for J/psi -> n (n) over bar. Our branching- fraction results suggest a large phase angle between the strong and electromagnetic amplitudes describing the J/psi -> N (N) over bar decay.

To explore Phylogenetic relationship with the rbcL protein sequences about 25 species of Dendrobium plants based on the mathematical model of the biological classification and biological evolution.Phylogenetic relationships among species in Dendrobium were estimated by neighbor-joining(NJ) and Unweighted Pair-Group Method using an arithmetic Average(UPGMA) methods to construct similar rcbL trees using matlab7.1;by Maximum Parsimony(MP) method to construct similar rcbL trees using MEGA4.1.This paper offers protein sequence evidence for the study of Dendrobium phylogeny.

A discrete particle swarm optimization algorithm is designed to tackle the Traveling Salesman Problem.Based on the characteristics of the problem at hand and discrete variable,this paper redefines particle's position,velocity and their operation rules.In order to restrain premature stagnation,individual diversity of particle and micro-diversity of particle swarm are defined.A repulsion operator is designed to keep the diversity of particle swarm,and an efficient learning operator is defined to improve the algorithm's intensification ability.Using those operators,the proposed algorithm can get good balance between exploration and exploitation.The simulation results comparing with typical algorithms from the literature show that it can produce good results.

Coalition formation is an important form of cooperation in multiagent systems.A series of frameworks for coalition formation have been designed,to some extent,which solves many important questions,such as the maximization of the sum of values of all coalitions,task allocation,combinatorial auctions,and so on.In their systems,the agents which form coalition are driven by interests or accomplishing tasks,which is helpless in supervising the participators in the system.Therefore,investigating the process of coalition formation from the aspect of restriction is necessary.We analyse the restriction problem in coalition formation,and then use proposition logic to describe the restriction of agents.Firstly,we design the coalition preference language(CPL),and describe its semantics.Secondly,we present some properties of CPL.Finally,we compare coalition formation under dynamic restrictions with some familiar frameworks of coalition formation,and educe the advantages of ours.

In this article, we have two parts. In the first part, we are concerned with the locally Holder continuity of quasi-minima of the following integral functionalintegral(Omega) f(x, u, Du)dx, (1)where Omega is an open subset of Euclidean N-space (N >= 3), u : Omega -> R, the Caratheodory function f satisfies the critical Sobolev exponent growth conditionvertical bar Du vertical bar(p) - vertical bar u vertical bar(p)* - a(x) <= f(x, u, Du) <= L(vertical bar Du vertical bar(p) + vertical bar u vertical bar(p)* + a(x)), (2)where L >= 1, 1 < p < N, p* = Np/N - p, and a(x) is a nonnegative function that lies in a suitable L-p space. In the second part, we study the locally Holder continuity of omega-minima of (1). Our method is to compare the omega-minima of (1) with the minima of corresponding function determined by its critical Sobolev exponent growth condition. Finally, we obtain the regularity by Ekeland's variational principal.

Temporal logics are often adopted as basic tools to specifying mental states such as belief and goal of agents. Although there are works on non-monotonic extension of linear temporal logic (LTL) and branching time temporal logic (CTL), the non-monotonic extension of alternating-time temporal logic (ATL) which is an important kind of multi-agent cooperation logics has not been discussed yet in literature. To solve this problem, this paper proposed non-monotonic alternating-time temporal logic with belief and goal, namely N-ATL-BG, to facilitate the non-monotonic reasoning of mental states of agents. The semantic model, syntax and semantics of this new logic are developed. A model checking algorithm which can be finished in polynomial time is proposed for this new logic. Examples are given to show its usage.

农林院校担负着培养农林人才的重任,其非计算机专业的计算机基础课教学是十分重要的,它对把握信息社会时代脉搏,培养合格人才具有十分重要的作用。教学管理是教学质量健康发展的重要保证。

Constructing intelligent advisory information system for bamboo’s afforestation can provide information service for bamboo's reforestation.How to build an intelligent advisory information system for bamboo reforestation was discussed,and key technologies adopted by construction scheme were analyzed,as well as three important models and an important algorithm of the system.At last,a weak-prototype with its evaluation was proposed for user reference.

本论文研究的基于学习流的网络学习平台是以建构主义学习理论为理论基础的,基于计算机信息处理技术,计算机网络资源共享技术和多媒体信息技术的新型远程教育网络教学支撑平台。此网络学习平台能清晰地表示知识点之间的关联关系,并且能有效地监控整个学习过程以及能智能分析最后的学习效果,最后根据个人的学习效果来评估整个学习群体的学习效果,是当前教育领域的有意义的尝试。

Based on the studying flow theory,this paper adopts the XML norm to realize the studying flow model.Since tree space has many characteristics such as clear layers relation,extensive system,multiple located style,new technology norm and easy realization,complex knowledge system is mapped on it to build study flow model.XML description is presented.This built model provides a new approach for the computer control and management of teaching information network.

Autonomous obstacle avoidance technology is the best way to embody the feature of robot strong intelligence in intelligent robot navigation system. In order to solve the problem of autonomous obstacle avoidance of mobile robot, an intelligent model is used in this paper. Adopting multi-sensor data fusion technology and obstacle avoidance algorithm based on fuzzy control, a design of intelligent mobile robot obstacle avoidance system based on S3C2410X is described. Its perceptual system is composed of nine ultrasonic sensors to detect the surrounding environment from different angles, enhancing the reliability of the system on the based of redundant data between sensors, and expanding the performance of individual sensors with its complementary data. The S3C2410X processor receives information from perceptual system to calculate the exact location of obstructions to plan a better obstacle avoidance path by rational fuzzy control reasoning and defuzzification method. The paper focused on the analysis of the difference between the simulation results and the actual effects. The analysis shows that: the robot can avoid obstacles with a better security path to solve the problems of mobile robot intelligent obstacle avoidance. Through the comparison results, we can also find that the design of mobile avoidance obstacle system has a good navigation effect s because of its advanced characteristics of adaptability, stability and robustness.

With the increased attention on simulations of trees and forest ecosystem, the visualization of plants quickly becomes the combinative development trend of Graphics and forestry. A number of methods have been proposed for generating trees, But these methods could not accurately simulate the appearance changes in the growth process of trees. The paper presents an interactively parameterized modeling method based on the morphological characters of Chinese fir and the results testify our method can simulate Chinese fir well.

This paper presented that the regular expressions' optimal NFA should be first determined when we used them for biological sequence indexing,and then turned into the corresponding algorithm steps,which could improve the efficiency of biological sequence's indexing.Furthermore,a retrieve instance of a specific biological sequence was showed in this paper.

应用型本科课程建设是我国高等教育的薄弱环节.本文在多方位研究了应用型本科特点之后,结合长期从事应用型本科教学工作的经验和体会,重点论述了应用型本科"数据结构"课程的课程建设和教研教改问题,并简要介绍了作者所在学校的一些做法.

本文从人性化的角度出发,借鉴专家思考问题时擅于使用电网拓扑图的特点,采用语义网络图描述电网领域知识,将电网领域本体分层、分类显示并与图的基本性质相结合,构建基于语义网络图的供电系统检修计划编排策略.

This paper develops a new Agent-Oriented Programming(AOP) language called IG-AOP with individual and group mental states byintroducing group mental states into GOAL, and gives its syntax and semantics.Several desired properties of the language are introduced, and it isproved that the IG-AOP expresses better than GOAL through the example.The gap between theory and practice of Agent research is bridged, andtaking into account of group mental states makes this language more suitable for solving the problem of multi-Agent cooperative modeling andconcurrent programming.

When specifying mental states such as belief and goal of agents, temporal logics are often adopted as basic tools. Although there are work on non-monotonic extension of linear temporal logic LTL and branching time temporal logic CTL, the non-monotonic extension of alternating-time temporal logic ATL which is an important kind of multi-agent cooperation logics has not been discussed yet in literature. To solve this problem, this paper proposed non-monotonic alternating-time temporal logic with belief and goal, namely N-ATL-GB to facilitate the non-monotonic reasoning of mental states of agents. Firstly, Concurrent Game Structures of ATL are extended by strong and weak exceptions, two kinds of modal operators are introduced into the syntax of N-ATL-GB, and exceptions removing model is built. Secondly, the corresponding model checking algorithm which can be finished in polynomial time is proposed Examples are given to show the usage of this new logic at last.

Multi-agent cooperation logics, which provide powerful tool for modeling knowledge-based systems and cooperative problem solving process, gained great research interest in multi-agent systems community in the last five years. ATEL (Alternating-time Temporal Epistemic Logic) which is an important kind of multi-agent cooperation logics only takes knowledge into account, but does not deal with belief of agents. To solve this problem, firstly, general concurrent game structures are developed by extending concurrent game structures. Secondly, by introducing three kinds of belief operators into ATEL, a new multi-agent cooperation logic named ATBKL (Alternating-time Temporal Belief and Knowledge Logic) is developed Thirdly, a model checking algorithm is presented, and it is proved that the model checking complexity of ATBKL is PTIME-complete. Lastly, several desired properties of ATBKL are gained and proved. As a result, an expressive and powerful tool is developed for knowledge-based systems modeling. Further research is undertaken to model cooperative problem solving process based on this new logic.