In document-center XML dataset, an element may contain so many text that users have to spend enough time to judge the elements returned by XML search engine are valuable or not. Query-orient XML summarization system a...
详细信息
In document-center XML dataset, an element may contain so many text that users have to spend enough time to judge the elements returned by XML search engine are valuable or not. Query-orient XML summarization system aim to provide users a brief and readable substitution of the original retrieved elements according to the user's query, which can relieve user's reading burden effectively. In this work, we extract sentences from the results of XML search engine, and combine them as a summary. Experiments on the IEEE-CS datasets used in INEX show that, the query-oriented XML summary generated by our method is reasonable.
Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthet...
详细信息
Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthetic criteria instead of finding better clusters, and their analysis results may provide misleading information. A process model of technical group identification method was presented using LinLog graph clustering algorithm to find better competitor groups. In the model, technical similarity value of each pair of competitors is measured based on their R&D output in sub-fields, and two competitors have a link when they have high similarity value; LinLog algorithm, which is aimed at producing better clusters, was employed to layout graph with competitors as nodes, their links as edges and technology similarity values as weights of edges. Experiment results show the efficiency of presented method.
It have become very difficult that users can find the best, credible web service for some proposed semantic web service discovery methods, because web service environment has become open, autonomic, dynamic, and decep...
详细信息
It have become very difficult that users can find the best, credible web service for some proposed semantic web service discovery methods, because web service environment has become open, autonomic, dynamic, and deceptive. This paper proposes a QoS-assured trust-driven semantic web service discovery method i.e. TDSWSD. This method, firstly, describes and labels web services by ontology technology, and then makes use of the existing keyword matching method to carry basic matching;secondly, function matching will be done by ontology-based concept semantic similarity calculation method;finally, QoS-assured trust measure method will be designed to carry credible QoS matching. Compared with existing methods, the experimental results show that this method can not only automatically find the service to meet user' requirements, but also ensure the validity and reliability of service discovery.
Activity instance oriented handling is a new means for vertical optimization of process cases. Unlike our previous batch processing mechanism in workflows, it focuses on the data characteristics of activity instances ...
详细信息
Activity instance oriented handling is a new means for vertical optimization of process cases. Unlike our previous batch processing mechanism in workflows, it focuses on the data characteristics of activity instances and utilizes explicit knowledge for planning. This paper introduces its concept and proposes activity instance pattern to model and represent the knowledge for execution optimization. A flexible and intelligent workflow enactment framework for activity instance oriented handling is also proposed and investigated.
In this paper, we use strict mathematics reasoning to discover the relation between the threshold and reduction in Fuzzy Variable Precision Rough Sets (FVPRS), i.e., the reductions act as a nested structure with the m...
详细信息
In this paper, we use strict mathematics reasoning to discover the relation between the threshold and reduction in Fuzzy Variable Precision Rough Sets (FVPRS), i.e., the reductions act as a nested structure with the monotonously increasing threshold. By using the nested structure of reductions, we could design algorithms to quickly find different reductions when a reduction is required. Here `different' means the reductions obtained using different thresholds.
in this paper, we describe idea-map, a mash-up application building on top of Linked data Cloud. It reads in user's keywords (about research ideas) and executes a SPARQL query against DBLP endpoint. Spatial an...
详细信息
in this paper, we describe idea-map, a mash-up application building on top of Linked data Cloud. It reads in user's keywords (about research ideas) and executes a SPARQL query against DBLP endpoint. Spatial and temporal information is extracted and parsed from the query results and is further transformed to SIMILE/EXHIBIT to show a spatiotemporal map for the research ideas. Idea-map shows the feasibility of combing various techniques such as YQL, SIMILE/Exhibit and SPARQL query answering to provide an insightful interface to better understand the interested research ideas.
Based on analysis of relationships between solution qualities and number of initial dynamic points in elastic net algorithm, we propose an improved elastic network algorithm (IENA) introduced in a heuristic cloning st...
详细信息
In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected ...
详细信息
ISBN:
(纸本)9781424499199
In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected unit disk graph (UDG). The problem is to find a minimum connected dominating set of given UDG with minimum routing cost for each node pair. We present a constant approximation scheme which produces a connected dominating set D, whose size |D| is within a factor α from that of the minimum connected dominating set and each node pair exists a routing path with all intermediate nodes in D and with length at most 5 · d(u,v), where d(u,v) is the length of shortest path of this node pair. A distributed algorithm is also provided with analogical performance. Extensive simulation shows that our distributed algorithm achieves significantly than the latest solution in research direction.
This paper studied the synchronization of fractional-order chaotic system based on the theory of fractional calculus, and the synchronization between the two identical fractional-order Chen systems is realized after 0...
详细信息
This paper studied the synchronization of fractional-order chaotic system based on the theory of fractional calculus, and the synchronization between the two identical fractional-order Chen systems is realized after 0.6s by using the active control, and the simulation results verify the effectiveness of the examined method. Furthermore, the control scheme can be used in secure communication via the technology of chaotic masking. Numerical simulations coincide with the theoretical analysis.
暂无评论