Proof. we’re following an argument from (Grötschel, Lovász, and Schrijver 1984); proof is provided for completeness. Assume we are given an oracle O that computes LPw. Consider another polyhedron P◦ w = {y : yx ≤ 1,∀x ∈ Pw}. For any y, we can decide whether y ∈ P◦ w by solving an instance of LPw: max yx, s.t. x ∈ Pw. This can be computed by oracle O and output an optimal solution x∗. If yTx∗ ≤ ...

We address the question of how much space remains for performance improvement over current association rule mining algorithms. Our approach is to compare their performance against an “Oracle algorithm” that knows in advance the identities of all frequent itemsets in the database and only needs to gather the actual supports of these itemsets, in one scan over the database, to complete the mining...

In this paper, we propose to combine imitation and reinforcement learning via the idea of reward shaping using an oracle. We study the effectiveness of the nearoptimal cost-to-go oracle on the planning horizon and demonstrate that the costto-go oracle shortens the learner’s planning horizon as function of its accuracy: a globally optimal oracle can shorten the planning horizon to one, leading t...

In an international epidemiological study of 2000 cardiac surgery patients, the data of 7000 variables are entered through a Visual Basic data entry system and stored in 57 large ORACLE tables. A SAS application is developed to automatically convert the ORACLE tables to SAS data sets, perform a series of intensive data processing, and based upon the result of the data processing, dynamically...

Partitioning oracles were introduced by Hassidim et al. (FOCS 2009) as a generic tool for constant-time algorithms. For any ε > 0, a partitioning oracle provides query access to a fixed partition of the input bounded-degree minor-free graph, in which every component has size poly(1/ε), and the number of edges removed is at most εn, where n is the number of vertices in the graph. However, the or...

7 We consider polynomial-time Turing machines that have access to two oracles and investigate when the order of oracle queries is significant. The oracles used here are complete languages for the Polynomial Hierarchy (PH). We prove that, for solving decision problems, the order of oracle queries does not matter. This improves upon the previous result of Hemaspaandra, Hemaspaandra and Hempel, wh...

A general top-down algorithmization for the WellFounded MKNF Semantics a semantics for combining rules and ontologies was recently defined based on an extension of SLG resolution for Logic Programming with an abstract oracle to the parametric ontology language. Here we provide a concrete oracle with practical usage, namely for EL which is tractable for reasoning tasks like subsumption. We show ...

The paper will introduce the advantages of using the Object-Oriented Model for conceptual modeling, as a kind of knowledge model to capture information system properties. Next, the paper will explain how to properly implement such a system description in an advanced ORACLE environment, using ORACLE v7 as server and Developer/2000 as execution model tool. The main contribution is the definition ...

It is well known that the optimal convergence rate for stochastic optimization of smooth functions is O(1/ √ T ), which is same as stochastic optimization of Lipschitz continuous convex functions. This is in contrast to optimizing smooth functions using full gradients, which yields a convergence rate of O(1/T ). In this work, we consider a new setup for optimizing smooth functions, termed as Mi...

An oracle Turing machine M has the following additional features: – an additional tape (= query tape) – three additional states: query state q?, answer states qYES, qNO Suppose that M has an oracle for the problem A. Then the call of the oracle works as follows: If M is in state q?, then M decides if the string z on the query tape is a positive instance of A or not. ⇒ M either enters state qYES...