By casting off the direct restriction of topological structure, this paper presents another matching scheme between the input A * and the knowledge A rarr B based on the equivalence relation R on formulae set F(S) ...
详细信息
By casting off the direct restriction of topological structure, this paper presents another matching scheme between the input A * and the knowledge A rarr B based on the equivalence relation R on formulae set F(S) and the corresponding equivalence classification F(S)/R = { [A] R | A isin F(S)} therefore, obtains another algorithm of approximate reasoning - the IV-type R-algorithm. The paper presents the IV-type R-algorithm for the simple approximate reasoning model and the multiple approximate reasoning model in the frame of R-logic C R .
keyphrases extracted from articles are beneficial in helping people boost browsing speed, but unfortunately keyphrases are rarely available for news articles due to the high expense of labor and time for manual annota...
详细信息
MemoryIO, a sort of extended I/O in embedded systems, is presented in this paper. MemoryIO makes it powerful for embedded systems to achieve the high-performance interconnect. In view of the facts that the main memory...
详细信息
MemoryIO, a sort of extended I/O in embedded systems, is presented in this paper. MemoryIO makes it powerful for embedded systems to achieve the high-performance interconnect. In view of the facts that the main memory system is absolutely necessary in any embedded system, and not all embedded systems integrate HyperTransport (HT), PCI Express or RapidIO interface, the MemoryIO based interconnect in embedded systems has more universalities compared with that based on HT, PCI Express or RapidIO. MemoryIO can not only thoroughly compensates for the lack of high performance data transfer channel, but also efficiently utilizes the memory bus bandwidth and the direct memory access (DMA) engine to reduce the latency for data transfer in embedded systems. This paper discusses some key technologies of MemoryIO, and presents its application in DCNet and the implementation of MemoryIO IP core. The MemoryIO technology can be used in various systems, but not limited to embedded systems.
In order to provide high resource utilization and QoS assurance inutility computing hosting concurrently various services, this paper proposes aservice computing framework-RAINBOW for VM(Virtual Machine)-basedutility ...
详细信息
ISBN:
(纸本)9783540898931
In order to provide high resource utilization and QoS assurance inutility computing hosting concurrently various services, this paper proposes aservice computing framework-RAINBOW for VM(Virtual Machine)-basedutility computing. In RAINBOW, we present a priority-based resourcescheduling scheme including resource flowing algorithms (RFaVM) to optimizeresource allocations amongst services. The principle of RFaVM is preferentiallyensuring performance of some critical services by degrading of others to someextent when resource competition arises. Based on our prototype, we evaluateRAINBOW and RFaVM. The experimental results show that RAINBOWwithout RFaVM provides 28%-324% improvements in service performance,and 26% higher the average CPU utilization than traditional service computingframework (TSF) in typical enterprise environment. RAINBOW with RFaVMfurther improves performance by 25%-42% for those critical services whileonly introducing up to 7% performance degradation to others, with 2%-8%more improvements in resource utilization than RAINBOW without RFaVM.
This paper introduces and investigate the type II true level k knowledge circle, extended type II knowledge base, extended type II automatic reasoning system and the level (k,j) perfectness of extended type II knowled...
详细信息
This paper introduces and investigate the type II true level k knowledge circle, extended type II knowledge base, extended type II automatic reasoning system and the level (k,j) perfectness of extended type II knowledge base K II bases on the type II topological logicC II T.
The Association for the Advancement of Artificial Intelligence (AAAI) was pleased to present the AAAI 2008 Spring Symposium Series, held Wednesday through Friday, March 26-28, 2008, at Stanford University, California....
详细信息
The Association for the Advancement of Artificial Intelligence (AAAI) was pleased to present the AAAI 2008 Spring Symposium Series, held Wednesday through Friday, March 26-28, 2008, at Stanford University, California. The eight symposia were titled (1) AI Meets Business Rules and Process Management, (2) architectures for intelligent Theory-Based Agents, (3) Creative intelligentsystems, (4) Emotion, Personality, and Social Behavior, (5) Semantic Scientific Knowledge Integration, (6) Social Information Processing, (7) Symbiotic Relationships between Semantic Web and Knowledge Engineering, (8) Using Al to Motivate Greater Participation in computer Science. The goal of the AI Meets Business Rules and Process Management AAAI symposium was to investigate the various approaches and standards to represent business rules, business process management, and the semantic web with respect to expressiveness and reasoning capabilities. The focus of the architectures ror intelligent Theory-Based Agents AAAI symposium was the definition or architectures for intelligent theory-based agents, comprising languages, knowledge representation methodologies, reasoning algorithms, and control loops. The Creative intelligentsystems symposium included five major discussion sessions and a general poster session (in which all contributing papers were presented). The purpose of this symposium was to explore the synergies between creative cognition and intelligentsystems. The goal of the Emotion, Personality, and Social Behavior symposium was to examine fundamental issues in affect and personality in both biological and artificial agents, focusing on the roles of these factors in mediating social behavior. The Semantic Scientific Knowledge Integration symposium brought together the semantic technologies community with the scientific information technology community in an effort to build the general semantic science information community. The Social Information Processing symposium's goal was to
In this paper, we propose the basic framework of point- wise topological logic on completely distributive lattices and explore approximate reasoning in it. The logic of this paper is based on pointwise characterizatio...
详细信息
In this paper, we propose the basic framework of point- wise topological logic on completely distributive lattices and explore approximate reasoning in it. The logic of this paper is based on pointwise characterization, therefore the pointwise conception is pervasive. We explore approximate reasoning in abstract logical framework Fl on completely distributive lattice L. We propose the structure of point- wise topological logic F TL , the structure of matching function sigma. and the structure of matching neighborhood group. We investigate approximate reasoning in pointwise topological logic F TL with matching function sigma, develop pointwise topological algorithm of simple approximate reasoning, introduce the essential characteristics of this scheme.
Superimpose one protein tertiary structure to another can help to find similarity between them and further identify functional and evolutionary relationships. We first extract invariant features under rigid body trans...
详细信息
Structure alignment could help to find shape similarities between proteins and guide structure classification and fold recognition. Common substructure detection and extraction are especially important, for which coul...
详细信息
ISBN:
(纸本)9781424415786
Structure alignment could help to find shape similarities between proteins and guide structure classification and fold recognition. Common substructure detection and extraction are especially important, for which could guide the biologist to discover binding site or active site. We represent each segment of alpha-carbon backbone by using dihedral angles and curve moment invariants. Then, local and global structure alignment could be performed by iterative closest point algorithm. Maximum common substructures between a pair of proteins or within a protein could be found. Active sites also could be detected by the proposed algorithm.
2-D projective moment invariants were firstly proposed by Suk and Flusser in [12]. We point out here that there is a useless projective moment invariant which is equivalent to zero in their paper. 3-D projective momen...
详细信息
2-D projective moment invariants were firstly proposed by Suk and Flusser in [12]. We point out here that there is a useless projective moment invariant which is equivalent to zero in their paper. 3-D projective moment invariants are generated theoretically by investigating the property of signed volume of a tetrahedron. The main part is the selection of permutation invariant cores for multiple integrals to generate independent and nonzero 3-D projective moment invariants. We give the conclusion that projective moment invariants don't exist strictly speaking because of their convergence problem.
暂无评论