The present paper focuses on privacy preserving technique. Cloud computing is not a new technology more over it is a new way of delivering technology. Providers deliver it in the form of services, in computing field s...
详细信息
ISBN:
(纸本)9781467345286
The present paper focuses on privacy preserving technique. Cloud computing is not a new technology more over it is a new way of delivering technology. Providers deliver it in the form of services, in computing field security is the main concern which blocks the tremendous growth of Cloud computing and became a huge debate area worldwide, due to security breach of user's valuable inf.rmation. So we identified the week service bonding of cloud providers in maintaining, and preserving users' secrecy and failed to have a universal service level agreement. This paper focus on privacy mitigation methodology by proposing a privacy preserving algorithmic approach to congregate the privacy issue and preserve ones confidential data stored in the cloud.
We evaluate the performance of the OBDA system Ontop and compare it with other systems. Our experiments show that (i) the Ontop tree-witness query rewriter is fast and outperforms the competi- tors, and (ii) query eva...
We evaluate the performance of the OBDA system Ontop and compare it with other systems. Our experiments show that (i) the Ontop tree-witness query rewriter is fast and outperforms the competi- tors, and (ii) query evaluation in Ontop using the semantic index is as efficient as in materialisation-based systems (but without the materiali- sation overhead).
Top-k query processing has recently received a significant amount of attention due to its wide application in inf.rmation retrieval, multimedia search and recommendation generation. In this work, we consider the probl...
详细信息
Power transmission lines are often used very inefficiently. A possible way to increase their effectiveness is the use of dynamic thermal rating, instead of the more common static rating. Dynamic thermal rating can be ...
详细信息
This paper studies the problem of recommending new venues to users who participate in location-based social networks (LBSNs). As an increasingly larger number of users partake in LBSNs, the recommendation problem in t...
详细信息
The continuing pervasion of our society with safety-critical cyber-physical systems not only demands for adequate (risk) analysis, testing and verification techniques, it also generates growing experience on their use...
详细信息
The continuing pervasion of our society with safety-critical cyber-physical systems not only demands for adequate (risk) analysis, testing and verification techniques, it also generates growing experience on their use, which can be considered as important as the tools themselves for their efficient use. This paper introduces workflow patterns to describe such best practices in a systematic way that efficiently represents this knowledge, and also provides a way to relate different patterns, making them easier to identify and use, and cover as wide a range of experiences as possible. The value of the approach is demonstrated using some pattern examples from a collection developed in the Artemis-project MBAT. Finally, the paper presents a wiki-based approach for developing and maintaining the pattern collection.
Control and manipulation are two of the most studied types of attacks on elections. In this paper, we study the complexity of control attacks on elections in which there are manipulators. We study both the case where ...
详细信息
ISBN:
(纸本)9781577356332
Control and manipulation are two of the most studied types of attacks on elections. In this paper, we study the complexity of control attacks on elections in which there are manipulators. We study both the case where the "chair" who is seeking to control the election is allied with the manipulators, and the case where the manipulators seek to thwart the chair. In the latter case, we see that the order of play substantially inf.uences the complexity. We prove upper bounds, holding over every election system with a polynomial-time winner problem, for all standard control cases, and some of these bounds are at the second or third level of the polynomial hierarchy, and we provide matching lower bounds to prove these tight. Nonetheless, for important natural systems the complexity can be much lower. We prove that for approval and plurality elections, the complexity of even competitive clashes between a controller and manipulators falls far below those high bounds, even as low as polynomial time. Yet we for a Borda-voting case show that such clashes raise the complexity unless NP = coNP.
Recruiting or recommending appropriate latent editors who can edit a specific entry (or called article) plays an important role in improving the quality of Wikipedia entries. To predict an editor's editing interes...
详细信息
Recruiting or recommending appropriate latent editors who can edit a specific entry (or called article) plays an important role in improving the quality of Wikipedia entries. To predict an editor's editing interest for Wikipedia entries, this paper proposes an Interest Prediction Factor Graph (IPFG) model, which is characterized by editor's social properties, hyperlinks between Wikipedia entries, categories of an entry and other important features. Furthermore, the paper suggests a parameter learning algorithm based on the gradient descent and Loopy Sum-Product algorithms for factor graphs. The experiment on a Wikipedia dataset shows that, the average prediction accuracy (F1-Measure) of the IPFG model could be up to 87.5%, which is about 35% higher than that of a collaborative filtering approach. Moreover, the paper analyses how incomplete social properties and editing bursts affect the prediction accuracy of the IPFG model. What we found would provide a useful insight into effective Wikipedia article tossing, and improve the quality of those entries that belong to specific categories by means of collective collaboration.
We illustrate our approach to recommending short texts according to their semantic similarity to a given one. We make use of Linked Data on the Web to discover similarity between words, and then we analyze the syntax ...
详细信息
We present a recommender system that suggests geo-located text tags by using linguistic inf.rmation extracted from Linked Data sets available on the Web. The recommender system performs tag matching by measuring the s...
详细信息
暂无评论