Towards Automated Invocation of Web APIs

This paper, targeting the large variety of Web APIs, presents an approach towards automated invocation of Web APIs. This approach applies a data schema, to the SAWSDL lowering schema mapping, a grounding mechanism that connects the ontological representations of Web APIs with their execution messages. It is intuitive to existing standard efforts and effective in coping with the heterogeneities witnessed by a majority of Web APIs

MultiView : a methodology for supporting multiple view schemata in object-oriented databases

It has been widely recognized that object-oriented database (OODB) technology needs to be extended to provide a mechanism similar to views in relational database systems. We define an object-oriented view to be an arbitrarily complex virtual schema graph with possibly restructured generalization and decomposition hierarchies - rather than just one virtual class as has been proposed in the literature. In this paper, we propose a methodology, called MultiView, for supporting multiple such view schemata. MultiView breaks the schema design task into the following independent and well-defined subtasks: (1) the customization of type descriptions and object sets of existing classes by deriving virtual classes, (2) the integration of all derived classes into one consistent global schema graph, and (3) the definition of arbitrarily complex view schemata on this augmented global schema. For the first task of MultiView, we define a set of object algebra operators that can be used by the view definer for class customization. For the second task of MultiView, we propose an algorithm that automatically integrates these newly derived virtual classes into the global schema. We solve the third task of MultiView by first letting the view definer explicitly select the desired view classes from the global schema using a view definition language and then by automatically generating a view class hierarchy for these selected classes. In addition, we present algorithms that verify the closure property of a view and, if found to be incomplete, transform it into a closed, yet minimal, view. In this paper, we introduce the fundamental concept of view independence and show MultiView to be view independent. We also outline implementation techniques for realizing MultiView with existing OODB technology

Overlapping memory replay during sleep builds cognitive schemata

Sleep enhances integration across multiple stimuli, abstraction of general rules, insight into hidden solutions and false memory formation. Newly learned information is better assimilated if compatible with an existing cognitive framework or schema. This article proposes a mechanism by which the reactivation of newly learned memories during sleep could actively underpin both schema formation and the addition of new knowledge to existing schemata. Under this model, the overlapping replay of related memories selectively strengthens shared elements. Repeated reactivation of memories in different combinations progressively builds schematic representations of the relationships between stimuli. We argue that this selective strengthening forms the basis of cognitive abstraction, and explain how it facilitates insight and false memory formation

A benchmark for online non-blocking schema transformations

This paper presents a benchmark for measuring the blocking behavior of schema transformations in relational database systems. As a basis for our benchmark, we have developed criteria for the functionality and performance of schema transformation mechanisms based on the characteristics of state of the art approaches. To address limitations of existing approaches, we assert that schema transformations must be composable while satisfying the ACID guarantees like regular database transactions. Additionally, we have identified important classes of basic and complex relational schema transformations that a schema transformation mechanism should be able to perform. Based on these transformations and our criteria, we have developed a benchmark that extends the standard TPC-C benchmark with schema transformations, which can be used to analyze the blocking behavior of schema transformations in database systems. The goal of the benchmark is not only to evaluate existing solutions for non-blocking schema transformations, but also to challenge the database community to find solutions that allow more complex transactional schema transformations

Suggestions for Genetic A.I.

This paper presents suggestions for "Genetic A.I.": an attempt to model the genesis of intelligence in human infants, particularly as described by Piaget's theory of the Sensorimotor period. The paper includes a synopsis of Sensorimotor intelligence, followed by preliminary suggestions for a mechanism (the "Schema mechanism") for its development, and a hypothetical Scenario which partially reinterprets Sensorimotor development in terms of that mechanism. The Schema mechanism focuses on Piaget's concept of the competition and evolution of mental "schemas." The schema is modelled here as an assertion that one partial state of the mechanism's world-representation is transformable to another via a given action, taken when the schema is "activated". A proposed process of "correlation" allows a schema's assertion to be extended or revised in response to empirically-observed effects of the schema's activation. Correlation uses the the formation and activation of schemas to propose and test hypothesis, in contrast with the passive tabulation characteristic of associationist mechanisms. Further features are proposed to enable schemas to become coordinated into composite structures, "compound actions", which can be used by other schemas; and to synthesize new "items" (state-elements) when existing ones prove inadequate to model the world. The Scenario outlines how the Schema mechanism might begin to make its way through the progression of Sensorimotor stages; development culminating in Piaget's third stage is discussed. This development includes learning about the visual and tactile effects of eye and hand motions-- eg, learning how to look directly at an object, or to move a hand into view; and the organization of that knowledge to designate the tactile properties of "visual objects", and vice versa-- eg knowing how to touch an object which is seen-- paving the way to a sensory-modality-invariant representation of objects and space. The Schema mechanism attempts to "learn from scratch", without built-in expertise or built-in structure in its learning domains. In the past there has been little success among AI programs of this genre. But many such attempts have suffered from mechanisms which were trivial in that they placed the full burden of acquiring and structuring knowledge on one or two simple tricks, whereas, I claim, the present effort shows a willingness to incorporate a multiplicity of elements in a complicated mechanism. In addition, the Schema mechanism benefits from its orientation around a nontrivial theory of development. Piaget gives a comprehensive account of the infant's evolution of primitive problem-solving and domain-specific (chiefly object-manipulation) knowledge; this account is used here as a roadmap that describes the proper course for the mechanism to follow. Thus, there is a nontrivial (or at least nonarbitrary) sequence of target abilities to use as a framework for evaluating and revising the mechanism's performance.MIT Artificial Intelligence Laborator

The POOL Data Storage, Cache and Conversion Mechanism

The POOL data storage mechanism is intended to satisfy the needs of the LHC experiments to store and analyze the data from the detector response of particle collisions at the LHC proton-proton collider. Both the data rate and the data volumes will largely differ from the past experience. The POOL data storage mechanism is intended to be able to cope with the experiment's requirements applying a flexible multi technology data persistency mechanism. The developed technology independent approach is flexible enough to adopt new technologies, take advantage of existing schema evolution mechanisms and allows users to access data in a technology independent way. The framework consists of several components, which can be individually adopted and integrated into existing experiment frameworks.Comment: Talk from the 2003 Computing in High Energy and Nuclear Physics (CHEP03), La Jolla, Ca, USA, March 2003, 5 pages, PDF, 6 figures. PSN MOKT00

Semantics and Validation of Shapes Schemas for RDF

We present a formal semantics and proof of soundness for shapes schemas, an expressive schema language for RDF graphs that is the foundation of Shape Expressions Language 2.0. It can be used to describe the vocabulary and the structure of an RDF graph, and to constrain the admissible properties and values for nodes in that graph. The language defines a typing mechanism called shapes against which nodes of the graph can be checked. It includes an algebraic grouping operator, a choice operator and cardinality constraints for the number of allowed occurrences of a property. Shapes can be combined using Boolean operators, and can use possibly recursive references to other shapes. We describe the syntax of the language and define its semantics. The semantics is proven to be well-defined for schemas that satisfy a reasonable syntactic restriction, namely stratified use of negation and recursion. We present two algorithms for the validation of an RDF graph against a shapes schema. The first algorithm is a direct implementation of the semantics, whereas the second is a non-trivial improvement. We also briefly give implementation guidelines