The subject of this paper is the use of ITS (Intelligent Transport System) with the DSS (Decision Support System) for intermodal transport. The types of ITS are classified with attention to specific mobility sequences for freight movements. Referential freight ITS are the CVO (Commercial Vehicle Operations). Then four management tools are presented: SAP-YARD, CroBIT, UirNet and Access. A classi...

When designing multimodal dialogue systems allowing speech as well as graphical operations, it is important to understand not only how people make use of the different modalities in their utterances, but also how the system might influence a user’s choice of modality by its own behavior. This paper describes an experiment in which subjects interacted with two versions of a simulated multimodal ...

The paper shows that movement or equivalent computational structure-changing operations of any kind at the level of logical form can be dispensed with entirely in capturing quantifier scope ambiguity. It offers a new semantics whereby the effects of quantifier scope alternation can be obtained by an entirely monotonic derivation, without typechanging rules. The paper follows Fodor (1982), Fodor...

Horizontal partitioning has evolved significantly in recent years and widely advocated by the academic and industrial communities. Horizontal Partitioning affects positively query performance, database manageability and availability. Two types of horizontal partitioning are supported: primary and referential. Horizontal fragmentation in the context of relational data warehouses is to partition ...

Abstract This paper provides an analysis of the notational difference between Beta Existential Graphs, graphical notation for quantificational logic invented by Charles S. Peirce at end 19th century, and ordinary first-order logic. thought his graphs to be “more diagrammatic” than equivalently expressive languages (including own algebras) The reason this, he claimed, is that less room afforded ...

The combination of probabilistic and nondeterministic choice in program calculi is a notoriously tricky problem, and one with a long history. We present a simple functional programming approach to this challenge, based on algebraic theories of computational effects. We make use of the powerful abstraction facilities of modern functional languages, to introduce the choice operations as a little ...