50,824 research outputs found

    Building Medical Homes in State Medicaid and CHIP Programs

    Get PDF
    Presents strategies, best practices, and lessons learned from ten states' efforts to advance the medical home model of comprehensive and coordinated care in Medicaid and Children's Health Insurance Programs in order to improve quality and contain costs

    Train-scheduling optimization model for railway networks with multiplatform stations

    Get PDF
    This paper focuses on optimizing the schedule of trains on railway networks composed of busy complex stations. A mathematical formulation of this problem is provided as a Mixed Integer Linear Program (MILP). However, the creation of an optimal new timetable is an NP-hard problem; therefore, the MILP can be solved for easy cases, computation time being impractical for more complex examples. In these cases, a heuristic approach is provided that makes use of genetic algorithms to find a good solution jointly with heuristic techniques to generate an initial population. The algorithm was applied to a number of problem instances producing feasible, though not optimal, solutions in several seconds on a laptop, and compared to other proposals. Some improvements are suggested to obtain better results and further improve computation time. Rail transport is recognized as a sustainable and energy-efficient means of transport. Moreover, each freight train can take a large number of trucks off the roads, making them safer. Studies in this field can help to make railways more attractive to travelers by reducing operative cost, and increasing the number of services and their punctuality. To improve the transit system and service, it is necessary to build optimal train scheduling. There is an interest from the industry in automating the scheduling process. Fast computerized train scheduling, moreover, can be used to explore the effects of alternative draft timetables, operating policies, station layouts, and random delays or failures.Postprint (published version

    A Review of ISO New England's Proposed Market Rules

    Get PDF
    This report reviews the proposed rules for restructured wholesale electricity markets in New England. We review the market rules, both individually and collectively, and identify potential problems that might limit the efficiency of these markets. We examine alternatives and identify the key tradeoffs among alternative designs. We believe that the wholesale electricity market in New England can begin on December 1, 1998. However, improvements are needed for long-run success. We have identified four major recommendations: 1. Switch to a multi-settlement system. 2. Introduce demand-side bidding. 3. Adopt location-based transmission congestion pricing, especially for the import/export interfaces. 4. Fix the pricing of the ten minute spinning reserves.Auctions; Multiple Object Auctions; Electricity Auctions

    Atomic-SDN: Is Synchronous Flooding the Solution to Software-Defined Networking in IoT?

    Get PDF
    The adoption of Software Defined Networking (SDN) within traditional networks has provided operators the ability to manage diverse resources and easily reconfigure networks as requirements change. Recent research has extended this concept to IEEE 802.15.4 low-power wireless networks, which form a key component of the Internet of Things (IoT). However, the multiple traffic patterns necessary for SDN control makes it difficult to apply this approach to these highly challenging environments. This paper presents Atomic-SDN, a highly reliable and low-latency solution for SDN in low-power wireless. Atomic-SDN introduces a novel Synchronous Flooding (SF) architecture capable of dynamically configuring SF protocols to satisfy complex SDN control requirements, and draws from the authors' previous experiences in the IEEE EWSN Dependability Competition: where SF solutions have consistently outperformed other entries. Using this approach, Atomic-SDN presents considerable performance gains over other SDN implementations for low-power IoT networks. We evaluate Atomic-SDN through simulation and experimentation, and show how utilizing SF techniques provides latency and reliability guarantees to SDN control operations as the local mesh scales. We compare Atomic-SDN against other SDN implementations based on the IEEE 802.15.4 network stack, and establish that Atomic-SDN improves SDN control by orders-of-magnitude across latency, reliability, and energy-efficiency metrics

    Can This Marriage Be Saved?

    Get PDF
    Market forces in health care are paradoxically pulling physicians and hospitals apart and together at the same time. What are these forces and trends? Is the long-standing marriage of interdependence and productivity between them destined to fail, or can it be saved and even strengthened by emerging delivery and governance models in the so-called "market revolution" of consumer-driven health care? What are the implications for health care policy and practice? These are issues we explore in this Arizona Health Futures Policy Primer

    Cyclic transfers in school timetabling

    Get PDF
    In this paper we propose a neighbourhood structure based on sequential/cyclic moves and a cyclic transfer algorithm for the high school timetabling problem. This method enables execution of complex moves for improving an existing solution, while dealing with the challenge of exploring the neighbourhood efficiently. An improvement graph is used in which certain negative cycles correspond to the neighbours; these cycles are explored using a recursive method. We address the problem of applying large neighbourhood structure methods on problems where the cost function is not exactly the sum of independent cost functions, as it is in the set partitioning problem. For computational experiments we use four real world data sets for high school timetabling in the Netherlands and England.We present results of the cyclic transfer algorithm with different settings on these data sets. The costs decrease by 8–28% if we use the cyclic transfers for local optimization compared to our initial solutions. The quality of the best initial solutions are comparable to the solutions found in practice by timetablers

    Cyclic transfers in school timetabling

    Get PDF
    In this paper we propose a neighbourhood structure based\ud on sequential/cyclic moves and a Cyclic Transfer algorithm for the high school timetabling problem. This method enables execution of complex moves for improving an existing solution, while dealing with the challenge of exploring the neighbourhood efficiently. An improvement graph is used in which certain negative cycles correspond to the neighbours; these cycles are explored using a recursive method. We address the problem of applying large neighbourhood structure methods on problems where the cost function is not exactly the sum of independent cost functions, as it is in the set partitioning problem. For computational experiments we use four real world datasets for high school timetabling in the Netherlands and England. We present results of the cyclic transfer algorithm with different settings on these datasets. The costs decrease by 8% to 28% if we use the cyclic transfers for local optimization compared to our initial solutions. The quality of the best initial solutions are comparable to the solutions found in practice by timetablers
    • 

    corecore