Applied Mechanics and Materials Vols. 713-715

Paper Title Page

Abstract: In this paper, we develop models to analyze traffic flow of intelligent transportation system (ITS).The investigation into ITS is carried out in two aspects: one is the partly ITS, the other is the completely ITS. Comparisons between two systems show: with the increasing of intelligence degree, the superiority of each rule becomes more and more obvious. As is mentioned above, each rule is the most ideal for certain traffic state. While the detailed forms of different rules are not the same, the purpose of all rules is to promote the traffic flow. The phenomenon reveals the consistency of the ITS. In another word, the higher the intelligence degree of a system is, the larger its contributions to the traffic flow are.
2000
Abstract: This paper reveals the changesof concept collection and propertyof Hasse graph after detrimental. Detrimental construction algorithm of concept latticethis paper present is valid. In practical applications, if the property changes, you need to remove some of the properties, using the algorithm proposed in this paper can slim down directly. Based on above content, this paper is divided into three parts; the first part introduces the basic concepts of concept lattices and its basic structure. The second part introduces the basic principle of concept lattice attribute reduction and itsalgorithm. The third part is focus onincremental and detrimental algorithm analysis of node types.
2004
Abstract: In this paper, an improved trappy alpha-beta (simply) algorithm, namedis proposed.is an extended version ofby introducing the two-ply iterative deepening (TPID). By applying TPID, can search more deeply and therefore find the traps hidden more deep plies in game-tree. The experimental results reflect thatindeed obtains the better chess playing performance than.
2008
Abstract: This paper investigates the construction methods of sequences with optimal autocorrelation functions. The approaches proposed by us are to convert the known optimal sequences into the required sequences. In order to arrive at our goal, we establish two conversion formulas, and summarize their performance. The proposed methods can provide lots of candidates of spread sequences for the applications of code-division multiple-access (CDMA) spread spectrum communication systems.
2012
Abstract: This paper introduces two methods for solving the expectation in Envelopes Pairing Problem, one is that the random variable is expressed as the sum of n random variables and then solves its expectation; another method is put forward by this paper, that is, firstly the distribution law is derived from simple cases, then considers problems of general situation, gets the expectation of conjecture by simple cases, finally proves the conjecture with mathematical induction.
2016
Abstract: In this paper, we study the group decision making (GDM) problem with two-tuple linguistic information .we propose a way to calculate the comprehensive assessment information. Then average preference degree of one alternative over all the other alternatives is calculated. Thus, the ranking of alternatives is obtained by the comparison of linguistic two-tuple information.
2020
Abstract: In order to facilitate government making timely decision for multiple internet public opinion emergencies with interval fuzzy indicators, we first determine the rational weight of each emergency decision index based on fuzzy information entropy of interval index. Then we aggregate all the interval index values to obtain the comprehensive alarm interval of each emergency. Finally, we can get the priority of emergency operation of all the internet public opinion emergencies according to the possible degree between their alarm intervals.
2024
Abstract: In terms of different decision-making problem and expert groups, experts’ discourse right is dynamic and relative. Therefore, scientific and rationality of experts empowerment are directly affect final evaluation results. For solving the problem of the objectivity of the evaluation index weight assignment, a method which based on the Shapley value to determine the expert’s weight has been proposed and illustrated in this paper. Firstly, on the basis of analyzing the characteristics of the expert group decision making process, the correlation of experts’ knowledge stock has been defined to represent knowledge spillover among the experts group. Secondly, based on the contribution degree of each expert’s knowledge spillover which has been discussed through correlation analysis, and weight has been allocated to experts. The results show that the method can not only avoid experts empowerment evenly phenomenon, and fully respect the differences of evaluation experts. Finally, the author suggests different types of expert group decisions should be invited to participate in decision-making which helps to give play to brainstorming effect, producing more knowledge spillover and promoting scientific and rationality of decision-making.
2029
Abstract: This paper presents the connotation, research purpose and goals of virtual combat system evolution model, studies virtual combat system simulation principle and modeling process, and the evolution modeling method of virtual combat system, presents virtual combat system evolution modeling method based on main body, designs virtual combat system evolution model system structure, summarizes the portfolio level of virtual combat system model, and gives information control relations between virtual combat system models.
2037
Abstract: Weapon target assignment problem is most critical in modern warfare command decision of a problem for the weapon system and a relatively small number of targets assignment problem, you can use the Hungarian algorithm. Hungarian algorithm can solve the assignment problem, but under normal circumstances, weapon target assignment problem does not have the form of a mathematical model of assignment problem, through dummy weapon system or target method, the weapon target assignment problem is transformed into a standard assignment problem, and then solved by the Hungarian algorithm.
2041

Showing 441 to 450 of 664 Paper Titles