A structured array is an array satisfying given constraints, such as being sorted or having no duplicate values. Generation of all arrays with a given structure up to some given length has many applications, including bounded exhaustive testing. A sequential generator of structured arrays can be defined by two C functions: the first one computes an initial array, and the second one steps from o...

In this paper we present two general results on the existence of a discrete zero point of a function from the n-dimensional integer lattice Z to the n-dimensional Euclidean space IR. Under two different boundary conditions, we give a constructive proof using a combinatorial argument based on a simplicial algorithm with vector labeling and lexicographic linear programming pivot steps. We also ad...

This paper presents a numerically robust algorithm for solving linear complementarity problems (LCPs), and applies it to simulation of frictional contacts of articulated rigid bodies each modeled as a general polygonal object. We first point out two problems of the popular pivot-based LCP solver called Lemke Algorithm and its extension with lexicographic ordering, due to numerical errors especi...

In the simply-typed lambda-calculus, a hereditary substitution replaces a free variable in a normal form r by another normal form s of type a, removing freshly created redexes on the fly. It can be defined by lexicographic induction on a and r, thus, giving rise to a structurally recursive normalizer for the simply-typed lambda-calculus. We generalize this scheme to simultaneous substitutions, ...

In this paper, we propose the use of lexicographic parametric programming to recognize efficient units in Data Envelopment Analysis (DEA). By using the parameterization of the rhs vector of the envelopment problem, we obtain the efficiency curve which is traversing through the efficient frontier from unit to unit. The units in the basis with any parameter value are efficient and the unit domina...

In this work we consider a multiobjective open shop scheduling problem with uncertain processing times and flexible due dates, both modelled using fuzzy sets. We adopt a goal programming model based on lexicographic multiobjective optimisation of both makespan and due-date satisfaction and propose a particle swarm algorithm to solve the resulting problem. We present experimental results which s...

Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-hand side of the constraints, and solved explicitly offline. Degeneracy occurs when the control input, or optimiser, is non-unique, which can cause chattering of the control input and overlap of the polyhedral regions ...

Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for monoidal operator. One its area application has been constraint programming, whose key requirement is presence an aggregator operator combining preferences. Given residuated monoid preferences, paper first shows how to build new (possibly infinite) tuples, which ...

Despite the large amount of research effort dedicated to adapting boosting for imbalanced classification, boosting methods are yet to be satisfactorily immune to class imbalance, especially for multi-class problems, due to the long-standing reliance on expensive cost set tuning. We show that the assignment of weights to the component classifiers of a boosted ensemble can be thought of as a game...