With the popularity of Android devices, more and more Android malware are manufactured every year. How to filter out malicious app is a serious problem for app markets. In this paper, we propose DroidADDMiner, an effi...
详细信息
The negative bias temperature instability (NBTI) in CMOS devices is one of most prominent sources of aging mechanisms, which can induce severe threats to the reliability of modern processors at deep submicron semicond...
详细信息
Ontology matching techniques can help improve the accuracy of emergency decisionmaking on heterogeneous data. In this paper, we propose a practical approach to leverage ontology and MapReduce for matching metadata of ...
详细信息
Many ontologies have been published on the Semantic Web,to be shared to describe *** them,large ontologies of real-world areas have the scalability problem in presenting semantic technologies such as ontology matching...
详细信息
Many ontologies have been published on the Semantic Web,to be shared to describe *** them,large ontologies of real-world areas have the scalability problem in presenting semantic technologies such as ontology matching(OM).This either suffers from too long run time or has strong hypotheses on the running *** deal with this issue,we propose a three-stage MapReduce-based approach V-Doc+ for matching large ontologies,based on the MapReduce framework and virtual document ***,two MapReduce processes are performed in the first stage to extract the textual descriptions of named entities(classes,properties,and instances) and blank nodes,*** the second stage,the extracted descriptions are exchanged with neighbors in Resource Description Framework(RDF) graphs to construct virtual *** extraction process also benefits from the MapReduce-based implementation.A word-weight-based partitioning method is proposed in the third stage to conduct parallel similarity calculation using the term frequency-inverse document frequency(TF-IDF) *** results on two large-scale real datasets and the benchmark testbed from Ontology Alignment Evaluation Initiative(OAEI) are reported,showing that the proposed approach significantly reduces the run time with minor loss in precision and recall.
As a fundamental task of sentiment analysis, document level sentiment classification aims to predict user’s overall sentiment (e.g., positive or negative) towards the target in a document. The document usually consis...
详细信息
Since smartphones have stored diverse sensitive privacy information, including credit card and so on, a great deal of malware are desired to tamper them. As one of the most prevalent platforms, Android contains sensit...
详细信息
A lot of network services and applications are being designed to support quality-of-service (QoS) routing. One of the key problems is to find a feasible path that satisfies multiple QoS requirements, i.e., Multi-Const...
详细信息
ISBN:
(纸本)9781450306942
A lot of network services and applications are being designed to support quality-of-service (QoS) routing. One of the key problems is to find a feasible path that satisfies multiple QoS requirements, i.e., Multi-Constrained Path (MCP) problem which is known to be NP-complete. Many heuristic and approximation algorithms have been proposed to solve this problem. However, most of them converted it into the classic shortest path problem by transforming multiple QoS weights into single weight. In this paper, we propose a binary graph reduction (BGR) algorithm to convert network graph into a simplified graph by removing redundant edges before constructing a routing path. BGR improves system performance from two aspects: i) BGR decreases the decision-making time, which then decreases the delay of end users;ii) BGR removes some abnormal anti-heuristic redundant edges from network graph, so that the actual routing algorithm could get a better result. We use a multimedia delivery system to illustrate these advantages in this paper. Simulation results also approve the efficiency of the proposed BGR algorithm.
Web applications support more and more our daily activities, it's important to improve their reliability and security. The content which users input to web applications' server-side is named un-trusted content...
详细信息
Landmark heuristics are perhaps the most accurate current known admissible heuristics for optimal planning. A disjunctive action landmark can be seen a form of at-least-one constraint on the actions it contains. In ma...
Web caching has been well accepted as a viable method for saving network bandwidth and reducing user access latency. To provide cache sharing on a large scale, hierarchical web caching has been widely deployed to impr...
详细信息
暂无评论