This paper proposes a formal method which is used to model and analyze network devices such as touters. It is based on an algebraic process called “ACSR-VP”, which enhances the original CCS algebraic process by inco...This paper proposes a formal method which is used to model and analyze network devices such as touters. It is based on an algebraic process called “ACSR-VP”, which enhances the original CCS algebraic process by incorporating the notions of time, resource requirements, dynamic prioritization, and synchronization. Therefore, although there are many formal methods to analyze the timed concurrency system, ACSR-VP, due to its prominent features, is best fit for analysis of a resource bounded real-time system. This paper extends ACSR-VP to EACSR-VP, which is more adaptive to the features of network devices and specializes in analyzing this kind of embedded system. EACSR-VP adds the notion of n-way communication which allows more than two processes to participate in synchronization. It also enhances value-passing capabilities which make for more flexible specifications. Finally, specifications, verification and analysis methods with EACSR-VP are introduced by a case study of router with multiple input queues.展开更多
Although, researchers in the ATC field have done a wide range of work based on SVM, almost all existing approaches utilize an empirical model of selection algorithms. Their attempts to model automatic selection in pra...Although, researchers in the ATC field have done a wide range of work based on SVM, almost all existing approaches utilize an empirical model of selection algorithms. Their attempts to model automatic selection in practical, large-scale, text classification systems have been limited. In this paper, we propose a new model selection algorithm that utilizes the DDAG learning architecture. This architecture derives a new large-scale text classifier with very good performance. Experimental results show that the proposed algorithm has good efficiency and the necessary generalization capability while handling large-scale multi-class text classification tasks.展开更多
An ontology mapping approach based on set & relation theory and OCL is introduced,then an ontology mapping meta-model is established which is composed of ontology related elements,mapping related elements and defi...An ontology mapping approach based on set & relation theory and OCL is introduced,then an ontology mapping meta-model is established which is composed of ontology related elements,mapping related elements and definition rule related elements.This ontology mapping meta-model can be regarded as a unified mechanism to realize different kinds of ontology mappings.The powerful computation capability of set and relation theory and the flexible expressive capability of OCL can be used in the computation of ontology mapping meta-model to realize the unified mapping among different ontology models.Based on the mapping meta-model,a general mapping management framework is developed to provide a common mapping storage mechanism,some mapping APIs and mapping rule APIs.展开更多
In order to automatically find and conveniently rectify the structural conflicts appearing in a new ontology model version after a series of ontology evolution,we propose an ontology model verification approach,in whi...In order to automatically find and conveniently rectify the structural conflicts appearing in a new ontology model version after a series of ontology evolution,we propose an ontology model verification approach,in which the object constraint language (OCL) and an ontology definition meta-model (ODM) are used to complete the ontology verification.The ODM is composed of the ontology related elements and the definition rule related elements.The OCL is employed to describe the elements in the ontology definition meta-model:OCL extension for the ontology related elements,and OCL extension for the ontological design patterns.All of the above OCL rules will describe the constraint relationships between ontology elements.Associated with an example,the application of the ontology model verification approach based on OCL and ODM is introduced.Consequently,the conflicts happened in the ontology changing and evolution can be easily verified and rectified through this approach.展开更多
Support vector machines have met with significant success in the information retrieval field, especially in handling text classification tasks. Although various performance estimators for SVMs have been proposed, thes...Support vector machines have met with significant success in the information retrieval field, especially in handling text classification tasks. Although various performance estimators for SVMs have been proposed, these only focus on accuracy which is based on the leave-one-out cross validation procedure. Information-retrieval-related performance measures are always neglected in a kernel learning methodology. In this paper, we have proposed a set of information-retrieval-oriented performance estimators for SVMs, which are based on the span bound of the leave-one-out procedure. Experiments have proven that our proposed estimators are both effective and stable.展开更多
Coordination technology addresses the construction of open, flexible systems from active and independent software agents in concurrent and distributed systems. In most open distributed applications, multiple agents ne...Coordination technology addresses the construction of open, flexible systems from active and independent software agents in concurrent and distributed systems. In most open distributed applications, multiple agents need interaction and communication to achieve their overall goal. Coordination technologies for the Internet typically are concerned with enabling interaction among agents and helping them cooperate with each other. At the same time, access control should also be considered to constrain interaction to make it harmless. Access control should be regarded as the security counterpart of coordination. At present, the combination of coordination and access control remains an open problem. Thus, we propose a role Dased coordination model with policy enforcement in agent application systems. In this model, coordination is combined with access control so as to fully characterize the interactions in agent systems. A set of agents interacting with each other for a common global system task constitutes a coordination group. Role based access control is applied in this model to prevent unauthorized accesses. Coordination policy is enforced in a distributed manner so that the model can be applied to the open distributed systems such as Internet. An Internet online auction system is presented as a case study to illustrate the proposed coordination model and finally the performance analysis of the model is introduced.展开更多
A configurable ontology mapping approach based on different kinds of concept feature information is introduced in this paper. In this approach, ontology concept feature information is classified as five kinds, which r...A configurable ontology mapping approach based on different kinds of concept feature information is introduced in this paper. In this approach, ontology concept feature information is classified as five kinds, which respectively corresponds to five kinds of concept similarity computation methods. Many existing ontology mapping approaches have adopted the multi-feature reasoning, whereas not all feature information can be com- puted in the real ontology mapping and only fractional feature information needs to be selected in the mapping computation. Consequently a eonfigurable ontology mapping model is introduced, which is composed of CMT model, SMT model and related transformation model. Through the configurable model, users can conveniently select the most suitable features and configure the suitable weights. Simultaneously, a related 3-step ontology mapping approach is also introduced. Associated with the traditional name and instance learner-based ontology mapping approach, this approach is evaluated by an ontology mapping application example.展开更多
文摘This paper proposes a formal method which is used to model and analyze network devices such as touters. It is based on an algebraic process called “ACSR-VP”, which enhances the original CCS algebraic process by incorporating the notions of time, resource requirements, dynamic prioritization, and synchronization. Therefore, although there are many formal methods to analyze the timed concurrency system, ACSR-VP, due to its prominent features, is best fit for analysis of a resource bounded real-time system. This paper extends ACSR-VP to EACSR-VP, which is more adaptive to the features of network devices and specializes in analyzing this kind of embedded system. EACSR-VP adds the notion of n-way communication which allows more than two processes to participate in synchronization. It also enhances value-passing capabilities which make for more flexible specifications. Finally, specifications, verification and analysis methods with EACSR-VP are introduced by a case study of router with multiple input queues.
文摘Although, researchers in the ATC field have done a wide range of work based on SVM, almost all existing approaches utilize an empirical model of selection algorithms. Their attempts to model automatic selection in practical, large-scale, text classification systems have been limited. In this paper, we propose a new model selection algorithm that utilizes the DDAG learning architecture. This architecture derives a new large-scale text classifier with very good performance. Experimental results show that the proposed algorithm has good efficiency and the necessary generalization capability while handling large-scale multi-class text classification tasks.
基金Sponsored by the National High Technology Research and Development Program of China(863)(Grant No.2002AA411420)National Natural Science Foundation(Grant No.60374071)
文摘An ontology mapping approach based on set & relation theory and OCL is introduced,then an ontology mapping meta-model is established which is composed of ontology related elements,mapping related elements and definition rule related elements.This ontology mapping meta-model can be regarded as a unified mechanism to realize different kinds of ontology mappings.The powerful computation capability of set and relation theory and the flexible expressive capability of OCL can be used in the computation of ontology mapping meta-model to realize the unified mapping among different ontology models.Based on the mapping meta-model,a general mapping management framework is developed to provide a common mapping storage mechanism,some mapping APIs and mapping rule APIs.
基金Sponsored by the National Basic Research Program of China (the Natural Key Basis Research and Development Plan (Grant No.973:2003CB316905))the National Natural Science Foundation of China(Grant No.60374071)
文摘In order to automatically find and conveniently rectify the structural conflicts appearing in a new ontology model version after a series of ontology evolution,we propose an ontology model verification approach,in which the object constraint language (OCL) and an ontology definition meta-model (ODM) are used to complete the ontology verification.The ODM is composed of the ontology related elements and the definition rule related elements.The OCL is employed to describe the elements in the ontology definition meta-model:OCL extension for the ontology related elements,and OCL extension for the ontological design patterns.All of the above OCL rules will describe the constraint relationships between ontology elements.Associated with an example,the application of the ontology model verification approach based on OCL and ODM is introduced.Consequently,the conflicts happened in the ontology changing and evolution can be easily verified and rectified through this approach.
文摘Support vector machines have met with significant success in the information retrieval field, especially in handling text classification tasks. Although various performance estimators for SVMs have been proposed, these only focus on accuracy which is based on the leave-one-out cross validation procedure. Information-retrieval-related performance measures are always neglected in a kernel learning methodology. In this paper, we have proposed a set of information-retrieval-oriented performance estimators for SVMs, which are based on the span bound of the leave-one-out procedure. Experiments have proven that our proposed estimators are both effective and stable.
文摘Coordination technology addresses the construction of open, flexible systems from active and independent software agents in concurrent and distributed systems. In most open distributed applications, multiple agents need interaction and communication to achieve their overall goal. Coordination technologies for the Internet typically are concerned with enabling interaction among agents and helping them cooperate with each other. At the same time, access control should also be considered to constrain interaction to make it harmless. Access control should be regarded as the security counterpart of coordination. At present, the combination of coordination and access control remains an open problem. Thus, we propose a role Dased coordination model with policy enforcement in agent application systems. In this model, coordination is combined with access control so as to fully characterize the interactions in agent systems. A set of agents interacting with each other for a common global system task constitutes a coordination group. Role based access control is applied in this model to prevent unauthorized accesses. Coordination policy is enforced in a distributed manner so that the model can be applied to the open distributed systems such as Internet. An Internet online auction system is presented as a case study to illustrate the proposed coordination model and finally the performance analysis of the model is introduced.
基金Sponsored by the 973 Natural Key Basis Research and Development Plan (Grant No.973: 2003CB316905)the National Natural Science Foundationof China (Grant No.60374071)
文摘A configurable ontology mapping approach based on different kinds of concept feature information is introduced in this paper. In this approach, ontology concept feature information is classified as five kinds, which respectively corresponds to five kinds of concept similarity computation methods. Many existing ontology mapping approaches have adopted the multi-feature reasoning, whereas not all feature information can be com- puted in the real ontology mapping and only fractional feature information needs to be selected in the mapping computation. Consequently a eonfigurable ontology mapping model is introduced, which is composed of CMT model, SMT model and related transformation model. Through the configurable model, users can conveniently select the most suitable features and configure the suitable weights. Simultaneously, a related 3-step ontology mapping approach is also introduced. Associated with the traditional name and instance learner-based ontology mapping approach, this approach is evaluated by an ontology mapping application example.
