In the process of kinematic chain type synthesis,it is necessary to solve the problems of isomorphism identification and rigid subchain detection.The problem of rigid subchain detection can be reduced to subgraph isom...In the process of kinematic chain type synthesis,it is necessary to solve the problems of isomorphism identification and rigid subchain detection.The problem of rigid subchain detection can be reduced to subgraph isomorphism problem,which belongs to NPC problem.This paper introduces the properties,detection methods,algorithm time complexity and program code of rigid subchain of kinematic chain.The detection codes of rigid subchains with different number of links are different.It is necessary to modify the for-loop nesting times of program code according to the change of the link number,so the code reusability is very low.In view of this,the recursive pseudo code of rigid subchain detection algorithm is proposed for the first time,which makes the program can be directly used for rigid subchain detection of any number of links,improves the reusability of the code,and provides a certain reference for the realization and optimization of computer programs for NPC problems in other disciplines.A rigid subchain detection software of kinematic chain was developed,and the rigid subchain detection process of a 16-link kinematic chain was successfully realized in the software.展开更多
In this paper, we apply the recursive genetic programming (RGP) approach to the cognition of a system, and then proceed to the detecting procedure for structural changes in the system whose components are of long memo...In this paper, we apply the recursive genetic programming (RGP) approach to the cognition of a system, and then proceed to the detecting procedure for structural changes in the system whose components are of long memory. This approach is adaptive and model-free, which can simulate the individual activities of the system's participants, therefore, it has strong ability to recognize the operating mechanism of the system. Based on the previous cognition about the system, a testing statistic is developed for the detection of structural changes in the system. Furthermore, an example is presented to illustrate the validity and practical value of the proposed.展开更多
In this paper, we discuss Markovian decision programming with recursive vector-reward andgive an algorithm to find optimal policies. We prove that: (1) There is a Markovian optimal policy for the nonstationary case; (...In this paper, we discuss Markovian decision programming with recursive vector-reward andgive an algorithm to find optimal policies. We prove that: (1) There is a Markovian optimal policy for the nonstationary case; (2) Thereis a stationary optimal policy for the stationary case.展开更多
In this paper we try to introduce a new approach to operational semantics of recursive programs by using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu of modelling partial func...In this paper we try to introduce a new approach to operational semantics of recursive programs by using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu of modelling partial functions by introducing undefined values in a traditional approach,we shall define a priority derivation tree for every term,and by respecting the rule“attacking the subterm of the highest priority first”we define transition relations,computation sequences etc.directly based on a standard interpretation which includes no undefined value in its domain.Finally,we prove that our new approach generates the same operational semantics as the traditional one.It is also pointed out that we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semantics of recursive programs cannot be built based on predicate logic.展开更多
文摘In the process of kinematic chain type synthesis,it is necessary to solve the problems of isomorphism identification and rigid subchain detection.The problem of rigid subchain detection can be reduced to subgraph isomorphism problem,which belongs to NPC problem.This paper introduces the properties,detection methods,algorithm time complexity and program code of rigid subchain of kinematic chain.The detection codes of rigid subchains with different number of links are different.It is necessary to modify the for-loop nesting times of program code according to the change of the link number,so the code reusability is very low.In view of this,the recursive pseudo code of rigid subchain detection algorithm is proposed for the first time,which makes the program can be directly used for rigid subchain detection of any number of links,improves the reusability of the code,and provides a certain reference for the realization and optimization of computer programs for NPC problems in other disciplines.A rigid subchain detection software of kinematic chain was developed,and the rigid subchain detection process of a 16-link kinematic chain was successfully realized in the software.
文摘In this paper, we apply the recursive genetic programming (RGP) approach to the cognition of a system, and then proceed to the detecting procedure for structural changes in the system whose components are of long memory. This approach is adaptive and model-free, which can simulate the individual activities of the system's participants, therefore, it has strong ability to recognize the operating mechanism of the system. Based on the previous cognition about the system, a testing statistic is developed for the detection of structural changes in the system. Furthermore, an example is presented to illustrate the validity and practical value of the proposed.
基金The project is supported by National Natural Science Foundation of China
文摘In this paper, we discuss Markovian decision programming with recursive vector-reward andgive an algorithm to find optimal policies. We prove that: (1) There is a Markovian optimal policy for the nonstationary case; (2) Thereis a stationary optimal policy for the stationary case.
文摘In this paper we try to introduce a new approach to operational semantics of recursive programs by using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu of modelling partial functions by introducing undefined values in a traditional approach,we shall define a priority derivation tree for every term,and by respecting the rule“attacking the subterm of the highest priority first”we define transition relations,computation sequences etc.directly based on a standard interpretation which includes no undefined value in its domain.Finally,we prove that our new approach generates the same operational semantics as the traditional one.It is also pointed out that we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semantics of recursive programs cannot be built based on predicate logic.
