Aim of this paper is to define a scheduling of the task graph of an application that minimizes its total execution time on a partially dynamically reconfigurable FPGA. The scheduler has to take into account the reconf...
详细信息
ISBN:
(纸本)9783981080131
Aim of this paper is to define a scheduling of the task graph of an application that minimizes its total execution time on a partially dynamically reconfigurable FPGA. The scheduler has to take into account the reconfiguration overhead of each task, the area constraint of the target FPGA, the precedences between the tasks, configuration prefetching and module reuse. We introduce an ILP formulation to solve the task scheduling problem in the reconfigurable architecture scenario. This formulation has been used to identify interesting features for a possible heuristic scheduler. The results of the ILP solution show how a reconfiguration-aware scheduler exploiting all the reconfiguration features can outperform one with partial knowledge.
We define N-model tests that target detection of faults belonging to N specified fault models. We provide a method for deriving minimal tests using integer linear programming (ILP) without reducing the individual faul...
详细信息
ISBN:
(纸本)9781424418060
We define N-model tests that target detection of faults belonging to N specified fault models. We provide a method for deriving minimal tests using integer linear programming (ILP) without reducing the individual fault model coverage. Any test sequences, deterministic, random, functional, N-detect, etc., can be minimized for the given set of fault models. Stuck-at, transition, and pseudo stuck-at I{sub}(DDQ) faults are used as illustrations. We generate tests using Mentor Graphics FastScan ATPG tool employing a single fault model at a time. A minimized test set for the three fault models is then obtained by solving the proposed combined ILP problem. For s5378 benchmark circuit we achieved about 50% reduction in the number of vectors and 10% reduction in the I{sub}(DDQ) current measurements compared to the originally generated tests. We also propose a reduced complexity ILP approximation.
A novel relational learning approach that tightly integrates the naive Bayes learning scheme with the inductive logic programming rule-learner FOIL is presented. In contrast to previous combinations that have employed...
详细信息
A novel relational learning approach that tightly integrates the naive Bayes learning scheme with the inductive logic programming rule-learner FOIL is presented. In contrast to previous combinations that have employed naive Bayes only for post-processing the rule sets, the presented approach employs the naive Bayes criterion to guide its search directly. The proposed technique is implemented in the NFOIL and TFOIL systems, which employ standard naive Bayes and tree augmented naive Bayes models respectively. We show that these integrated approaches to probabilistic model and rule learning outperform post-processing approaches. They also yield significantly more accurate models than simple rule learning and are competitive with more sophisticated ILP systems.
In real-life domains, learning systems often have to deal with various kinds of imperfections in data such as noise, incompleteness and inexactness. This problem seriously affects the knowledge discovery process, spec...
详细信息
In real-life domains, learning systems often have to deal with various kinds of imperfections in data such as noise, incompleteness and inexactness. This problem seriously affects the knowledge discovery process, specifically in the case of traditional Machine Learning approaches that exploit simple or constrained knowledge representations and are based on single inference mechanisms. Indeed, this limits their capability of discovering fundamental knowledge in those situations. In order to broaden the investigation and the applicability of machine learning schemes in such particular situations, it is necessary to move on to more expressive representations which require more complex inference mechanisms. However, the applicability of such new and complex inference mechanisms, such as abductive reasoning, strongly relies on a deep background knowledge about the specific application domain. This work aims at automatically discovering the meta-knowledge needed to abduction inference strategy to complete the incoming information in order to handle cases of missing knowledge.
Protein-protein interactions (PPIs) are intrinsic to almost all cellular processes. Different computational methods offer new chances to study PPIs. To predict PPIs, while the integrative methods use multiple data sou...
详细信息
Protein-protein interactions (PPIs) are intrinsic to almost all cellular processes. Different computational methods offer new chances to study PPIs. To predict PPIs, while the integrative methods use multiple data sources instead of a single source, the domain-based methods often use only protein domain features. Integration of both protein domain features and genomic/proteomic features from multiple databases can more effectively predict PPIs. Moreover, it allows discovering the reciprocal relationships between PPIs and biological features of their interacting partners. We developed a novel integrative domain-based method for predicting PPIs using inductive logic programming (ILP). Two principal domain features used were domain fusions and domain-domain interactions (DDIs). Various relevant features of proteins were exploited from five popular genomic and proteomic databases. By integrating these features, we constructed biologically significant ILP background knowledge of more than 278,000 ground facts. The experimental results through multiple 10-fold cross-validations demonstrated that our method predicts PPIs better than other computational methods in terms of typical performance measures. The proposed ILP framework can be applied to predict DDIs with high sensitivity and specificity. The induced ILP rules gave us many interesting, biologically reciprocal relationships among PPIs, protein domains, and PPI-related genomic/proteomic features. Supplementary material is available at (http://***/~s0560205/PPIandDDI/).
Probabilistic Relational Learning is a research area that brings together several previously separated lines of research. One line of research originates with early approaches to combine probabilistic graphical models...
详细信息
Probabilistic Relational Learning is a research area that brings together several previously separated lines of research. One line of research originates with early approaches to combine probabilistic graphical models with higher-level, logic-based representation languages. Originally mostly pursued for the purpose of knowledge representation and reasoning (and then called knowledge-based model construction), this line of research gained significant momentum when its focus shifted to machine learning, where it was found that these new representation languages are well-suited to provide statistical models for relational data. A second line of research is represented by inductive logic programming, which for a long time had been concerned with learning purely logical models from logical or relational data, and over the past decade has increasingly turned towards probabilistic-logic models as well. Finally, over the past few years a further integration has taken place with sub-areas of machine learning that are concerned with learning from structured data, notably graph mining.
The paper introduces LOGAN-H-a system for learning first-order function-free Horn expressions from interpretations. The system is based on an algorithm that learns by asking questions and that was proved correct in pr...
详细信息
The paper introduces LOGAN-H-a system for learning first-order function-free Horn expressions from interpretations. The system is based on an algorithm that learns by asking questions and that was proved correct in previous work. The current paper shows how the algorithm can be implemented in a practical system, and introduces a new algorithm based on it that avoids interaction and learns from examples only. The LOGAN-H system implements these algorithms and adds several facilities and optimizations that allow efficient applications in a wide range of problems. As one of the important ingredients, the system includes several fast procedures for solving the subsumption problem, an NP-complete problem that needs to be solved many times during the learning process. We describe qualitative and quantitative experiments in several domains. The experiments demonstrate that the system can deal with varied problems, large amounts of data, and that it achieves good classification accuracy.
In this paper, we propose a novel class of wrappers (logic wrappers) inspired by the logic prog- ramming paradigm. The developed logic wrappers (L-wrapper) have declarative semantics, and therefore: (i) their specific...
详细信息
In this paper, we propose a novel class of wrappers (logic wrappers) inspired by the logic prog- ramming paradigm. The developed logic wrappers (L-wrapper) have declarative semantics, and therefore: (i) their specification is decoupled from their implementation and (ii) they can be generated using inductive logic programming. We also define a convenient way for mapping L-wrappers to XSLT for efficient processing using available XSLT processing engines.
Fuzzy predicates have been incorporated into machine learning and data mining to extend the types of data relationships that can be represented, to facilitate the interpretation of rules in linguistic terms, and to av...
详细信息
Fuzzy predicates have been incorporated into machine learning and data mining to extend the types of data relationships that can be represented, to facilitate the interpretation of rules in linguistic terms, and to avoid unnatural boundaries in partitioning attribute domains. The confidence of an association is classically measured by the co-occurrence of attributes in tuples in the database. The semantics of fuzzy rules, however, is not co-occurrence but rather graduality or certainty and is determined by the implication operator that defines the rule. In this paper we present a learning algorithm, based on inductive logic programming, that simultaneously learns the semantics and evaluates the validity of fuzzy rules. The learning algorithm selects the implication that maximizes rule confidence while trying to be as informative as possible. The use of inductive logic programming increases the expressive power of fuzzy rules while maintaining their linguistic interpretability. (c) 2006 Elsevier B.V. All rights reserved.
Daikon is an implementation of dynamic detection of likely invariants;that is, the Daikon invariant detector reports likely program invariants. An invariant is a property that holds at a certain point or points in a p...
详细信息
Daikon is an implementation of dynamic detection of likely invariants;that is, the Daikon invariant detector reports likely program invariants. An invariant is a property that holds at a certain point or points in a program;these are often used in assert statements, documentation, and formal specifications. Examples include being constant (x = a), non-zero (x not equal 0), being in a range (a <= x <= b), linear relationships (y = ax + b), ordering (x <= y), functions from a library (x = fn(y)), containment (x epsilon y), sortedness (x is sorted), and many more. Users can extend Daikon to check for additional invariants. Dynamic invariant detection runs a program, observes the values that the program computes, and then reports properties that were true over the observed executions. Dynamic invariant detection is a machine learning technique that can be applied to arbitrary data. Daikon can detect invariants in C, C + +, Java, and Perl programs, and in record-structured data sources;it is easy to extend Daikon to other applications. Invariants can be useful in program understanding and a host of other applications. Daikon's output has been used for generating test cases, predicting incompatibilities in component integration, automating theorem proving, repairing inconsistent data structures, and checking the validity of data streams, among other tasks. Daikon is freely available in source and binary form, along with extensive documentation, at http://***/daikon/. (c) 2007 Elsevier B.V. All rights reserved.
暂无评论