11,705 research outputs found

    "Almost-stable" matchings in the Hospitals / Residents problem with Couples

    Get PDF
    The Hospitals / Residents problem with Couples (hrc) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is known that a stable matching need not exist, so we consider min bp hrc, the problem of finding a matching that admits the minimum number of blocking pairs (i.e., is “as stable as possible”). We show that this problem is NP-hard and difficult to approximate even in the highly restricted case that each couple finds only one hospital pair acceptable. However if we further assume that the preference list of each single resident and hospital is of length at most 2, we give a polynomial-time algorithm for this case. We then present the first Integer Programming (IP) and Constraint Programming (CP) models for min bp hrc. Finally, we discuss an empirical evaluation of these models applied to randomly-generated instances of min bp hrc. We find that on average, the CP model is about 1.15 times faster than the IP model, and when presolving is applied to the CP model, it is on average 8.14 times faster. We further observe that the number of blocking pairs admitted by a solution is very small, i.e., usually at most 1, and never more than 2, for the (28,000) instances considered

    VisGenome: visualization of single and comparative genome representations

    Get PDF
    VisGenome visualizes single and comparative representations for the rat, the mouse and the human chromosomes at different levels of detail. The tool offers smooth zooming and panning which is more flexible than seen in other browsers. It presents information available in Ensembl for single chromosomes, as well as homologies (orthologue predictions including ortholog one2one, apparent ortholog one2one, ortholog many2many) for any two chromosomes from different species. The application can query supporting data from Ensembl by invoking a link in a browser

    An unconditionally stable algorithm for generalized thermoelasticity based on operator-splitting and time-discontinuous Galerkin finite element methods

    Get PDF
    An efficient time-stepping algorithm is proposed based on operator-splitting and the space–time discontinuous Galerkin finite element method for problems in the non-classical theory of thermoelasticity. The non-classical theory incorporates three models: the classical theory based on Fourier’s law of heat conduction resulting in a hyperbolic–parabolic coupled system, a non-classical theory of a fully-hyperbolic extension, and a combination of the two. The general problem is split into two contractive sub-problems, namely the mechanical phase and the thermal phase. Each sub-problem is discretized using the space–time discontinuous Galerkin finite element method. The sub-problems are stable which then leads to unconditional stability of the global product algorithm. A number of numerical examples are presented to demonstrate the performance and capability of the method

    Modeling the complete Otto cycle: Preliminary version

    Get PDF
    A description is given of the equations and the computer program being developed to model the complete Otto cycle. The program incorporates such important features as: (1) heat transfer, (2) finite combustion rates, (3) complete chemical kinetics in the burned gas, (4) exhaust gas recirculation, and (5) manifold vacuum or supercharging. Changes in thermodynamic, kinetic and transport data as well as model parameters can be made without reprogramming. Preliminary calculations indicate that: (1) chemistry and heat transfer significantly affect composition and performance, (2) there seems to be a strong interaction among model parameters, and (3) a number of cycles must be calculated in order to obtain steady-state conditions

    Policy Reform in the Tobacco Industry: Producers Adapt to a Changing Market

    Get PDF
    The Fair and Equitable Tobacco Reform Act of 2004 eliminated tobacco quotas and tobacco price supports and allowed producers to plant any amount or type of tobacco regardless of geographic location. The authors found that flue-cured tobacco producers made greater adjustments to their operations after the buyout than did burley tobacco producers. Flue-cured tobacco producers were more likely to increase tobacco acres per farm, pushing up the tobacco acreage per farm at a faster rate compared with burley tobacco producers. Flue-cured producers also were more likely to invest in their tobacco enterprises and invested more per farm after 2004. As a result of increased acreage, tobacco operations became more sensitive to changes in labor costs. With over 75 percent of tobacco farms using hired or contract labor in 2008, the availability and cost of workers have become increasingly important to tobacco producers. This report is based on data collected from the tobacco version of the 2008 Agricultural Resource Management Survey (ARMS), which focused on U.S. producers of burley and flue-cure tobacco in 2008 and how their tobacco operations have changed since 2000 and 2004.Tobacco, structural change, farm adjustments, adaptations, Agricultural Resources Management Survey (ARMS) Acknowledgments, Agricultural and Food Policy, Crop Production/Industries, Farm Management,

    Stable matchings of teachers to schools

    Get PDF
    Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning teachers to schools. Our model is motivated by a particular characteristic of the education system in many countries where each teacher specializes in two subjects. We seek stable matchings, which ensure that no teacher and school have the incentive to deviate from their assignments. Indeed we propose two stability definitions depending on the precise format of schools' preferences. If the schools' ranking of applicants is independent of their subjects of specialism, we show that the problem of deciding whether a stable matching exists is NP-complete, even if there are only three subjects, unless there are master lists of applicants or of schools. By contrast, if the schools may order applicants differently in each of their specialization subjects, the problem of deciding whether a stable matching exists is NP-complete even in the presence of subject-specific master lists plus a master list of schools. Finally, we prove a strong inapproximability result for the problem of finding a matching with the minimum number of blocking pairs with respect to both stability definitions.Comment: 15 page

    Computer program for calculation of complex chemical equilibrium compositions and applications. Supplement 1: Transport properties

    Get PDF
    An addition to the computer program of NASA SP-273 is given that permits transport property calculations for the gaseous phase. Approximate mixture formulas are used to obtain viscosity and frozen thermal conductivity. Reaction thermal conductivity is obtained by the same method as in NASA TN D-7056. Transport properties for 154 gaseous species were selected for use with the program
    • …
    corecore