The generalized sports competition problem

Consider a sports competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to win the competition. The computational complexity of this question depends on the way scores are allocated according to the outcome of a match. For competitions with at most $3$ different outcomes of a match the complexity is already known. In practice there are many competitions in which more than $3$ outcomes are possible. We determine the complexity of the above problem for competitions with an arbitrary number of different outcomes. Our model also includes competitions that are asymmetric in the sense that away playing teams possibly receive other scores than home playing teams. \u

Matching games: the least core and the nucleolus

A matching game is a cooperative game defined by a graph $G=(V,E)$. The player set is $V$ and the value of a coalition $S \subseteq V$ is defined as the size of a maximum matching in the subgraph induced by $S$. We show that the nucleolus of such games can be computed efficiently. The result is based on an alternative characterization of the least core which may be of independent interest. The general case of weighted matching games remains unsolved. \u

The new FIFA rules are hard: Complexity aspects of sports competitions

Consider a soccer competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to win the competition. The complexity of this question depends on the way scores are allocated according to the outcome of a match. For example, the problem is polynomially solvable for the ancient FIFA rules (2:0 resp. 1:1) but becomes NP-hard if the new rules (3:0 resp. 1:1) are applied. We determine the complexity of the above problem for all possible score allocation rules. \u

Magnetic recording head and method of making same Patent

Magnetic recording head composed of ferrite core coated with thin film of aluminum-iron-silicon allo

Deformable vehicle wheel Patent

Resilient vehicle wheel for lunar surface trave

The role of long-range forces in the phase behavior of colloids and proteins

The phase behavior of colloid-polymer mixtures, and of solutions of globular proteins, is often interpreted in terms of a simple model of hard spheres with short-ranged attraction. While such a model yields a qualitative understanding of the generic phase diagrams of both colloids and proteins, it fails to capture one important difference: the model predicts fluid-fluid phase separation in the metastable regime below the freezing curve. Such demixing has been observed for globular proteins, but for colloids it appears to be pre-empted by the appearance of a gel. In this paper, we study the effect of additional long-range attractions on the phase behavior of spheres with short-ranged attraction. We find that such attractions can shift the (metastable) fluid-fluid critical point out of the gel region. As this metastable critical point may be important for crystal nucleation, our results suggest that long-ranged attractive forces may play an important role in the crystallization of globular proteins. However, in colloids, where refractive index matching is often used to switch off long-ranged dispersion forces, gelation is likely to inhibit phase separation.Comment: EURO-LATEX, 6 pages, 2 figure

Shuttle payload bay dynamic environments: Summary and conclusion report for STS flights 1-5 and 9

The vibration, acoustic and low frequency loads data from the first 5 shuttle flights are presented. The engineering analysis of that data is also presented. Vibroacoustic data from STS-9 are also presented because they represent the only data taken on a large payload. Payload dynamic environment predictions developed by the participation of various NASA and industrial centers are presented along with a comparison of analytical loads methodology predictions with flight data, including a brief description of the methodologies employed in developing those predictions for payloads. The review of prediction methodologies illustrates how different centers have approached the problems of developing shuttle dynamic environmental predictions and criteria. Ongoing research activities related to the shuttle dynamic environments are also described. Analytical software recently developed for the prediction of payload acoustic and vibration environments are also described

Quantum phase estimation algorithm in presence of static imperfections

We study numerically the effects of static imperfections and residual couplings between qubits for the quantum phase estimation algorithm with two qubits. We show that the success probability of the algorithm is affected significantly more by static imperfections than by random noise errors in quantum gates. An improvement of the algorithm accuracy can be reached by application of the Pauli-random-error-correction method (PAREC).Comment: 5 pages, 5 figures. Research avilable at http://www.quantware.ups-tlse.fr

Manipulating Tournaments in Cup and Round Robin Competitions

In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial time. In addition, we show that finding the minimal number of games that need to be thrown to manipulate the result can also be determined in polynomial time. Finally, we show that there are several different variations of standard cup competitions where manipulation remains polynomial.Comment: Proceedings of Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 200