A context memory model and an approach for context query and association discovery are proposed. The context query is based on a resource description framework （RDF） dataset and SPARQL language. To discover collabor...A context memory model and an approach for context query and association discovery are proposed. The context query is based on a resource description framework （RDF） dataset and SPARQL language. To discover collaborative associations, an approach of transforming RDF named graphs into ＂context graph＂ is proposed. First, the definitions of the importance of the nodes and the weight assignment for the ＂context graph＂ are given. Secondly, the implementation of a spread activation algorithm based on ＂context graph＂ is proposed. An infrastructure is also built up in the collaborative context space （CCS） system to support context memory and knowledge discovery in a collaborative environment.展开更多
In this paper we investigate a variant of the scheduling problem on two uniform machines with speeds 1 and s. For this problem, we are given two potential uniform machines to process a sequence of independent jobs. Ma...In this paper we investigate a variant of the scheduling problem on two uniform machines with speeds 1 and s. For this problem, we are given two potential uniform machines to process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed, the algorithm has the option to activate new machines. The objective is to minimize the sum of the makespan and the machine activation cost. We design optimal online algorithms with competitive ratio of (2s+1)/(s+1) for every s≥1.展开更多
基金The National Natural Science Foundation of China(No.90412009).
文摘A context memory model and an approach for context query and association discovery are proposed. The context query is based on a resource description framework （RDF） dataset and SPARQL language. To discover collaborative associations, an approach of transforming RDF named graphs into ＂context graph＂ is proposed. First, the definitions of the importance of the nodes and the weight assignment for the ＂context graph＂ are given. Secondly, the implementation of a spread activation algorithm based on ＂context graph＂ is proposed. An infrastructure is also built up in the collaborative context space （CCS） system to support context memory and knowledge discovery in a collaborative environment.
基金Project (No. Y605316) supported by the Natural Science Foundationof Zhejiang Province, China and the Natural Science Foundation of the Education Department of Zhejiang Province (No. 20060578), China
文摘In this paper we investigate a variant of the scheduling problem on two uniform machines with speeds 1 and s. For this problem, we are given two potential uniform machines to process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed, the algorithm has the option to activate new machines. The objective is to minimize the sum of the makespan and the machine activation cost. We design optimal online algorithms with competitive ratio of (2s+1)/(s+1) for every s≥1.
