A bipartite graph G(U, V ;E) that admits a perfect matching is given. One player imposes a permutation π over V , the other player imposes a permutation σ over U . In the greedy matching algorithm, vertices of U arrive in order σ and each vertex is matched to the lowest (under π) yet unmatched neighbor in V (or left unmatched, if all its neighbors are already matched). The obtained matching is ...

This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...

Eulerian poset is a basic and widely used combinatorial concept. It is the combinatorial version of manifolds and has the analogue of the Poincaré duality in the form of the DehnSommerville equations (linear relations among f -vectors). The concept has always been defined in the combinatorial language. As a topologist, my main insight is that a poset is Eulerian if and only if its underlying po...

The min-max kernel is a generalization of the popular resemblance kernel (which is designed for binary data). In this paper, we demonstrate, through an extensive classification study using kernel machines, that the min-max kernel often provides an effective measure of similarity for nonnegative data. As the min-max kernel is nonlinear and might be difficult to be used for industrial application...

this presentation features, modalities: plain radiographs, ct, mri, and ultrasound; arthroplasty; hardware loosening; suture anchor migration; avn, collapse, arthritis; rotator cuff repair; labral repair.

A mother cell giving rise to offspring usually needs to choose the site of cytokinesis carefully, as this will determine the size and shape of the daughter cells. Rod-shaped bacteria that divide by binary fission, such as Escherichia coli, often mark their cell division sites at their cell midpoint so that daughter cells are roughly equivalent in size and shape. So how does E. coli know where i...

A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. 20 2. G t is a dominating subgraph of G c as there are no edges between nodes v i 2 V ? t and v j 2 (V + nV + t), G t has a min-max potential and G c has a min potential. G t is a maximal dominating subgraph of G c. To proof this, let us suppose that a subgraph G q of G c nG t cou...

,4 simple implementation of doubleended priority queues is presented. The proposed structure, called a min-max heap, can be built in linear time; in contrast to conventional heaps, it allows both FindMin and FindMax to be performed in constant time; Insert, DeleteMin, and DeleteMax operations can be performed in logarithmic time. Min-max heaps can be generalized to support other similar order-s...