Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization

We discuss an allocation mechanism of capstone projects to senior-year undergraduate students, which the recently established Singapore University of Technology and Design (SUTD) has implemented. A distinguishing feature of these projects is that they are multidisciplinary ; each project must involve students from at least two disciplines. This is an instance of a bipartite many-to-one matching problem with one-sided preferences and with additional lower and upper bounds on the number of students from the disciplines that must be matched to projects. This leads to challenges in applying many existing algorithms.We propose the use of discrete optimization to find an allocation that considers both efficiency and fairness. This provides flexibility in incorporating side constraints, which are often introduced in the final project allocation using inputs from the various stakeholders. Over a three-year period from 2015 to 2017, the average rank of the project allocated to the student is roughly halfway between their top two choices, with around 78 percent of the students assigned to projects in their top-three choices. We discuss practical design and optimization issues that arise in developing such an allocation

Network Flows

Not Availabl

Minimizing the stabbing number of matchings, trees, and triangulations

The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or triangulations of minimum stabbing number for a given set of points. The complexity of these problems has been a long-standing open question; in fact, it is one of the original 30 outstanding open problems in computational geometry on the list by Demaine, Mitchell, and O'Rourke. The answer we provide is negative for a number of minimum stabbing problems by showing them NP-hard by means of a general proof technique. It implies non-trivial lower bounds on the approximability. On the positive side we propose a cut-based integer programming formulation for minimizing the stabbing number of matchings and spanning trees. We obtain lower bounds (in polynomial time) from the corresponding linear programming relaxations, and show that an optimal fractional solution always contains an edge of at least constant weight. This result constitutes a crucial step towards a constant-factor approximation via an iterated rounding scheme. In computational experiments we demonstrate that our approach allows for actually solving problems with up to several hundred points optimally or near-optimally.Comment: 25 pages, 12 figures, Latex. To appear in "Discrete and Computational Geometry". Previous version (extended abstract) appears in SODA 2004, pp. 430-43

On the Price of Anarchy for flows over time

Dynamic network flows, or network flows over time, constitute an important model for real-world situations where steady states are unusual, such as urban traffic and the Internet. These applications immediately raise the issue of analyzing dynamic network flows from a game-theoretic perspective. In this paper we study dynamic equilibria in the deterministic fluid queuing model in single-source single-sink networks, arguably the most basic model for flows over time. In the last decade we have witnessed significant developments in the theoretical understanding of the model. However, several fundamental questions remain open. One of the most prominent ones concerns the Price of Anarchy, measured as the worst case ratio between the minimum time required to route a given amount of flow from the source to the sink, and the time a dynamic equilibrium takes to perform the same task. Our main result states that if we could reduce the inflow of the network in a dynamic equilibrium, then the Price of Anarchy is exactly e/(e − 1) ≈ 1.582. This significantly extends a result by Bhaskar, Fleischer, and Anshelevich (SODA 2011). Furthermore, our methods allow to determine that the Price of Anarchy in parallel-link networks is exactly 4/3. Finally, we argue that if a certain very natural monotonicity conjecture holds, the Price of Anarchy in the general case is exactly e/(e − 1)

Certificação de produtos orgânicos: obstáculos à implantação de um sistema participativo de garantia na Andaluzia, Espanha.

O trabalho analisa o processo de organização de produtores orgânicos da Andaluzia que estiveram envolvidos em uma tentativa de implantação de um sistema participativo de garantia. Esta iniciativa foi liderada pela administração dessa comunidade autônoma espanhola entre 2006 e 2008. O estudo baseia-se em entrevistas realizadas com atores sociais que estiveram implicados nesse processo, identificando os obstáculos políticos e organizativos que impediram que essa proposta pudesse avançar

Incidence and survival of childhood bone cancer in northern England and the West Midlands, 1981–2002

There is a paucity of population-based studies examining incidence and survival trends in childhood bone tumours. We used high quality data from four population-based registries in England. Incidence patterns and trends were described using Poisson regression. Survival trends were analysed using Cox regression. There were 374 cases of childhood (ages 0–14 years) bone tumours (206 osteosarcomas, 144 Ewing sarcomas, 16 chondrosarcomas, 8 other bone tumours) registered in the period 1981–2002. Overall incidence (per million person years) rates were 2.63 (95% confidence interval (CI) 2.27–2.99) for osteosarcoma, 1.90 (1.58–2.21) for Ewing sarcoma and 0.21 (0.11–0.31) for chondrosarcoma. Incidence of Ewing sarcoma declined at an average rate of 3.1% (95% CI 0.6–5.6) per annum (P=0.04), which may be due to tumour reclassification, but there was no change in osteosarcoma incidence. Survival showed marked improvement over the 20 years (1981–2000) for Ewing sarcoma (hazard ratio (HR) per annum=0.95 95% CI 0.91–0.99; P=0.02). However, no improvement was seen for osteosarcoma patients (HR per annum=1.02 95% CI 0.98–1.05; P=0.35) over this time period. Reasons for failure to improve survival including potential delays in diagnosis, accrual to trials, adherence to therapy and lack of improvement in treatment strategies all need to be considered