A general framework for adaptive processing of data structures

1998 ◽  
Vol 9 (5) ◽  
pp. 768-786 ◽  
Author(s):  
P. Frasconi ◽  
M. Gori ◽  
A. Sperduti
Keyword(s):  
Data Structures ◽  
General Framework ◽  
Adaptive Processing

Towards a Lexically Oriented Automatic Parsing

1991 ◽  
Vol 15 (1) ◽  
pp. 1-40
Author(s):  
Lucio Costa
Keyword(s):  
Artificial Intelligence ◽  
Distributed Control ◽  
Data Structures ◽  
General Framework ◽  
Computational Models ◽  
The Other ◽  
Sono Stati ◽  
Use Context ◽  
And Linguistics ◽  
Context Free

RIASSUNTO La ricerca sul linguaggio naturale condotta in Intelligenza Artificiale si è sviluppata, malgrado le apparenze, in modo alquanto indipendente dal la-voro dei linguisti. Da un lato sono stati elaborati modelli computazionali delle facoltà di lunguaggio che si configurano come largamente autonomi rispetto a quelli sviluppati in linguistica. D'altro lato, l'implementazione dei sistemi è stata influenzata da soluzioni pragmatiche connesse all'efficacia computazionale delle regole indipendenti dal contesto, alla necessità di evitare componenti trasformazionali inversi e ad una concezione rappresenta-zionale del significato. Il presente articolo propone l'interesse dei lavori lin-guistici di Z. S. Harris e M. Gross ai fini dello sviluppo di un'analisi sintat-tica automatica che sia a controllo diffuso e incentrata sul comportamento idiosincratico delle unità lessicali. Essa è anche inquadrata nel tentativo di gettare luce sulla natura del processo denotazionale. SUMMARY In spite of the claim on the interactions between artificial intelligence (AI) and linguistics, AI research on natural language has developed independently from the work of linguists. On one hand, computational models of the faculties of language which are independent from the models developed in linguistics have been worked out. On the other hand, the AI system design has been oriented towards practical solutions, whose main motivations where to use context-free rules, to avoid an inverse transformational component, and to represent meanings by some data structures. This paper is about the linguistic works of Z.S. Harris and M. Gross to develop automatic distributed control parsing which takes seriously into account the indiosyncratic behaviour of the lexical items. The general framework for the discussion is the procedural nature of the denotational process.

scholarly journals Timed Automata May Cause Some Troubles

2002 ◽  
Vol 9 (35) ◽  
Author(s):  
Patricia Bouyer
Keyword(s):  
Data Structures ◽  
General Framework ◽  
Timed Automata ◽  
Exact Computation ◽  
Analysis Algorithm ◽  
Forward Analysis

Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it does not support a natural implementation and, in practice, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on forward analysis algorithms, the exact computation of all the successors of the initial configurations does not always terminate. Thus, some abstractions are often used to ensure termination, among which, a widening operator on zones.<br /> <br />In this paper, we study in details this widening operator and the forward analysis algorithm that uses it. This algorithm is most used and implemented in tools like Kronos and Uppaal. One of our main results is that it is hopeless to find a forward analysis algorithm, that uses such a widening operator, and which is correct. This goes really against what one could think. We then study in details this algorithm in the more general framework of updatable timed automata, a model which has been introduced as a natural syntactic extension of classical timed automata. We describe subclasses of this model for which a correct widening operator can be found.

CFEL: A Finite Element Library

1999 ◽  
Author(s):  
G. M. Seed ◽  
G. E. Cardew
Keyword(s):  
Finite Element ◽  
Data Structures ◽  
Finite Element Modelling ◽  
General Framework ◽  
Computational Modelling ◽  
Object Oriented ◽  
Element Modelling ◽  
Class Library ◽  
Class Hierarchies ◽  
As Stress

Abstract An overview of an object-oriented class library, CFEL, for finite element modelling is presented. The structure and class hierarchies of CFEL are presented and how the library forms part of a larger computational modelling class framework, CML. The CML framework is a move towards a general framework for geometric computational modelling which unifies traditionally separate disciplines such as stress analysis and fluid flow. CML consists of the following set of core libraries for modelling: i) data structures, ii) element and structure geometric modelling, iii) material and geometric characteristics and iv) solid and fluid finite element modelling, of which CFEL is a member.

scholarly journals Verifying concurrent multicopy search structures

2021 ◽  
Vol 5 (OOPSLA) ◽  
pp. 1-32
Author(s):  
Nisarg Patel ◽  
Siddharth Krishna ◽  
Dennis Shasha ◽  
Thomas Wies
Keyword(s):  
Data Structures ◽  
General Framework ◽  
Directed Acyclic Graphs ◽  
Separation Logic ◽  
A Value ◽  
Acyclic Graphs ◽  
Multiple Copies ◽  
File Structures ◽  
Search Structure ◽  
Concurrent Separation Logic

Multicopy search structures such as log-structured merge (LSM) trees are optimized for high insert/update/delete (collectively known as upsert) performance. In such data structures, an upsert on key k , which adds ( k , v ) where v can be a value or a tombstone, is added to the root node even if k is already present in other nodes. Thus there may be multiple copies of k in the search structure. A search on k aims to return the value associated with the most recent upsert. We present a general framework for verifying linearizability of concurrent multicopy search structures that abstracts from the underlying representation of the data structure in memory, enabling proof-reuse across diverse implementations. Based on our framework, we propose template algorithms for (a) LSM structures forming arbitrary directed acyclic graphs and (b) differential file structures, and formally verify these templates in the concurrent separation logic Iris. We also instantiate the LSM template to obtain the first verified concurrent in-memory LSM tree implementation.

Adaptive Processing of Sequences and Data Structures,

2000 ◽  
Vol 35 (1-4) ◽  
pp. 203-204
Author(s):  
Witold Pedrycz
Keyword(s):  
Data Structures ◽  
Adaptive Processing

A general framework for prefetch scheduling in linked data structures and its application to multi-chain prefetching

2004 ◽  
Vol 22 (2) ◽  
pp. 214-280 ◽  
Author(s):  
Seungryul Choi ◽  
Nicholas Kohout ◽  
Sumit Pamnani ◽  
Dongkeun Kim ◽  
Donald Yeung
Keyword(s):  
Data Structures ◽  
Linked Data ◽  
General Framework

scholarly journals First-class patterns

2009 ◽  
Vol 19 (2) ◽  
pp. 191-225 ◽  
Author(s):  
BARRY JAY ◽  
DELIA KESNER
Keyword(s):  
Pattern Matching ◽  
Data Structures ◽  
General Framework ◽  
Expressive Power ◽  
Training Data ◽  
Matching Algorithm ◽  
Recursive Functions ◽  
Pattern Polymorphism

AbstractPure pattern calculus supports pattern-matching functions in which patterns are first-class citizens that can be passed as parameters, evaluated and returned as results. This new expressive power supports two new forms of polymorphism. Path polymorphism allows recursive functions to traverse arbitrary data structures. Pattern polymorphism allows patterns to be treated as parameters which may be collected from various sources or generated from training data. A general framework for pattern calculi is developed. It supports a proof of confluence that is parameterised by the nature of the matching algorithm, suitable for the pure pattern calculus and all other known pattern calculi.

Sign in / Sign up

Export Citation Format

Share Document