RWA is a fundamental problem in the design and control of optical networks. We propose link selection algorithms that reduce the size of the link-based ilp formulation for RWA by pruning redundant link decision variab...
详细信息
ISBN:
(纸本)9781479904914
RWA is a fundamental problem in the design and control of optical networks. We propose link selection algorithms that reduce the size of the link-based ilp formulation for RWA by pruning redundant link decision variables. the resulting formulation scales well to mesh topologies representative of backbone and regional networks. In our experiments, the new formulation decreases the running time by more than two orders of magnitude without any impact on optimality. the link selection techniques are general in that they may be applied to any optimization problem for which the ilp formulation consists of multicommodity flow equations as its core constraints.
In this paper we present the work in progress on LogCHEM, an ilp based tool for discriminative interactive mining of chemical fragments. In particular, we describe the integration with a molecule visualisation softwar...
详细信息
ISBN:
(纸本)9783642024801
In this paper we present the work in progress on LogCHEM, an ilp based tool for discriminative interactive mining of chemical fragments. In particular, we describe the integration with a molecule visualisation software that allows the chemist to graphically control the search for interesting patterns in chemical fragments. Furthermore, we show how structured information, such as rings, functional groups like carboxyl, amine, methyl, ester, etc are integrated and exploited in LogCHEM.
ilp learners are commonly implemented to consider sequentially each training example for each of the hypotheses tested. Computing the cover set of a hypothesis in this way is costly, and introduces a major bottleneck ...
详细信息
this paper proposes new architecture of agent which adapts its behavior by predicting the results of actions and avoiding taking ones predicted to be failures shown in Fig. 1. Our agent consists of five parts: Observe...
ISBN:
(纸本)3540679251
this paper proposes new architecture of agent which adapts its behavior by predicting the results of actions and avoiding taking ones predicted to be failures shown in Fig. 1. Our agent consists of five parts: Observer, Planner, Actor which are same as those of basic agent and write perceiving information in the first-order formalism, Learner which acquires prediction rules using inductivelogicprogramming (ilp), and Checker which predicts the result of an action selected by Planner and changes action if it seems to be failure. the agent classifies past actions into successes and failures, then it learns rules from them to assort the current action without information after taking it.
the proceedings contain 30 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and Reasoning. the topics include: From tableaux to automata for description logics;imperat...
ISBN:
(纸本)3540201017
the proceedings contain 30 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and Reasoning. the topics include: From tableaux to automata for description logics;imperative object-based calculi in co-inductive type theories;congruence closure with integer offsets;a translation characterizing the constructive content of classical theories;extensions of non-standard inferences to description logics with transitive roles;extended canonicity of certain topological properties of set spaces;algebraic and model theoretic techniques for fusion decidability in modal logics;on closure under complementation of equational tree automata for theories extending ac;completeness of e-unification with eager variable elimination;handling equality in monodic temporal resolution;computing preferred answer sets in answer set programming;a syntax-based approach to reasoning about actions and events;minimizing automata on infinite words;accelerating proof search for zero-one linear constraint systems;NP-completeness results for deductive problems on stratified terms;automatic structures of bounded degree;an optimal automata approach to ltl model checking of probabilistic systems;a logical study on qualitative default reasoning with probabilities;strict geometry of interaction graph models and connection-based proof construction in non-commutative logic.
In this paper, we make an attempt to use inductivelogicprogramming (ilp) to automatically learn non trivial descriptions of symbols, based on a formal description. this work is a first step in this direction and is ...
详细信息
In this paper, we make an attempt to use inductivelogicprogramming (ilp) to automatically learn non trivial descriptions of symbols, based on a formal description. this work is a first step in this direction and is rather a proof of concept, rather than a fully operational and robust framework. the overall goal of our approach is to express graphic symbols by a number of primitives that may be of any complexity (i.e. not necessarily just lines or points) and connecting relationships that can be deduced from straightforward state-of-the art image treatment and analysis tools. this representation is then used as an input to an ilp solver, in order to deduce non obvious characteristics that may lead to a more semantic related recognition process.
Several learning systems based on Inverse Entailment (IE) have been proposed, some that compute single clause hypotheses, exemplified by Progol, and others that, produce multiple clauses in response to a single seed e...
详细信息
ISBN:
(纸本)9783642042379
Several learning systems based on Inverse Entailment (IE) have been proposed, some that compute single clause hypotheses, exemplified by Progol, and others that, produce multiple clauses in response to a single seed example. A common denominator of these systems, is a restricted hypothesis search space, within which each clause must individually explain some example E, or some member of an abductive explanation for E. this paper proposes a new IE approach, called Induction on Failure (IoF), that generalises existing Horn clause learning systems by allowing the computation of hypotheses within a larger search space, namely that of Connected theories. A proof procedure for IoF is proposed that generalises existing IE systems and also resolves Yamamoto's example. A prototype implementation is also described. Finally, a semantics is presented called Connected theory Generalisation, which is proved to extend Kernel Set Subsumption and to include hypotheses constructed within this new IoF approach.
An important problem that decreases the accuracy in thai Printed Character Recognition system is the errors in segmentation process. In vertical connected character segmentation, we can easily use the reference lines ...
详细信息
ISBN:
(纸本)3540407308
An important problem that decreases the accuracy in thai Printed Character Recognition system is the errors in segmentation process. In vertical connected character segmentation, we can easily use the reference lines of thai language structure. this paper thus proposes a method for detecting the connecting points in horizontal connected characters. First, we extract the features of the connecting points in the character images. then, we employ inductivelogicprogramming to produce the rules that will be used to classify the unseen examples. Finally, we use Backpropagation Neural Network to make these rules more flexible. the results show that our method achieves 94.94% of accuracy.
the exponential growth in computation demand drives chip vendors to heterogeneous architectures combining Instruction-Level Processors (ilps) and custom HW Accelerators (HWACCs) in an attempt to provide the needed pro...
详细信息
ISBN:
(纸本)9781479936090
the exponential growth in computation demand drives chip vendors to heterogeneous architectures combining Instruction-Level Processors (ilps) and custom HW Accelerators (HWACCs) in an attempt to provide the needed processing capabilities while meeting power/energy requirements. ilps, on one hand, are highly flexible, but power inefficient. Custom HWACCs, on the other hand, are inflexible (focusing on dedicated kernels), but highly power efficient. Since, designing HWACCs for every application is cost prohibitive, large portions of applications still run inefficiently on ilps. New processing architectures are needed that combine the power efficiency of HWACCs while still retaining sufficient flexibility to realize applications across targeted market segments. this paper introduces Function-Level Processors (FLPs) to fill the gap between ilps and dedicated HWACCs. FLPs are comprised of configurable Function Blocks (FBs) implementing selected functions which are then interconnected via programmable point-to-point connections constructing an extensible/configurable macro data-path. An FLP raises programming abstraction to a Function-Set Architecture (FSA) controlling FBs allocation, configuration and scheduling. We demonstrate FLP benefits with an industry example of the Pipeline-Vision Processor (PVP). We highlight the gained flexibility by mapping 10 embedded vision applications entirely to the FLP-PVP offering up to 22.4 GOPs/s with average power of 120 mW. the results also demonstrate that our FLP-PVP solution consumes 14x-18x less power than an ilp and 5x less power than a hybrid ilp+ HWACCs solution.
暂无评论