Scientific Annals of Computer Science
"Alexandru Ioan Cuza" University of Iaşi
Volume IX, 2000
On Coverability Structures for Jumping Petri Nets.,
pages 1-26
Cristian VIDRASCU, Toader JUCAN
Abstract |
BibTeX
The goal of this paper is to extend some concepts
about coverability structures
from the class of finite jumping
Petri nets ({it FJPTN}) to a
newly defined class of nets, called
marked reduced-computable jumping Petri nets
({it mRCJPTN}).
Moreover, we will point out how minimal coverability structures
can be defined for jumping Petri nets as well.
A RDF Description of Distributed File Systems.,
pages 27-44
Sabin Corneliu BURAGA
Abstract |
BibTeX
The modern operating systems must integrate various Internet services,
especially World-Wide Web facilities to access Web resources
using file systems mechanisms. In this paper we present a high-level
model describing an abstract distributed file system. The proposed description
is based on emph{Resource Description Framework} (emph{RDF}) recommendation
of the World-Wide Web Consortium, a standardized foundation for processing
metadata. To represent the RDF statements about various file characteristics,
we propose an XML-based language called emph{Extensible File Properties
Markup Language}.
Ontologies for Information Retrieval.,
pages 45-64
Amalia TODIRASCU
Abstract |
BibTeX
The paper presents a system for querying in natural language (French)
a set of texts from a limited domain. The domain knowledge,
represented in description logics (DL), is used for filtering
the results of the search and it is extended dynamically (when new
concepts are identified in the texts), as result of DL inference mechanisms.
The conceptual hierarchy is built semi-automatically
from the texts. Candidate concepts are identified in the texts and
checked by the DL tests (satisfiability, consistency etc.).
Different small French corpora (heart surgery, newspaper articles,
papers on natural language processing) have been used for
experimenting the prototype. The system uses shallow natural language
parsing techniques and DL reasoning mechanisms are used to
handle incomplete or incorrect user queries.
A query expansion based on reduced document representation is proposed
as an alternative for document retrieval.
Boundary Control Approximation of a 1-Dimensional Hyperbolic Equations.,
pages 65-78
Anca IGNAT
Abstract |
BibTeX
In this paper we study the approximation for a quadratic control problem
over an infinite time horizon, governed by a 1-dimensional
hyperbolic equation with unbounded control operator. We used the
general abstract model proposed by I.Lasiecka and
R.Triggiani in cite{L1}, cite{LT1}, cite{LT2} to study the
convergence of the approximation scheme. For this problem, the exact
solution of the algebraic Riccati equation associated to the control
problem can be computed and thus, the correctness of the numerical results
is evaluated.
On the Computation of the Nucleous of Line-Graph Peer Group Games.,
pages 79-92
Rodica BRANZEI
Abstract |
BibTeX
Line--graph peer group games are coalitional games modelling
economic situations in which agents with potential individual
economic possibilities are connected via a chain--like hierarchy
within an organization. We focus on the nucleolus of such games.
Formulae for computing the nucleolus of small games are provided
and an iterative algorithm for the case with more than four agents
involved is designed and analysed.
Generalized Template Dependencies.,
pages 93-
Adrian OANCEA
Abstract |
BibTeX
This paper is a contribution to the study of a large
class of dependencies, called ``generalized template
dependencies''. This class includes template dependencies,
multivalued dependencies, join dependencies, mutual dependencies,
subset dependencies, and embedded versions of the above mentioned
dependencies . The existing studies (Sadri, Ullman, Fagin, Mayer,
Yannakakis) treat only the template dependencies, which are
considered on a single relational schema.
In this work, we define the generalized template dependencies
(GTD-s) as template dependencies on database schemas and we prove
that some results obtained for template dependencies are
confirmed, and others are not confirmed. We give a complete
axiomatization for GTD-s, we define the chase process and study
the existence of the strongest and the weakest GTD-s.
