To properly compute the ontological similarity, an ontological similarity network-based reasoning framework is proposed. It structurally integrates extension-based approach, intension-based approach, the similarity ne...To properly compute the ontological similarity, an ontological similarity network-based reasoning framework is proposed. It structurally integrates extension-based approach, intension-based approach, the similarity network-based reasoning to exploit the implicit similarity, and the feedback from the context to validate the similarity measures. A new similarity measure is also presented to construct concept similarity network, which scales the similarity using the relative depth of the least common super-concept between any two concepts. Subsequently, the graph theory, instead of predefined knowledge rules, is applied to perform the similarity network-based reasoning such that the knowledge acquisition can be avoided. The framework has been applied to text categorization and visualization of high dimensional data. Theory analysis and the experimental results validate the proposed framework.展开更多
In order to improve the performance of the attribute reduction algorithm to deal with the noisy and uncertain large data, a novel co-evolutionary cloud-based attribute ensemble multi-agent reduction(CCAEMR) algorith...In order to improve the performance of the attribute reduction algorithm to deal with the noisy and uncertain large data, a novel co-evolutionary cloud-based attribute ensemble multi-agent reduction(CCAEMR) algorithm is proposed.First, a co-evolutionary cloud framework is designed under the M apReduce mechanism to divide the entire population into different co-evolutionary subpopulations with a self-adaptive scale. Meanwhile, these subpopulations will share their rewards to accelerate attribute reduction implementation.Secondly, a multi-agent ensemble strategy of co-evolutionary elitist optimization is constructed to ensure that subpopulations can exploit any correlation and interdependency between interacting attribute subsets with reinforcing noise tolerance.Hence, these agents are kept within the stable elitist region to achieve the optimal profit. The experimental results show that the proposed CCAEMR algorithm has better efficiency and feasibility to solve large-scale and uncertain dataset problems with complex noise.展开更多
We categorify the notion of coalgebras by imposing a co-associative law up to some isomorphisms on the co-multiplication map and requiring that these isomorphisms satisfy certairl law of their own, which is called the...We categorify the notion of coalgebras by imposing a co-associative law up to some isomorphisms on the co-multiplication map and requiring that these isomorphisms satisfy certairl law of their own, which is called the copentagon identity. We also set up a 2-category of 2-coalgebras. The purpose of this study is from the idea of reconsidering the quasi-Hopf algebras by the categorification process, so that we can study the theory of quasi-Hopf algebras and their representations in some new framework of higher category theory in natural ways.展开更多
With the improvement of mobile equipment performance and development of Pervasive Computing,interactive computational applications such as Multi-Agent (MA) systems in Pervasive Computing Environments (PCE) become more...With the improvement of mobile equipment performance and development of Pervasive Computing,interactive computational applications such as Multi-Agent (MA) systems in Pervasive Computing Environments (PCE) become more and more prevalent. Many applications in PCE require Agent communication,manual control,and diversity of devices. Hence system in PCE must be designed flexible,and optimize the use of network,storage and computing resources. However,traditional MA software framework cannot completely adapt to these new features. A new MA software framework and its Agent Communication Modules to solve the problem brought by PCE was proposed. To describe more precisely,it presents Wright/ADL (Architecture Description Language) description of the new framework. Then,it displays an application called AI Eleven based on this new framework. AI Eleven achieves Agent-Agent communication and good collaboration for a task. Two experiments on AI Eleven will demonstrate the new framework's practicability and superiority.展开更多
Agent negotiation has become increasingly important since the advent of electronic commerce.There are two kinds of interactions in the process of agent negotiation.One is the interaction between different agents,and t...Agent negotiation has become increasingly important since the advent of electronic commerce.There are two kinds of interactions in the process of agent negotiation.One is the interaction between different agents,and the other is the interaction between the agent and the human user.In this paper,firstly,we introduce Q language,a scenario description language for designing interactions between agents and human users.Then we propose an integrating interaction framework for agent negotiation,in which both kinds of interactions are described by Q scenario.Our framework can make the interaction process open and easy to be understood by the users.Users can understand how the negotiation process goes and what is happening in the system including some erroneous or inappropriate actions caused by the negotiation agent.This gives the users a chance to terminate or change the behavior of negotiation agent in time to avoid unfavorable negotiation outcome.In addition,users can customize the agent's behaviors through visible interactions with it.展开更多
The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols.In this framework,the security of protocols is maintained under a general protocol compositio...The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols.In this framework,the security of protocols is maintained under a general protocol composition operation.In the paper,we propose the universal composability framework for the analysis of proxy threshold signature and present a universally composable secure proxy threshold signature scheme which is the first one in this area.The proposed scheme is suitable for the mobile agents,which should migrate across different environment through network.Furthermore,we give the concrete analysis of the reduction to prove the security of the proposed scheme.展开更多
基金The National Natural Science Foundation of China(No.60003019).
文摘To properly compute the ontological similarity, an ontological similarity network-based reasoning framework is proposed. It structurally integrates extension-based approach, intension-based approach, the similarity network-based reasoning to exploit the implicit similarity, and the feedback from the context to validate the similarity measures. A new similarity measure is also presented to construct concept similarity network, which scales the similarity using the relative depth of the least common super-concept between any two concepts. Subsequently, the graph theory, instead of predefined knowledge rules, is applied to perform the similarity network-based reasoning such that the knowledge acquisition can be avoided. The framework has been applied to text categorization and visualization of high dimensional data. Theory analysis and the experimental results validate the proposed framework.
基金The National Natural Science Foundation of China(No.61300167)the Open Project Program of State Key Laboratory for Novel Software Technology of Nanjing University(No.KFKT2015B17)+3 种基金the Natural Science Foundation of Jiangsu Province(No.BK20151274)Qing Lan Project of Jiangsu Provincethe Open Project Program of Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education(No.JYB201606)the Program for Special Talent in Six Fields of Jiangsu Province(No.XYDXXJS-048)
文摘In order to improve the performance of the attribute reduction algorithm to deal with the noisy and uncertain large data, a novel co-evolutionary cloud-based attribute ensemble multi-agent reduction(CCAEMR) algorithm is proposed.First, a co-evolutionary cloud framework is designed under the M apReduce mechanism to divide the entire population into different co-evolutionary subpopulations with a self-adaptive scale. Meanwhile, these subpopulations will share their rewards to accelerate attribute reduction implementation.Secondly, a multi-agent ensemble strategy of co-evolutionary elitist optimization is constructed to ensure that subpopulations can exploit any correlation and interdependency between interacting attribute subsets with reinforcing noise tolerance.Hence, these agents are kept within the stable elitist region to achieve the optimal profit. The experimental results show that the proposed CCAEMR algorithm has better efficiency and feasibility to solve large-scale and uncertain dataset problems with complex noise.
基金Supported by National Natural Science Foundation of China under Grant Nos. 10975102, 11031005 10871135, 10871227, and PHR201007107
文摘We categorify the notion of coalgebras by imposing a co-associative law up to some isomorphisms on the co-multiplication map and requiring that these isomorphisms satisfy certairl law of their own, which is called the copentagon identity. We also set up a 2-category of 2-coalgebras. The purpose of this study is from the idea of reconsidering the quasi-Hopf algebras by the categorification process, so that we can study the theory of quasi-Hopf algebras and their representations in some new framework of higher category theory in natural ways.
基金Guangdong-Hong Kong Technology Cooperation Funding Scheme, China ( No.2007A010101003)Guangdong-Ministry of Education Industry-University Cooperation Funding Scheme,China (No.2007B090200018)
文摘With the improvement of mobile equipment performance and development of Pervasive Computing,interactive computational applications such as Multi-Agent (MA) systems in Pervasive Computing Environments (PCE) become more and more prevalent. Many applications in PCE require Agent communication,manual control,and diversity of devices. Hence system in PCE must be designed flexible,and optimize the use of network,storage and computing resources. However,traditional MA software framework cannot completely adapt to these new features. A new MA software framework and its Agent Communication Modules to solve the problem brought by PCE was proposed. To describe more precisely,it presents Wright/ADL (Architecture Description Language) description of the new framework. Then,it displays an application called AI Eleven based on this new framework. AI Eleven achieves Agent-Agent communication and good collaboration for a task. Two experiments on AI Eleven will demonstrate the new framework's practicability and superiority.
基金This work is partially supported by the National Natural Science Foundation of China (No. 69973032)AIEJ (Association of International Education, Japan).
文摘Agent negotiation has become increasingly important since the advent of electronic commerce.There are two kinds of interactions in the process of agent negotiation.One is the interaction between different agents,and the other is the interaction between the agent and the human user.In this paper,firstly,we introduce Q language,a scenario description language for designing interactions between agents and human users.Then we propose an integrating interaction framework for agent negotiation,in which both kinds of interactions are described by Q scenario.Our framework can make the interaction process open and easy to be understood by the users.Users can understand how the negotiation process goes and what is happening in the system including some erroneous or inappropriate actions caused by the negotiation agent.This gives the users a chance to terminate or change the behavior of negotiation agent in time to avoid unfavorable negotiation outcome.In addition,users can customize the agent's behaviors through visible interactions with it.
基金the National Natural Science Foundation of China(Nos.60703031,60703004)the National High Technology Research and Development Program(863)of China(No.2006AA01Z4220the National Basic Research Program(973)of China(No.2007CB311201)
文摘The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols.In this framework,the security of protocols is maintained under a general protocol composition operation.In the paper,we propose the universal composability framework for the analysis of proxy threshold signature and present a universally composable secure proxy threshold signature scheme which is the first one in this area.The proposed scheme is suitable for the mobile agents,which should migrate across different environment through network.Furthermore,we give the concrete analysis of the reduction to prove the security of the proposed scheme.