Dependencies play an important role in database theory. We study order dependencies (ODs) and unidirectional order dependencies (UODs), which describe the relationships among lexicographical orderings of sets of tuples. We investigate the axiomatization problem for order

Abstract. In this note we give a numerical expression for the bandwidth bw(P d n) of the dproduct of a path with n edges, P d n . We prove that this bandwidth is given by the sum of certain multinomial coefficients. We also show that bw(P d n) is bounded above and below by the largest coefficient in the expansion of (1 + x + · · ·+ x), with k ∈ {d, d + 1}. Moreover, we compare the asymptotic be...

The nucleolus is one of the most important solution concepts in cooperative game theory as a result of its attractive properties it always exists, is unique, and is always in the core (if the core is non-empty). However, computing the nucleolus is very challenging because it involves the lexicographical minimization of an exponentially large number of excess values. We present a method for comp...

Let T(n) be the set of all well-formed parentheses strings of length 2n. We show that the elements of T(n) can be listed so that successive strings diier by the transposition of a left and a right parenthesis. Furthermore, between the two parentheses that are transposed, only left parentheses occur. Our listing is a modiication of the well-known Eades-McKay 4] algorithm for generating combinati...

s of the Talks Sorted in alphabetical order of the first author’s last name Titles of poster presentations are marked with ∗ Attainability of Optimal Solutions of Lexicographical Maximization Problem with Convex Criterion Functions on their Weighed Sum∗

Given two disjoint alphabets T and T ] and a relation R T T ] , the generalized Dyck language D R over T T ] consists of all words w 2 (T T ]) ? which are equivalent to the empty word " under the congruence deened by x y " mod for all (x; y) 2 R. In this paper we present an algorithm that generates all words of length 2n of the generalized Dyck language lexicograph-ically. Thereby, each Dyck wo...

The HLS colour space is widely used in image analysis as it is physically intuitive. As the hue component of this space is defined on the unit circle, standard greyscale image analysis operators, specifically morphological operators, are not applicable to it. A variation of the standard morphological operators which require the choice of an origin are discussed. In addition, some lexicographica...

for sorting n integers from the range !!.) algorithm p Optimal cost parallel algorithms for lexicographical ordering on a CREW PRAM are log n presented here. An 0 (I ( ) og nIp {I•...• n} usingp :::;; n processors is given here. Also an algorithm for sorting n strings of size lover an alphabet of size s is presented. that requires 0 ( log n[ ) .!!!.. + !.... ) units of time log (nllp p p and it...

Based on the analysis of dictionaries, an attempt is made to lexicographically describe one-word lexemes with inexpressible semantics and pragmatic stylistic semantic features. It revealed that different constituents contain a number lexical-semantic variants. In defining since middle XX century, there has been expansion definitions semantics, intersection extremely high concentration quality. ...