89,055 research outputs found
A Primer for Program Composition Notation
This primer describes a notation for program composition. Program composition is putting programs together to get larger ones. PCN (Program Composition Notation) is a programming language that allows programmers to compose programs so that composed programs execute efficiently on uniprocessors, distributed-memory multicomputers or shared-memory multiprocessors. (Revised December 12, 1990
SWI-Prolog and the Web
Where Prolog is commonly seen as a component in a Web application that is
either embedded or communicates using a proprietary protocol, we propose an
architecture where Prolog communicates to other components in a Web application
using the standard HTTP protocol. By avoiding embedding in external Web servers
development and deployment become much easier. To support this architecture, in
addition to the transfer protocol, we must also support parsing, representing
and generating the key Web document types such as HTML, XML and RDF.
This paper motivates the design decisions in the libraries and extensions to
Prolog for handling Web documents and protocols. The design has been guided by
the requirement to handle large documents efficiently. The described libraries
support a wide range of Web applications ranging from HTML and XML documents to
Semantic Web RDF processing.
To appear in Theory and Practice of Logic Programming (TPLP)Comment: 31 pages, 24 figures and 2 tables. To appear in Theory and Practice
of Logic Programming (TPLP
Local module identification in dynamic networks with correlated noise: the full input case
The identification of local modules in dynamic networks with known topology
has recently been addressed by formulating conditions for arriving at
consistent estimates of the module dynamics, typically under the assumption of
having disturbances that are uncorrelated over the different nodes. The
conditions typically reflect the selection of a set of node signals that are
taken as predictor inputs in a MISO identification setup. In this paper an
extension is made to arrive at an identification setup for the situation that
process noises on the different node signals can be correlated with each other.
In this situation the local module may need to be embedded in a MIMO
identification setup for arriving at a consistent estimate with maximum
likelihood properties. This requires the proper treatment of confounding
variables. The result is an algorithm that, based on the given network topology
and disturbance correlation structure, selects an appropriate set of node
signals as predictor inputs and outputs in a MISO or MIMO identification setup.
As a first step in the analysis, we restrict attention to the (slightly
conservative) situation where the selected output node signals are predicted
based on all of their in-neighbor node signals in the network.Comment: Extended version of paper submitted to the 58th IEEE Conf. Decision
and Control, Nice, 201
Cohomological invariants of hyperelliptic curves of even genus
Let be an even positive integer, and be a prime number. We compute
the cohomological invariants with coefficients in of
the stacks of hyperelliptic curves over an algebraically closed
field .Comment: Final version. 23 page
- …