Search results for "Context"
showing 10 items of 6304 documents
Modelling mode choice for freight transport using advanced choice experiments
2015
Abstract In this paper we use advanced choice modelling techniques to analyse demand for freight transport in a context of modal choice. To this end, a stated preference (SP) survey was conducted in order to estimate freight shipper preferences for the main attributes that define the service offered by the different transport modes. From a methodological point of view, we focus on two critical issues in the construction of efficient choice experiments. Firstly, in obtaining good quality prior information about the parameters; and secondly, in the improved quality of the experimental data by tailoring a specific efficient design for every respondent in the sample. With these data, different …
On ergodic operator means in Banach spaces
2016
We consider a large class of operator means and prove that a number of ergodic theorems, as well as growth estimates known for particular cases, continue to hold in the general context under fairly mild regularity conditions. The methods developed in the paper not only yield a new approach based on a general point of view, but also lead to results that are new, even in the context of the classical Cesaro means.
On point-irreducible projective lattice geometries
1994
Within the conceptual frame of projective lattice geometry (as introduced in [5]) we are considering the class of all point-irreducible geometries. In the algebraic context these geometries are closely connected with unitary modules over local rings. Besides several synthetic investigations we obtain a lattice-geometric characterization of free left modules over right chain rings which allows a purely lattice-theoretic version in the Artinian case.
Nondeterministic operations on finite relational structures
1998
Abstract This article builds on a tutorial introduction to universal algebra for language theory (Courcelle, Theoret. Comput. Sci. 163 (1996) 1–54) and extends it in two directions. First, nondeterministic operations are considered, i.e., operations which give a set of results instead of a single one. Most of their properties concerning recognizability and equational definability carry over from the ordinary case with minor modifications. Second, inductive sets of evaluations are studied in greater detail. It seems that they are handled most naturally in the framework presented here. We consider the analogues of top-down and bottom-up tree transducers. Again, most of their closure propertie…
On block pumpable languages
2016
Ehrenfeucht, Parikh and Rozenberg gave an interesting characterisation of the regular languages called the block pumping property. When requiring this property only with respect to members of the language but not with respect to nonmembers, one gets the notion of block pumpable languages. It is shown that these block pumpable are a more general concept than regular languages and that they are an interesting notion of their own: they are closed under intersection, union and homomorphism by transducers; they admit multiple pumping; they have either polynomial or exponential growth.
Monotone Relations, Fixed Points and Recursive Definitions
2008
The paper is concerned with reflexive points of relations. The significance of reflexive points in the context of indeterminate recursion principles is shown.
Periodicity vectors for labelled trees
2003
AbstractThe concept of a periodicity vector is introduced in the context of labelled trees, and some new periodicity theorems are obtained. These results constitute generalizations of the classical periodicity theorem of Fine and Wilf for words. The concept of a tree congruence is also generalized and the isomorphism between the lattice of tree congruences and the lattice of unlabelled trees (prefix codes) is established.
A loopless algorithm for generating the permutations of a multiset
2003
AbstractMany combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shuffle on trajectories (defined previously in a non-combinatorial context), and we show how this constructor enables us to obtain a new loopless generating algorithm for multiset permutations from similar results for simpler objects.
An extension of the Burrows-Wheeler Transform
2007
AbstractWe describe and highlight a generalization of the Burrows–Wheeler Transform (bwt) to a multiset of words. The extended transformation, denoted by ebwt, is reversible. Moreover, it allows to define a bijection between the words over a finite alphabet A and the finite multisets of conjugacy classes of primitive words in A∗. Besides its mathematical interest, the extended transform can be useful for applications in the context of string processing. In the last part of this paper we illustrate one such application, providing a similarity measure between sequences based on ebwt.
Quantum Pushdown Automata
2000
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [13]. In this paper we introduce the notion of quantum pushdown automata (QPA) in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [11]. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity criteria of quantum Turing machines [4]. We show that QPA can recognize every regular language. Finally we present some simple languages recognized by QPA, two of them are not recognizable by deterministic pushdown automata and one seems to be not recognizable by probabilistic pushdown …