261.
Centrum voor Wiskunde en Informatica
- Heinrich Herre
We showhow to use model classes of partial logic to define semantics of general knowledge-based reasoning.
262.
Centrum voor Wiskunde en Informatica
- R. C. E. Van Velthoven
Automatically generating presentations from content available on the World Wide Web, mainly
through multimedia databases, is made possible with the advent of the Semantic Web and the
increasing availability of multimedia repositories. The Semantic Web enables machines to work
with assumptions on the meaning and interrelations of multimedia content. This makes it
possible to present information in a more coherent manner, paving the way for the field of
automatic multimedia presentation generation. Among the different issues to be solved in this
field is layout generation. When combining separate parts together into a single presentation,
new options and dangers present themselves. In this report we look at two...
263.
Facultad De Informatica
- J. Correas,J. M. Gomez,M. Carro,D. Cabeza,M. Hermenegildo,J. Correas Et Al
This paper describes a model of persistence in (C)LP languages and two di#erent and practically
very useful ways to implement this model in current systems. The fundamental idea is that
persistence is a characteristic of certain dynamic predicates (i.e., those which encapsulate state).
The main e#ect of declaring a predicate persistent is that the dynamic changes made to such
predicates persist from one execution to the next one. After proposing a syntax for declaring
persistent predicates, a simple, file-based implementation of the concept is presented and some
examples shown. An additional implementation is proposed which stores persistent predicates
in an external database. The abstraction of the concept...
264.
Facultad De Informatica
- J. Correas,J. M. Gomez,M. Carro,D. Cabeza,M. Hermenegildo,J. Correas Et Al
This paper describes a model of persistence in (C)LP languages and two di#erent and practically
very useful ways to implement this model in current systems. The fundamental idea is that
persistence is a characteristic of certain dynamic predicates (which encapsulate state). The main
e#ect of declaring a predicate persistent is that the dynamic changes made to such predicates persist
from one execution to the next one. After proposing a syntax for declaring persistent predicates,
a simple, file-based implementation of the concept is presented and some examples shown. It is
then argued that the concept developed provides the most natural way to interface with databases.
Such an interface...
265.
HTTPSniffer. Monitoreo de tráfico HTTP: herramienta de monitoreo de tráfico HTTP basada en la Web
- Malvaso, Marisa Andrea; Facultad de Informática
266.
Análisis de proxies cooperativos en sistemas educativos: observaciones y mediciones en la Universidad de Karlsruhe, República Federal de Alemania
- Sosa, Eduardo Omar; Facultad de Informática
267.
Inteligencias en Aplicaciones Senbiles al Contexto
- Diab, Jose Carlos; Facultad de Informática
268.
Connectability Problems
- Vakgroep Informatica
In this paper we define a general class of problems in computational geometry
that we cal connectability problems. Connectability problems involve
connecting objects by some kind of connections, avoiding obstacles. This
includes many different types of problems like intersection problems, visibility
problems, etc. Studying these problems in a general framework might
led to general solutions. Some solutions axe presented. In paxticulax, an
O(nlog nlogiog n) solution is given for determining al pairs of points in a
set that can be connected with an axis-paxallel rectangle, avoiding a set of
obstacle points.
269.
Aplicación de auditoría en el departamento de informática
- Oroz Perales, Adriana; Flores Trejo, Carlos Antonio; Flores Trejo, Carlos Antonio
Tesis de Lic. en Informática Administrativa
270.
Del aula de informática a la informática en el aula
- Educar. área de Organización e Informática; Junta de Comunidades de Castilla-La Mancha. Consejería de Educación y Ciencia
En: Educar en Castilla-La Mancha Toledo 2005, n. 27, febrero ; p. 16-17
271.
Del aula de informática a la informática en el aula
- Educar. área de Organización e Informática; Junta de Comunidades de Castilla-La Mancha. Consejería de Educación y Ciencia
En: Educar en Castilla-La Mancha Toledo 2005, n. 27, febrero ; p. 16-17
272.
A Markup Language for ORM Business Rules
- Vakgroep Informatica,En Toegepaste Informatica
Conceptual modeling techniques such as EER, ORM and to some extent the UML have been developed in the past for building information systems. These techniques or suitable extensions can often also be used to design business rules at a conceptual level. In particular in this paper we adopt the well-known CM technique of ORM, which has a rich complement of business rule specification, and develop ORM-ML, an XML-based markup language for ORM. Clearly domain modeling of this kind will be closely related to work on so-called ontologies and we will briefly discuss the analogies and differences. Since ORM schemas are...
273.
Lector de noticias
- Flores, Mariel; PIatti, Flavia; Facultad de Informática
274.
Aplicando métodos formales a la construcción de aplicaciones de hipermedia colaborativas
- Mola, Vanesa; Russo, Wanda Mariana; Facultad de Informática
275.
Las nuevas tecnologías y la expresión músical, otros lenguajes en la educación
- Romero Carmona, Juan Bautista
Hoy día entendemos como nuevas tecnologías las aplicaciones que los medios informáticos (máquinas y programas) ponen al alcance de las diferentes áreas de conocimiento y de la gran diversidad de actividades humanas. Desde los grandes programas de investigación científica hasta los juegos de las vídeo-consolas, nuestra sociedad se ha visto transformada de una manera radical y rápida con la introducción de los medios informáticos en todos los campos. La música, como una actividad más de nuestra sociedad, también se ha transformado por medio de las aplicaciones que la informática ha puesto a su servicio.
276.
II Jornadas de Informatica Educativa InfoEdu2005
- -
277.
Informatica 17 Page Xxxyyy 1
- Raphal Marvie
Model, Applied to
the Vending Machine Example
a new meta-type which is a specialization of the
interface one. Thus, component type denitions
are very similar to interface denitions. Right now
the vending machine component type includes the
denitions of two attributes that will be congured
according to each instance expected behavior.
The two attributes are used to dene which
kind of drinks are available and if the machine is
running or not.
278.
Dipartimento di Informatica e Sistemistica
- S. Lucidi,R. Giugno
In this paper we propose a new line search algorithm that ensures global convergence of the PolakRibi
`ere conjugate gradient method for the unconstrained minimization of nonconvex differentiable
functions. In particular, we show that every limit point produced by the Polak-Ribi`ere iteration is a
stationary point of the objective function. Moreover, we prove that, asymptotically, the first stationary
point along the search direction can be accepted and that, under strong convexity assumptions, the
known global convergence results can be reobtained as a special case. From a computational point of
view, we may expect that an algorithm incorporating the stepsize acceptance rules proposed here will
retain the same...
279.
Centrum voor Wiskunde en Informatica
- J. A. Bergstra,J. Heering
Although every computable data type has an initial algebra specification
with hidden functions, it may happen that some of the homomorphic
images of the data type are not models of the specification.
The latter are reducts of algebras that would be models of the specification
if all its functions were visible, whereas the homomorphic images
of the data type are independent of the specification and need not be
compatible with the hidden functions used in it. A hidden function
specification that does not exclude any of the homomorphic images
of its initial model from its model class will be called homomorphism
preserving. It turns out that, unlike unrestricted initial...
280.
Centrum voor Wiskunde en Informatica
- J. F. T. Kamperman
GEL (Graph Exchange Language) is a formalism for the compressed exchange of (term) graphs between processes.
Key features of GEL are speed, compactness, independence of readers and writers, and compositionality.
Typically, GEL representations of large, tree-like graph structures require an average of a little more than one
byte storage for representing one node in the graph.
Orthogonally to GEL, other protocols can be used to exchange data residing in the nodes of a graph.
An algebraic specification of the semantics of GEL texts is given, as well as performance measurents of an
experimental C implementation.
The C implementation can be ftp'ed at ftp.cwi.nl as pub/gipe/sources/GEL.tar.Z.
CR Subject Classification...
