No abstract

No abstract

In this paper we discuss applications and design of the agent-oriented, hp-adaptive projection-based interpolation technique. We describe the use of the mesh adaptation process to produce the most faithful representation of the input image in the Finite Element space. We discuss the advantages of the agent-oriented application model both in general and in terms of the hp-adaptive application properties. Lastly, we describe a sample problem used as a proof of concept.

We provide the first polynomial-time algorithm for recognizing if a profile of (possibly weak) preference orders is top-monotonic. Top-monotonicity is a generalization of the notions of single-peakedness and single-crossingness, defined by Barberà and Moreno. Top-monotonic profiles always have weak Condorcet winners and satisfy a variant of the median voter theorem. Our algorithm proceeds by reducing the recognition problem to the SAT-2CNF problem.

We provide the first polynomial-time algorithm for recognizing if a profile of (possibly weak) preference orders is top-monotonic. Top-monotonicity is a generalization of the notions of single-peakedness and single-crossingness, defined by Barbera and Moreno. Top-monotonic profiles always have weak Condorcet winners and satisfy a variant of the median voter theorem. Our algorithm proceeds by reducing the recognition problem to the SAT-2CNF problem.