The problem of multi-label classification has attracted great interests in the last decade. Multi-label classification refers to the problems where an example that is represented by a single instance can be assigned t...
详细信息
Finding justifications plays an important role in the development and maintenance of ontologies. It helps users or developers to understand the entailments by presenting the minimal subsets of the ontology which are r...
详细信息
Partial label learning deals with the problem where each training example is associated with a set of candidate labels, among which only one is correct. The common strategy is to try to disambiguate their candidate la...
详细信息
In the keyphrase prediction task, it is usually difficult for a single corpus information to help the model learn enough core information, so this paper improves the current keyphrase generation method based on the co...
详细信息
Inconsistency handling in OWL DL ontologies is an important problem because an ontology can easily be inconsistent when it is generated or modified. Current approaches to dealing with inconsistent ontologies often ass...
详细信息
ISBN:
(纸本)9781614994190;9781614994183
Inconsistency handling in OWL DL ontologies is an important problem because an ontology can easily be inconsistent when it is generated or modified. Current approaches to dealing with inconsistent ontologies often assume that there exists a total order over axioms and use such an order to select axioms to remove. However, in some cases, such as ontology merging, a total order may not be available and we only have a partial order over axioms. In this paper, we consider a general notion of logical inconsistency and define the notion of conflict of an inconsistent ontology. We then propose a general approach to resolving inconsistency of a partially ordered ontology. We instantiate this approach by proposing two algorithms to calculate prioritized hitting sets for a set of conflicts. We implement the algorithms and provide evaluation results on the efficiency and effectiveness by considering both artificial and real-life data sets.
One of the fundamental challenges for Peer to Peer (P2P) systems is the ability to manage risks involved in interacting and collaborating with prior unknown and potentially malicious parties. Reputation-based trust ma...
详细信息
As technology scales, multiple bit upsets (MBUs) have shown prominent effect, thus affecting the reliability of memory to a great extent. In order to mitigate MBUs errors, interleaving schemes together with single err...
详细信息
With the increasing use of field-programmable gate arrays (FPGAs) in embedded systems and many embedded applications, the failure to protect FPGA-based embedded systems from cloning attacks has brought serious losse...
详细信息
With the increasing use of field-programmable gate arrays (FPGAs) in embedded systems and many embedded applications, the failure to protect FPGA-based embedded systems from cloning attacks has brought serious losses to system developers. This paper proposes a novel combinational logic binding technique to specially protect FPGA-based embedded systems from cloning attacks and provides a pay-per-device licensing model for the FPGA market. Security analysis shows that the proposed binding scheme is robust against various types of malicious attacks. Experimental evaluations demonstrate the low overhead of the proposed technique.
In this paper, an efficient iterated greedy algorithm is proposed for the SDST (Sequence Dependent Setup Time) no-wait flowshop with makespan minimization, which is known to be NP-hard. By introducing effective operat...
详细信息
In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PH1 (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A co...
详细信息
暂无评论