MEIGO: an open-source software suite based on metaheuristics for global optimization in systems biology and bioinformatics

PubMed Central

2014-01-01

Background Optimization is the key to solving many problems in computational biology. Global optimization methods, which provide a robust methodology, and metaheuristics in particular have proven to be the most efficient methods for many applications. Despite their utility, there is a limited availability of metaheuristic tools. Results We present MEIGO, an R and Matlab optimization toolbox (also available in Python via a wrapper of the R version), that implements metaheuristics capable of solving diverse problems arising in systems biology and bioinformatics. The toolbox includes the enhanced scatter search method (eSS) for continuous nonlinear programming (cNLP) and mixed-integer programming (MINLP) problems, and variable neighborhood search (VNS) for Integer Programming (IP) problems. Additionally, the R version includes BayesFit for parameter estimation by Bayesian inference. The eSS and VNS methods can be run on a single-thread or in parallel using a cooperative strategy. The code is supplied under GPLv3 and is available at http://www.iim.csic.es/~gingproc/meigo.html. Documentation and examples are included. The R package has been submitted to BioConductor. We evaluate MEIGO against optimization benchmarks, and illustrate its applicability to a series of case studies in bioinformatics and systems biology where it outperforms other state-of-the-art methods. Conclusions MEIGO provides a free, open-source platform for optimization that can be applied to multiple domains of systems biology and bioinformatics. It includes efficient state of the art metaheuristics, and its open and modular structure allows the addition of further methods. PMID:24885957

Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.

PubMed

Zörnig, Peter

2015-08-01

We present integer programming models for some variants of the farthest string problem. The number of variables and constraints is substantially less than that of the integer linear programming models known in the literature. Moreover, the solution of the linear programming-relaxation contains only a small proportion of noninteger values, which considerably simplifies the rounding process. Numerical tests have shown excellent results, especially when a small set of long sequences is given.

Optimal Diet Planning for Eczema Patient Using Integer Programming

NASA Astrophysics Data System (ADS)

Zhen Sheng, Low; Sufahani, Suliadi

2018-04-01

Human diet planning is conducted by choosing appropriate food items that fulfill the nutritional requirements into the diet formulation. This paper discusses the application of integer programming to build the mathematical model of diet planning for eczema patients. The model developed is used to solve the diet problem of eczema patients from young age group. The integer programming is a scientific approach to select suitable food items, which seeks to minimize the costs, under conditions of meeting desired nutrient quantities, avoiding food allergens and getting certain foods into the diet that brings relief to the eczema conditions. This paper illustrates that the integer programming approach able to produce the optimal and feasible solution to deal with the diet problem of eczema patient.

Orbital angular momentum and spectral flow in two-dimensional chiral superfluids.

PubMed

Tada, Yasuhiro; Nie, Wenxing; Oshikawa, Masaki

2015-05-15

We study the orbital angular momentum (OAM) L_{z} in two-dimensional chiral (p_{x}+ip_{y})^{ν}-wave superfluids (SFs) of N fermions on a disk at zero temperature, in terms of spectral asymmetry and spectral flow. It is shown that L_{z}=νN/2 for any integer ν, in the Bose-Einstein condensation regime. In contrast, in the BCS limit, while the OAM is L_{z}=N/2 for the p+ip-wave SF, for chiral SFs with ν≥2, the OAM is remarkably suppressed as L_{z}=N×O(Δ_{0}/ϵ_{F})≪N, where Δ_{0} is the gap amplitude and ϵ_{F} is the Fermi energy. We demonstrate that the difference between the p+ip-wave SF and the other chiral SFs in the BCS regimes originates from the nature of edge modes and related depairing effects.

Fast rerouting schemes for protected mobile IP over MPLS networks

NASA Astrophysics Data System (ADS)

Wen, Chih-Chao; Chang, Sheng-Yi; Chen, Huan; Chen, Kim-Joan

2005-10-01

Fast rerouting is a critical traffic engineering operation in the MPLS networks. To implement the Mobile IP service over the MPLS network, one can collaborate with the fast rerouting operation to enhance the availability and survivability. MPLS can protect critical LSP tunnel between Home Agent (HA) and Foreign Agent (FA) using the fast rerouting scheme. In this paper, we propose a simple but efficient algorithm to address the triangle routing problem for the Mobile IP over the MPLS networks. We consider this routing issue as a link weighting and capacity assignment (LW-CA) problem. The derived solution is used to plan the fast restoration mechanism to protect the link or node failure. In this paper, we first model the LW-CA problem as a mixed integer optimization problem. Our goal is to minimize the call blocking probability on the most congested working truck for the mobile IP connections. Many existing network topologies are used to evaluate the performance of our scheme. Results show that our proposed scheme can obtain the best performance in terms of the smallest blocking probability compared to other schemes.

Menu-Driven Solver Of Linear-Programming Problems

NASA Technical Reports Server (NTRS)

Viterna, L. A.; Ferencz, D.

1992-01-01

Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).

The use of integer programming to select bulls across breeding companies with volume price discounts.

PubMed

McConnel, M B; Galligan, D T

2004-10-01

Optimization programs are currently used to aid in the selection of bulls to be used in herd breeding programs. While these programs offer a systematic approach to the problem of semen selection, they ignore the impact of volume discounts. Volume discounts are discounts that vary depending on the number of straws purchased. The dynamic nature of volume discounts means that, in order to be adequately accounted for, they must be considered in the optimization routine. Failing to do this creates a missed economic opportunity because the potential benefits of optimally selecting and combining breeding company discount opportunities are not captured. To address these issues, an integer program was created which used binary decision variables to incorporate the effects of quantity discounts into the optimization program. A consistent set of trait criteria was used to select a group of bulls from 3 sample breeding companies. Three different selection programs were used to select the bulls, 2 traditional methods and the integer method. After the discounts were applied using each method, the integer program resulted in the lowest cost portfolio of bulls. A sensitivity analysis showed that the integer program also resulted in a low cost portfolio when the genetic trait goals were changed to be more or less stringent. In the sample application, a net benefit of the new approach over the traditional approaches was a 12.3 to 20.0% savings in semen cost.

ALPS: A Linear Program Solver

NASA Technical Reports Server (NTRS)

Ferencz, Donald C.; Viterna, Larry A.

1991-01-01

ALPS is a computer program which can be used to solve general linear program (optimization) problems. ALPS was designed for those who have minimal linear programming (LP) knowledge and features a menu-driven scheme to guide the user through the process of creating and solving LP formulations. Once created, the problems can be edited and stored in standard DOS ASCII files to provide portability to various word processors or even other linear programming packages. Unlike many math-oriented LP solvers, ALPS contains an LP parser that reads through the LP formulation and reports several types of errors to the user. ALPS provides a large amount of solution data which is often useful in problem solving. In addition to pure linear programs, ALPS can solve for integer, mixed integer, and binary type problems. Pure linear programs are solved with the revised simplex method. Integer or mixed integer programs are solved initially with the revised simplex, and the completed using the branch-and-bound technique. Binary programs are solved with the method of implicit enumeration. This manual describes how to use ALPS to create, edit, and solve linear programming problems. Instructions for installing ALPS on a PC compatible computer are included in the appendices along with a general introduction to linear programming. A programmers guide is also included for assistance in modifying and maintaining the program.

A mixed integer program to model spatial wildfire behavior and suppression placement decisions

Treesearch

Erin J. Belval; Yu Wei; Michael Bevers

2015-01-01

Wildfire suppression combines multiple objectives and dynamic fire behavior to form a complex problem for decision makers. This paper presents a mixed integer program designed to explore integrating spatial fire behavior and suppression placement decisions into a mathematical programming framework. Fire behavior and suppression placement decisions are modeled using...

An Integer Programming Model for Multi-Echelon Supply Chain Decision Problem Considering Inventories

NASA Astrophysics Data System (ADS)

Harahap, Amin; Mawengkang, Herman; Siswadi; Effendi, Syahril

2018-01-01

In this paper we address a problem that is of significance to the industry, namely the optimal decision of a multi-echelon supply chain and the associated inventory systems. By using the guaranteed service approach to model the multi-echelon inventory system, we develop a mixed integer; programming model to simultaneously optimize the transportation, inventory and network structure of a multi-echelon supply chain. To solve the model we develop a direct search approach using a strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points.

An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems

NASA Astrophysics Data System (ADS)

Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri

2018-01-01

The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.

A Structural Weight Estimation Program (SWEEP) for Aircraft. Volume 11 - Flexible Airloads Stand-Alone Program

DTIC Science & Technology

1974-06-01

stiffness, lb-in. I Integer used to designate wing strip number 2 I Airplanw pitching moment of inertia, slug ft 2 I Airplane yawing moment of inertia...slug ft J Integer used to designated wing-loading distribution, i.e., J-l, loading due to angle of attack J=2> loading due to flap deflection J-3...moment at intersection of load reference line and body interface station (for vertical tail), in.-lb Integer used to designate type of wing airload

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

Bley, Andreas; Fortz, Bernard; Gourdin, Eric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Ümit, Hakan

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) autonomous system AS . They all rely on the Internet Protocol (IP) internet protocol IP for transport of packets across the network. And most of them use shortest path routing protocols shortest path routing!protocols , such as OSPF or IS-IS, to control the routing of IP packets routing!of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric routing!metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing traffic!routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems shortest path routing!problems .

Multiple object tracking using the shortest path faster association algorithm.

PubMed

Xi, Zhenghao; Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

PubMed Central

Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time. PMID:25215322

VIRTUAL FRAME BUFFER INTERFACE

NASA Technical Reports Server (NTRS)

Wolfe, T. L.

1994-01-01

Large image processing systems use multiple frame buffers with differing architectures and vendor supplied user interfaces. This variety of architectures and interfaces creates software development, maintenance, and portability problems for application programs. The Virtual Frame Buffer Interface program makes all frame buffers appear as a generic frame buffer with a specified set of characteristics, allowing programmers to write code which will run unmodified on all supported hardware. The Virtual Frame Buffer Interface converts generic commands to actual device commands. The virtual frame buffer consists of a definition of capabilities and FORTRAN subroutines that are called by application programs. The virtual frame buffer routines may be treated as subroutines, logical functions, or integer functions by the application program. Routines are included that allocate and manage hardware resources such as frame buffers, monitors, video switches, trackballs, tablets and joysticks; access image memory planes; and perform alphanumeric font or text generation. The subroutines for the various "real" frame buffers are in separate VAX/VMS shared libraries allowing modification, correction or enhancement of the virtual interface without affecting application programs. The Virtual Frame Buffer Interface program was developed in FORTRAN 77 for a DEC VAX 11/780 or a DEC VAX 11/750 under VMS 4.X. It supports ADAGE IK3000, DEANZA IP8500, Low Resolution RAMTEK 9460, and High Resolution RAMTEK 9460 Frame Buffers. It has a central memory requirement of approximately 150K. This program was developed in 1985.

Toward Large-Graph Comparison Measures to Understand Internet Topology Dynamics

DTIC Science & Technology

2013-09-01

continuously from randomly selected vantage points in these monitors to destination IP addresses . From each IPv4 /24 prefix on the Internet, a destination is...expected to be more similar. This was verified when the esd and vsd measures applied to this dataset gave a low reading 5 An IPv4 address is a 32-bit...integer value. /24 is the prefix of the IPv4 network starting at a given address , having 24 bits allocated for the network prefix. 6 This utility

Dynamic UNITY

DTIC Science & Technology

2002-01-01

UNITY program that implements exactly the same algorithm as Specification 1.1. The correctness of this program is proven in amanner sim- 4 program...chapter, we introduce the Dynamic UNITY formalism, which allows us to reason about algorithms and protocols in which the sets of participating processes...implements Euclid’s algorithm for calculating the greatest common divisor (GCD) of two integers; it repeat- edly reads an integer message from each of its

Stochastic Semidefinite Programming: Applications and Algorithms

DTIC Science & Technology

2012-03-03

doi: 2011/09/07 13:38:21 13 TOTAL: 1 Number of Papers published in non peer-reviewed journals: Baha M. Alzalg and K. A. Ariyawansa, Stochastic...symmetric programming over integers. International Conference on Scientific Computing, Las Vegas, Nevada, July 18--21, 2011. Baha M. Alzalg. On recent...Proceeding publications (other than abstracts): PaperReceived Baha M. Alzalg, K. A. Ariyawansa. Stochastic mixed integer second-order cone programming

Optimal Facility Location Tool for Logistics Battle Command (LBC)

DTIC Science & Technology

2015-08-01

64 Appendix B. VBA Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 Appendix C. Story...should city planners have located emergency service facilities so that all households (the demand) had equal access to coverage?” The critical...programming language called Visual Basic for Applications ( VBA ). CPLEX is a commercial solver for linear, integer, and mixed integer linear programming problems

A Treatment of Computational Precision, Number Representation, and Large Integers in an Introductory Fortran Course

ERIC Educational Resources Information Center

Richardson, William H., Jr.

2006-01-01

Computational precision is sometimes given short shrift in a first programming course. Treating this topic requires discussing integer and floating-point number representations and inaccuracies that may result from their use. An example of a moderately simple programming problem from elementary statistics was examined. It forced students to…

An Integer Programming Approach to School District Financial Management.

ERIC Educational Resources Information Center

Dembowski, Frederick L.

Because of the nature of school district cash flows, there are opportunities for investing surplus cash and the necessity to borrow cash in deficit periods. The term structure of interest rates makes the manual determination of the optimal financial package impossible. In this research, an integer programming model of this cash management process…

Currency Arbitrage Detection Using a Binary Integer Programming Model

ERIC Educational Resources Information Center

Soon, Wanmei; Ye, Heng-Qing

2011-01-01

In this article, we examine the use of a new binary integer programming (BIP) model to detect arbitrage opportunities in currency exchanges. This model showcases an excellent application of mathematics to the real world. The concepts involved are easily accessible to undergraduate students with basic knowledge in Operations Research. Through this…

Puerto Rico water resources planning model program description

USGS Publications Warehouse

Moody, D.W.; Maddock, Thomas; Karlinger, M.R.; Lloyd, J.J.

1973-01-01

Because the use of the Mathematical Programming System -Extended (MPSX) to solve large linear and mixed integer programs requires the preparation of many input data cards, a matrix generator program to produce the MPSX input data from a much more limited set of data may expedite the use of the mixed integer programming optimization technique. The Model Definition and Control Program (MODCQP) is intended to assist a planner in preparing MPSX input data for the Puerto Rico Water Resources Planning Model. The model utilizes a mixed-integer mathematical program to identify a minimum present cost set of water resources projects (diversions, reservoirs, ground-water fields, desalinization plants, water treatment plants, and inter-basin transfers of water) which will meet a set of future water demands and to determine their sequence of construction. While MODCOP was specifically written to generate MPSX input data for the planning model described in this report, the program can be easily modified to reflect changes in the model's mathematical structure.

Dynamic analysis for solid waste management systems: an inexact multistage integer programming approach.

PubMed

Li, Yongping; Huang, Guohe

2009-03-01

In this study, a dynamic analysis approach based on an inexact multistage integer programming (IMIP) model is developed for supporting municipal solid waste (MSW) management under uncertainty. Techniques of interval-parameter programming and multistage stochastic programming are incorporated within an integer-programming framework. The developed IMIP can deal with uncertainties expressed as probability distributions and interval numbers, and can reflect the dynamics in terms of decisions for waste-flow allocation and facility-capacity expansion over a multistage context. Moreover, the IMIP can be used for analyzing various policy scenarios that are associated with different levels of economic consequences. The developed method is applied to a case study of long-term waste-management planning. The results indicate that reasonable solutions have been generated for binary and continuous variables. They can help generate desired decisions of system-capacity expansion and waste-flow allocation with a minimized system cost and maximized system reliability.

Airborne Tactical Crossload Planner

DTIC Science & Technology

2017-12-01

set out in the Airborne Standard Operating Procedure (ASOP). 14. SUBJECT TERMS crossload, airborne, optimization, integer linear programming ...they land to their respective sub-mission locations. In this thesis, we formulate and implement an integer linear program called the Tactical...to meet any desired crossload objectives. xiv We demonstrate TCP with two real-world tactical problems from recent airborne operations: one by the

Solving mixed integer nonlinear programming problems using spiral dynamics optimization algorithm

NASA Astrophysics Data System (ADS)

Kania, Adhe; Sidarto, Kuntjoro Adji

2016-02-01

Many engineering and practical problem can be modeled by mixed integer nonlinear programming. This paper proposes to solve the problem with modified spiral dynamics inspired optimization method of Tamura and Yasuda. Four test cases have been examined, including problem in engineering and sport. This method succeeds in obtaining the optimal result in all test cases.

PIPS-SBB: A Parallel Distributed-Memory Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

DOE PAGES

Munguia, Lluis-Miquel; Oxberry, Geoffrey; Rajan, Deepak

2016-05-01

Stochastic mixed-integer programs (SMIPs) deal with optimization under uncertainty at many levels of the decision-making process. When solved as extensive formulation mixed- integer programs, problem instances can exceed available memory on a single workstation. In order to overcome this limitation, we present PIPS-SBB: a distributed-memory parallel stochastic MIP solver that takes advantage of parallelism at multiple levels of the optimization process. We also show promising results on the SIPLIB benchmark by combining methods known for accelerating Branch and Bound (B&B) methods with new ideas that leverage the structure of SMIPs. Finally, we expect the performance of PIPS-SBB to improve furthermore » as more functionality is added in the future.« less

Logic integer programming models for signaling networks.

PubMed

Haus, Utz-Uwe; Niermann, Kathrin; Truemper, Klaus; Weismantel, Robert

2009-05-01

We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.

A logic-based method for integer programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hooker, J.; Natraj, N.R.

1994-12-31

We propose a logic-based approach to integer programming that replaces traditional branch-and-cut techniques with logical analogs. Integer variables are regarded as atomic propositions. The constraints give rise to logical formulas that are analogous to separating cuts. No continuous relaxation is used. Rather, the cuts are selected so that they can be easily solved as a discrete relaxation. (In fact, defining a relaxation and generating cuts are best seen as the same problem.) We experiment with relaxations that have a k-tree structure and can be solved by nonserial dynamic programming. We also present logic-based analogs of facet-defining cuts, Chv{acute a}tal rank,more » etc. We conclude with some preliminary computational results.« less

Determination of optimum values for maximizing the profit in bread production: Daily bakery Sdn Bhd

NASA Astrophysics Data System (ADS)

Muda, Nora; Sim, Raymond

2015-02-01

An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. An ILP has many applications in industrial production, including job-shop modelling. A possible objective is to maximize the total production, without exceeding the available resources. In some cases, this can be expressed in terms of a linear program, but variables must be constrained to be integer. It concerned with the optimization of a linear function while satisfying a set of linear equality and inequality constraints and restrictions. It has been used to solve optimization problem in many industries area such as banking, nutrition, agriculture, and bakery and so on. The main purpose of this study is to formulate the best combination of all ingredients in producing different type of bread in Daily Bakery in order to gain maximum profit. This study also focuses on the sensitivity analysis due to changing of the profit and the cost of each ingredient. The optimum result obtained from QM software is RM 65,377.29 per day. This study will be benefited for Daily Bakery and also other similar industries. By formulating a combination of all ingredients make up, they can easily know their total profit in producing bread everyday.

Computer Corner: Spreadsheets, Power Series, Generating Functions, and Integers.

ERIC Educational Resources Information Center

Snow, Donald R.

1989-01-01

Implements a table algorithm on a spreadsheet program and obtains functions for several number sequences such as the Fibonacci and Catalan numbers. Considers other applications of the table algorithm to integers represented in various number bases. (YP)

An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

NASA Astrophysics Data System (ADS)

Li, Hong; Zhang, Li; Jiao, Yong-Chang

2016-07-01

This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn-Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.

Currency arbitrage detection using a binary integer programming model

NASA Astrophysics Data System (ADS)

Soon, Wanmei; Ye, Heng-Qing

2011-04-01

In this article, we examine the use of a new binary integer programming (BIP) model to detect arbitrage opportunities in currency exchanges. This model showcases an excellent application of mathematics to the real world. The concepts involved are easily accessible to undergraduate students with basic knowledge in Operations Research. Through this work, students can learn to link several types of basic optimization models, namely linear programming, integer programming and network models, and apply the well-known sensitivity analysis procedure to accommodate realistic changes in the exchange rates. Beginning with a BIP model, we discuss how it can be reduced to an equivalent but considerably simpler model, where an efficient algorithm can be applied to find the arbitrages and incorporate the sensitivity analysis procedure. A simple comparison is then made with a different arbitrage detection model. This exercise helps students learn to apply basic Operations Research concepts to a practical real-life example, and provides insights into the processes involved in Operations Research model formulations.

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

NASA Technical Reports Server (NTRS)

Cheung, Kar-Ming; Lee, Charles H.

2012-01-01

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

An Interactive Artificial Cutting Plane Method for Bicriterion Integer Programming Problems

DTIC Science & Technology

1992-08-01

AUTHOR(S) Diane Breivik Allen, 1st Lt 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) 8. PERFORMING ORGANIZATION REPORT NUMBER AFIT Student Attending...INTERACTIVE ARTIFICIAL CUTTING PLANE METHOD FOR BICRITERION INTEGER PROGRAMMING PROBLEMS By Diane Breivik Allen A Thesis Submitted to the Faculty of...ITfiSRA&1 DTIC TAB 0 Unannounced 0 Justirication By BY Diane Breivik Allen Distributlon/ Availability CQdes Avail and/or Dist Special Approved: DTI

Enhanced index tracking modeling in portfolio optimization with mixed-integer programming z approach

NASA Astrophysics Data System (ADS)

Siew, Lam Weng; Jaaman, Saiful Hafizah Hj.; Ismail, Hamizun bin

2014-09-01

Enhanced index tracking is a popular form of portfolio management in stock market investment. Enhanced index tracking aims to construct an optimal portfolio to generate excess return over the return achieved by the stock market index without purchasing all of the stocks that make up the index. The objective of this paper is to construct an optimal portfolio using mixed-integer programming model which adopts regression approach in order to generate higher portfolio mean return than stock market index return. In this study, the data consists of 24 component stocks in Malaysia market index which is FTSE Bursa Malaysia Kuala Lumpur Composite Index from January 2010 until December 2012. The results of this study show that the optimal portfolio of mixed-integer programming model is able to generate higher mean return than FTSE Bursa Malaysia Kuala Lumpur Composite Index return with only selecting 30% out of the total stock market index components.

Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.

PubMed

Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush

2016-08-01

This research investigates an optimal delay-based virtual topology design using integer linear programming (ILP), which is applied to the current backbone networks such as smart-grid real-time communication systems. A network traffic matrix is applied and the corresponding virtual topology problem is solved using the ILP formulations that include a network delay-dependent objective function and lightpath routing, wavelength assignment, wavelength continuity, flow routing, and traffic loss constraints. The proposed optimization approach provides an efficient deterministic integration of intelligent sensing and decision making, and network learning features for superior smart grid operations by adaptively responding the time-varying network traffic data as well as operational constraints to maintain optimal virtual topologies. A representative optical backbone network has been utilized to demonstrate the proposed optimization framework whose simulation results indicate that superior smart-grid network performance can be achieved using commercial networks and integer programming.

Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.

PubMed

Lyubetsky, Vassily; Gershgorin, Roman; Gorbunov, Konstantin

2017-12-06

Chromosome structure is a very limited model of the genome including the information about its chromosomes such as their linear or circular organization, the order of genes on them, and the DNA strand encoding a gene. Gene lengths, nucleotide composition, and intergenic regions are ignored. Although highly incomplete, such structure can be used in many cases, e.g., to reconstruct phylogeny and evolutionary events, to identify gene synteny, regulatory elements and promoters (considering highly conserved elements), etc. Three problems are considered; all assume unequal gene content and the presence of gene paralogs. The distance problem is to determine the minimum number of operations required to transform one chromosome structure into another and the corresponding transformation itself including the identification of paralogs in two structures. We use the DCJ model which is one of the most studied combinatorial rearrangement models. Double-, sesqui-, and single-operations as well as deletion and insertion of a chromosome region are considered in the model; the single ones comprise cut and join. In the reconstruction problem, a phylogenetic tree with chromosome structures in the leaves is given. It is necessary to assign the structures to inner nodes of the tree to minimize the sum of distances between terminal structures of each edge and to identify the mutual paralogs in a fairly large set of structures. A linear algorithm is known for the distance problem without paralogs, while the presence of paralogs makes it NP-hard. If paralogs are allowed but the insertion and deletion operations are missing (and special constraints are imposed), the reduction of the distance problem to integer linear programming is known. Apparently, the reconstruction problem is NP-hard even in the absence of paralogs. The problem of contigs is to find the optimal arrangements for each given set of contigs, which also includes the mutual identification of paralogs. We proved that these problems can be reduced to integer linear programming formulations, which allows an algorithm to redefine the problems to implement a very special case of the integer linear programming tool. The results were tested on synthetic and biological samples. Three well-known problems were reduced to a very special case of integer linear programming, which is a new method of their solutions. Integer linear programming is clearly among the main computational methods and, as generally accepted, is fast on average; in particular, computation systems specifically targeted at it are available. The challenges are to reduce the size of the corresponding integer linear programming formulations and to incorporate a more detailed biological concept in our model of the reconstruction.

77 FR 33227 - Assessment Questionnaire-IP Sector Specific Agency Risk Self Assessment Tool (IP-SSARSAT)

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-05

... DEPARTMENT OF HOMELAND SECURITY [Docket No. DHS-2011-0069] Assessment Questionnaire--IP Sector Specific Agency Risk Self Assessment Tool (IP-SSARSAT) AGENCY: National Protection and Programs Directorate...), Office of Infrastructure Protection (IP), Sector Outreach and Programs Division (SOPD), previously named...

Internet-Based Partner Services in US Sexually Transmitted Disease Prevention Programs: 2009-2013.

PubMed

Moody, Victoria; Hogben, Matthew; Kroeger, Karen; Johnson, James

2015-01-01

Social networking sites have become increasingly popular venues for meeting sex partners. Today, some sexually transmitted disease (STD) programs conduct Internet-based partner services (IPS). The purpose of the study was to explore how the Internet is being used by STD prevention programs to perform partner services. We assessed US STD prevention programs receiving funds through the 2008-2013 Comprehensive STD Prevention Systems cooperative agreement. We (1) reviewed 2009 IPS protocols in 57 funding applications against a benchmark of national guidelines and (2) surveyed persons who conducted IPS in jurisdictions conducting IPS in 2012. Of the 57 project areas receiving Comprehensive STD Prevention Systems funds, 74% provided an IPS protocol. States with IPS protocols had larger populations and more gonorrhea and syphilis cases (t = 2.2-2.6; all Ps < .05), although not higher rates of infection. Most protocols included staffing (92%) and IPS documentation (87%) requirements, but fewer had evaluation plans (29%) or social networking site engagement strategies (16%). Authority to perform a complete range of IPS activities (send e-mail, use social networking sites) was associated with contacting more partners via IPSs (P < .05). This study provides a snapshot of IPS activities in STD programs in the United States. Further research is needed to move from assessment to generating data that can assist training efforts and program action and, finally, to enable efficient IPS programs that are integrated into STD prevention and control efforts.

Alternative mathematical programming formulations for FSS synthesis

NASA Technical Reports Server (NTRS)

Reilly, C. H.; Mount-Campbell, C. A.; Gonsalvez, D. J. A.; Levis, C. A.

1986-01-01

A variety of mathematical programming models and two solution strategies are suggested for the problem of allocating orbital positions to (synthesizing) satellites in the Fixed Satellite Service. Mixed integer programming and almost linear programming formulations are presented in detail for each of two objectives: (1) positioning satellites as closely as possible to specified desired locations, and (2) minimizing the total length of the geostationary arc allocated to the satellites whose positions are to be determined. Computational results for mixed integer and almost linear programming models, with the objective of positioning satellites as closely as possible to their desired locations, are reported for three six-administration test problems and a thirteen-administration test problem.

Aerospace Applications of Integer and Combinatorial Optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Aerospace applications on integer and combinatorial optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem. for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

An Improved SoC Test Scheduling Method Based on Simulated Annealing Algorithm

NASA Astrophysics Data System (ADS)

Zheng, Jingjing; Shen, Zhihang; Gao, Huaien; Chen, Bianna; Zheng, Weida; Xiong, Xiaoming

2017-02-01

In this paper, we propose an improved SoC test scheduling method based on simulated annealing algorithm (SA). It is our first to disorganize IP core assignment for each TAM to produce a new solution for SA, allocate TAM width for each TAM using greedy algorithm and calculate corresponding testing time. And accepting the core assignment according to the principle of simulated annealing algorithm and finally attain the optimum solution. Simultaneously, we run the test scheduling experiment with the international reference circuits provided by International Test Conference 2002(ITC’02) and the result shows that our algorithm is superior to the conventional integer linear programming algorithm (ILP), simulated annealing algorithm (SA) and genetic algorithm(GA). When TAM width reaches to 48,56 and 64, the testing time based on our algorithm is lesser than the classic methods and the optimization rates are 30.74%, 3.32%, 16.13% respectively. Moreover, the testing time based on our algorithm is very close to that of improved genetic algorithm (IGA), which is state-of-the-art at present.

Integration of progressive hedging and dual decomposition in stochastic integer programs

DOE PAGES

Watson, Jean -Paul; Guo, Ge; Hackebeil, Gabriel; ...

2015-04-07

We present a method for integrating the Progressive Hedging (PH) algorithm and the Dual Decomposition (DD) algorithm of Carøe and Schultz for stochastic mixed-integer programs. Based on the correspondence between lower bounds obtained with PH and DD, a method to transform weights from PH to Lagrange multipliers in DD is found. Fast progress in early iterations of PH speeds up convergence of DD to an exact solution. As a result, we report computational results on server location and unit commitment instances.

Performance comparison of genetic algorithms and particle swarm optimization for model integer programming bus timetabling problem

NASA Astrophysics Data System (ADS)

Wihartiko, F. D.; Wijayanti, H.; Virgantari, F.

2018-03-01

Genetic Algorithm (GA) is a common algorithm used to solve optimization problems with artificial intelligence approach. Similarly, the Particle Swarm Optimization (PSO) algorithm. Both algorithms have different advantages and disadvantages when applied to the case of optimization of the Model Integer Programming for Bus Timetabling Problem (MIPBTP), where in the case of MIPBTP will be found the optimal number of trips confronted with various constraints. The comparison results show that the PSO algorithm is superior in terms of complexity, accuracy, iteration and program simplicity in finding the optimal solution.

Solving the Water Jugs Problem by an Integer Sequence Approach

ERIC Educational Resources Information Center

Man, Yiu-Kwong

2012-01-01

In this article, we present an integer sequence approach to solve the classic water jugs problem. The solution steps can be obtained easily by additions and subtractions only, which is suitable for manual calculation or programming by computer. This approach can be introduced to secondary and undergraduate students, and also to teachers and…

Fast scaffolding with small independent mixed integer programs

PubMed Central

Salmela, Leena; Mäkinen, Veli; Välimäki, Niko; Ylinen, Johannes; Ukkonen, Esko

2011-01-01

Motivation: Assembling genomes from short read data has become increasingly popular, but the problem remains computationally challenging especially for larger genomes. We study the scaffolding phase of sequence assembly where preassembled contigs are ordered based on mate pair data. Results: We present MIP Scaffolder that divides the scaffolding problem into smaller subproblems and solves these with mixed integer programming. The scaffolding problem can be represented as a graph and the biconnected components of this graph can be solved independently. We present a technique for restricting the size of these subproblems so that they can be solved accurately with mixed integer programming. We compare MIP Scaffolder to two state of the art methods, SOPRA and SSPACE. MIP Scaffolder is fast and produces better or as good scaffolds as its competitors on large genomes. Availability: The source code of MIP Scaffolder is freely available at http://www.cs.helsinki.fi/u/lmsalmel/mip-scaffolder/. Contact: leena.salmela@cs.helsinki.fi PMID:21998153

A two-stage mixed-integer fuzzy programming with interval-valued membership functions approach for flood-diversion planning.

PubMed

Wang, S; Huang, G H

2013-03-15

Flood disasters have been extremely severe in recent decades, and they account for about one third of all natural catastrophes throughout the world. In this study, a two-stage mixed-integer fuzzy programming with interval-valued membership functions (TMFP-IMF) approach is developed for flood-diversion planning under uncertainty. TMFP-IMF integrates the fuzzy flexible programming, two-stage stochastic programming, and integer programming within a general framework. A concept of interval-valued fuzzy membership function is introduced to address complexities of system uncertainties. TMFP-IMF can not only deal with uncertainties expressed as fuzzy sets and probability distributions, but also incorporate pre-regulated water-diversion policies directly into its optimization process. TMFP-IMF is applied to a hypothetical case study of flood-diversion planning for demonstrating its applicability. Results indicate that reasonable solutions can be generated for binary and continuous variables. A variety of flood-diversion and capacity-expansion schemes can be obtained under four scenarios, which enable decision makers (DMs) to identify the most desired one based on their perceptions and attitudes towards the objective-function value and constraints. Copyright © 2013 Elsevier Ltd. All rights reserved.

Creation of a competency-based professional development program for infection preventionists guided by the APIC Competency Model: steps in the process.

PubMed

Bernard, Heather; Hackbarth, Diana; Olmsted, Russell N; Murphy, Denise

2018-06-07

Infection Preventionists have varying levels of educational preparation. Many have no prior experience in IP. The diversity makes design of professional development programs challenging. Recent surveys suggest that only about half of practicing IPs are board certified. There is an urgent need to employ competent IP's to drive improvement in patient outcomes. This is a project that utilized the APIC Competency Model to create a professional development program characterizing three career stages. Methods included a review of literature on professional development; a survey of IP competence; an assessment of job descriptions and performance evaluations; and a crosswalk of IP competencies. The professional development program includes competency - based IP job descriptions and performance evaluations for each career stage; a professional portfolio; and a toolkit for supervisors. Participants agreed that application of the model resulted in tools which are more closely aligned with current roles for IPs; and increased satisfaction and motivation with the new program. Competent and knowledgeable IP's are crucial to optimizing efficacy of IPC programs. A professional development program has the potential to guide staff orientation, improve satisfaction and retention, improve patient outcomes and promote a positive trajectory in advancing practice. Copyright © 2018 Association for Professionals in Infection Control and Epidemiology, Inc. Published by Elsevier Inc. All rights reserved.

A Comparison of the DISASTER (Trademark) Scheduling Software with a Simultaneous Scheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

DTIC Science & Technology

1993-09-01

goal ( Heizer , Render , and Stair, 1993:94). Integer Prgronmming. Integer programming is a general purpose approach used to optimally solve job shop...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations

An integer programming model to optimize resource allocation for wildfire containment.

Treesearch

Geoffrey H. Donovan; Douglas B. Rideout

2003-01-01

Determining the specific mix of fire-fighting resources for a given fire is a necessary condition for identifying the minimum of the Cost Plus Net Value Change (C+NVC) function. Current wildland fire management models may not reliably do so. The problem of identifying the most efficient wildland fire organization is characterized mathematically using integer-...

RSM 1.0 - A RESUPPLY SCHEDULER USING INTEGER OPTIMIZATION

NASA Technical Reports Server (NTRS)

Viterna, L. A.

1994-01-01

RSM, Resupply Scheduling Modeler, is a fully menu-driven program that uses integer programming techniques to determine an optimum schedule for replacing components on or before the end of a fixed replacement period. Although written to analyze the electrical power system on the Space Station Freedom, RSM is quite general and can be used to model the resupply of almost any system subject to user-defined resource constraints. RSM is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more computationally intensive, integer programming was required for accuracy when modeling systems with small quantities of components. Input values for component life cane be real numbers, RSM converts them to integers by dividing the lifetime by the period duration, then reducing the result to the next lowest integer. For each component, there is a set of constraints that insure that it is replaced before its lifetime expires. RSM includes user-defined constraints such as transportation mass and volume limits, as well as component life, available repair crew time and assembly sequences. A weighting factor allows the program to minimize factors such as cost. The program then performs an iterative analysis, which is displayed during the processing. A message gives the first period in which resources are being exceeded on each iteration. If the scheduling problem is unfeasible, the final message will also indicate the first period in which resources were exceeded. RSM is written in APL2 for IBM PC series computers and compatibles. A stand-alone executable version of RSM is provided; however, this is a "packed" version of RSM which can only utilize the memory within the 640K DOS limit. This executable requires at least 640K of memory and DOS 3.1 or higher. Source code for an APL2/PC workspace version is also provided. This version of RSM can make full use of any installed extended memory but must be run with the APL2 interpreter; and it requires an 80486 based microcomputer or an 80386 based microcomputer with an 80387 math coprocessor, at least 2Mb of extended memory, and DOS 3.3 or higher. The standard distribution medium for this package is one 5.25 inch 360K MS-DOS format diskette. RSM was developed in 1991. APL2 and IBM PC are registered trademarks of International Business Machines Corporation. MS-DOS is a registered trademark of Microsoft Corporation.

A generalized interval fuzzy mixed integer programming model for a multimodal transportation problem under uncertainty

NASA Astrophysics Data System (ADS)

Tian, Wenli; Cao, Chengxuan

2017-03-01

A generalized interval fuzzy mixed integer programming model is proposed for the multimodal freight transportation problem under uncertainty, in which the optimal mode of transport and the optimal amount of each type of freight transported through each path need to be decided. For practical purposes, three mathematical methods, i.e. the interval ranking method, fuzzy linear programming method and linear weighted summation method, are applied to obtain equivalents of constraints and parameters, and then a fuzzy expected value model is presented. A heuristic algorithm based on a greedy criterion and the linear relaxation algorithm are designed to solve the model.

77 FR 74685 - Chemical Facility Anti-Terrorism Standards (CFATS) Chemical-Terrorism Vulnerability Information...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-17

... Programs Directorate (NPPD), Office of Infrastructure Protection (IP), Infrastructure Security Compliance... questions about this Information Collection Request should be forwarded to DHS/NPPD/IP/ISCD CFATS Program... to the DHS/NPPD/IP/ISCD CFATS Program Manager at the Department of Homeland Security, 245 Murray Lane...

77 FR 37060 - Critical Infrastructure and Key Resources (CIKR) Asset Protection Technical Assistance Program...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-20

...), National Protection and Programs Directorate (NPPD), Office of Infrastructure Protection (IP.../IP/IICD, 245 Murray Lane SW., Mailstop 0602, Arlington, VA 20598-0602. Email requests should go to... Technical Assistance Program (CAPTAP) is offered jointly by the NPPD/IP and the Federal Emergency Management...

A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.

DTIC Science & Technology

1987-10-01

INTEGER LINEAR PROGRAMMING PROBLEM WHICH IS EFFICIENTLY SOLVABLE 12. PERSONAL AUTHOR(S) Leiserson, Charles, and Saxe, James B. 13a. TYPE OF REPORT j13b TIME...ger prongramn rg versions or the problem is not ac’hievable in genieral for sparse inistancves of’ P rolem(r Mi. Th le remrai nder or thris paper is...rClazes c:oIh edge (i,I*) by comlpli urg +- rnirr(z 3, ,x + a,j). A sirnI) le analysis (11 vto Nei [131 indicates why whe Iellinan-Ford algorithm works

Development of a Menu Driven Materials Data Base for Use on Personal Computers

DTIC Science & Technology

1992-07-01

written permission. Copyright Is the responsibility of the Director Publishing and Marketing , AGPS. Enquiries should be directed to the Manager, AGPS...PROGRAM LISTING A-2-1 Program MOB; uses crt; label levell,level2,level3,shutdown,dis;play; var options,code, nlines ,nmeflitemp,i,j4,k :integer; w,chl,ch2,ch3...char; menus :array [I. .1001 of st~ring[801; nline :array [l. .100] of integer; s2 :string[21; control :string[4]; aline :string[801; inm,iflt :text

Stacking-sequence optimization for buckling of laminated plates by integer programming

NASA Technical Reports Server (NTRS)

Haftka, Raphael T.; Walsh, Joanne L.

1991-01-01

Integer-programming formulations for the design of symmetric and balanced laminated plates under biaxial compression are presented. Both maximization of buckling load for a given total thickness and the minimization of total thickness subject to a buckling constraint are formulated. The design variables that define the stacking sequence of the laminate are zero-one integers. It is shown that the formulation results in a linear optimization problem that can be solved on readily available software. This is in contrast to the continuous case, where the design variables are the thicknesses of layers with specified ply orientations, and the optimization problem is nonlinear. Constraints on the stacking sequence such as a limit on the number of contiguous plies of the same orientation and limits on in-plane stiffnesses are easily accommodated. Examples are presented for graphite-epoxy plates under uniaxial and biaxial compression using a commercial software package based on the branch-and-bound algorithm.

Comparison of two non-convex mixed-integer nonlinear programming algorithms applied to autoregressive moving average model structure and parameter estimation

NASA Astrophysics Data System (ADS)

Uilhoorn, F. E.

2016-10-01

In this article, the stochastic modelling approach proposed by Box and Jenkins is treated as a mixed-integer nonlinear programming (MINLP) problem solved with a mesh adaptive direct search and a real-coded genetic class of algorithms. The aim is to estimate the real-valued parameters and non-negative integer, correlated structure of stationary autoregressive moving average (ARMA) processes. The maximum likelihood function of the stationary ARMA process is embedded in Akaike's information criterion and the Bayesian information criterion, whereas the estimation procedure is based on Kalman filter recursions. The constraints imposed on the objective function enforce stability and invertibility. The best ARMA model is regarded as the global minimum of the non-convex MINLP problem. The robustness and computational performance of the MINLP solvers are compared with brute-force enumeration. Numerical experiments are done for existing time series and one new data set.

47 CFR 64.606 - VRS and IP Relay provider and TRS program certification.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 3 2010-10-01 2010-10-01 false VRS and IP Relay provider and TRS program... Services and Related Customer Premises Equipment for Persons With Disabilities § 64.606 VRS and IP Relay... including notification in the Federal Register. (2) VRS and IP Relay provider. Any entity desiring to...

Procedural volume and structure of interventional pulmonary fellowships: a survey of fellows and fellowship program directors.

PubMed

Yarmus, Lonny; Feller-Kopman, David; Imad, Melhem; Kim, Stephanie; Lee, Hans J

2013-09-01

Current interventional pulmonary (IP) procedural guidelines for competency are based on expert opinion. There are few objective data to support competency metrics for IP procedures. This survey reports procedural volume during IP fellowships to help define new standards in training and curriculum development. A web-based survey was developed to evaluate IP training procedural volume. The survey was administered to all US and Canadian IP fellowship directors and graduates in training from 2006 to 2011. The survey inquired about all diagnostic and therapeutic procedures performed during the specialized year of IP training. Questions regarding the training program structure were collected and analyzed. There was a 92.5% fellow response rate (37 of 40) and 77% fellowship director response rate (10 of 13) from programs in existence at the time of the survey. Procedural volume was consistent between fellowship directors and graduates (P = .64). Although there was a wide range of procedural volume and types of procedures between different programs, the procedural mean volumes were all significantly higher than the American College of Chest Physicians (ACCP) and American Thoracic Society/European Respiratory Society (ATS/ERS) guideline recommendations (P < .005). US and Canadian IP fellowships produce fellows with variable procedural volumes; however, these are significantly higher than ACCP and ATS/ERS guidelines for most programs and procedures. With a uniform training curriculum being adopted by the majority of IP fellowship programs in the United States and Canada, as well as data showing improved core knowledge in IP fellows undergoing a dedicated year of additional training, further metrics examining the impact of advanced IP training on patient outcomes are needed.

A model for the implementation of a two-shift municipal solid waste and recyclable material collection plan that offers greater convenience to residents.

PubMed

Lin, Hung-Yueh; Tsai, Zong-Pei; Chen, Guan-Hwa; Kao, Jehng-Jung

2011-01-01

Separating recyclables from municipal solid waste (MSW) before collection reduces not only the quantity of MSW that needs to be treated but also the depletion of resources. However, the participation of residents is essential for a successful recycling program, and the level of participation usually depends on the degree of convenience associated with accessing recycling collection points. The residential accessing convenience (RAC) of a collection plan is determined by the proximity of its collection points to all residents and its temporal flexibility in response to resident requirements. The degree of proximity to all residents is determined by using a coverage radius that represents the maximum distance residents need to travel to access a recycling point. The temporal flexibility is assessed by the availability of proximal recycling points at times suitable to the lifestyles of all residents concerned. In Taiwan, the MSW collection is implemented at fixed locations and at fixed times. Residents must deposit their garbage directly into the collection vehicle. To facilitate the assignment of collection vehicles and to encourage residents to thoroughly separate their recyclables, in Taiwan MSW and recyclable materials are usually collected at the same time by different vehicles. A heuristic procedure including an integer programming (IP) model and ant colony optimization (ACO) is explored in this study to determine an efficient two-shift collection plan that takes into account RAC factors. The IP model has been developed to determine convenient collection points in each shift on the basis of proximity, and then the ACO algorithm is applied to determine the most effective routing plan of each shift. With the use of a case study involving a city in Taiwan, this study has demonstrated that collection plans generated using the above procedure are superior to current collection plans on the basis of proximity and total collection distance.

Architectures and Design for Next-Generation Hybrid Circuit/Packet Networks

NASA Astrophysics Data System (ADS)

Vadrevu, Sree Krishna Chaitanya

Internet traffic is increasing rapidly at an annual growth rate of 35% with aggregate traffic exceeding several Exabyte's per month. The traffic is also becoming heterogeneous in bandwidth and quality-of-service (QoS) requirements with growing popularity of cloud computing, video-on-demand (VoD), e-science, etc. Hybrid circuit/packet networks which can jointly support circuit and packet services along with the adoption of high-bit-rate transmission systems form an attractive solution to address the traffic growth. 10 Gbps and 40 Gbps transmission systems are widely deployed in telecom backbone networks such as Comcast, AT&T, etc., and network operators are considering migration to 100 Gbps and beyond. This dissertation proposes robust architectures, capacity migration strategies, and novel service frameworks for next-generation hybrid circuit/packet architectures. In this dissertation, we study two types of hybrid circuit/packet networks: a) IP-over-WDM networks, in which the packet (IP) network is overlaid on top of the circuit (optical WDM) network and b) Hybrid networks in which the circuit and packet networks are deployed side by side such as US DoE's ESnet. We investigate techniques to dynamically migrate capacity between the circuit and packet sections by exploiting traffic variations over a day, and our methods show that significant bandwidth savings can be obtained with improved reliability of services. Specifically, we investigate how idle backup circuit capacity can be used to support packet services in IP-over-WDM networks, and similarly, excess capacity in packet network to support circuit services in ESnet. Control schemes that enable our mechanisms are also discussed. In IP-over-WDM networks, with upcoming 100 Gbps and beyond, dedicated protection will induce significant under-utilization of backup resources. We investigate design strategies to loan idle circuit backup capacity to support IP/packet services. However, failure of backup circuits will preempt IP services routed over them, and thus it is important to ensure IP topology survivability to successfully re-route preempted IP services. Integer-linear-program (ILP) and heuristic solutions have been developed and network cost reduction up to 60% has been observed. In ESnet, we study loaning packet links to support circuit services. Mixed-line-rate (MLR) networks supporting 10/40/100 Gbps on the same fiber are becoming increasingly popular. Services that accept degradation in bandwidth, latency, jitter, etc. under failure scenarios for lower cost are known as degraded services. We study degradation in bandwidth for lower cost under failure scenarios, a concept called partial protection, in the context of MLR networks. We notice partial protection enables significant cost savings compared to full protection. To cope with traffic growth, network operators need to deploy equipment at periodic time intervals, and this is known as the multi-period planning and upgrade problem. We study three important multi-period planning approaches, namely incremental planning, all-period planning, and two-period planning with mixed line rates. Our approaches predict the network equipment that needs to be deployed optimally at which nodes and at which time periods in the network to meet QoS requirements.

Implementation of evidence-based supported employment in regional Australia.

PubMed

Morris, Adrienne; Waghorn, Geoffrey; Robson, Emma; Moore, Lyndell; Edwards, Emma

2014-06-01

To implement the Individual Placement and Support (IPS) approach at 4 locations in regional New South Wales, Australia. Outcomes attained were compared with a national non-IPS program and with international trials of IPS within and outside the United States. Four IPS programs were established through formal partnerships between mental health services and disability employment services. Ninety-five mental health service clients commenced employment assistance and were tracked for a minimum of 12 months. Two sites achieved good fidelity to IPS principles, and 2 sites achieved fair fidelity. IPS clients had 3.5 times greater odds of attaining 13 weeks' employment than those receiving assistance in the national network of disability employment services. Implementing IPS is challenging in the Australian service delivery context. Factors other than program fidelity appear to contribute to excellent employment outcomes. Further research is needed to identify these factors.

Distributed mixed-integer fuzzy hierarchical programming for municipal solid waste management. Part I: System identification and methodology development.

PubMed

Cheng, Guanhui; Huang, Guohe; Dong, Cong; Xu, Ye; Chen, Xiujuan; Chen, Jiapei

2017-03-01

Due to the existence of complexities of heterogeneities, hierarchy, discreteness, and interactions in municipal solid waste management (MSWM) systems such as Beijing, China, a series of socio-economic and eco-environmental problems may emerge or worsen and result in irredeemable damages in the following decades. Meanwhile, existing studies, especially ones focusing on MSWM in Beijing, could hardly reflect these complexities in system simulations and provide reliable decision support for management practices. Thus, a framework of distributed mixed-integer fuzzy hierarchical programming (DMIFHP) is developed in this study for MSWM under these complexities. Beijing is selected as a representative case. The Beijing MSWM system is comprehensively analyzed in many aspects such as socio-economic conditions, natural conditions, spatial heterogeneities, treatment facilities, and system complexities, building a solid foundation for system simulation and optimization. Correspondingly, the MSWM system in Beijing is discretized as 235 grids to reflect spatial heterogeneity. A DMIFHP model which is a nonlinear programming problem is constructed to parameterize the Beijing MSWM system. To enable scientific solving of it, a solution algorithm is proposed based on coupling of fuzzy programming and mixed-integer linear programming. Innovations and advantages of the DMIFHP framework are discussed. The optimal MSWM schemes and mechanism revelations will be discussed in another companion paper due to length limitation.

VR closure rates for two vocational models.

PubMed

Fraser, Virginia V; Jones, Amanda M; Frounfelker, Rochelle; Harding, Brian; Hardin, Teresa; Bond, Gary R

2008-01-01

The Individual Placement and Support (IPS) model of supported employment is an evidence-based practice for individuals with psychiatric disabilities. To be financially viable, IPS programs require funding from the state-federal vocational rehabilitation (VR) system. However, some observers have questioned the compatibility of IPS and the VR system. Using a randomized controlled trial comparing IPS to a well-established vocational program called the Diversified Placement Approach (DPA), we examined rates of VR sponsorship and successful VR closures. We also describe the establishment of an active collaboration between a psychiatric rehabilitation agency and the state VR system to facilitate rapid VR sponsorship for IPS clients. Both IPS and DPA achieved a 44% rate of VR Status 26 closure when considering all clients entering the study. IPS and DPA averaged similar amount of time to achieve VR sponsorship. Time from vocational program entry to Status 26 was 51 days longer on average for IPS. Even though several IPS principles seem to run counter to VR practices, such as zero exclusion and rapid job search, we found IPS closure rates comparable to those for DPA, a vocational model that screens for readiness, provides prevocational preparation, and extensively uses agency-run businesses.

Split diversity in constrained conservation prioritization using integer linear programming.

PubMed

Chernomor, Olga; Minh, Bui Quang; Forest, Félix; Klaere, Steffen; Ingram, Travis; Henzinger, Monika; von Haeseler, Arndt

2015-01-01

Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary history of species. Here, we discuss several optimization problems related to the use of PD, and the more general measure split diversity (SD), in conservation prioritization.Depending on the conservation goal and the information available about species, one can construct optimization routines that incorporate various conservation constraints. We demonstrate how this information can be used to select sets of species for conservation action. Specifically, we discuss the use of species' geographic distributions, the choice of candidates under economic pressure, and the use of predator-prey interactions between the species in a community to define viability constraints.Despite such optimization problems falling into the area of NP hard problems, it is possible to solve them in a reasonable amount of time using integer programming. We apply integer linear programming to a variety of models for conservation prioritization that incorporate the SD measure.We exemplarily show the results for two data sets: the Cape region of South Africa and a Caribbean coral reef community. Finally, we provide user-friendly software at http://www.cibiv.at/software/pda.

Rarity-weighted richness: a simple and reliable alternative to integer programming and heuristic algorithms for minimum set and maximum coverage problems in conservation planning.

PubMed

Albuquerque, Fabio; Beier, Paul

2015-01-01

Here we report that prioritizing sites in order of rarity-weighted richness (RWR) is a simple, reliable way to identify sites that represent all species in the fewest number of sites (minimum set problem) or to identify sites that represent the largest number of species within a given number of sites (maximum coverage problem). We compared the number of species represented in sites prioritized by RWR to numbers of species represented in sites prioritized by the Zonation software package for 11 datasets in which the size of individual planning units (sites) ranged from <1 ha to 2,500 km2. On average, RWR solutions were more efficient than Zonation solutions. Integer programming remains the only guaranteed way find an optimal solution, and heuristic algorithms remain superior for conservation prioritizations that consider compactness and multiple near-optimal solutions in addition to species representation. But because RWR can be implemented easily and quickly in R or a spreadsheet, it is an attractive alternative to integer programming or heuristic algorithms in some conservation prioritization contexts.

Integer programming for improving radiotherapy treatment efficiency.

PubMed

Lv, Ming; Li, Yi; Kou, Bo; Zhou, Zhili

2017-01-01

Patients received by radiotherapy departments are diverse and may be diagnosed with different cancers. Therefore, they need different radiotherapy treatment plans and thus have different needs for medical resources. This research aims to explore the best method of scheduling the admission of patients receiving radiotherapy so as to reduce patient loss and maximize the usage efficiency of service resources. A mix integer programming (MIP) model integrated with special features of radiotherapy is constructed. The data used here is based on the historical data collected and we propose an exact method to solve the MIP model. Compared with the traditional First Come First Served (FCFS) method, the new method has boosted patient admission as well as the usage of linear accelerators (LINAC) and beds. The integer programming model can be used to describe the complex problem of scheduling radio-receiving patients, to identify the bottleneck resources that hinder patient admission, and to obtain the optimal LINAC-bed radio under the current data conditions. Different management strategies can be implemented by adjusting the settings of the MIP model. The computational results can serve as a reference for the policy-makers in decision making.

Mobile-ip Aeronautical Network Simulation Study

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Tran, Diepchi T.

2001-01-01

NASA is interested in applying mobile Internet protocol (mobile-ip) technologies to its space and aeronautics programs. In particular, mobile-ip will play a major role in the Advanced Aeronautic Transportation Technology (AATT), the Weather Information Communication (WINCOMM), and the Small Aircraft Transportation System (SATS) aeronautics programs. This report presents the results of a simulation study of mobile-ip for an aeronautical network. The study was performed to determine the performance of the transmission control protocol (TCP) in a mobile-ip environment and to gain an understanding of how long delays, handoffs, and noisy channels affect mobile-ip performance.

Automated medical resident rotation and shift scheduling to ensure quality resident education and patient care.

PubMed

Smalley, Hannah K; Keskinocak, Pinar

2016-03-01

At academic teaching hospitals around the country, the majority of clinical care is provided by resident physicians. During their training, medical residents often rotate through various hospitals and/or medical services to maximize their education. Depending on the size of the training program, manually constructing such a rotation schedule can be cumbersome and time consuming. Further, rules governing allowable duty hours for residents have grown more restrictive in recent years (ACGME 2011), making day-to-day shift scheduling of residents more difficult (Connors et al., J Thorac Cardiovasc Surg 137:710-713, 2009; McCoy et al., May Clin Proc 86(3):192, 2011; Willis et al., J Surg Edu 66(4):216-221, 2009). These rules limit lengths of duty periods, allowable duty hours in a week, and rest periods, to name a few. In this paper, we present two integer programming models (IPs) with the goals of (1) creating feasible assignments of residents to rotations over a one-year period, and (2) constructing night and weekend call-shift schedules for the individual rotations. These models capture various duty-hour rules and constraints, provide the ability to test multiple what-if scenarios, and largely automate the process of schedule generation, solving these scheduling problems more effectively and efficiently compared to manual methods. Applying our models on data from a surgical residency program, we highlight the infeasibilities created by increased duty-hour restrictions placed on residents in conjunction with current scheduling paradigms.

Mixed Integer Linear Programming model for Crude Palm Oil Supply Chain Planning

NASA Astrophysics Data System (ADS)

Sembiring, Pasukat; Mawengkang, Herman; Sadyadharma, Hendaru; Bu'ulolo, F.; Fajriana

2018-01-01

The production process of crude palm oil (CPO) can be defined as the milling process of raw materials, called fresh fruit bunch (FFB) into end products palm oil. The process usually through a series of steps producing and consuming intermediate products. The CPO milling industry considered in this paper does not have oil palm plantation, therefore the FFB are supplied by several public oil palm plantations. Due to the limited availability of FFB, then it is necessary to choose from which plantations would be appropriate. This paper proposes a mixed integer linear programming model the supply chain integrated problem, which include waste processing. The mathematical programming model is solved using neighborhood search approach.

77 FR 74678 - Chemical Security Assessment Tool (CSAT)

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-17

...), National Protection and Programs Directorate (NPPD), Office of Infrastructure Protection (IP.../IP/ISCD Chemical Facility Anti-Terrorism Standards Program Manager, 245 Murray Lane SW., Mail Stop... should be appropriately marked and submitted by mail to the DHS/NPPD/IP/ISCD Chemical Facility Anti...

BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs

DOE PAGES

Barnett, Jason; Watson, Jean -Paul; Woodruff, David L.

2016-11-27

Progressive hedging, though an effective heuristic for solving stochastic mixed integer programs (SMIPs), is not guaranteed to converge in this case. Here, we describe BBPH, a branch and bound algorithm that uses PH at each node in the search tree such that, given sufficient time, it will always converge to a globally optimal solution. Additionally, to providing a theoretically convergent “wrapper” for PH applied to SMIPs, computational results demonstrate that for some difficult problem instances branch and bound can find improved solutions after exploring only a few nodes.

An Integer Programming Model for the Management of a Forest in the North of Portugal

NASA Astrophysics Data System (ADS)

Cerveira, Adelaide; Fonseca, Teresa; Mota, Artur; Martins, Isabel

2011-09-01

This study aims to develop an approach for the management of a forest of maritime pine located in the north region of Portugal. The forest is classified into five public lands, the so-called baldios, extending over 4432 ha. These baldios are co-managed by the Official Forest Services and the local communities mainly for timber production purposes. The forest planning involves non-spatial and spatial constraints. Spatial constraints dictate a maximum clearcut area and an exclusion time. An integer programming model is presented and the computational results are discussed.

Application of Mobile-ip to Space and Aeronautical Networks

NASA Technical Reports Server (NTRS)

Leung, Kent; Shell, Dan; Ivancic, William D.; Stewart, David H.; Bell, Terry L.; Kachmar, Brian A.

2001-01-01

The National Aeronautics and Space Administration (NASA) is interested in applying mobile Internet protocol (mobile-ip) technologies to its space and aeronautics programs. In particular, mobile-ip will play a major role in the Advanced Aeronautic Transportation Technology (AAT-F), the Weather Information Communication (WINCOMM), and the Small Aircraft Transportation System (SATS) aeronautics programs. This paper describes mobile-ip and mobile routers--in particular, the features, capabilities, and initial performance of the mobile router are presented. The application of mobile-router technology to NASA's space and aeronautics programs is also discussed.

78 FR 29375 - Protected Critical Infrastructure Information (PCII) Office Self-Assessment Questionnaire

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-20

...), Office of Infrastructure Protection (IP), Infrastructure Information Collection Division (IICD... Forrest DHS/NPPD/IP/PCII, [email protected] . SUPPLEMENTARY INFORMATION: The PCII Program was... administered by DHS/ NPPD/IP/IICD. The PCII Program is responsible for ensuring compliance with the Regulation...

Solving the water jugs problem by an integer sequence approach

NASA Astrophysics Data System (ADS)

Man, Yiu-Kwong

2012-01-01

In this article, we present an integer sequence approach to solve the classic water jugs problem. The solution steps can be obtained easily by additions and subtractions only, which is suitable for manual calculation or programming by computer. This approach can be introduced to secondary and undergraduate students, and also to teachers and lecturers involved in teaching mathematical problem solving, recreational mathematics, or elementary number theory.

New Approaches for Very Large-Scale Integer Programming

DTIC Science & Technology

2016-06-24

existing algorithms. This research has been presented at several conferences and has and will appear in archival journals. 15. SUBJECT TERMS integer...This research has been presented at several conferences and has and will appear in archival journals. Distribution Statement This is block 12 on the...pdf Upload a Report Document, if any. The maximum file size for the Report Document is 50MB. Archival Publications (published) during reporting

The effectiveness of augmented versus standard individual placement and support programs in terms of employment: a systematic literature review.

PubMed

Dewa, Carolyn S; Loong, Desmond; Trojanowski, Lucy; Bonato, Sarah

2018-04-01

The Individual Placement and Support (IPS) program is a well-studied vocational rehabilitation program. Although it is more effective than usual care, it is not effective for everyone. This offers an opportunity for program improvement. This systematic literature review examines the state of knowledge regarding the effectiveness of augmented versus standard IPS for people with severe mental illness (SMI). We address the questions, "What IPS augmentations have been tested?" and "What is the evidence for the effectiveness of augmented IPS versus standard IPS in terms of employment?" This systematic literature review used publically available peer-reviewed studies published between January 2002 and January 2016 in either: (1) Medline Current, (2) Medline In-process, (3) PsycINFO, (4) Econlit or (5) Web of Science. 5718 unique citations were identified; seven articles from five studies were included. Of these studies, four were rated as having moderate risk of bias and one as having high risk. The results suggest that augmentations of IPS focusing on cognitive and psychosocial skills training, may have additional effects to standard IPS. Areas in need of further research related to the process and targeting of those interventions are discussed.

77 FR 68795 - Protected Critical Infrastructure Information (PCII) Office Self-Assessment Questionnaire

Federal Register 2010, 2011, 2012, 2013, 2014

2012-11-16

...), Office of Infrastructure Protection (IP), Infrastructure Information Collection Division (IICD... forwarded to DHS/NPPD/IP/IICD, 245 Murray Lane, SW., Mail Stop 0602, Arlington,VA 20598-0602. Emailed.../IP PCII Program to assess state and local programs, their compliance with PCII rules and requirements...

77 FR 74677 - Chemical Facility Anti-Terrorism Standards (CFATS)

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-17

... Protection (IP), Infrastructure Security Compliance Division (ISCD) will submit the following Information... should be forwarded to DHS/NPPD/IP/ISCD CFATS Program Manager, 245 Murray Lane SW., Mail Stop 0610... should be appropriately marked and submitted by mail to the DHS/NPPD/IP/ISCD CFATS Program Manager, 245...

Understanding the Relationship Between Female Sex Workers and Their Intimate Partners: Lessons and Initial Findings From Participatory Research in North Karnataka, South India.

PubMed

Bhattacharjee, Parinita; Campbell, Linda; Thalinja, Raghavendra; Nair, Sapna; Doddamane, Mahesh; Ramanaik, Satyanarayana; Isac, Shajy; Beattie, Tara S

2018-04-01

While traditional HIV prevention programs with female sex workers (FSWs) in Karnataka, India, have focused on reducing HIV transmission between FSWs and clients through increased condom use, these programs have not fully addressed the transmission risk between FSWs and their nonpaying intimate partners (IPs). Condom use is infrequent and violence is recurrent in these relationships: Furthermore, there is little evidence on the precise nature of FSW-IP relationships. Our study addresses this knowledge gap to inform HIV programs targeted at FSWs. A series of workshops, using participatory tools, was held to explore FSW-IP relationships; 31 FSWs and 37 IPs participated. Three aspects of FSW-IP relationships were examined: how FSWs and IPs understand and interpret their relationships, factors influencing condom use, and the role of violence and its consequences. FSWs wish to be perceived as their IPs' wives, while IPs expect their FSW partners to accept their dominance in the relationship. Nonuse of condoms signals fidelity and elevates the status of the relationship almost to that of marriage, which helps FSWs enter the category of "good" (married) women. Tolerating and accepting violence in these relationships is normative, as in other marital relationships; IPs justify violence as necessary to establish and maintain their power within the relationship. Both FSWs and IPs value their relationships despite the high degree of risk posed by low condom use and high levels of violence. Implications for program design include addressing current norms around masculinity and gender roles, and improving communication within relationships.

76 FR 81955 - Assessment Questionnaire-IP Sector Specific Agency Risk Self Assessment Tool (IP-SSARSAT)

Federal Register 2010, 2011, 2012, 2013, 2014

2011-12-29

... DEPARTMENT OF HOMELAND SECURITY [Docket No. DHS-2011-0069] Assessment Questionnaire--IP Sector Specific Agency Risk Self Assessment Tool (IP-SSARSAT) AGENCY: National Protection and Programs Directorate...), Office of Infrastructure Protection (IP), Sector Specific Agency Executive Management Office (SSA EMO...

78 FR 29759 - Chemical Facility Anti-Terrorism Standards Personnel Surety Program

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-21

...), National Protection and Programs Directorate (NPPD), Office of Infrastructure Protection (IP... requirements and submitted by mail to the DHS/NPPD/IP/ ISCD CFATS Program Manager at the Department of Homeland...

Rationale, Scenarios, and Profiles for the Application of the Internet Protocol Suite (IPS) in Space Operations

NASA Technical Reports Server (NTRS)

Benbenek, Daniel B.; Walsh, William

2010-01-01

This greenbook captures some of the current, planned and possible future uses of the Internet Protocol (IP) as part of Space Operations. It attempts to describe how the Internet Protocol is used in specific scenarios. Of primary focus is low-earth-orbit space operations, which is referred to here as the design reference mission (DRM). This is because most of the program experience drawn upon derives from this type of mission. Application profiles are provided. This includes parameter settings programs have proposed for sending IP datagrams over CCSDS links, the minimal subsets and features of the IP protocol suite and applications expected for interoperability between projects, and the configuration, operations and maintenance of these IP functions. Of special interest is capturing the lessons learned from the Constellation Program in this area, since that program included a fairly ambitious use of the Internet Protocol.

Effective Leadership and Management of an ACS Injury Prevention Program: Current Opinions and Perspectives From Where the Rubber Meets the Road.

PubMed

Wolfe, Elizabeth S; Bryant, Elizabeth A

The American College of Surgeons (ACS) mandates that each verified trauma center must have an injury prevention coordinator (IPC); however, Chapter 18 in the Resources for Optimal Care of the Injured Patient (2014) provides minimal information on how to effectively lead or manage an injury prevention (IP) program. This opinion article addresses 3 fundamental components of an effective IP program: (1) construction of an innovative vision of IP programming using current technology; (2) intentional investment and involvement; and (3) stakeholder leadership, engagement, and sustainability. This article also provides leadership and management methods from other professions both within and outside of the health care field that can be translated into sustainable IP program planning, implementation, and longevity.

Integer programming of cement distribution by train

NASA Astrophysics Data System (ADS)

Indarsih

2018-01-01

Cement industry in Central Java distributes cement by train to meet daily demand in Yogyakarta and Central Java area. There are five destination stations. For each destination station, there is a warehouse to load cements. Decision maker of cement industry have a plan to redesign the infrastructure and transportation system. The aim is to determine how many locomotives, train wagons, and containers and how to arrange train schedules with subject to the delivery time. For this purposes, we consider an integer programming to minimize the total of operational cost. Further, we will discuss a case study and the solution the problem can be calculated by LINGO software.

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs

DOE PAGES

Gade, Dinakar; Hackebeil, Gabriel; Ryan, Sarah M.; ...

2016-04-02

We present a method for computing lower bounds in the progressive hedging algorithm (PHA) for two-stage and multi-stage stochastic mixed-integer programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated during execution of the standard PHA. In conclusion, we report computational results on stochastic unit commitment and stochastic server location problem instances, and explore the relationship between key PHA parameters and the quality of the resulting lower bounds.

An integer programming model for distal humerus fracture fixation planning.

PubMed

Maratt, Joseph D; Peaks, Ya-Sin A; Doro, Lisa Case; Karunakar, Madhav A; Hughes, Richard E

2008-05-01

To demonstrate the feasibility of an integer programming model to assist in pre-operative planning for open reduction and internal fixation of a distal humerus fracture. We describe an integer programming model based on the objective of maximizing the reward for screws placed while satisfying the requirements for sound internal fixation. The model maximizes the number of bicortical screws placed while avoiding screw collision and favoring screws of greater length that cross multiple fracture planes. The model was tested on three types of total articular fractures of the distal humerus. Solutions were generated using 5, 9, 21 and 33 possible screw orientations per hole. Solutions generated using 33 possible screw orientations per hole and five screw lengths resulted in the most clinically relevant fixation plan and required the calculation of 1,191,975 pairs of screws that resulted in collision. At this level of complexity, the pre-processor took 104 seconds to generate the constraints for the solver, and a solution was generated in under one minute in all three cases. Despite the large size of this problem, it can be solved in a reasonable amount of time, making use of the model practical in pre-surgical planning.

Mixed-Integer Conic Linear Programming: Challenges and Perspectives

DTIC Science & Technology

2013-10-01

The novel DCCs for MISOCO may be used in branch- and-cut algorithms when solving MISOCO problems. The experimental software CICLO was developed to...perform limited, but rigorous computational experiments. The CICLO solver utilizes continuous SOCO solvers, MOSEK, CPLES or SeDuMi, builds on the open...submitted Fall 2013. Software: 1. CICLO : Integer conic linear optimization package. Authors: J.C. Góez, T.K. Ralphs, Y. Fu, and T. Terlaky

75 FR 18850 - National Protection and Programs Directorate; Chemical Facility Anti-Terrorism Standards...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-13

... Programs Directorate (NPPD), Office of Infrastructure Protection (IP), Infrastructure Security Compliance... submitted by mail to the DHS/NPPD/ IP/ISCD CFATS Program Manager at the Department of Homeland Security, 245...

Genome wide approaches to identify protein-DNA interactions.

PubMed

Ma, Tao; Ye, Zhenqing; Wang, Liguo

2018-05-29

Transcription factors are DNA-binding proteins that play key roles in many fundamental biological processes. Unraveling their interactions with DNA is essential to identify their target genes and understand the regulatory network. Genome-wide identification of their binding sites became feasible thanks to recent progress in experimental and computational approaches. ChIP-chip, ChIP-seq, and ChIP-exo are three widely used techniques to demarcate genome-wide transcription factor binding sites. This review aims to provide an overview of these three techniques including their experiment procedures, computational approaches, and popular analytic tools. ChIP-chip, ChIP-seq, and ChIP-exo have been the major techniques to study genome-wide in vivo protein-DNA interaction. Due to the rapid development of next-generation sequencing technology, array-based ChIP-chip is deprecated and ChIP-seq has become the most widely used technique to identify transcription factor binding sites in genome-wide. The newly developed ChIP-exo further improves the spatial resolution to single nucleotide. Numerous tools have been developed to analyze ChIP-chip, ChIP-seq and ChIP-exo data. However, different programs may employ different mechanisms or underlying algorithms thus each will inherently include its own set of statistical assumption and bias. So choosing the most appropriate analytic program for a given experiment needs careful considerations. Moreover, most programs only have command line interface so their installation and usage will require basic computation expertise in Unix/Linux. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

Mixed Integer Programming Model and Incremental Optimization for Delivery and Storage Planning Using Truck Terminals

NASA Astrophysics Data System (ADS)

Sakakibara, Kazutoshi; Tian, Yajie; Nishikawa, Ikuko

We discuss the planning of transportation by trucks over a multi-day period. Each truck collects loads from suppliers and delivers them to assembly plants or a truck terminal. By exploiting the truck terminal as a temporal storage, we aim to increase the load ratio of each truck and to minimize the lead time for transportation. In this paper, we show a mixed integer programming model which represents each product explicitly, and discuss the decomposition of the problem into a problem of delivery and storage, and a problem of vehicle routing. Based on this model, we propose a relax-and-fix type heuristic in which decision variables are fixed one by one by mathematical programming techniques such as branch-and-bound methods.

A chance-constrained stochastic approach to intermodal container routing problems.

PubMed

Zhao, Yi; Liu, Ronghui; Zhang, Xi; Whiteing, Anthony

2018-01-01

We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost.

A chance-constrained stochastic approach to intermodal container routing problems

PubMed Central

Zhao, Yi; Zhang, Xi; Whiteing, Anthony

2018-01-01

We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost. PMID:29438389

Edit distance for marked point processes revisited: An implementation by binary integer programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hirata, Yoshito; Aihara, Kazuyuki

2015-12-15

We implement the edit distance for marked point processes [Suzuki et al., Int. J. Bifurcation Chaos 20, 3699–3708 (2010)] as a binary integer program. Compared with the previous implementation using minimum cost perfect matching, the proposed implementation has two advantages: first, by using the proposed implementation, we can apply a wide variety of software and hardware, even spin glasses and coherent ising machines, to calculate the edit distance for marked point processes; second, the proposed implementation runs faster than the previous implementation when the difference between the numbers of events in two time windows for a marked point process ismore » large.« less

SSP: an interval integer linear programming for de novo transcriptome assembly and isoform discovery of RNA-seq reads.

PubMed

Safikhani, Zhaleh; Sadeghi, Mehdi; Pezeshk, Hamid; Eslahchi, Changiz

2013-01-01

Recent advances in the sequencing technologies have provided a handful of RNA-seq datasets for transcriptome analysis. However, reconstruction of full-length isoforms and estimation of the expression level of transcripts with a low cost are challenging tasks. We propose a novel de novo method named SSP that incorporates interval integer linear programming to resolve alternatively spliced isoforms and reconstruct the whole transcriptome from short reads. Experimental results show that SSP is fast and precise in determining different alternatively spliced isoforms along with the estimation of reconstructed transcript abundances. The SSP software package is available at http://www.bioinf.cs.ipm.ir/software/ssp. © 2013.

A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems.

PubMed

Abouelseoud, Gehan; Abouelseoud, Yasmine; Shoukry, Amin; Ismail, Nour; Mekky, Jaidaa

2018-02-01

Electrical stimulation optimization is a challenging problem. Even when a single region is targeted for excitation, the problem remains a constrained multi-objective optimization problem. The constrained nature of the problem results from safety concerns while its multi-objectives originate from the requirement that non-targeted regions should remain unaffected. In this paper, we propose a mixed integer linear programming formulation that can successfully address the challenges facing this problem. Moreover, the proposed framework can conclusively check the feasibility of the stimulation goals. This helps researchers to avoid wasting time trying to achieve goals that are impossible under a chosen stimulation setup. The superiority of the proposed framework over alternative methods is demonstrated through simulation examples.

Integer Linear Programming in Computational Biology

NASA Astrophysics Data System (ADS)

Althaus, Ernst; Klau, Gunnar W.; Kohlbacher, Oliver; Lenhof, Hans-Peter; Reinert, Knut

Computational molecular biology (bioinformatics) is a young research field that is rich in NP-hard optimization problems. The problem instances encountered are often huge and comprise thousands of variables. Since their introduction into the field of bioinformatics in 1997, integer linear programming (ILP) techniques have been successfully applied to many optimization problems. These approaches have added much momentum to development and progress in related areas. In particular, ILP-based approaches have become a standard optimization technique in bioinformatics. In this review, we present applications of ILP-based techniques developed by members and former members of Kurt Mehlhorn’s group. These techniques were introduced to bioinformatics in a series of papers and popularized by demonstration of their effectiveness and potential.

Integer programming applications: Bond trading, mortgage backed security financing, and FASB 115 accounting

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nauss, R.

1994-12-31

In this review we describe three integer programming applications involving fixed income securities. A bond trading model is presented that features a number of possible different objectives and collections of constraints including future interest rate scenarios. A mortgage backed security (MBS) financing model that accounts for potential defaults in the MBS is also presented. Finally we describe an approach to allocate collections of bank securities into three categories: hold to maturity, available for sale, or trading. Placement of securities in these categories affects the capital, net income, and liquidity of a bank according to new accounting rules promulgated by themore » Financial Accounting Standards Board.« less

76 FR 17934 - Infrastructure Protection Data Call

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-31

...), National Protection and Programs Directorate (NPPD), Office of Infrastructure Protection (IP), will submit... Collection Request should be forwarded to DHS/NPPD/IP, 245 Murray Lane, SW., Mail Stop 0602, Arlington, VA..., this responsibility is managed by IP within NPPD. Beginning in Fiscal Year 2006, IP engaged in the...

Intelligent Tutoring for Programming Tasks: Using Plan Analysis to Generate Better Hints.

DTIC Science & Technology

1982-03-01

construction and execution of a BASIC proqram that assiqns an integer value to a variable and then prints the value of that integer. - ARTICHOKE : assign...the string " ARTICHOKE " to a string variable, assiqn the value of that variable to a second variable, and print the second variable. -SINOP: qet two...the first five tasks: GREENFLAG, ARTICHOKE , SINOP, NINOP, and TWOS. Because the protocols are very lonq, it was necessary to condense them into a

Determining the Surface-to-Air Missile Requirement for Western and Southern Part of the Turkish Air Defense System

DTIC Science & Technology

2008-03-01

been shown to yield success in such applications as well. ( Daskin ,1995). LP optimization, matrix row reduction, a combination of both, or cutting...integer solution (Current, 2002). If the LP relaxation of the SCLP results in a fractional solution, Current, Daskin , and Schilling (2002) recommend...coverage for a given number of SAM sites. The model is formulated as an integer program, and the LINGO 10 software package is used to solve the model

Aerospace applications of integer and combinatorial optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in solving combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on a large space structure and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Results of the Clarus Regional Demonstrations : Evaluation of Enhanced Road Weather Forecasting

DOT National Transportation Integrated Search

2012-01-01

The Clarus Initiative is a research effort of the U.S. Department of Transportation Intelligent Transportation Systems Joint Program Office and the Federal Highway Administrations Road Weather Management Program to develop and demonstrate an integ...

Determining on-fault earthquake magnitude distributions from integer programming

NASA Astrophysics Data System (ADS)

Geist, Eric L.; Parsons, Tom

2018-02-01

Earthquake magnitude distributions among faults within a fault system are determined from regional seismicity and fault slip rates using binary integer programming. A synthetic earthquake catalog (i.e., list of randomly sampled magnitudes) that spans millennia is first formed, assuming that regional seismicity follows a Gutenberg-Richter relation. Each earthquake in the synthetic catalog can occur on any fault and at any location. The objective is to minimize misfits in the target slip rate for each fault, where slip for each earthquake is scaled from its magnitude. The decision vector consists of binary variables indicating which locations are optimal among all possibilities. Uncertainty estimates in fault slip rates provide explicit upper and lower bounding constraints to the problem. An implicit constraint is that an earthquake can only be located on a fault if it is long enough to contain that earthquake. A general mixed-integer programming solver, consisting of a number of different algorithms, is used to determine the optimal decision vector. A case study is presented for the State of California, where a 4 kyr synthetic earthquake catalog is created and faults with slip ≥3 mm/yr are considered, resulting in >106 variables. The optimal magnitude distributions for each of the faults in the system span a rich diversity of shapes, ranging from characteristic to power-law distributions.

Cost-effectiveness of two vocational rehabilitation programs for persons with severe mental illness.

PubMed

Dixon, Lisa; Hoch, Jeffrey S; Clark, Robin; Bebout, Richard; Drake, Robert; McHugo, Greg; Becker, Deborah

2002-09-01

This study sought to determine differences in the cost-effectiveness of two vocational programs: individual placement and support (IPS), in which employment specialists within a mental health center help patients obtain competitive jobs and provide them with ongoing support, and enhanced vocational rehabilitation (EVR), in which stepwise services that involve prevocational experiences are delivered by rehabilitation agencies. A total of 150 unemployed inner-city patients with severe mental disorders who expressed an interest in competitive employment were randomly assigned to IPS or EVR programs and were followed for 18 months. Wages from all forms of employment and the number of weeks and hours of competitive employment were tracked monthly. Estimates were made of direct mental health costs and vocational costs. Incremental cost-effectiveness ratios (ICERs) were calculated for competitive employment outcomes and total wages. No statistically significant differences were found in the overall costs of IPS and EVR. Participation in the IPS program was associated with significantly more hours and weeks of competitive employment. However, the average combined earnings-earnings from competitive and noncompetitive employment-were virtually the same both programs. The ICER estimates indicated that participants in the IPS program worked in competitive employment settings for an additional week over the 18-month period at a cost of $283 ($13 an hour). The analyses suggest that IPS participants engaged in competitive employment at a higher cost. When combined earnings were used as the outcome, data from the statistical analyses were insufficient to enable any firm conclusions to be drawn. The findings illustrate the importance of choice of outcomes in evaluations of employment programs.

Operations research applications in nuclear energy

NASA Astrophysics Data System (ADS)

Johnson, Benjamin Lloyd

This dissertation consists of three papers; the first is published in Annals of Operations Research, the second is nearing submission to INFORMS Journal on Computing, and the third is the predecessor of a paper nearing submission to Progress in Nuclear Energy. We apply operations research techniques to nuclear waste disposal and nuclear safeguards. Although these fields are different, they allow us to showcase some benefits of using operations research techniques to enhance nuclear energy applications. The first paper, "Optimizing High-Level Nuclear Waste Disposal within a Deep Geologic Repository," presents a mixed-integer programming model that determines where to place high-level nuclear waste packages in a deep geologic repository to minimize heat load concentration. We develop a heuristic that increases the size of solvable model instances. The second paper, "Optimally Configuring a Measurement System to Detect Diversions from a Nuclear Fuel Cycle," introduces a simulation-optimization algorithm and an integer-programming model to find the best, or near-best, resource-limited nuclear fuel cycle measurement system with a high degree of confidence. Given location-dependent measurement method precisions, we (i) optimize the configuration of n methods at n locations of a hypothetical nuclear fuel cycle facility, (ii) find the most important location at which to improve method precision, and (iii) determine the effect of measurement frequency on near-optimal configurations and objective values. Our results correspond to existing outcomes but we obtain them at least an order of magnitude faster. The third paper, "Optimizing Nuclear Material Control and Accountability Measurement Systems," extends the integer program from the second paper to locate measurement methods in a larger, hypothetical nuclear fuel cycle scenario given fixed purchase and utilization budgets. This paper also presents two mixed-integer quadratic programming models to increase the precision of existing methods given a fixed improvement budget and to reduce the measurement uncertainty in the system while limiting improvement costs. We quickly obtain similar or better solutions compared to several intuitive analyses that take much longer to perform.

Investigating Integer Restrictions in Linear Programming

ERIC Educational Resources Information Center

Edwards, Thomas G.; Chelst, Kenneth R.; Principato, Angela M.; Wilhelm, Thad L.

2015-01-01

Linear programming (LP) is an application of graphing linear systems that appears in many Algebra 2 textbooks. Although not explicitly mentioned in the Common Core State Standards for Mathematics, linear programming blends seamlessly into modeling with mathematics, the fourth Standard for Mathematical Practice (CCSSI 2010, p. 7). In solving a…

The Retrofit Puzzle Extended: Optimal Fleet Owner Behavior over Multiple Time Periods

DOT National Transportation Integrated Search

2009-08-04

In "The Retrofit Puzzle: Optimal Fleet Owner Behavior in the Context of Diesel Retrofit Incentive Programs" (1) an integer program was developed to model profit-maximizing diesel fleet owner behavior when selecting pollution reduction retrofits. Flee...

TCP/IP Interface for the Satellite Orbit Analysis Program (SOAP)

NASA Technical Reports Server (NTRS)

Carnright, Robert; Stodden, David; Coggi, John

2009-01-01

The Transmission Control Protocol/ Internet protocol (TCP/IP) interface for the Satellite Orbit Analysis Program (SOAP) provides the means for the software to establish real-time interfaces with other software. Such interfaces can operate between two programs, either on the same computer or on different computers joined by a network. The SOAP TCP/IP module employs a client/server interface where SOAP is the server and other applications can be clients. Real-time interfaces between software offer a number of advantages over embedding all of the common functionality within a single program. One advantage is that they allow each program to divide the computation labor between processors or computers running the separate applications. Secondly, each program can be allowed to provide its own expertise domain with other programs able to use this expertise.

47 CFR 64.606 - Internet-based TRS provider and TRS program certification.

Code of Federal Regulations, 2011 CFR

2011-10-01

... of Internet-based TRS to be provided (i.e., VRS, IP Relay, and/or IP captioned telephone relay... IP Relay providers certified under this section must notify the Commission of substantive changes in...

NEWTONP - CUMULATIVE BINOMIAL PROGRAMS

NASA Technical Reports Server (NTRS)

Bowerman, P. N.

1994-01-01

The cumulative binomial program, NEWTONP, is one of a set of three programs which calculate cumulative binomial probability distributions for arbitrary inputs. The three programs, NEWTONP, CUMBIN (NPO-17555), and CROSSER (NPO-17557), can be used independently of one another. NEWTONP can be used by statisticians and users of statistical procedures, test planners, designers, and numerical analysts. The program has been used for reliability/availability calculations. NEWTONP calculates the probably p required to yield a given system reliability V for a k-out-of-n system. It can also be used to determine the Clopper-Pearson confidence limits (either one-sided or two-sided) for the parameter p of a Bernoulli distribution. NEWTONP can determine Bayesian probability limits for a proportion (if the beta prior has positive integer parameters). It can determine the percentiles of incomplete beta distributions with positive integer parameters. It can also determine the percentiles of F distributions and the midian plotting positions in probability plotting. NEWTONP is designed to work well with all integer values 0 < k <= n. To run the program, the user simply runs the executable version and inputs the information requested by the program. NEWTONP is not designed to weed out incorrect inputs, so the user must take care to make sure the inputs are correct. Once all input has been entered, the program calculates and lists the result. It also lists the number of iterations of Newton's method required to calculate the answer within the given error. The NEWTONP program is written in C. It was developed on an IBM AT with a numeric co-processor using Microsoft C 5.0. Because the source code is written using standard C structures and functions, it should compile correctly with most C compilers. The program format is interactive. It has been implemented under DOS 3.2 and has a memory requirement of 26K. NEWTONP was developed in 1988.

HAL/S programmer's guide. [space shuttle flight software language

NASA Technical Reports Server (NTRS)

Newbold, P. M.; Hotz, R. L.

1974-01-01

HAL/S is a programming language developed to satisfy the flight software requirements for the space shuttle program. The user's guide explains pertinent language operating procedures and described the various HAL/S facilities for manipulating integer, scalar, vector, and matrix data types.

Are you ready? Managing transportation resources through the Y2K weekend

DOT National Transportation Integrated Search

2011-01-01

The Clarus Initiative, a joint effort of the U.S. Department of Transportation Intelligent Transportation Systems (ITS) Joint Program Office and FHWAs Road Weather Management Program (RWMP), is a six-year effort to develop and demonstrate an integ...

Inexact fuzzy-stochastic mixed-integer programming approach for long-term planning of waste management--Part A: methodology.

PubMed

Guo, P; Huang, G H

2009-01-01

In this study, an inexact fuzzy chance-constrained two-stage mixed-integer linear programming (IFCTIP) approach is proposed for supporting long-term planning of waste-management systems under multiple uncertainties in the City of Regina, Canada. The method improves upon the existing inexact two-stage programming and mixed-integer linear programming techniques by incorporating uncertainties expressed as multiple uncertainties of intervals and dual probability distributions within a general optimization framework. The developed method can provide an effective linkage between the predefined environmental policies and the associated economic implications. Four special characteristics of the proposed method make it unique compared with other optimization techniques that deal with uncertainties. Firstly, it provides a linkage to predefined policies that have to be respected when a modeling effort is undertaken; secondly, it is useful for tackling uncertainties presented as intervals, probabilities, fuzzy sets and their incorporation; thirdly, it facilitates dynamic analysis for decisions of facility-expansion planning and waste-flow allocation within a multi-facility, multi-period, multi-level, and multi-option context; fourthly, the penalties are exercised with recourse against any infeasibility, which permits in-depth analyses of various policy scenarios that are associated with different levels of economic consequences when the promised solid waste-generation rates are violated. In a companion paper, the developed method is applied to a real case for the long-term planning of waste management in the City of Regina, Canada.

Randomized Trial of Supported Employment Integrated With Assertive Community Treatment for Rural Adults With Severe Mental Illness

PubMed Central

Gold, Paul B; Meisler, Neil; Santos, Alberto B; Carnemolla, Mark A; Williams, Olivia H; Keleher, Jennie

2006-01-01

Urban-based randomized clinical trials of integrated supported employment (SE) and mental health services in the United States on average have doubled the employment rates of adults with severe mental illness (SMI) compared to traditional vocational rehabilitation. However, studies have not yet explored if the service integrative functions of SE will be effective in coordinating rural-based services that are limited, loosely linked, and geographically dispersed. In addition, SE's ability to replicate the work outcomes of urban programs in rural economies with scarce and less diverse job opportunities remains unknown. In a rural South Carolina county, we designed and implemented a program blending Assertive Community Treatment (ACT) with an SE model, Individual Placement and Support (IPS). The ACT-IPS program operated with ACT and IPS subteams that tightly integrated vocational with mental health services within each self-contained team. In a 24-month randomized clinical trial, we compared ACT-IPS to a traditional program providing parallel vocational and mental health services on competitive work outcomes for adults with SMI (N = 143; 69% schizophrenia, 77% African American). More ACT-IPS participants held competitive jobs (64 versus 26%; p < .001, effect size [ES] = 0.38) and earned more income (median [Mdn] = $549, interquartile range [IQR] = $0–$5,145, versus Mdn = $0, IQR = $0–$40; p < .001, ES = 0.70) than comparison participants. The competitive work outcomes of this rural ACT-IPS program closely resemble those of urban SE programs. However, achieving economic self-sufficiently and developing careers probably require increasing access to higher education and jobs imparting marketable technical skills. PMID:16177278

76 FR 24031 - Disease, Disability, and Injury Prevention and Control Special Emphasis Panel (SEP): Initial Review

Federal Register 2010, 2011, 2012, 2013, 2014

2011-04-29

... Intervention to Promote a Targeted Vaccination program in the Obstetrician- Gynecologist Setting, FOA IP11-009... a Targeted Vaccination Program in the Obstetrician-Gynecologist Setting; FOA IP11-009, initial...

Enacting the Independent Public Schools Program in Western Australia

ERIC Educational Resources Information Center

Gobby, Brad

2013-01-01

The Independent Public Schools (IPS) program began to be implemented in some Western Australian schools in 2010. The IPS program devolves a number of responsibilities to principals and is part of the political objective of removing the constraints of the education bureaucracy by fostering school level decision-making, problem-solving and…

GLOBAL SOLUTIONS TO FOLDED CONCAVE PENALIZED NONCONVEX LEARNING

PubMed Central

Liu, Hongcheng; Yao, Tao; Li, Runze

2015-01-01

This paper is concerned with solving nonconvex learning problems with folded concave penalty. Despite that their global solutions entail desirable statistical properties, there lack optimization techniques that guarantee global optimality in a general setting. In this paper, we show that a class of nonconvex learning problems are equivalent to general quadratic programs. This equivalence facilitates us in developing mixed integer linear programming reformulations, which admit finite algorithms that find a provably global optimal solution. We refer to this reformulation-based technique as the mixed integer programming-based global optimization (MIPGO). To our knowledge, this is the first global optimization scheme with a theoretical guarantee for folded concave penalized nonconvex learning with the SCAD penalty (Fan and Li, 2001) and the MCP penalty (Zhang, 2010). Numerical results indicate a significant outperformance of MIPGO over the state-of-the-art solution scheme, local linear approximation, and other alternative solution techniques in literature in terms of solution quality. PMID:27141126

RSM 1.0 user's guide: A resupply scheduler using integer optimization

NASA Technical Reports Server (NTRS)

Viterna, Larry A.; Green, Robert D.; Reed, David M.

1991-01-01

The Resupply Scheduling Model (RSM) is a PC based, fully menu-driven computer program. It uses integer programming techniques to determine an optimum schedule to replace components on or before a fixed replacement period, subject to user defined constraints such as transportation mass and volume limits or available repair crew time. Principal input for RSJ includes properties such as mass and volume and an assembly sequence. Resource constraints are entered for each period corresponding to the component properties. Though written to analyze the electrical power system on the Space Station Freedom, RSM is quite general and can be used to model the resupply of almost any system subject to user defined resource constraints. Presented here is a step by step procedure for preparing the input, performing the analysis, and interpreting the results. Instructions for installing the program and information on the algorithms are given.

An integer programming approach to a real-world recyclable waste collection problem in Argentina.

PubMed

Braier, Gustavo; Durán, Guillermo; Marenco, Javier; Wesner, Francisco

2017-05-01

This article reports on the use of mathematical programming techniques to optimise the routes of a recyclable waste collection system servicing Morón, a large municipality outside Buenos Aires, Argentina. The truck routing problem posed by the system is a particular case of the generalised directed open rural postman problem. An integer programming model is developed with a solving procedure built around a subtour-merging algorithm and the addition of subtour elimination constraints. The route solutions generated by the proposed methodology perform significantly better than the previously used, manually designed routes, the main improvement being that coverage of blocks within the municipality with the model solutions is 100% by construction, whereas with the manual routes as much as 16% of the blocks went unserviced. The model-generated routes were adopted by the municipality in 2014 and the national government is planning to introduce the methodology elsewhere in the country.

Mixed integer nonlinear programming model of wireless pricing scheme with QoS attribute of bandwidth and end-to-end delay

NASA Astrophysics Data System (ADS)

Irmeilyana, Puspita, Fitri Maya; Indrawati

2016-02-01

The pricing for wireless networks is developed by considering linearity factors, elasticity price and price factors. Mixed Integer Nonlinear Programming of wireless pricing model is proposed as the nonlinear programming problem that can be solved optimally using LINGO 13.0. The solutions are expected to give some information about the connections between the acceptance factor and the price. Previous model worked on the model that focuses on bandwidth as the QoS attribute. The models attempt to maximize the total price for a connection based on QoS parameter. The QoS attributes used will be the bandwidth and the end to end delay that affect the traffic. The maximum goal to maximum price is achieved when the provider determine the requirement for the increment or decrement of price change due to QoS change and amount of QoS value.

Synchronizable Series Expressions. Part 2. Overview of the Theory and Implementation.

DTIC Science & Technology

1987-11-01

more running time than shown in the table. because time is eventually required in order to collect the garbage it creates. Program Running ’rime Garbage...possible to simply put an enumerator where it is used.) (loop for x integer from I to 4 collect x) - (lotS* ((x (Eup I :to 4))) (declare (type integer x...below. (loop for x from 1 to 4 and for y = 0 then (1- x) collect (list x y)) - (lotS* ((x (Eup 1 :to 4)) (y (Tprevious (1- x) 0))) (Rlist (list x y

Papers on Program Testing,

DTIC Science & Technology

1979-01-01

tractability for scientific analysis. Although much remains to be learned about mutation as a testing tool, there is a considerable body of written material...explicitly address classifications (2) may not have been affected at all! In general, the and (3) in this article , except to point out that even relative...34 ARTICLE B=B’B C IN CACM 1971). C=C*02 INTEGER AiN),N.F D=B+C INTEGER M.NS.R.I.J.W IF (A.NE.D) GOTO 200 MI PRINT 150 NS=N 150 FORMATIIH .RIGHT ANGLED

ALPS - A LINEAR PROGRAM SOLVER

NASA Technical Reports Server (NTRS)

Viterna, L. A.

1994-01-01

Linear programming is a widely-used engineering and management tool. Scheduling, resource allocation, and production planning are all well-known applications of linear programs (LP's). Most LP's are too large to be solved by hand, so over the decades many computer codes for solving LP's have been developed. ALPS, A Linear Program Solver, is a full-featured LP analysis program. ALPS can solve plain linear programs as well as more complicated mixed integer and pure integer programs. ALPS also contains an efficient solution technique for pure binary (0-1 integer) programs. One of the many weaknesses of LP solvers is the lack of interaction with the user. ALPS is a menu-driven program with no special commands or keywords to learn. In addition, ALPS contains a full-screen editor to enter and maintain the LP formulation. These formulations can be written to and read from plain ASCII files for portability. For those less experienced in LP formulation, ALPS contains a problem "parser" which checks the formulation for errors. ALPS creates fully formatted, readable reports that can be sent to a printer or output file. ALPS is written entirely in IBM's APL2/PC product, Version 1.01. The APL2 workspace containing all the ALPS code can be run on any APL2/PC system (AT or 386). On a 32-bit system, this configuration can take advantage of all extended memory. The user can also examine and modify the ALPS code. The APL2 workspace has also been "packed" to be run on any DOS system (without APL2) as a stand-alone "EXE" file, but has limited memory capacity on a 640K system. A numeric coprocessor (80X87) is optional but recommended. The standard distribution medium for ALPS is a 5.25 inch 360K MS-DOS format diskette. IBM, IBM PC and IBM APL2 are registered trademarks of International Business Machines Corporation. MS-DOS is a registered trademark of Microsoft Corporation.

The Capability Portfolio Analysis Tool (CPAT): A Mixed Integer Linear Programming Formulation for Fleet Modernization Analysis (Version 2.0.2).

DOE Office of Scientific and Technical Information (OSTI.GOV)

Waddell, Lucas; Muldoon, Frank; Henry, Stephen Michael

In order to effectively plan the management and modernization of their large and diverse fleets of vehicles, Program Executive Office Ground Combat Systems (PEO GCS) and Program Executive Office Combat Support and Combat Service Support (PEO CS&CSS) commis- sioned the development of a large-scale portfolio planning optimization tool. This software, the Capability Portfolio Analysis Tool (CPAT), creates a detailed schedule that optimally prioritizes the modernization or replacement of vehicles within the fleet - respecting numerous business rules associated with fleet structure, budgets, industrial base, research and testing, etc., while maximizing overall fleet performance through time. This paper contains a thor-more » ough documentation of the terminology, parameters, variables, and constraints that comprise the fleet management mixed integer linear programming (MILP) mathematical formulation. This paper, which is an update to the original CPAT formulation document published in 2015 (SAND2015-3487), covers the formulation of important new CPAT features.« less

An improved exploratory search technique for pure integer linear programming problems

NASA Technical Reports Server (NTRS)

Fogle, F. R.

1990-01-01

The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

Determining on-fault earthquake magnitude distributions from integer programming

USGS Publications Warehouse

Geist, Eric L.; Parsons, Thomas E.

2018-01-01

Earthquake magnitude distributions among faults within a fault system are determined from regional seismicity and fault slip rates using binary integer programming. A synthetic earthquake catalog (i.e., list of randomly sampled magnitudes) that spans millennia is first formed, assuming that regional seismicity follows a Gutenberg-Richter relation. Each earthquake in the synthetic catalog can occur on any fault and at any location. The objective is to minimize misfits in the target slip rate for each fault, where slip for each earthquake is scaled from its magnitude. The decision vector consists of binary variables indicating which locations are optimal among all possibilities. Uncertainty estimates in fault slip rates provide explicit upper and lower bounding constraints to the problem. An implicit constraint is that an earthquake can only be located on a fault if it is long enough to contain that earthquake. A general mixed-integer programming solver, consisting of a number of different algorithms, is used to determine the optimal decision vector. A case study is presented for the State of California, where a 4 kyr synthetic earthquake catalog is created and faults with slip ≥3 mm/yr are considered, resulting in >106  variables. The optimal magnitude distributions for each of the faults in the system span a rich diversity of shapes, ranging from characteristic to power-law distributions. 

Putting "The System" into a School Autonomy Reform: The Case of the Independent Public Schools Program

ERIC Educational Resources Information Center

Gobby, Brad

2016-01-01

The Australian Federal and state governments have been introducing neoliberal reforms to the governance of their education systems for a number of decades. One of the most recent programs of reform is the Western Australian Independent Public Schools (IPS) initiative. Similar to decentralizing reforms around the world, the IPS program seeks…

Multi-board kernel communication using socket programming for embedded applications

NASA Astrophysics Data System (ADS)

Mishra, Ashish; Girdhar, Neha; Krishnia, Nikita

2016-03-01

It is often seen in large application projects, there is a need to communicate between two different processors or two different kernels. The aim of this paper is to communicate between two different kernels and use efficient method to do so. The TCP/IP protocol is implemented to communicate between two boards via the Ethernet port and use lwIP (lightweight IP) stack, which is a smaller independent implementation of the TCP/IP stack suitable for use in embedded systems. While retaining TCP/IP functionality, lwIP stack reduces the use of memory and even size of the code. In this process of communication we made Raspberry pi as an active client and Field programmable gate array(FPGA) board as a passive server and they are allowed to communicate via Ethernet. Three applications based on TCP/IP client-server network communication have been implemented. The Echo server application is used to communicate between two different kernels of two different boards. Socket programming is used as it is independent of platform and programming language used. TCP transmit and receive throughput test applications are used to measure maximum throughput of the transmission of data. These applications are based on communication to an open source tool called iperf. It is used to measure the throughput transmission rate by sending or receiving some constant piece of data to the client or server according to the test application.

Selection of actuator locations for static shape control of large space structures by heuristic integer programing

NASA Technical Reports Server (NTRS)

Haftka, R. T.; Adelman, H. M.

1984-01-01

Orbiting spacecraft such as large space antennas have to maintain a highly accurate space to operate satisfactorily. Such structures require active and passive controls to mantain an accurate shape under a variety of disturbances. Methods for the optimum placement of control actuators for correcting static deformations are described. In particular, attention is focused on the case were control locations have to be selected from a large set of available sites, so that integer programing methods are called for. The effectiveness of three heuristic techniques for obtaining a near-optimal site selection is compared. In addition, efficient reanalysis techniques for the rapid assessment of control effectiveness are presented. Two examples are used to demonstrate the methods: a simple beam structure and a 55m space-truss-parabolic antenna.

Developing optimal nurses work schedule using integer programming

NASA Astrophysics Data System (ADS)

Shahidin, Ainon Mardhiyah; Said, Mohd Syazwan Md; Said, Noor Hizwan Mohamad; Sazali, Noor Izatie Amaliena

2017-08-01

Time management is the art of arranging, organizing and scheduling one's time for the purpose of generating more effective work and productivity. Scheduling is the process of deciding how to commit resources between varieties of possible tasks. Thus, it is crucial for every organization to have a good work schedule for their staffs. The job of Ward nurses at hospitals runs for 24 hours every day. Therefore, nurses will be working using shift scheduling. This study is aimed to solve the nurse scheduling problem at an emergency ward of a private hospital. A 7-day work schedule for 7 consecutive weeks satisfying all the constraints set by the hospital will be developed using Integer Programming. The work schedule for the nurses obtained gives an optimal solution where all the constraints are being satisfied successfully.

An Integer Programming Model For Solving Heterogeneous Vehicle Routing Problem With Hard Time Window considering Service Choice

NASA Astrophysics Data System (ADS)

Susilawati, Enny; Mawengkang, Herman; Efendi, Syahril

2018-01-01

Generally a Vehicle Routing Problem with time windows (VRPTW) can be defined as a problem to determine the optimal set of routes used by a fleet of vehicles to serve a given set of customers with service time restrictions; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the fleet of vehicle is heterogenic due to the different size of demand from customers. The problem, called Heterogeneous VRP (HVRP) also includes service levels. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.

A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty

NASA Astrophysics Data System (ADS)

Yin, Sisi; Nishi, Tatsushi

2014-11-01

Quantity discount policy is decision-making for trade-off prices between suppliers and manufacturers while production is changeable due to demand fluctuations in a real market. In this paper, quantity discount models which consider selection of contract suppliers, production quantity and inventory simultaneously are addressed. The supply chain planning problem with quantity discounts under demand uncertainty is formulated as a mixed-integer nonlinear programming problem (MINLP) with integral terms. We apply an outer-approximation method to solve MINLP problems. In order to improve the efficiency of the proposed method, the problem is reformulated as a stochastic model replacing the integral terms by using a normalisation technique. We present numerical examples to demonstrate the efficiency of the proposed method.

Advances in mixed-integer programming methods for chemical production scheduling.

PubMed

Velez, Sara; Maravelias, Christos T

2014-01-01

The goal of this paper is to critically review advances in the area of chemical production scheduling over the past three decades and then present two recently proposed solution methods that have led to dramatic computational enhancements. First, we present a general framework and problem classification and discuss modeling and solution methods with an emphasis on mixed-integer programming (MIP) techniques. Second, we present two solution methods: (a) a constraint propagation algorithm that allows us to compute parameters that are then used to tighten MIP scheduling models and (b) a reformulation that introduces new variables, thus leading to effective branching. We also present computational results and an example illustrating how these methods are implemented, as well as the resulting enhancements. We close with a discussion of open research challenges and future research directions.

Pediatric injury prevention programs: Identifying markers for success and sustainability.

PubMed

Chaudhary, Sofia; Pomerantz, Wendy J; Miller, Beverly; Pan, Anqi; Agarwal, Maneesha

2017-11-01

Injury is the leading cause of death in children. Although many pediatric hospitals and trauma centers provide injury prevention (IP) programming, there is no national standard. This study aims to identify characteristics of a sustainable and successful IP program by querying programs affiliated with the Injury Free Coalition for Kids (IFCK). The IFCK sites were sent a 30-question survey via e-mail. Questions focused on demographics, scope of IP activities, self-efficacy, and outcome measures including finances, academic productivity, and legislative advocacy. Counts and frequencies were calculated and compared using χ tests. The survey was completed by 38 (90.4%) of 42 sites. The majority were associated with a freestanding children's hospital (57.9%) and Level I pediatric trauma center (86.8%). Most programs (79%) had at least one dedicated full-time equivalent (FTE) staff. Research was most common on child passenger safety and teen driving. Nearly 30% of programs offered educational curricula to health care providers; these sites were more likely to have FTE support (p = 0.036). Steady sources of funding were identified for 60.5% of programs, with 47.8% citing their hospital as the primary source; 73% of respondents were confident in their program's capacity to sustain activities; these were more likely to be larger programs (p = 0.001) with steady sources of funding (p < 0.001). Despite 73.7% of sites having academic affiliations, 60.5% had 5 or fewer publications over the previous 5 years. In the prior 2 years, 55.3% of programs impacted legislative or policy changes. Funding, size of program, and FTE had no statistical correlation with research productivity or number of legislative/policy contributions. This study characterizes the variation among pediatric IP programs within IFCK sites, while highlighting the association between financial and FTE support from programs' institutions with sustainable IP programming. These results can assist programs in identifying differences in relation to their peers.

Fast-Solving Quasi-Optimal LS-S3VM Based on an Extended Candidate Set.

PubMed

Ma, Yuefeng; Liang, Xun; Kwok, James T; Li, Jianping; Zhou, Xiaoping; Zhang, Haiyan

2018-04-01

The semisupervised least squares support vector machine (LS-S 3 VM) is an important enhancement of least squares support vector machines in semisupervised learning. Given that most data collected from the real world are without labels, semisupervised approaches are more applicable than standard supervised approaches. Although a few training methods for LS-S 3 VM exist, the problem of deriving the optimal decision hyperplane efficiently and effectually has not been solved. In this paper, a fully weighted model of LS-S 3 VM is proposed, and a simple integer programming (IP) model is introduced through an equivalent transformation to solve the model. Based on the distances between the unlabeled data and the decision hyperplane, a new indicator is designed to represent the possibility that the label of an unlabeled datum should be reversed in each iteration during training. Using the indicator, we construct an extended candidate set consisting of the indices of unlabeled data with high possibilities, which integrates more information from unlabeled data. Our algorithm is degenerated into a special scenario of the previous algorithm when the extended candidate set is reduced into a set with only one element. Two strategies are utilized to determine the descent directions based on the extended candidate set. Furthermore, we developed a novel method for locating a good starting point based on the properties of the equivalent IP model. Combined with the extended candidate set and the carefully computed starting point, a fast algorithm to solve LS-S 3 VM quasi-optimally is proposed. The choice of quasi-optimal solutions results in low computational cost and avoidance of overfitting. Experiments show that our algorithm equipped with the two designed strategies is more effective than other algorithms in at least one of the following three aspects: 1) computational complexity; 2) generalization ability; and 3) flexibility. However, our algorithm and other algorithms have similar levels of performance in the remaining aspects.

76 FR 17935 - Protected Critical Infrastructure Information (PCII) Stakeholder Survey

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-31

... Infrastructure Protection (IP) will submit the following Information Collection Request to the Office of... questions about this Information Collection Request should be forwarded to DHS/NPPD/IP, Attn: Emily R... PCII Program is administered by IP's Infrastructure Information Collection Division (IICD). The PCII...

A divide-and-conquer approach to determine the Pareto frontier for optimization of protein engineering experiments.

PubMed

He, Lu; Friedman, Alan M; Bailey-Kellogg, Chris

2012-03-01

In developing improved protein variants by site-directed mutagenesis or recombination, there are often competing objectives that must be considered in designing an experiment (selecting mutations or breakpoints): stability versus novelty, affinity versus specificity, activity versus immunogenicity, and so forth. Pareto optimal experimental designs make the best trade-offs between competing objectives. Such designs are not "dominated"; that is, no other design is better than a Pareto optimal design for one objective without being worse for another objective. Our goal is to produce all the Pareto optimal designs (the Pareto frontier), to characterize the trade-offs and suggest designs most worth considering, but to avoid explicitly considering the large number of dominated designs. To do so, we develop a divide-and-conquer algorithm, Protein Engineering Pareto FRontier (PEPFR), that hierarchically subdivides the objective space, using appropriate dynamic programming or integer programming methods to optimize designs in different regions. This divide-and-conquer approach is efficient in that the number of divisions (and thus calls to the optimizer) is directly proportional to the number of Pareto optimal designs. We demonstrate PEPFR with three protein engineering case studies: site-directed recombination for stability and diversity via dynamic programming, site-directed mutagenesis of interacting proteins for affinity and specificity via integer programming, and site-directed mutagenesis of a therapeutic protein for activity and immunogenicity via integer programming. We show that PEPFR is able to effectively produce all the Pareto optimal designs, discovering many more designs than previous methods. The characterization of the Pareto frontier provides additional insights into the local stability of design choices as well as global trends leading to trade-offs between competing criteria. Copyright © 2011 Wiley Periodicals, Inc.

Integer Optimization Model for a Logistic System based on Location-Routing Considering Distance and Chosen Route

NASA Astrophysics Data System (ADS)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

In a distribution network it is important to decide the locations of facilities that impacts not only the profitability of an organization but the ability to serve customers.Generally the location-routing problem is to minimize the overall cost by simultaneously selecting a subset of candidate facilities and constructing a set of delivery routes that satisfy some restrictions. In this paper we impose restriction on the route that should be passed for delivery. We use integer programming model to describe the problem. A feasible neighbourhood search is proposed to solve the result model.

A new Fortran 90 program to compute regular and irregular associated Legendre functions (new version announcement)

NASA Astrophysics Data System (ADS)

Schneider, Barry I.; Segura, Javier; Gil, Amparo; Guan, Xiaoxu; Bartschat, Klaus

2018-04-01

This is a revised and updated version of a modern Fortran 90 code to compute the regular Plm (x) and irregular Qlm (x) associated Legendre functions for all x ∈(- 1 , + 1) (on the cut) and | x | > 1 and integer degree (l) and order (m). The necessity to revise the code comes as a consequence of some comments of Prof. James Bremer of the UC//Davis Mathematics Department, who discovered that there were errors in the code for large integer degree and order for the normalized regular Legendre functions on the cut.

Modeling an integrated hospital management planning problem using integer optimization approach

NASA Astrophysics Data System (ADS)

Sitepu, Suryati; Mawengkang, Herman; Irvan

2017-09-01

Hospital is a very important institution to provide health care for people. It is not surprising that nowadays the people’s demands for hospital is increasing. However, due to the rising cost of healthcare services, hospitals need to consider efficiencies in order to overcome these two problems. This paper deals with an integrated strategy of staff capacity management and bed allocation planning to tackle these problems. Mathematically, the strategy can be modeled as an integer linear programming problem. We solve the model using a direct neighborhood search approach, based on the notion of superbasic variables.

76 FR 59963 - Closed Captioning of Internet Protocol-Delivered Video Programming: Implementation of the Twenty...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-28

...In this document, the Commission proposes rules to implement provisions of the Twenty-First Century Communications and Video Accessibility Act of 2010 (``CVAA'') that mandate rules for closed captioning of certain video programming delivered using Internet protocol (``IP''). The Commission seeks comment on rules that would apply to the distributors, providers, and owners of IP-delivered video programming, as well as the devices that display such programming.

Recent research in network problems with applications

NASA Technical Reports Server (NTRS)

Thompson, G. L.

1980-01-01

The capabilities of network codes and their extensions are surveyed in regard to specially structured integer programming problems which are solved by using the solutions of a series of ordinary network problems.

76 FR 17933 - Infrastructure Protection Data Call Survey

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-31

... Survey AGENCY: National Protection and Programs Directorate, DHS. ACTION: 60-Day Notice and request for... mission, IP requests opinions and information in a survey from IP Data Call participants regarding the IP Data Call process and the web-based application used to collect the CIKR data. The survey data...

75 FR 67989 - Agency Information Collection Activities: Office of Infrastructure Protection; Infrastructure...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-11-04

..., National Protection and Programs Directorate, Office of Infrastructure Protection (IP), will submit the... manner.'' DHS designated IP to lead these efforts. Given that the vast majority of the Nation's critical infrastructure and key resources in most sectors are privately owned or controlled, IP's success in achieving the...

75 FR 13775 - Agency Information Collection Activities: Proposed Collection; Comment Request, 1660-NEW...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-23

... Security Exercise and Evaluation Program (HSEEP) After Action Report (AAR) Improvement Plan (IP) AGENCY... (HSEEP) After Action Report (AAR) Improvement Plan (IP). SUMMARY: The Federal Emergency Management Agency... (HSEEP) After Action Report (AAR) Improvement Plan (IP). DATES: Comments must be submitted on or before...

78 FR 60301 - Agency Information Collection Activities: Proposed Collection; Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-01

... Evaluation Program (HSEEP) After Action Report (AAR) Improvement Plan (IP). DATES: Comments must be submitted...) Improvement Plan (IP) provides a standardized method for reporting the results of preparedness exercises and identifying, correcting and sharing as appropriate strengths and areas for improvement. Thus, the HSEEP AAR/IP...

Developing an Interventional Pulmonary Service in a Community-Based Private Practice: A Case Study.

PubMed

French, Kim D; Desai, Neeraj R; Diamond, Edward; Kovitz, Kevin L

2016-04-01

Interventional pulmonology (IP) is a field that uses minimally invasive techniques to diagnose, treat, and palliate advanced lung disease. Technology, formal training, and reimbursement for IP procedures have been slow to catch up with other interventional subspecialty areas. A byproduct of this pattern has been limited IP integration in private practice settings. We describe the key aspects and programmatic challenges of building an IP program in a community-based setting. A philosophical and financial buy-in by stakeholders and a regionalization of services, within and external to a larger practice, are crucial to success. Our experience demonstrates that a successful launch of an IP program increases overall visits as well as procedural volume without cannibalizing existing practice volume. We hope this might encourage others to provide this valuable service to their own communities. Copyright © 2016 American College of Chest Physicians. Published by Elsevier Inc. All rights reserved.

Integer programming model for optimizing bus timetable using genetic algorithm

NASA Astrophysics Data System (ADS)

Wihartiko, F. D.; Buono, A.; Silalahi, B. P.

2017-01-01

Bus timetable gave an information for passengers to ensure the availability of bus services. Timetable optimal condition happened when bus trips frequency could adapt and suit with passenger demand. In the peak time, the number of bus trips would be larger than the off-peak time. If the number of bus trips were more frequent than the optimal condition, it would make a high operating cost for bus operator. Conversely, if the number of trip was less than optimal condition, it would make a bad quality service for passengers. In this paper, the bus timetabling problem would be solved by integer programming model with modified genetic algorithm. Modification was placed in the chromosomes design, initial population recovery technique, chromosomes reconstruction and chromosomes extermination on specific generation. The result of this model gave the optimal solution with accuracy 99.1%.

Reconstructing cerebrovascular networks under local physiological constraints by integer programming

DOE PAGES

Rempfler, Markus; Schneider, Matthias; Ielacqua, Giovanna D.; ...

2015-04-23

We introduce a probabilistic approach to vessel network extraction that enforces physiological constraints on the vessel structure. The method accounts for both image evidence and geometric relationships between vessels by solving an integer program, which is shown to yield the maximum a posteriori (MAP) estimate to the probabilistic model. Starting from an over-connected network, it is pruning vessel stumps and spurious connections by evaluating the local geometry and the global connectivity of the graph. We utilize a high-resolution micro computed tomography (µCT) dataset of a cerebrovascular corrosion cast to obtain a reference network and learn the prior distributions of ourmore » probabilistic model. As a result, we perform experiments on micro magnetic resonance angiography (µMRA) images of mouse brains and discuss properties of the networks obtained under different tracking and pruning approaches.« less

FPGA Implementation of Optimal 3D-Integer DCT Structure for Video Compression

PubMed Central

2015-01-01

A novel optimal structure for implementing 3D-integer discrete cosine transform (DCT) is presented by analyzing various integer approximation methods. The integer set with reduced mean squared error (MSE) and high coding efficiency are considered for implementation in FPGA. The proposed method proves that the least resources are utilized for the integer set that has shorter bit values. Optimal 3D-integer DCT structure is determined by analyzing the MSE, power dissipation, coding efficiency, and hardware complexity of different integer sets. The experimental results reveal that direct method of computing the 3D-integer DCT using the integer set [10, 9, 6, 2, 3, 1, 1] performs better when compared to other integer sets in terms of resource utilization and power dissipation. PMID:26601120

Automated Simultaneous Assembly of Multistage Testlets for a High-Stakes Licensing Examination

ERIC Educational Resources Information Center

Breithaupt, Krista; Hare, Donovan R.

2007-01-01

Many challenges exist for high-stakes testing programs offering continuous computerized administration. The automated assembly of test questions to exactly meet content and other requirements, provide uniformity, and control item exposure can be modeled and solved by mixed-integer programming (MIP) methods. A case study of the computerized…

THREE-PEE SAMPLING THEORY and program 'THRP' for computer generation of selection criteria

Treesearch

L. R. Grosenbaugh

1965-01-01

Theory necessary for sampling with probability proportional to prediction ('three-pee,' or '3P,' sampling) is first developed and then exemplified by numerical comparisons of several estimators. Program 'T RP' for computer generation of appropriate 3P-sample-selection criteria is described, and convenient random integer dispensers are...

The checkpoint ordering problem

PubMed Central

Hungerländer, P.

2017-01-01

Abstract We suggest a new variant of a row layout problem: Find an ordering of n departments with given lengths such that the total weighted sum of their distances to a given checkpoint is minimized. The Checkpoint Ordering Problem (COP) is both of theoretical and practical interest. It has several applications and is conceptually related to some well-studied combinatorial optimization problems, namely the Single-Row Facility Layout Problem, the Linear Ordering Problem and a variant of parallel machine scheduling. In this paper we study the complexity of the (COP) and its special cases. The general version of the (COP) with an arbitrary but fixed number of checkpoints is NP-hard in the weak sense. We propose both a dynamic programming algorithm and an integer linear programming approach for the (COP) . Our computational experiments indicate that the (COP) is hard to solve in practice. While the run time of the dynamic programming algorithm strongly depends on the length of the departments, the integer linear programming approach is able to solve instances with up to 25 departments to optimality. PMID:29170574

Evaluation of an employment program for people with mental illness using the Supported Employment Fidelity Scale.

PubMed

Cocks, Errol; Boaden, Ross

2009-10-01

The Individual Placement and Support (IPS) model aims to achieve open employment for people with mental illness. The Supported Employment Fidelity Scale (SEFS) is a 15-item instrument that evaluates the extent to which a service follows the IPS principles of best practice. This paper describes the IPS model and an evaluation of a specialist employment program for people with mental illness using the SEFS. The SEFS enabled a quantitative assessment of service provision against the criteria of evidence-based practice principles. Data were collected from multiple sources. In addition, a literature review was conducted, and personnel engaged in implementation of the IPS model at other Australian employment programs were consulted. The program achieved a score of 59 of a possible 75 on the SEFS, which is described as fair supported employment. Analysis of the 15-scale items resulted in the identification of strengths, areas for further development, and a set of recommendations. The program was operating substantially in line with evidence-based practice principles and had considerable scope for further development. Issues arising from the evaluation, areas of applicability of the SEFS and the underlying literature, and implications for occupational therapy are highlighted.

75 FR 41213 - National Protection and Programs Directorate; Infrastructure Protection Data Call Survey; Correction

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-15

... (IP), Infrastructure Information Collection Division (IICD) published a 60-day comment period notice..., ``IP Data Call.'' This is a correction notice to correct the title of the published 60-day notice to read, ``IP Data Call Survey.'' There are no further updates. This correction notice is issued as...

76 FR 5186 - National Protection and Programs Directorate; Agency Information Collection Activities; Office of...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-01-28

...), Office of Infrastructure Protection (IP), will submit the following information collection request (ICR... Paperwork Reduction Act of 1995 (Pub. L. 104-13, 44 U.S.C. Chapter 35). IP is soliciting comments concerning... INFORMATION CONTACT: If additional information is required, contact DHS/NPPD/IP, Michael Beland, (703) 235...

Incorporation of Fixed Installation Costs into Optimization of Groundwater Remediation with a New Efficient Surrogate Nonlinear Mixed Integer Optimization Algorithm

NASA Astrophysics Data System (ADS)

Shoemaker, Christine; Wan, Ying

2016-04-01

Optimization of nonlinear water resources management issues which have a mixture of fixed (e.g. construction cost for a well) and variable (e.g. cost per gallon of water pumped) costs has been not well addressed because prior algorithms for the resulting nonlinear mixed integer problems have required many groundwater simulations (with different configurations of decision variable), especially when the solution space is multimodal. In particular heuristic methods like genetic algorithms have often been used in the water resources area, but they require so many groundwater simulations that only small systems have been solved. Hence there is a need to have a method that reduces the number of expensive groundwater simulations. A recently published algorithm for nonlinear mixed integer programming using surrogates was shown in this study to greatly reduce the computational effort for obtaining accurate answers to problems involving fixed costs for well construction as well as variable costs for pumping because of a substantial reduction in the number of groundwater simulations required to obtain an accurate answer. Results are presented for a US EPA hazardous waste site. The nonlinear mixed integer surrogate algorithm is general and can be used on other problems arising in hydrology with open source codes in Matlab and python ("pySOT" in Bitbucket).

Conjunctive management of multi-reservoir network system and groundwater system

NASA Astrophysics Data System (ADS)

Mani, A.; Tsai, F. T. C.

2015-12-01

This study develops a successive mixed-integer linear fractional programming (successive MILFP) method to conjunctively manage water resources provided by a multi-reservoir network system and a groundwater system. The conjunctive management objectives are to maximize groundwater withdrawals and maximize reservoir storages while satisfying water demands and raising groundwater level to a target level. The decision variables in the management problem are reservoir releases and spills, network flows and groundwater pumping rates. Using the fractional programming approach, the objective function is defined as a ratio of total groundwater withdraws to total reservoir storage deficits from the maximum storages. Maximizing this ratio function tends to maximizing groundwater use and minimizing surface water use. This study introduces a conditional constraint on groundwater head in order to sustain aquifers from overpumping: if current groundwater level is less than a target level, groundwater head at the next time period has to be raised; otherwise, it is allowed to decrease up to a certain extent. This conditional constraint is formulated into a set of mixed binary nonlinear constraints and results in a mixed-integer nonlinear fractional programming (MINLFP) problem. To solve the MINLFP problem, we first use the response matrix approach to linearize groundwater head with respect to pumping rate and reduce the problem to an MILFP problem. Using the Charnes-Cooper transformation, the MILFP is transformed to an equivalent mixed-integer linear programming (MILP). The solution of the MILP is successively updated by updating the response matrix in every iteration. The study uses IBM CPLEX to solve the MILP problem. The methodology is applied to water resources management in northern Louisiana. This conjunctive management approach aims to recover the declining groundwater level of the stressed Sparta aquifer by using surface water from a network of four reservoirs as an alternative source of supply.

Calculating the Mean Amplitude of Glycemic Excursions from Continuous Glucose Data Using an Open-Code Programmable Algorithm Based on the Integer Nonlinear Method.

PubMed

Yu, Xuefei; Lin, Liangzhuo; Shen, Jie; Chen, Zhi; Jian, Jun; Li, Bin; Xin, Sherman Xuegang

2018-01-01

The mean amplitude of glycemic excursions (MAGE) is an essential index for glycemic variability assessment, which is treated as a key reference for blood glucose controlling at clinic. However, the traditional "ruler and pencil" manual method for the calculation of MAGE is time-consuming and prone to error due to the huge data size, making the development of robust computer-aided program an urgent requirement. Although several software products are available instead of manual calculation, poor agreement among them is reported. Therefore, more studies are required in this field. In this paper, we developed a mathematical algorithm based on integer nonlinear programming. Following the proposed mathematical method, an open-code computer program named MAGECAA v1.0 was developed and validated. The results of the statistical analysis indicated that the developed program was robust compared to the manual method. The agreement among the developed program and currently available popular software is satisfied, indicating that the worry about the disagreement among different software products is not necessary. The open-code programmable algorithm is an extra resource for those peers who are interested in the related study on methodology in the future.

Multi-task feature selection in microarray data by binary integer programming.

PubMed

Lan, Liang; Vucetic, Slobodan

2013-12-20

A major challenge in microarray classification is that the number of features is typically orders of magnitude larger than the number of examples. In this paper, we propose a novel feature filter algorithm to select the feature subset with maximal discriminative power and minimal redundancy by solving a quadratic objective function with binary integer constraints. To improve the computational efficiency, the binary integer constraints are relaxed and a low-rank approximation to the quadratic term is applied. The proposed feature selection algorithm was extended to solve multi-task microarray classification problems. We compared the single-task version of the proposed feature selection algorithm with 9 existing feature selection methods on 4 benchmark microarray data sets. The empirical results show that the proposed method achieved the most accurate predictions overall. We also evaluated the multi-task version of the proposed algorithm on 8 multi-task microarray datasets. The multi-task feature selection algorithm resulted in significantly higher accuracy than when using the single-task feature selection methods.

Comparison of penalty functions on a penalty approach to mixed-integer optimization

NASA Astrophysics Data System (ADS)

Francisco, Rogério B.; Costa, M. Fernanda P.; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.

2016-06-01

In this paper, we present a comparative study involving several penalty functions that can be used in a penalty approach for globally solving bound mixed-integer nonlinear programming (bMIMLP) problems. The penalty approach relies on a continuous reformulation of the bMINLP problem by adding a particular penalty term to the objective function. A penalty function based on the `erf' function is proposed. The continuous nonlinear optimization problems are sequentially solved by the population-based firefly algorithm. Preliminary numerical experiments are carried out in order to analyze the quality of the produced solutions, when compared with other penalty functions available in the literature.

Heterogeneous IP Ecosystem enabling Reuse (HIER)

DTIC Science & Technology

2017-03-22

Technical Approach and Justification IP reuse is a cornerstone of the commercial electronics market particularly in the digital domain...even in the digital domain. Significant investments in custom ASIC designs have been made by the government, but the IP resulting from such... approach to address requirements for that program. Research Plan The original vision for the HIER activity involved the evaluation

Trade Secret Law and Information Systems: Can Your Students Keep a Secret?

ERIC Educational Resources Information Center

Willey, Lorrie; Ford, Janet C.; White, Barbara Jo; Clapper, Danial L.

2011-01-01

The impact of intellectual property (IP) law on information systems (IS) professionals in business cannot be overstated. The IS 2010 model curriculum guidelines for undergraduate IS programs stress the importance of information security and knowledge about IP. While copyright and patents are the most well-known types of IP, another, trade secrets,…

Continued Development of Internet Protocols under the IBM OS/MVS Operating System

DTIC Science & Technology

1985-01-25

developed a prototype TCP/IP implementation for an IBM MVS host under a previous DARPA contract’ as part of the Internet research effort on the design of...participated in the DARPA Internet research program which led to the present TCP and IP protocols. Development of a prototype implementation of TCP/IP

Comparison of Traditional and ADRI Based Teaching Approaches in an Introductory Programming Course

ERIC Educational Resources Information Center

Malik, Sohail Iqbal; Coldwell-Neilson, Jo

2017-01-01

Aim/Purpose: This study introduced a new teaching and learning approach based on an ADRI (Approach, Deployment, Result, Improvement) model in an introductory programming (IP) course. The effectiveness of the new teaching and learning process was determined by collecting feedback from the IP instructors and by analyzing the final exam grades of the…

Impact of a New Teaching and Learning Approach in an Introductory Programming Course

ERIC Educational Resources Information Center

Iqbal Malik, Sohail; Coldwell-Neilson, Jo

2017-01-01

High failure and dropout rates are reported in introductory programming (IP) courses in different studies despite extensive research attempting to address the issue. In this study, we introduced an ADRI (Approach, Deployment, Result, Improvement) approach in the teaching and learning process of an IP course to improve learning and success rates.…

Finite pure integer programming algorithms employing only hyperspherically deduced cuts

NASA Technical Reports Server (NTRS)

Young, R. D.

1971-01-01

Three algorithms are developed that may be based exclusively on hyperspherically deduced cuts. The algorithms only apply, therefore, to problems structured so that these cuts are valid. The algorithms are shown to be finite.

Speedy Alchemy.

ERIC Educational Resources Information Center

Deininger, Rolf A.; Berger, Carl F., Jr.

1983-01-01

Provides instructions for interfacing a pH meter directly to an Apple II microcomputer without an analog-to-digital converter. Includes program listing (with enough remark statements to make it self-documenting) in Integer Basic to display the pH readings. (Author/JN)

Solving large-scale fixed cost integer linear programming models for grid-based location problems with heuristic techniques

NASA Astrophysics Data System (ADS)

Noor-E-Alam, Md.; Doucette, John

2015-08-01

Grid-based location problems (GBLPs) can be used to solve location problems in business, engineering, resource exploitation, and even in the field of medical sciences. To solve these decision problems, an integer linear programming (ILP) model is designed and developed to provide the optimal solution for GBLPs considering fixed cost criteria. Preliminary results show that the ILP model is efficient in solving small to moderate-sized problems. However, this ILP model becomes intractable in solving large-scale instances. Therefore, a decomposition heuristic is proposed to solve these large-scale GBLPs, which demonstrates significant reduction of solution runtimes. To benchmark the proposed heuristic, results are compared with the exact solution via ILP. The experimental results show that the proposed method significantly outperforms the exact method in runtime with minimal (and in most cases, no) loss of optimality.

A Generalized National Planning Approach for Admission Capacity in Higher Education: A Nonlinear Integer Goal Programming Model with a Novel Differential Evolution Algorithm

PubMed Central

El-Qulity, Said Ali; Mohamed, Ali Wagdy

2016-01-01

This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness. PMID:26819583

A Generalized National Planning Approach for Admission Capacity in Higher Education: A Nonlinear Integer Goal Programming Model with a Novel Differential Evolution Algorithm.

PubMed

El-Qulity, Said Ali; Mohamed, Ali Wagdy

2016-01-01

This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness.

Personnel scheduling using an integer programming model- an application at Avanti Blue-Nile Hotels.

PubMed

Kassa, Biniyam Asmare; Tizazu, Anteneh Eshetu

2013-01-01

In this paper, we report perhaps a first of its kind application of management science in the Ethiopian hotel industry. Avanti Blue Nile Hotels, a newly established five star hotel in Bahir Dar, is the company for which we developed an integer programming model that determines an optimal weekly shift schedule for the Hotel's engineering department personnel while satisfying several constraints including weekly rest requirements per employee, rest requirements between working shifts per employee, required number of personnel per shift, and other constraints. The model is implemented on an excel solver routine. The model enables the company's personnel department management to develop a fair personnel schedule as needed and to effectively utilize personnel resources while satisfying several technical, legal and economic requirements. These encouraging achievements make us optimistic about the gains other Ethiopian organizations can amass by introducing management science approaches in their management planning and decision making systems.

Combinatorial optimization games

DOE Office of Scientific and Technical Information (OSTI.GOV)

Deng, X.; Ibaraki, Toshihide; Nagamochi, Hiroshi

1997-06-01

We introduce a general integer programming formulation for a class of combinatorial optimization games, which immediately allows us to improve the algorithmic result for finding amputations in the core (an important solution concept in cooperative game theory) of the network flow game on simple networks by Kalai and Zemel. An interesting result is a general theorem that the core for this class of games is nonempty if and only if a related linear program has an integer optimal solution. We study the properties for this mathematical condition to hold for several interesting problems, and apply them to resolve algorithmic andmore » complexity issues for their cores along the line as put forward in: decide whether the core is empty; if the core is empty, find an imputation in the core; given an imputation x, test whether x is in the core. We also explore the properties of totally balanced games in this succinct formulation of cooperative games.« less

JPLEX: Java Simplex Implementation with Branch-and-Bound Search for Automated Test Assembly

ERIC Educational Resources Information Center

Park, Ryoungsun; Kim, Jiseon; Dodd, Barbara G.; Chung, Hyewon

2011-01-01

JPLEX, short for Java simPLEX, is an automated test assembly (ATA) program. It is a mixed integer linear programming (MILP) solver written in Java. It reads in a configuration file, solves the minimization problem, and produces an output file for postprocessing. It implements the simplex algorithm to create a fully relaxed solution and…

Radar Resource Management in a Dense Target Environment

DTIC Science & Technology

2014-03-01

problem faced by networked MFRs . While relaxing our assumptions concerning information gain presents numerous challenges worth exploring, future research...linear programming MFR multifunction phased array radar MILP mixed integer linear programming NATO North Atlantic Treaty Organization PDF probability...1: INTRODUCTION Multifunction phased array radars ( MFRs ) are capable of performing various tasks in rapid succession. The performance of target search

78 FR 16692 - Chemical Facility Anti-Terrorism Standards (CFATS)

Federal Register 2010, 2011, 2012, 2013, 2014

2013-03-18

... Protection (IP), Infrastructure Security Compliance Division (ISCD) will submit the following Information... submissions of responses. FOR FURTHER INFORMATION CONTACT: CFATS Program Manager, DHS/NPPD/IP/ ISCD, [email protected

A statistical mechanical approach to restricted integer partition functions

NASA Astrophysics Data System (ADS)

Zhou, Chi-Chun; Dai, Wu-Sheng

2018-05-01

The main aim of this paper is twofold: (1) suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions—a way of writing an integer as a sum of other integers under certain restrictions. In this approach, the generating function of restricted integer partition functions is constructed from the canonical partition functions of various quantum gases. (2) Introducing a new type of restricted integer partition functions corresponding to general statistics which is a generalization of Gentile statistics in statistical mechanics; many kinds of restricted integer partition functions are special cases of this restricted integer partition function. Moreover, with statistical mechanics as a bridge, we reveal a mathematical fact: the generating function of restricted integer partition function is just the symmetric function which is a class of functions being invariant under the action of permutation groups. Using this approach, we provide some expressions of restricted integer partition functions as examples.

Stochastic Dynamic Mixed-Integer Programming (SD-MIP)

DTIC Science & Technology

2015-05-05

stochastic linear programming ( SLP ) problems. By using a combination of ideas from cutting plane theory of deterministic MIP (especially disjunctive...developed to date. b) As part of this project, we have also developed tools for very large scale Stochastic Linear Programming ( SLP ). There are...several reasons for this. First, SLP models continue to challenge many of the fastest computers to date, and many applications within the DoD (e.g

Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis

DTIC Science & Technology

2016-10-11

Analysis of Interior Point Algorithms for Non-Lipschitz and Nonconvex Minimization,” (W. Bian, X. Chen, and Ye), Math Programming, 149 (2015) 301-327...Chen, Ge, Wang, Ye), Math Programming, 143 (1-2) (2014) 371-383. This paper resolved an important open question in cardinality constrained...Statistical Performance, and Algorithmic Theory for Local Solutions,” (H. Liu, T. Yao, R. Li, Y. Ye) manuscript, 2nd revision in Math Programming

Materiel Acquisition Management of U.S. Army Attack Helicopters

DTIC Science & Technology

1989-06-02

used to evaluate the existing helicopter program periodically in order to determine utility in reference to all evaluation criteria. Defintion of... mixed integer linear programming model, the Phoenix model has demonstrated the potential to assist in the analysis of strategic and operational issues in...Fleet Max i of Aircraft per Fleet Programmed Buys .. -- Technology Unit Production mix Retirement Start-up ROTIE Flying Hour Aviation Overheadl I Aviation

Anxiety and the Imposter Phenomenon among Graduate Students in Online versus Traditional Programs

ERIC Educational Resources Information Center

Fraenza, Christy B.

2014-01-01

High anxiety levels have been associated with high levels of the imposter phenomenon (IP), a negative experience of feeling like a fraud. Because IP can leave a person living in a negative cycle of anxiety that could limit participation in academic pursuits, the purpose of this study was to determine if there were differences in IP between…

A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bent, Rusell; Nagarajan, Harsha; Sundar, Kaarthik

2017-09-25

In this software, we implement an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) to global optimality. The algorithm combines ideas that exploit the structure of convex relaxations to MINLPs and bound tightening procedures

Integer programming methods for reserve selection and design

Treesearch

Robert G. Haight; Stephanie A. Snyder

2009-01-01

How many nature reserves should there be? Where should they be located? Which places have highest priority for protection? Conservation biologists, economists, and operations researchers have been developing quantitative methods to address these questions since the 1980s.

Optimal traffic resource allocation and management.

DOT National Transportation Integrated Search

2010-05-01

"In this paper, we address the problem of determining the patrol routes of state troopers for maximum coverage of : highway spots with high frequencies of crashes (hot spots). We develop a mixed integer linear programming model : for this problem und...

Efficient Remainder Rule

ERIC Educational Resources Information Center

Firozzaman, Firoz; Firoz, Fahim

2017-01-01

Understanding the solution of a problem may require the reader to have background knowledge on the subject. For instance, finding an integer which, when divided by a nonzero integer leaves a remainder; but when divided by another nonzero integer may leave a different remainder. To find a smallest positive integer or a set of integers following the…

ChIPpeakAnno: a Bioconductor package to annotate ChIP-seq and ChIP-chip data

PubMed Central

2010-01-01

Background Chromatin immunoprecipitation (ChIP) followed by high-throughput sequencing (ChIP-seq) or ChIP followed by genome tiling array analysis (ChIP-chip) have become standard technologies for genome-wide identification of DNA-binding protein target sites. A number of algorithms have been developed in parallel that allow identification of binding sites from ChIP-seq or ChIP-chip datasets and subsequent visualization in the University of California Santa Cruz (UCSC) Genome Browser as custom annotation tracks. However, summarizing these tracks can be a daunting task, particularly if there are a large number of binding sites or the binding sites are distributed widely across the genome. Results We have developed ChIPpeakAnno as a Bioconductor package within the statistical programming environment R to facilitate batch annotation of enriched peaks identified from ChIP-seq, ChIP-chip, cap analysis of gene expression (CAGE) or any experiments resulting in a large number of enriched genomic regions. The binding sites annotated with ChIPpeakAnno can be viewed easily as a table, a pie chart or plotted in histogram form, i.e., the distribution of distances to the nearest genes for each set of peaks. In addition, we have implemented functionalities for determining the significance of overlap between replicates or binding sites among transcription factors within a complex, and for drawing Venn diagrams to visualize the extent of the overlap between replicates. Furthermore, the package includes functionalities to retrieve sequences flanking putative binding sites for PCR amplification, cloning, or motif discovery, and to identify Gene Ontology (GO) terms associated with adjacent genes. Conclusions ChIPpeakAnno enables batch annotation of the binding sites identified from ChIP-seq, ChIP-chip, CAGE or any technology that results in a large number of enriched genomic regions within the statistical programming environment R. Allowing users to pass their own annotation data such as a different Chromatin immunoprecipitation (ChIP) preparation and a dataset from literature, or existing annotation packages, such as GenomicFeatures and BSgenome, provides flexibility. Tight integration to the biomaRt package enables up-to-date annotation retrieval from the BioMart database. PMID:20459804

Hybrid Nested Partitions and Math Programming Framework for Large-scale Combinatorial Optimization

DTIC Science & Technology

2010-03-31

optimization problems: 1) exact algorithms and 2) metaheuristic algorithms . This project will integrate concepts from these two technologies to develop...optimal solutions within an acceptable amount of computation time, and 2) metaheuristic algorithms such as genetic algorithms , tabu search, and the...integer programming decomposition approaches, such as Dantzig Wolfe decomposition and Lagrangian relaxation, and metaheuristics such as the Nested

Automated Test Assembly Using lp_Solve Version 5.5 in R

ERIC Educational Resources Information Center

Diao, Qi; van der Linden, Wim J.

2011-01-01

This article reviews the use of the software program lp_solve version 5.5 for solving mixed-integer automated test assembly (ATA) problems. The program is freely available under Lesser General Public License 2 (LGPL2). It can be called from the statistical language R using the lpSolveAPI interface. Three empirical problems are presented to…

47 CFR 1.2202 - Competitive bidding design options.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Section 1.2202 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL PRACTICE AND PROCEDURE Grants...) Procedures that utilize mathematical computer optimization software, such as integer programming, to evaluate... evaluating bids using a ranking based on specified factors. (B) Procedures that combine computer optimization...

SPECIES RICHNESS AND BIODIVERSITY CONSERVATION PRIORITIES IN BRITISH COLUMBIA

EPA Science Inventory

Patterns in the geographic distribution of seven species groups were used to identify important areas for conservation in British Columbia, Canada. Potential priority sites for conservation were determined using an integer programming algorithm that maximized the number of speci...

Selective Optimization

DTIC Science & Technology

2015-07-06

NUMBER 5b. GRANT NUMBER AFOSR FA9550-12-1-0154 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Shabbir Ahmed and Santanu S. Dey 5d. PROJECT NUMBER 5e. TASK...standard mixed-integer programming (MIP) formulations of selective optimization problems. While such formulations can be attacked by commercial...F33615-86-C-5169. 5b. GRANT NUMBER. Enter all grant numbers as they appear in the report, e.g. AFOSR-82-1234. 5c. PROGRAM ELEMENT NUMBER. Enter

Cumulative Poisson Distribution Program

NASA Technical Reports Server (NTRS)

Bowerman, Paul N.; Scheuer, Ernest M.; Nolty, Robert

1990-01-01

Overflow and underflow in sums prevented. Cumulative Poisson Distribution Program, CUMPOIS, one of two computer programs that make calculations involving cumulative Poisson distributions. Both programs, CUMPOIS (NPO-17714) and NEWTPOIS (NPO-17715), used independently of one another. CUMPOIS determines cumulative Poisson distribution, used to evaluate cumulative distribution function (cdf) for gamma distributions with integer shape parameters and cdf for X (sup2) distributions with even degrees of freedom. Used by statisticians and others concerned with probabilities of independent events occurring over specific units of time, area, or volume. Written in C.

A supported employment linkage intervention for people with schizophrenia who want a chance to work.

PubMed

Solar, Ann

2014-06-01

Investigate feasibility and development of a linkage intervention to the evidence-based Individual Placement and Support (IPS) approach to supported employment (SE) for patients with schizophrenia on a mental health unit who want to work in competitive employment. Literature review about the evidence-based IPS approach to SE in schizophrenia and why it might not be implemented in mental health services. Analysis of 10 adult mental health unit multidisciplinary staff interviews for categories in the literature review of IPS implementation barriers and whether these barriers could be overcome. There was lack of full staff knowledge of the IPS approach to SE. However, all staff knew respect for patient choice was paramount, community employment programs existed for the disabled, an outreach linkage process to such a program and ongoing support for people with schizophrenia would be required. There was staff ambivalence about SE for patients with schizophrenia. Despite staff ambivalence about SE for people with schizophrenia there was still enough staff knowledge and openness to shape an IPS linkage intervention from a staff perspective. © The Royal Australian and New Zealand College of Psychiatrists 2014.

Moving multiple sinks through wireless sensor networks for lifetime maximization.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Petrioli, Chiara; Carosi, Alessio; Basagni, Stefano

2008-01-01

Unattended sensor networks typically watch for some phenomena such as volcanic events, forest fires, pollution, or movements in animal populations. Sensors report to a collection point periodically or when they observe reportable events. When sensors are too far from the collection point to communicate directly, other sensors relay messages for them. If the collection point location is static, sensor nodes that are closer to the collection point relay far more messages than those on the periphery. Assuming all sensor nodes have roughly the same capabilities, those with high relay burden experience battery failure much faster than the rest of themore » network. However, since their death disconnects the live nodes from the collection point, the whole network is then dead. We consider the problem of moving a set of collectors (sinks) through a wireless sensor network to balance the energy used for relaying messages, maximizing the lifetime of the network. We show how to compute an upper bound on the lifetime for any instance using linear and integer programming. We present a centralized heuristic that produces sink movement schedules that produce network lifetimes within 1.4% of the upper bound for realistic settings. We also present a distributed heuristic that produces lifetimes at most 25:3% below the upper bound. More specifically, we formulate a linear program (LP) that is a relaxation of the scheduling problem. The variables are naturally continuous, but the LP relaxes some constraints. The LP has an exponential number of constraints, but we can satisfy them all by enforcing only a polynomial number using a separation algorithm. This separation algorithm is a p-median facility location problem, which we can solve efficiently in practice for huge instances using integer programming technology. This LP selects a set of good sensor configurations. Given the solution to the LP, we can find a feasible schedule by selecting a subset of these configurations, ordering them via a traveling salesman heuristic, and computing feasible transitions using matching algorithms. This algorithm assumes sinks can get a schedule from a central server or a leader sink. If the network owner prefers the sinks make independent decisions, they can use our distributed heuristic. In this heuristic, sinks maintain estimates of the energy distribution in the network and move greedily (with some coordination) based on local search. This application uses the new SUCASA (Solver Utility for Customization with Automatic Symbol Access) facility within the PICO (Parallel Integer and Combinatorial Optimizer) integer programming solver system. SUCASA allows rapid development of customized math programming (search-based) solvers using a problem's natural multidimensional representation. In this case, SUCASA also significantly improves runtime compared to implementations in the ampl math programming language or in perl.« less

An evaluation of the opportunities for collaborative practice occurring in and the impact of interprofessional education on advanced pharmacy practice experiences.

PubMed

Umland, Elena M; Valenzano, Jonathan; Brown, Caitlin; Giordano, Carolyn

2017-05-01

To evaluate the impact of interprofessional (IP) education (IPE) programs during the first three years of a four-year doctor of pharmacy program on student preparedness and ability to function as a collaborative team member and to garner student feedback on collaboration experienced during the Advanced Pharmacy Practice Experiences (APPEs). Likert scale based statements and open-ended questions were added to the student course evaluations for the APPEs for two graduating classes of students. Quantitative data were analyzed using SPSS (repeated measures ANOVA and MANOVA). Thematic analysis by three reviewers reaching consensus was used to evaluate the qualitative data. Students reported being well prepared for IP collaboration (average ratings ranged from a mean of 3.37-3.46 on a scale of 1-4; 1=not at all prepared and 4=very well prepared). On average, students spent 26-50% of their time working with colleagues from other healthcare professions. In describing their preparedness for IP collaboration, the IP core competency of teams/teamwork was addressed in 50% of the submitted responses. The competencies of values/ethics, roles/responsibilities and IP communication were addressed by 2%, 20% and 28% of the written responses, respectively. Required longitudinal IP programs in the first three years of the pharmacy curriculum contribute to the students' perceived preparedness for collaborative practice during their APPEs. Developing practice sites to increase the opportunities for students to practice collaboratively is key. Further education of and emphasis by preceptors relative to the IPE competencies is desired. Copyright © 2017 Elsevier Inc. All rights reserved.

Exact calculation of distributions on integers, with application to sequence alignment.

PubMed

Newberg, Lee A; Lawrence, Charles E

2009-01-01

Computational biology is replete with high-dimensional discrete prediction and inference problems. Dynamic programming recursions can be applied to several of the most important of these, including sequence alignment, RNA secondary-structure prediction, phylogenetic inference, and motif finding. In these problems, attention is frequently focused on some scalar quantity of interest, a score, such as an alignment score or the free energy of an RNA secondary structure. In many cases, score is naturally defined on integers, such as a count of the number of pairing differences between two sequence alignments, or else an integer score has been adopted for computational reasons, such as in the test of significance of motif scores. The probability distribution of the score under an appropriate probabilistic model is of interest, such as in tests of significance of motif scores, or in calculation of Bayesian confidence limits around an alignment. Here we present three algorithms for calculating the exact distribution of a score of this type; then, in the context of pairwise local sequence alignments, we apply the approach so as to find the alignment score distribution and Bayesian confidence limits.

Center for Parallel Optimization

DTIC Science & Technology

1993-09-30

BOLLING AFB DC 20332-0001 _ii _ 11. SUPPLEMENTARY NOTES 12a. DISTRIBUTION/ AVAILABILITY STATEMENT 12b. DISTRIBUTION CODE APPROVED FOR PUBLIC RELEASE...Machines Corporation, March 16-19, 1993 , A Branch- and-Bound Method for Mixed Integer Programming on the CM-.5 "* Dr. Roberto Musmanno, University of

Topics

ERIC Educational Resources Information Center

Mathematics Teaching, 1973

1973-01-01

This column includes the description of a game involving addition and subtraction of integers represented by colored bricks, a general formula for an enlargement in the Cartesian plane, an analysis of the possibilities for certain games of board Solitaire, and a BASIC program for a recreational mathematics problem. (DT)

How Maryland increased infection prevention and control activity in long-term care facilities, 2003-2008.

PubMed

Roup, Brenda J; Scaletta, Joseph M

2011-05-01

In January 2003, the Maryland Department of Health and Mental Hygiene (DHMH) assessed the state of infection prevention and control (IPC) resources and practices in all long-term care facilities (LTC) in the state. Only 8.1% of facilities that responded employed a trained IPC professional (IP) who managed the facility IPC program. Between 2003 and 2008, the DHMH partnered with long-term care industry trade associations and spearheaded regulatory, educational, and financial initiatives to improve this situation. In January 2008, all LTC facilities in the state were resurveyed to determine the impact of these initiatives on IPC activities. The 2008 survey indicated that 44% of LTC facilities used a trained IP who managed the IPC program, a 5-fold increase from 2003. Unpublished DHMH outbreak data indicated that LTC facilities with a trained IP recognized and reported outbreaks to the local health department 2 days sooner than facilities without a trained IP, resulting in fewer cases of disease. Multiple initiatives with concerned stakeholders and LTC partners over the course of 5 years resulted in increased numbers of LTC facilities with trained IPs who recognized and responded to outbreaks sooner than facilities without trained IPs. Copyright © 2011 Association for Professionals in Infection Control and Epidemiology, Inc. Published by Mosby, Inc. All rights reserved.

Distributing Earthquakes Among California's Faults: A Binary Integer Programming Approach

NASA Astrophysics Data System (ADS)

Geist, E. L.; Parsons, T.

2016-12-01

Statement of the problem is simple: given regional seismicity specified by a Gutenber-Richter (G-R) relation, how are earthquakes distributed to match observed fault-slip rates? The objective is to determine the magnitude-frequency relation on individual faults. The California statewide G-R b-value and a-value are estimated from historical seismicity, with the a-value accounting for off-fault seismicity. UCERF3 consensus slip rates are used, based on geologic and geodetic data and include estimates of coupling coefficients. The binary integer programming (BIP) problem is set up such that each earthquake from a synthetic catalog spanning millennia can occur at any location along any fault. The decision vector, therefore, consists of binary variables, with values equal to one indicating the location of each earthquake that results in an optimal match of slip rates, in an L1-norm sense. Rupture area and slip associated with each earthquake are determined from a magnitude-area scaling relation. Uncertainty bounds on the UCERF3 slip rates provide explicit minimum and maximum constraints to the BIP model, with the former more important to feasibility of the problem. There is a maximum magnitude limit associated with each fault, based on fault length, providing an implicit constraint. Solution of integer programming problems with a large number of variables (>105 in this study) has been possible only since the late 1990s. In addition to the classic branch-and-bound technique used for these problems, several other algorithms have been recently developed, including pre-solving, sifting, cutting planes, heuristics, and parallelization. An optimal solution is obtained using a state-of-the-art BIP solver for M≥6 earthquakes and California's faults with slip-rates > 1 mm/yr. Preliminary results indicate a surprising diversity of on-fault magnitude-frequency relations throughout the state.

Newton/Poisson-Distribution Program

NASA Technical Reports Server (NTRS)

Bowerman, Paul N.; Scheuer, Ernest M.

1990-01-01

NEWTPOIS, one of two computer programs making calculations involving cumulative Poisson distributions. NEWTPOIS (NPO-17715) and CUMPOIS (NPO-17714) used independently of one another. NEWTPOIS determines Poisson parameter for given cumulative probability, from which one obtains percentiles for gamma distributions with integer shape parameters and percentiles for X(sup2) distributions with even degrees of freedom. Used by statisticians and others concerned with probabilities of independent events occurring over specific units of time, area, or volume. Program written in C.

Integers as Transformations.

ERIC Educational Resources Information Center

Thompson, Patrick W.; Dreyfus, Tommy

1988-01-01

Investigates whether elementary school students can construct operations of thought for integers and integer addition crucial for understanding elementary algebra. Two sixth graders were taught using a computer. Results included both students being able to construct mental operations for negating arbitrary integers and determining sign and…

75 FR 31458 - Infrastructure Protection Data Call Survey

Federal Register 2010, 2011, 2012, 2013, 2014

2010-06-03

...-0022] Infrastructure Protection Data Call Survey AGENCY: National Protection and Programs Directorate... New Information Collection Request, Infrastructure Protection Data Call Survey. DHS previously... territories are able to achieve this mission, IP requests opinions and information in a survey from IP Data...

ELRIS2D: A MATLAB Package for the 2D Inversion of DC Resistivity/IP Data

NASA Astrophysics Data System (ADS)

Akca, Irfan

2016-04-01

ELRIS2D is an open source code written in MATLAB for the two-dimensional inversion of direct current resistivity (DCR) and time domain induced polarization (IP) data. The user interface of the program is designed for functionality and ease of use. All available settings of the program can be reached from the main window. The subsurface is discre-tized using a hybrid mesh generated by the combination of structured and unstructured meshes, which reduces the computational cost of the whole inversion procedure. The inversion routine is based on the smoothness constrained least squares method. In order to verify the program, responses of two test models and field data sets were inverted. The models inverted from the synthetic data sets are consistent with the original test models in both DC resistivity and IP cases. A field data set acquired in an archaeological site is also used for the verification of outcomes of the program in comparison with the excavation results.

Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study

PubMed Central

Catanzaro, Daniele; Schäffer, Alejandro A.; Schwartz, Russell

2016-01-01

Ductal Carcinoma In Situ (DCIS) is a precursor lesion of Invasive Ductal Carcinoma (IDC) of the breast. Investigating its temporal progression could provide fundamental new insights for the development of better diagnostic tools to predict which cases of DCIS will progress to IDC. We investigate the problem of reconstructing a plausible progression from single-cell sampled data of an individual with Synchronous DCIS and IDC. Specifically, by using a number of assumptions derived from the observation of cellular atypia occurring in IDC, we design a possible predictive model using integer linear programming (ILP). Computational experiments carried out on a preexisting data set of 13 patients with simultaneous DCIS and IDC show that the corresponding predicted progression models are classifiable into categories having specific evolutionary characteristics. The approach provides new insights into mechanisms of clonal progression in breast cancers and helps illustrate the power of the ILP approach for similar problems in reconstructing tumor evolution scenarios under complex sets of constraints. PMID:26353381

A mathematical model for municipal solid waste management - A case study in Hong Kong.

PubMed

Lee, C K M; Yeung, C L; Xiong, Z R; Chung, S H

2016-12-01

With the booming economy and increasing population, the accumulation of waste has become an increasingly arduous issue and has aroused the attention from all sectors of society. Hong Kong which has a relative high daily per capita domestic waste generation rate in Asia has not yet established a comprehensive waste management system. This paper conducts a review of waste management approaches and models. Researchers highlight that mathematical models provide useful information for decision-makers to select appropriate choices and save cost. It is suggested to consider municipal solid waste management in a holistic view and improve the utilization of waste management infrastructures. A mathematical model which adopts integer linear programming and mixed integer programming has been developed for Hong Kong municipal solid waste management. A sensitivity analysis was carried out to simulate different scenarios which provide decision-makers important information for establishing Hong Kong waste management system. Copyright © 2016 Elsevier Ltd. All rights reserved.

A new mathematical modeling for pure parsimony haplotyping problem.

PubMed

Feizabadi, R; Bagherian, M; Vaziri, H R; Salahi, M

2016-11-01

Pure parsimony haplotyping (PPH) problem is important in bioinformatics because rational haplotyping inference plays important roles in analysis of genetic data, mapping complex genetic diseases such as Alzheimer's disease, heart disorders and etc. Haplotypes and genotypes are m-length sequences. Although several integer programing models have already been presented for PPH problem, its NP-hardness characteristic resulted in ineffectiveness of those models facing the real instances especially instances with many heterozygous sites. In this paper, we assign a corresponding number to each haplotype and genotype and based on those numbers, we set a mixed integer programing model. Using numbers, instead of sequences, would lead to less complexity of the new model in comparison with previous models in a way that there are neither constraints nor variables corresponding to heterozygous nucleotide sites in it. Experimental results approve the efficiency of the new model in producing better solution in comparison to two state-of-the art haplotyping approaches. Copyright © 2016 Elsevier Inc. All rights reserved.

Discovering Link Communities in Complex Networks by an Integer Programming Model and a Genetic Algorithm

PubMed Central

Li, Zhenping; Zhang, Xiang-Sun; Wang, Rui-Sheng; Liu, Hongwei; Zhang, Shihua

2013-01-01

Identification of communities in complex networks is an important topic and issue in many fields such as sociology, biology, and computer science. Communities are often defined as groups of related nodes or links that correspond to functional subunits in the corresponding complex systems. While most conventional approaches have focused on discovering communities of nodes, some recent studies start partitioning links to find overlapping communities straightforwardly. In this paper, we propose a new quantity function for link community identification in complex networks. Based on this quantity function we formulate the link community partition problem into an integer programming model which allows us to partition a complex network into overlapping communities. We further propose a genetic algorithm for link community detection which can partition a network into overlapping communities without knowing the number of communities. We test our model and algorithm on both artificial networks and real-world networks. The results demonstrate that the model and algorithm are efficient in detecting overlapping community structure in complex networks. PMID:24386268

Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment

PubMed Central

Karimzadehgan, Maryam; Zhai, ChengXiang

2011-01-01

Automatic review assignment can significantly improve the productivity of many people such as conference organizers, journal editors and grant administrators. A general setup of the review assignment problem involves assigning a set of reviewers on a committee to a set of documents to be reviewed under the constraint of review quota so that the reviewers assigned to a document can collectively cover multiple topic aspects of the document. No previous work has addressed such a setup of committee review assignments while also considering matching multiple aspects of topics and expertise. In this paper, we tackle the problem of committee review assignment with multi-aspect expertise matching by casting it as an integer linear programming problem. The proposed algorithm can naturally accommodate any probabilistic or deterministic method for modeling multiple aspects to automate committee review assignments. Evaluation using a multi-aspect review assignment test set constructed using ACM SIGIR publications shows that the proposed algorithm is effective and efficient for committee review assignments based on multi-aspect expertise matching. PMID:22711970

Fish Processed Production Planning Using Integer Stochastic Programming Model

NASA Astrophysics Data System (ADS)

Firmansyah, Mawengkang, Herman

2011-06-01

Fish and its processed products are the most affordable source of animal protein in the diet of most people in Indonesia. The goal in production planning is to meet customer demand over a fixed time horizon divided into planning periods by optimizing the trade-off between economic objectives such as production cost and customer satisfaction level. The major decisions are production and inventory levels for each product and the number of workforce in each planning period. In this paper we consider the management of small scale traditional business at North Sumatera Province which performs processing fish into several local seafood products. The inherent uncertainty of data (e.g. demand, fish availability), together with the sequential evolution of data over time leads the production planning problem to a nonlinear mixed-integer stochastic programming model. We use scenario generation based approach and feasible neighborhood search for solving the model. The results which show the amount of each fish processed product and the number of workforce needed in each horizon planning are presented.

A robust multi-objective global supplier selection model under currency fluctuation and price discount

NASA Astrophysics Data System (ADS)

Zarindast, Atousa; Seyed Hosseini, Seyed Mohamad; Pishvaee, Mir Saman

2017-06-01

Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss decision variables, respectively, by a two-stage stochastic planning model, a robust stochastic optimization planning model which integrates worst case scenario in modeling approach and finally by equivalent deterministic planning model. The experimental study is carried out to compare the performances of the three models. Robust model resulted in remarkable cost saving and it illustrated that to cope with such uncertainties, we should consider them in advance in our planning. In our case study different supplier were selected due to this uncertainties and since supplier selection is a strategic decision, it is crucial to consider these uncertainties in planning approach.

Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study.

PubMed

Catanzaro, Daniele; Shackney, Stanley E; Schaffer, Alejandro A; Schwartz, Russell

2016-01-01

Ductal Carcinoma In Situ (DCIS) is a precursor lesion of Invasive Ductal Carcinoma (IDC) of the breast. Investigating its temporal progression could provide fundamental new insights for the development of better diagnostic tools to predict which cases of DCIS will progress to IDC. We investigate the problem of reconstructing a plausible progression from single-cell sampled data of an individual with synchronous DCIS and IDC. Specifically, by using a number of assumptions derived from the observation of cellular atypia occurring in IDC, we design a possible predictive model using integer linear programming (ILP). Computational experiments carried out on a preexisting data set of 13 patients with simultaneous DCIS and IDC show that the corresponding predicted progression models are classifiable into categories having specific evolutionary characteristics. The approach provides new insights into mechanisms of clonal progression in breast cancers and helps illustrate the power of the ILP approach for similar problems in reconstructing tumor evolution scenarios under complex sets of constraints.

A supplier selection and order allocation problem with stochastic demands

NASA Astrophysics Data System (ADS)

Zhou, Yun; Zhao, Lei; Zhao, Xiaobo; Jiang, Jianhua

2011-08-01

We consider a system comprising a retailer and a set of candidate suppliers that operates within a finite planning horizon of multiple periods. The retailer replenishes its inventory from the suppliers and satisfies stochastic customer demands. At the beginning of each period, the retailer makes decisions on the replenishment quantity, supplier selection and order allocation among the selected suppliers. An optimisation problem is formulated to minimise the total expected system cost, which includes an outer level stochastic dynamic program for the optimal replenishment quantity and an inner level integer program for supplier selection and order allocation with a given replenishment quantity. For the inner level subproblem, we develop a polynomial algorithm to obtain optimal decisions. For the outer level subproblem, we propose an efficient heuristic for the system with integer-valued inventory, based on the structural properties of the system with real-valued inventory. We investigate the efficiency of the proposed solution approach, as well as the impact of parameters on the optimal replenishment decision with numerical experiments.

Galaxy Redshifts from Discrete Optimization of Correlation Functions

NASA Astrophysics Data System (ADS)

Lee, Benjamin C. G.; Budavári, Tamás; Basu, Amitabh; Rahman, Mubdi

2016-12-01

We propose a new method of constraining the redshifts of individual extragalactic sources based on celestial coordinates and their ensemble statistics. Techniques from integer linear programming (ILP) are utilized to optimize simultaneously for the angular two-point cross- and autocorrelation functions. Our novel formalism introduced here not only transforms the otherwise hopelessly expensive, brute-force combinatorial search into a linear system with integer constraints but also is readily implementable in off-the-shelf solvers. We adopt Gurobi, a commercial optimization solver, and use Python to build the cost function dynamically. The preliminary results on simulated data show potential for future applications to sky surveys by complementing and enhancing photometric redshift estimators. Our approach is the first application of ILP to astronomical analysis.

Non-integer viscoelastic constitutive law to model soft biological tissues to in-vivo indentation.

PubMed

Demirci, Nagehan; Tönük, Ergin

2014-01-01

During the last decades, derivatives and integrals of non-integer orders are being more commonly used for the description of constitutive behavior of various viscoelastic materials including soft biological tissues. Compared to integer order constitutive relations, non-integer order viscoelastic material models of soft biological tissues are capable of capturing a wider range of viscoelastic behavior obtained from experiments. Although integer order models may yield comparably accurate results, non-integer order material models have less number of parameters to be identified in addition to description of an intermediate material that can monotonically and continuously be adjusted in between an ideal elastic solid and an ideal viscous fluid. In this work, starting with some preliminaries on non-integer (fractional) calculus, the "spring-pot", (intermediate mechanical element between a solid and a fluid), non-integer order three element (Zener) solid model, finally a user-defined large strain non-integer order viscoelastic constitutive model was constructed to be used in finite element simulations. Using the constitutive equation developed, by utilizing inverse finite element method and in vivo indentation experiments, soft tissue material identification was performed. The results indicate that material coefficients obtained from relaxation experiments, when optimized with creep experimental data could simulate relaxation, creep and cyclic loading and unloading experiments accurately. Non-integer calculus viscoelastic constitutive models, having physical interpretation and modeling experimental data accurately is a good alternative to classical phenomenological viscoelastic constitutive equations.

Fast Integer Ambiguity Resolution for GPS Attitude Determination

NASA Technical Reports Server (NTRS)

Lightsey, E. Glenn; Crassidis, John L.; Markley, F. Landis

1999-01-01

In this paper, a new algorithm for GPS (Global Positioning System) integer ambiguity resolution is shown. The algorithm first incorporates an instantaneous (static) integer search to significantly reduce the search space using a geometric inequality. Then a batch-type loss function is used to check the remaining integers in order to determine the optimal integer. This batch function represents the GPS sightline vectors in the body frame as the sum of two vectors, one depending on the phase measurements and the other on the unknown integers. The new algorithm has several advantages: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can resolve the integers even when coplanar baselines exist. The performance of the new algorithm is tested on a dynamic hardware simulator.

Learning Integer Addition: Is Later Better?

ERIC Educational Resources Information Center

Aqazade, Mahtob; Bofferding, Laura; Farmer, Sherri

2017-01-01

We investigate thirty-three second and fifth-grade students' solution strategies on integer addition problems before and after analyzing contrasting cases with integer addition and participating in a lesson on integers. The students took a pretest, participated in two small group sessions and a short lesson, and took a posttest. Even though the…

Online with Integers

ERIC Educational Resources Information Center

Siegel, Jonathan W.; Siegel, P. B.

2011-01-01

Integers are sometimes used in physics problems to simplify the mathematics so the arithmetic does not distract students from the physics concepts. This is particularly important in exams where students should not have to spend a lot of time using their calculators. Common uses of integers in physics problems include integer solutions to…

Integers Made Easy: Just Walk It Off

ERIC Educational Resources Information Center

Nurnberger-Haag, Julie

2007-01-01

This article describes a multisensory method for teaching students how to multiply and divide as well as add and subtract integers. The author uses sidewalk chalk and the underlying concept of integers to physically and mentally engage students in understanding the concepts of integers, making connections, and developing computational fluency.…

A mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach

NASA Astrophysics Data System (ADS)

Shafiee, Morteza; Lotfi, Farhad Hosseinzadeh; Saleh, Hilda; Ghaderi, Mehdi

2016-03-01

One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856-864, 2010) proposed a bi-level structure for cost efficiency at the first time. In this model, multi-level programming and cost efficiency were used. He used a nonlinear programming to solve the model. In this paper, we have focused on multi-level structure and proposed a bi-level DEA model. We then used a liner programming to solve our model. In other hand, we significantly improved the way to achieve the optimum solution in comparison with the work by Wu (2010) by converting the NP-hard nonlinear programing into a mixed integer linear programming. This study uses a bi-level programming data envelopment analysis model that embodies internal structure with Stackelberg-game relationships to evaluate the performance of banking chain. The perspective of decentralized decisions is taken in this paper to cope with complex interactions in banking chain. The results derived from bi-level programming DEA can provide valuable insights and detailed information for managers to help them evaluate the performance of the banking chain as a whole using Stackelberg-game relationships. Finally, this model was applied in the Iranian bank to evaluate cost efficiency.

Optimally Scheduling Basic Courses at the Defense Language Institute using Integer Programming

DTIC Science & Technology

2005-09-01

DLI’s manual schedules at best can train 8%, 7% and 64%. 15. NUMBER OF PAGES 59 14. SUBJECT TERMS Operations Research, Linear Programming...class in 2006, 2007, and 2008, whereas DLI’s manual schedules at best can train 8%, 7% and 64%. vi THIS PAGE...ARABIC INSTRUTOR LEVELS .....................................25 FIGURE 2. OCS1 AND OCS2 CHINESE-MANDARIN INSTRUTOR LEVELS ............26 FIGURE 3

78 FR 75573 - Agency Information Collection Activities: Submission for OMB Review; Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2013-12-12

..., facsimile number (202) 646-3347, or email address [email protected] (HSEEP) After Action Report (AAR) Improvement Plan (IP). Type of Information Collection: Revision of a... Exercise and Evaluation Program (HSEEP) After Action Report (AAR) Improvement Plan (IP). Abstract: The...

Optimization methods for decision making in disease prevention and epidemic control.

PubMed

Deng, Yan; Shen, Siqian; Vorobeychik, Yevgeniy

2013-11-01

This paper investigates problems of disease prevention and epidemic control (DPEC), in which we optimize two sets of decisions: (i) vaccinating individuals and (ii) closing locations, given respective budgets with the goal of minimizing the expected number of infected individuals after intervention. The spread of diseases is inherently stochastic due to the uncertainty about disease transmission and human interaction. We use a bipartite graph to represent individuals' propensities of visiting a set of location, and formulate two integer nonlinear programming models to optimize choices of individuals to vaccinate and locations to close. Our first model assumes that if a location is closed, its visitors stay in a safe location and will not visit other locations. Our second model incorporates compensatory behavior by assuming multiple behavioral groups, always visiting the most preferred locations that remain open. The paper develops algorithms based on a greedy strategy, dynamic programming, and integer programming, and compares the computational efficacy and solution quality. We test problem instances derived from daily behavior patterns of 100 randomly chosen individuals (corresponding to 195 locations) in Portland, Oregon, and provide policy insights regarding the use of the two DPEC models. Copyright © 2013 Elsevier Inc. All rights reserved.

A Two-Stage Stochastic Mixed-Integer Programming Approach to the Smart House Scheduling Problem

NASA Astrophysics Data System (ADS)

Ozoe, Shunsuke; Tanaka, Yoichi; Fukushima, Masao

A “Smart House” is a highly energy-optimized house equipped with photovoltaic systems (PV systems), electric battery systems, fuel cell cogeneration systems (FC systems), electric vehicles (EVs) and so on. Smart houses are attracting much attention recently thanks to their enhanced ability to save energy by making full use of renewable energy and by achieving power grid stability despite an increased power draw for installed PV systems. Yet running a smart house's power system, with its multiple power sources and power storages, is no simple task. In this paper, we consider the problem of power scheduling for a smart house with a PV system, an FC system and an EV. We formulate the problem as a mixed integer programming problem, and then extend it to a stochastic programming problem involving recourse costs to cope with uncertain electricity demand, heat demand and PV power generation. Using our method, we seek to achieve the optimal power schedule running at the minimum expected operation cost. We present some results of numerical experiments with data on real-life demands and PV power generation to show the effectiveness of our method.

Making Sense of Integer Arithmetic: The Effect of Using Virtual Manipulatives on Students' Representational Fluency

ERIC Educational Resources Information Center

Bolyard, Johnna; Moyer-Packenham, Patricia

2012-01-01

This study investigated how the use of virtual manipulatives in integer instruction impacts student achievement for integer addition and subtraction. Of particular interest was the influence of using virtual manipulatives on students' ability to create and translate among representations for integer computation. The research employed a…

Teachers' Construction of Meanings of Signed Quantities and Integer Operation

ERIC Educational Resources Information Center

Kumar, Ruchi S.; Subramaniam, K.; Naik, Shweta Shripad

2017-01-01

Understanding signed quantities and its arithmetic is one of the challenging topics of middle school mathematics. The "specialized content knowledge" (SCK) for teaching integers includes understanding of a variety of representations that may be used while teaching. In this study, we argue that meanings of integers and integer operations…

Anisotropic fractal media by vector calculus in non-integer dimensional space

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2014-08-01

A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensional space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media.

Provider-identified barriers and facilitators to implementing a supported employment program in spinal cord injury.

PubMed

Cotner, Bridget A; Ottomanelli, Lisa; O'Connor, Danielle R; Trainor, John K

2018-06-01

In a 5-year study, individual placement and support (IPS) significantly increased employment rate of United States Veterans with spinal cord injury (SCI), a historically underemployed population. In a follow-up study, data on barriers and facilitators to IPS implementation were identified. Over 24 months of implementation, 82 key medical and vocational staff underwent semi-structured interviews (n = 130). Interviews were digitally recorded and qualitatively analyzed (ATLAS.ti v0.7) using a constant comparative method to generate themes. Some barriers to implementation occurred throughout the study, such as Veterans' lack of motivation and providers' difficulty integrating vocational and medical rehabilitation. Other barriers emerged at specific stages, for example, early barriers included a large geographic service area and a large patient caseload, and late barriers included need for staff education. Facilitators were mostly constant throughout implementation and included leadership support and successful integration of vocational staff into the medical care team. Implementation strategies need to be adjusted as implementation progresses and matures. The strategies that succeeded in this setting, which were situated in a real-world context of providing IPS as a part of SCI medical care, may inform implementation of IPS for other populations with physical disabilities. Implications for Rehabilitation Key facilitators to IPS in SCI implementation are integrating vocational staff with expertise in IPS and SCI on clinical rehabilitation teams and providing leadership support. Ongoing barriers to IPS in SCI include patient specific and program administration factors such as caseload size and staffing patterns. Varying implementation strategies are needed to address barriers as they arise and facilitate successful implementation.

Solution of the Generalized Noah's Ark Problem.

PubMed

Billionnet, Alain

2013-01-01

The phylogenetic diversity (PD) of a set of species is a measure of the evolutionary distance among the species in the collection, based on a phylogenetic tree. Such a tree is composed of a root, internal nodes, and leaves that correspond to the set of taxa under study. With each edge of the tree is associated a non-negative branch length (evolutionary distance). If a particular survival probability is associated with each taxon, the PD measure becomes the expected PD measure. In the Noah's Ark Problem (NAP) introduced by Weitzman (1998), these survival probabilities can be increased at some cost. The problem is to determine how best to allocate a limited amount of resources to maximize the expected PD of the considered species. It is easy to formulate the NAP as a (difficult) nonlinear 0-1 programming problem. The aim of this article is to show that a general version of the NAP (GNAP) can be solved simply and efficiently with any set of edge weights and any set of survival probabilities by using standard mixed-integer linear programming software. The crucial point to move from a nonlinear program in binary variables to a mixed-integer linear program, is to approximate the logarithmic function by the lower envelope of a set of tangents to the curve. Solving the obtained mixed-integer linear program provides not only a near-optimal solution but also an upper bound on the value of the optimal solution. We also applied this approach to a generalization of the nature reserve problem (GNRP) that consists of selecting a set of regions to be conserved so that the expected PD of the set of species present in these regions is maximized. In this case, the survival probabilities of different taxa are not independent of each other. Computational results are presented to illustrate potentialities of the approach. Near-optimal solutions with hypothetical phylogenetic trees comprising about 4000 taxa are obtained in a few seconds or minutes of computing time for the GNAP, and in about 30 min for the GNRP. In all the cases the average guarantee varies from 0% to 1.20%.

MultiNet TCP/P/IP for VAX/VMS update

NASA Technical Reports Server (NTRS)

Vance, L. Stuart

1991-01-01

Outlines of device support; DECnet interoperability; installation; MultiNet services; domain name server; Telnet; FTP; SMTP; DECwindows over TCP/IP; BSD r services; remote printing; RPC services and NFS server; NFS client; netcontrol; diagnostics; programming support; and MultiNet features are presented in viewgraph format.

Intergenerational Programmes: Public Policy and Research Implications--An International Perspective.

ERIC Educational Resources Information Center

Hatton-Yeo, Alan, Ed.; Ohsako, Toshio, Ed.

This document consists of 12 papers that, together, summarize the key issues underpinning future research and policy development related to intergenerational programs (IPs). "Introduction" (Alan Hatton-Yeo) discusses the project out of which the papers developed. "A General Assessment of IP Initiatives in the Countries…

Multi-vehicle mobility allowance shuttle transit (MAST) system : an analytical model to select the fleet size and a scheduling heuristic.

DOT National Transportation Integrated Search

2012-06-01

The mobility allowance shuttle transit (MAST) system is a hybrid transit system in which vehicles are : allowed to deviate from a fixed route to serve flexible demand. A mixed integer programming (MIP) : formulation for the static scheduling problem ...

A Graphical Teaching Tool for Understanding Two's Complement.

ERIC Educational Resources Information Center

Luck, Carlos L.

As part of the Electrical Engineering program at the Univesity of Southern Maine, students are typically introduced to Two's Complement algebra and representation, a method to include negative numbers in the binary representation of integers that is widely used in microprocessors and related digital systems. The traditional, procedural method to…

Space tug economic analysis study. Volume 2: Tug concepts analysis. Part 2: Economic analysis

NASA Technical Reports Server (NTRS)

1972-01-01

An economic analysis of space tug operations is presented. The subjects discussed are: (1) cost uncertainties, (2) scenario analysis, (3) economic sensitivities, (4) mixed integer programming formulation of the space tug problem, and (5) critical parameters in the evaluation of a public expenditure.

Optimizing efficiency of height modeling for extensive forest inventories.

Treesearch

T.M. Barrett

2006-01-01

Although critical to monitoring forest ecosystems, inventories are expensive. This paper presents a generalizable method for using an integer programming model to examine tradeoffs between cost and estimation error for alternative measurement strategies in forest inventories. The method is applied to an example problem of choosing alternative height-modeling strategies...

Selecting Personal Computers.

ERIC Educational Resources Information Center

Djang, Philipp A.

1993-01-01

Describes a Multiple Criteria Decision Analysis Approach for the selection of personal computers that combines the capabilities of Analytic Hierarchy Process and Integer Goal Programing. An example of how decision makers can use this approach to determine what kind of personal computers and how many of each type to purchase is given. (nine…

Integrated Sensing and Processing (ISP) Phase II: Demonstration and Evaluation for Distributed Sensor Netowrks and Missile Seeker Systems

DTIC Science & Technology

2007-02-28

Shah, D. Waagen, H. Schmitt, S. Bellofiore, A. Spanias, and D. Cochran, 32nd International Conference on Acoustics, Speech , and Signal Processing...Information Exploitation Office kNN k-Nearest Neighbor LEAN Laplacian Eigenmap Adaptive Neighbor LIP Linear Integer Programming ISP

Optimization Research of Generation Investment Based on Linear Programming Model

NASA Astrophysics Data System (ADS)

Wu, Juan; Ge, Xueqian

Linear programming is an important branch of operational research and it is a mathematical method to assist the people to carry out scientific management. GAMS is an advanced simulation and optimization modeling language and it will combine a large number of complex mathematical programming, such as linear programming LP, nonlinear programming NLP, MIP and other mixed-integer programming with the system simulation. In this paper, based on the linear programming model, the optimized investment decision-making of generation is simulated and analyzed. At last, the optimal installed capacity of power plants and the final total cost are got, which provides the rational decision-making basis for optimized investments.

INFORM: An interactive data collection and display program with debugging capability

NASA Technical Reports Server (NTRS)

Cwynar, D. S.

1980-01-01

A computer program was developed to aid ASSEMBLY language programmers of mini and micro computers in solving the man machine communications problems that exist when scaled integers are involved. In addition to producing displays of quasi-steady state values, INFORM provides an interactive mode for debugging programs, making program patches, and modifying the displays. Auxiliary routines SAMPLE and DATAO add dynamic data acquisition and high speed dynamic display capability to the program. Programming information and flow charts to aid in implementing INFORM on various machines together with descriptions of all supportive software are provided. Program modifications to satisfy the individual user's needs are considered.

Using Instructional Design, Analyze, Design, Develop, Implement, and Evaluate, to Develop e-Learning Modules to Disseminate Supported Employment for Community Behavioral Health Treatment Programs in New York State.

PubMed

Patel, Sapana R; Margolies, Paul J; Covell, Nancy H; Lipscomb, Cristine; Dixon, Lisa B

2018-01-01

Implementation science lacks a systematic approach to the development of learning strategies for online training in evidence-based practices (EBPs) that takes the context of real-world practice into account. The field of instructional design offers ecologically valid and systematic processes to develop learning strategies for workforce development and performance support. This report describes the application of an instructional design framework-Analyze, Design, Develop, Implement, and Evaluate (ADDIE) model-in the development and evaluation of e-learning modules as one strategy among a multifaceted approach to the implementation of individual placement and support (IPS), a model of supported employment for community behavioral health treatment programs, in New York State. We applied quantitative and qualitative methods to develop and evaluate three IPS e-learning modules. Throughout the ADDIE process, we conducted formative and summative evaluations and identified determinants of implementation using the Consolidated Framework for Implementation Research (CFIR). Formative evaluations consisted of qualitative feedback received from recipients and providers during early pilot work. The summative evaluation consisted of levels 1 and 2 (reaction to the training, self-reported knowledge, and practice change) quantitative and qualitative data and was guided by the Kirkpatrick model for training evaluation. Formative evaluation with key stakeholders identified a range of learning needs that informed the development of a pilot training program in IPS. Feedback on this pilot training program informed the design document of three e-learning modules on IPS: Introduction to IPS, IPS Job development, and Using the IPS Employment Resource Book . Each module was developed iteratively and provided an assessment of learning needs that informed successive modules. All modules were disseminated and evaluated through a learning management system. Summative evaluation revealed that learners rated the modules positively, and self-report of knowledge acquisition was high (mean range: 4.4-4.6 out of 5). About half of learners indicated that they would change their practice after watching the modules (range: 48-51%). All learners who completed the level 1 evaluation demonstrated 80% or better mastery of knowledge on the level 2 evaluation embedded in each module. The CFIR was used to identify implementation barriers and facilitators among the evaluation data which facilitated planning for subsequent implementation support activities in the IPS initiative. Instructional design approaches such as ADDIE may offer implementation scientists and practitioners a flexible and systematic approach for the development of e-learning modules as a single component or one strategy in a multifaceted approach for training in EBPs.

Software Technology for Adaptable, Reliable Systems (STARS) (User Manual). Ada Command Environment (ACE) Version 8.0 Sun OS Implementation

DTIC Science & Technology

1990-10-29

the equivalent type names in the basic X libary . 37. Intrinsics Contains the type declarations common to all Xt toolkit routines. 38. Widget-Package...Memory-Size constant Integer 1; MinInt constant I-reger Integer’First; MaxInt const-i’ integer Integer’Last; -- Max- Digits constant Integer 1; -- MaxMan...connection between some type names used by Xt routines and the equivalent type names in the basic X libary . .package RenamedXlibTypes is P;’ge 65 29

CUMBIN - CUMULATIVE BINOMIAL PROGRAMS

NASA Technical Reports Server (NTRS)

Bowerman, P. N.

1994-01-01

The cumulative binomial program, CUMBIN, is one of a set of three programs which calculate cumulative binomial probability distributions for arbitrary inputs. The three programs, CUMBIN, NEWTONP (NPO-17556), and CROSSER (NPO-17557), can be used independently of one another. CUMBIN can be used by statisticians and users of statistical procedures, test planners, designers, and numerical analysts. The program has been used for reliability/availability calculations. CUMBIN calculates the probability that a system of n components has at least k operating if the probability that any one operating is p and the components are independent. Equivalently, this is the reliability of a k-out-of-n system having independent components with common reliability p. CUMBIN can evaluate the incomplete beta distribution for two positive integer arguments. CUMBIN can also evaluate the cumulative F distribution and the negative binomial distribution, and can determine the sample size in a test design. CUMBIN is designed to work well with all integer values 0 < k <= n. To run the program, the user simply runs the executable version and inputs the information requested by the program. The program is not designed to weed out incorrect inputs, so the user must take care to make sure the inputs are correct. Once all input has been entered, the program calculates and lists the result. The CUMBIN program is written in C. It was developed on an IBM AT with a numeric co-processor using Microsoft C 5.0. Because the source code is written using standard C structures and functions, it should compile correctly with most C compilers. The program format is interactive. It has been implemented under DOS 3.2 and has a memory requirement of 26K. CUMBIN was developed in 1988.

A comparative study of interprofessional education in global health care

PubMed Central

Herath, Chulani; Zhou, Yangfeng; Gan, Yong; Nakandawire, Naomie; Gong, Yanghong; Lu, Zuxun

2017-01-01

Abstract Background: The World Health Organization (WHO) and its partners identify interprofessional (IP) collaboration in education and practice as an innovative strategy that plays an important role in mitigating the global health workforce crisis. Evidence on the practice of global health level in interprofessional education (IPE) is scarce and hampered due to the absence of aggregate information. Therefore, this systematic review was conducted to examine the incidences of IPE and summarize the main features about the IPE programs in undergraduate and postgraduate education in developed and developing countries. Methods: The PubMed, Embase, Web of Science, and Google Scholar were searched from their inception to January 31, 2016 for relevant studies regarding the development of IPE worldwide, IPE undergraduate and postgraduate programs, IP interaction in health education, IPE content, clinical placements, and teaching methods. Countries in which a study was conducted were classified as developed and developing countries according to the definition by the United Nations (UN) in 2014. Results: A total of 65 studies from 41 countries met our inclusion criteria, including 45 studies from 25 developed countries and 20 studies from 16 developing countries. Compared with developing countries, developed countries had more IPE initiatives. IPE programs were mostly at the undergraduate level. Overall, the university was the most common academic institution that provided IPE programs. The contents of the curricula were mainly designed to provide IP knowledge, skills, and values that aimed at developing IP competencies. IPE clinical placements were typically based in hospitals, community settings, or both. The didactic and interactive teaching methods varied significantly within and across universities where they conducted IPE programs. Among all health care disciplines, nursing was the discipline that conducted most of the IPE programs. Conclusion: This systematic review illustrated that the IPE programs vary substantially across countries. Many countries, especially the academic institutions are benefiting from the implementation of IPE programs. There is a need to strengthen health education policies at global level aiming at initiating IPE programs in relevant institutions. PMID:28930816

Advanced Simulation and Computing Fiscal Year 2016 Implementation Plan, Version 0

DOE Office of Scientific and Technical Information (OSTI.GOV)

McCoy, M.; Archer, B.; Hendrickson, B.

2015-08-27

The Stockpile Stewardship Program (SSP) is an integrated technical program for maintaining the safety, surety, and reliability of the U.S. nuclear stockpile. The SSP uses nuclear test data, computational modeling and simulation, and experimental facilities to advance understanding of nuclear weapons. It includes stockpile surveillance, experimental research, development and engineering programs, and an appropriately scaled production capability to support stockpile requirements. This integrated national program requires the continued use of experimental facilities and programs, and the computational capabilities to support these programs. The purpose of this IP is to outline key work requirements to be performed and to control individualmore » work activities within the scope of work. Contractors may not deviate from this plan without a revised WA or subsequent IP.« less

Using Importance-Performance Analysis To Evaluate Teaching Effectiveness.

ERIC Educational Resources Information Center

Attarian, Aram

This paper introduces Importance-Performance (IP) analysis as a method to evaluate teaching effectiveness in a university outdoor program. Originally developed for use in the field of marketing, IP analysis is simple and easy to administer, and provides the instructor with a visual representation of what teaching attributes are important, how…

Nuclear inositol 1,4,5-trisphosphate is a necessary and conserved signal for the induction of both pathological and physiological cardiomyocyte hypertrophy.

PubMed

Arantes, Lilian A M; Aguiar, Carla J; Amaya, Maria Jimena; Figueiró, Núbia C G; Andrade, Lídia M; Rocha-Resende, Cibele; Resende, Rodrigo R; Franchini, K G; Guatimosim, Silvia; Leite, M Fatima

2012-10-01

It is well established that inositol 1,4,5-trisphosphate (IP3) dependent Ca(2+) signaling plays a crucial role in cardiomyocyte hypertrophy. However, it is not yet known whether nuclear IP3 represents a Ca(2+) mobilizing pathway involved in this process. The goal of the current work was to investigate the specific role of nuclear IP3 in cardiomyocyte hypertrophic response. In this work, we used an adenovirus construct that selectively buffers IP3 in the nuclear region of neonatal cardiomyocytes. We showed for the first time that nuclear IP3 mediates endothelin-1 (ET-1) induced hypertrophy. We also found that both calcineurin (Cn)/nuclear factor of activated T Cells (NFAT) and histone deacetylase-5 (HDAC5) pathways require nuclear IP3 to mediate pathological cardiomyocyte growth. Additionally, we found that nuclear IP3 buffering inhibited insulin-like growth factor-1 (IGF-1) induced hypertrophy and prevented reexpression of fetal gene program. Together, these results demonstrated that nuclear IP3 is an essential and a conserved signal for both pathological and physiological forms of cardiomyocyte hypertrophy. Copyright © 2012. Published by Elsevier Ltd.

Operational Planning for Multiple Heterogeneous Unmanned Aerial Vehicles in Three Dimensions

DTIC Science & Technology

2009-06-01

human input in the planning process. Two solution methods are presented: (1) a mixed-integer program, and (2) an algorithm that utilizes a metaheuristic ...and (2) an algorithm that utilizes a metaheuristic to generate composite variables for a linear program, called the Composite Operations Planning...that represent a path and an associated type of UAV. The reformulation is incorporated into an algorithm that uses a metaheuristic to generate the

Forest management and economics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Buongiorno, J.; Gilless, J.K.

1987-01-01

This volume provides a survey of quantitative methods, guiding the reader through formulation and analysis of models that address forest management problems. The authors use simple mathematics, graphics, and short computer programs to explain each method. Emphasizing applications, they discuss linear, integer, dynamic, and goal programming; simulation; network modeling; and econometrics, as these relate to problems of determining economic harvest schedules in even-aged and uneven-aged forests, the evaluation of forest policies, multiple-objective decision making, and more.

Modeling Road Vulnerability to Snow Using Mixed Integer Optimization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rodriguez, Tony K; Omitaomu, Olufemi A; Ostrowski, James A

As the number and severity of snowfall events continue to grow, the need to intelligently direct road maintenance during these snowfall events will also grow. In several locations, local governments lack the resources to completely treat all roadways during snow events. Furthermore, some governments utilize only traffic data to determine which roads should be treated. As a result, many schools, businesses, and government offices must be unnecessarily closed, which directly impacts the social, educational, and economic well-being of citizens and institutions. In this work, we propose a mixed integer programming formulation to optimally allocate resources to manage snowfall on roadsmore » using meteorological, geographical, and environmental parameters. Additionally, we evaluate the impacts of an increase in budget for winter road maintenance on snow control resources.« less

DORMAN computer program (study 2.5). Volume 2: User's guide and programmer's guide. [development of data bank for computerized information storage of NASA programs

NASA Technical Reports Server (NTRS)

Wray, S. T., Jr.

1973-01-01

The DORMAN program was developed to create and modify a data bank containing data decks which serve as input to the DORCA Computer Program. Via a remote terminal a user can access the bank, extract any data deck, modify that deck, output the modified deck to be input to the DORCA program, and save the modified deck in the data bank. This computer program is an assist in the utilization of the DORCA program. The program is dimensionless and operates almost entirely in integer mode. The program was developed on the CDC 6400/7600 complex for implementation on a UNIVAC 1108 computer.

Counting Triangles to Sum Squares

ERIC Educational Resources Information Center

DeMaio, Joe

2012-01-01

Counting complete subgraphs of three vertices in complete graphs, yields combinatorial arguments for identities for sums of squares of integers, odd integers, even integers and sums of the triangular numbers.

Slip and Slide Method of Factoring Trinomials with Integer Coefficients over the Integers

ERIC Educational Resources Information Center

Donnell, William A.

2012-01-01

In intermediate and college algebra courses there are a number of methods for factoring quadratic trinomials with integer coefficients over the integers. Some of these methods have been given names, such as trial and error, reversing FOIL, AC method, middle term splitting method and slip and slide method. The purpose of this article is to discuss…

Obstacles and Affordances for Integer Reasoning: An Analysis of Children's Thinking and the History of Mathematics

ERIC Educational Resources Information Center

Bishop, Jessica Pierson; Lamb, Lisa L.; Philipp, Randolph A.; Whitacre, Ian; Schappelle, Bonnie P.; Lewis, Melinda L.

2014-01-01

We identify and document 3 cognitive obstacles, 3 cognitive affordances, and 1 type of integer understanding that can function as either an obstacle or affordance for learners while they extend their numeric domains from whole numbers to include negative integers. In particular, we highlight 2 key subsets of integer reasoning: understanding or…

Anisotropic fractal media by vector calculus in non-integer dimensional space

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru

2014-08-15

A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensionalmore » space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media.« less

Staffing and structure of infection prevention and control programs.

PubMed

Stone, Patricia W; Dick, Andrew; Pogorzelska, Monika; Horan, Teresa C; Furuya, E Yoko; Larson, Elaine

2009-06-01

The nature of infection prevention and control is changing; however, little is known about current staffing and structure of infection prevention and control programs. Our objectives were to provide a snapshot of the staffing and structure of hospital-based infection prevention and control programs in the United States. A Web-based survey was sent to 441 hospitals that participate in the National Healthcare Safety Network. The response rate was 66% (n = 289); data were examined on 821 professionals. Infection preventionist (IP) staffing was significantly negatively related to bed size, with higher staffing in smaller hospitals (P < .001). Median staffing was 1 IP per 167 beds. Forty-seven percent of IPs were certified, and 24 percent had less than 2 years of experience. Most directors or hospital epidemiologists were reported to have authority to close beds for outbreaks always or most of the time (n = 225, 78%). Only 32% (n = 92) reported using an electronic surveillance system to track infections. This study is the first to provide a comprehensive description of current infection prevention and control staffing, organization, and support in a select group of hospitals across the nation. Further research is needed to identify effective staffing levels for various hospital types as well as examine how the IP role is changing over time.

Staffing and structure of infection prevention and control programs

PubMed Central

Stone, Patricia W.; Dick, Andrew; Pogorzelska, Monika; Horan, Teresa C.; Furuya, E. Yoko; Larson, Elaine

2009-01-01

Background The nature of infection prevention and control is changing; however, little is known about current staffing and structure of infection prevention and control programs. Methods Our objectives were to provide a snapshot of the staffing and structure of hospital-based infection prevention and control programs in the United States. A Web-based survey was sent to 441 hospitals that participate in the National Healthcare Safety Network. Results The response rate was 66% (n = 289); data were examined on 821 professionals. Infection preventionist (IP) staffing was significantly negatively related to bed size, with higher staffing in smaller hospitals (P < .001). Median staffing was 1 IP per 167 beds. Forty-seven percent of IPs were certified, and 24 percent had less than 2 years of experience. Most directors or hospital epidemiologists were reported to have authority to close beds for outbreaks always or most of the time (n = 225, 78%). Only 32% (n = 92) reported using an electronic surveillance system to track infections. Conclusion This study is the first to provide a comprehensive description of current infection prevention and control staffing, organization, and support in a select group of hospitals across the nation. Further research is needed to identify effective staffing levels for various hospital types as well as examine how the IP role is changing over time. PMID:19201510

Techniques for computing the discrete Fourier transform using the quadratic residue Fermat number systems

NASA Technical Reports Server (NTRS)

Truong, T. K.; Chang, J. J.; Hsu, I. S.; Pei, D. Y.; Reed, I. S.

1986-01-01

The complex integer multiplier and adder over the direct sum of two copies of finite field developed by Cozzens and Finkelstein (1985) is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplication over the rings of integers modulo Fermat numbers can be performed by means of two integer multiplications, whereas the complex integer multiplication requires three integer multiplications. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed to compute a systolic array of the DFT can be reduced substantially. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Approaches in highly parameterized inversion - GENIE, a general model-independent TCP/IP run manager

USGS Publications Warehouse

Muffels, Christopher T.; Schreuder, Willem A.; Doherty, John E.; Karanovic, Marinko; Tonkin, Matthew J.; Hunt, Randall J.; Welter, David E.

2012-01-01

GENIE is a model-independent suite of programs that can be used to generally distribute, manage, and execute multiple model runs via the TCP/IP infrastructure. The suite consists of a file distribution interface, a run manage, a run executer, and a routine that can be compiled as part of a program and used to exchange model runs with the run manager. Because communication is via a standard protocol (TCP/IP), any computer connected to the Internet can serve in any of the capacities offered by this suite. Model independence is consistent with the existing template and instruction file protocols of the widely used PEST parameter estimation program. This report describes (1) the problem addressed; (2) the approach used by GENIE to queue, distribute, and retrieve model runs; and (3) user instructions, classes, and functions developed. It also includes (4) an example to illustrate the linking of GENIE with Parallel PEST using the interface routine.

Communication and respect for people with dementia: student learning (CARDS) - the development and evaluation of a pilot of an education intervention for pre-qualifying healthcare students.

PubMed

Wood, Julia Helen; Alushi, Ledia; Hammond, John A

2016-04-01

Dementia is an international health priority and healthcare students need to be prepared to work with people living with dementia. There is a paucity of the literature describing appropriate educational interventions for pre-qualifying healthcare students and even fewer that are evaluated. Based on available evidence, an education program was developed aiming to increase students' knowledge and confidence in working with people with dementia (PWD). An introductory program (IP) of classroom sessions and workshops was followed by a volunteer care home experience (CHE) (4 × 3 h). Piloted with physiotherapy (IP n = 55; CHE n = 6) and nursing students (IP n = 20; CHE n = 7), using a survey design, knowledge, and perceived confidence for working with PWD were measured at four time points; baseline, after the IP, after the CHE, and six months later. The data were analyzed using paired t-tests or non-parametric equivalents. Knowledge scores increased after the IP (Time 1-2, p < 0.001, n = 48) and increases were retained after six months (Time 1-4, p < 0.001, n = 40). Perceived confidence increased at six months follow up (Time 1-4, p < 0.001, n = 40) with peaks after the IP (Time 1-2, p < 0.001, n = 47) and CHE (Time 2-3, p = 0.004, n = 13). Physiotherapy and nursing students did not differ on knowledge, but nursing students were more confident at baseline and after the IP. Prior experience equated with greater confidence but no more knowledge. Findings indicate that students' knowledge and confidence to work with PWD improves after this educational intervention, with confidence improving more when supplemented by experience.

X-Windows Socket Widget Class

NASA Technical Reports Server (NTRS)

Barry, Matthew R.

2006-01-01

The X-Windows Socket Widget Class ("Class" is used here in the object-oriented-programming sense of the word) was devised to simplify the task of implementing network connections for graphical-user-interface (GUI) computer programs. UNIX Transmission Control Protocol/Internet Protocol (TCP/IP) socket programming libraries require many method calls to configure, operate, and destroy sockets. Most X Windows GUI programs use widget sets or toolkits to facilitate management of complex objects. The widget standards facilitate construction of toolkits and application programs. The X-Windows Socket Widget Class encapsulates UNIX TCP/IP socket-management tasks within the framework of an X Windows widget. Using the widget framework, X Windows GUI programs can treat one or more network socket instances in the same manner as that of other graphical widgets, making it easier to program sockets. Wrapping ISP socket programming libraries inside a widget framework enables a programmer to treat a network interface as though it were a GUI.

Scheduling algorithms for rapid imaging using agile Cubesat constellations

NASA Astrophysics Data System (ADS)

Nag, Sreeja; Li, Alan S.; Merrick, James H.

2018-02-01

Distributed Space Missions such as formation flight and constellations, are being recognized as important Earth Observation solutions to increase measurement samples over space and time. Cubesats are increasing in size (27U, ∼40 kg in development) with increasing capabilities to host imager payloads. Given the precise attitude control systems emerging in the commercial market, Cubesats now have the ability to slew and capture images within short notice. We propose a modular framework that combines orbital mechanics, attitude control and scheduling optimization to plan the time-varying, full-body orientation of agile Cubesats in a constellation such that they maximize the number of observed images and observation time, within the constraints of Cubesat hardware specifications. The attitude control strategy combines bang-bang and PD control, with constraints such as power consumption, response time, and stability factored into the optimality computations and a possible extension to PID control to account for disturbances. Schedule optimization is performed using dynamic programming with two levels of heuristics, verified and improved upon using mixed integer linear programming. The automated scheduler is expected to run on ground station resources and the resultant schedules uplinked to the satellites for execution, however it can be adapted for onboard scheduling, contingent on Cubesat hardware and software upgrades. The framework is generalizable over small steerable spacecraft, sensor specifications, imaging objectives and regions of interest, and is demonstrated using multiple 20 kg satellites in Low Earth Orbit for two case studies - rapid imaging of Landsat's land and coastal images and extended imaging of global, warm water coral reefs. The proposed algorithm captures up to 161% more Landsat images than nadir-pointing sensors with the same field of view, on a 2-satellite constellation over a 12-h simulation. Integer programming was able to verify that optimality of the dynamic programming solution for single satellites was within 10%, and find up to 5% more optimal solutions. The optimality gap for constellations was found to be 22% at worst, but the dynamic programming schedules were found at nearly four orders of magnitude better computational speed than integer programming. The algorithm can include cloud cover predictions, ground downlink windows or any other spatial, temporal or angular constraints into the orbital module and be integrated into planning tools for agile constellations.

Case study and lessons learned for the Great Lakes ITS Program, Airport ITS Integration and the Road Infrastructure Management System projects, final report, Wayne County, Michigan

DOT National Transportation Integrated Search

2007-03-02

This report presents the case study and lessons learned for the national evaluation of the Great Lakes Intelligent Transportation Systems (GLITS) Airport ITS Integration and Road Infrastructure Management System (RIMS) projects. The Airport ITS Integ...

A Procedure Using Calculators to Express Answers in Fractional Form.

ERIC Educational Resources Information Center

Carlisle, Earnest

A procedure is described that enables students to perform operations on fractions with a calculator, expressing the answer as a fraction. Patterns using paper-and-pencil procedures for each operation with fractions are presented. A microcomputer software program illustrates how the answer can be found using integer values of the numerators and…

Automated Test-Form Generation

ERIC Educational Resources Information Center

van der Linden, Wim J.; Diao, Qi

2011-01-01

In automated test assembly (ATA), the methodology of mixed-integer programming is used to select test items from an item bank to meet the specifications for a desired test form and optimize its measurement accuracy. The same methodology can be used to automate the formatting of the set of selected items into the actual test form. Three different…

A strategic assessment of biofuels development in the Western States

Treesearch

Kenneth E. Skog; Robert Rummer; Bryan Jenkins; Nathan Parker; Peter Tittman; Quinn Hart; Richard Nelson; Ed Gray; Anneliese Schmidt; Marcia Patton-Mallory; Gordon Gayle

2009-01-01

The Western Governors' Association assessment of biofuels potential in western states estimated the location and capacity of biofuels plants that could potentially be built for selected gasoline prices in 2015 using a mixed integer programming model. The model included information on forest biomass supply curves by county (developed using Forest Service FIA data...

An Integer Programming-Based Generalized Vehicle Routing Approach for Printed Circuit Board Assembly Optimization

ERIC Educational Resources Information Center

Seth, Anupam

2009-01-01

Production planning and scheduling for printed circuit, board assembly has so far defied standard operations research approaches due to the size and complexity of the underlying problems, resulting in unexploited automation flexibility. In this thesis, the increasingly popular collect-and-place machine configuration is studied and the assembly…

Elements of Mathematics, Book O: Intuitive Background. Chapter 2, The Integers.

ERIC Educational Resources Information Center

Exner, Robert; And Others

The sixteen chapters of this book provide the core materials for the Elements of Mathematics Program, a secondary sequence developed for highly motivated students with strong verbal abilities. The sequence is based on a functional-relational approach to mathematics teaching, and emphasizes teaching by analysis of real-life situations. This text is…

Algorithms for Scheduling and Network Problems

DTIC Science & Technology

1991-09-01

time. We already know, by Lemma 2.2.1, that WOPT = O(log( mpU )), so if we could solve this integer program optimally we would be done. However, the...Folydirat, 15:177-191, 1982. [6] I.S. Belov and Ya. N. Stolin. An algorithm in a single path operations scheduling problem. In Mathematical Economics and

Enhancing Autonomy of Aerial Systems Via Integration of Visual Sensors into Their Avionics Suite

DTIC Science & Technology

2016-09-01

aerial platform for subsequent visual sensor integration. 14. SUBJECT TERMS autonomous system, quadrotors, direct method, inverse ...CONTROLLER ARCHITECTURE .....................................................43 B. INVERSE DYNAMICS IN THE VIRTUAL DOMAIN ......................45 1...control station GPS Global-Positioning System IDVD inverse dynamics in the virtual domain ILP integer linear program INS inertial-navigation system

The Efficiency of Split Panel Designs in an Analysis of Variance Model

PubMed Central

Wang, Wei-Guo; Liu, Hai-Jun

2016-01-01

We consider split panel design efficiency in analysis of variance models, that is, the determination of the cross-sections series optimal proportion in all samples, to minimize parametric best linear unbiased estimators of linear combination variances. An orthogonal matrix is constructed to obtain manageable expression of variances. On this basis, we derive a theorem for analyzing split panel design efficiency irrespective of interest and budget parameters. Additionally, relative estimator efficiency based on the split panel to an estimator based on a pure panel or a pure cross-section is present. The analysis shows that the gains from split panel can be quite substantial. We further consider the efficiency of split panel design, given a budget, and transform it to a constrained nonlinear integer programming. Specifically, an efficient algorithm is designed to solve the constrained nonlinear integer programming. Moreover, we combine one at time designs and factorial designs to illustrate the algorithm’s efficiency with an empirical example concerning monthly consumer expenditure on food in 1985, in the Netherlands, and the efficient ranges of the algorithm parameters are given to ensure a good solution. PMID:27163447

A farm-level precision land management framework based on integer programming

PubMed Central

Li, Qi; Hu, Guiping; Jubery, Talukder Zaki; Ganapathysubramanian, Baskar

2017-01-01

Farmland management involves several planning and decision making tasks including seed selection and irrigation management. A farm-level precision farmland management model based on mixed integer linear programming is proposed in this study. Optimal decisions are designed for pre-season planning of crops and irrigation water allocation. The model captures the effect of size and shape of decision scale as well as special irrigation patterns. The authors illustrate the model with a case study on a farm in the state of California in the U.S. and show the model can capture the impact of precision farm management on profitability. The results show that threefold increase of annual net profit for farmers could be achieved by carefully choosing irrigation and seed selection. Although farmers could increase profits by applying precision management to seed or irrigation alone, profit increase is more significant if farmers apply precision management on seed and irrigation simultaneously. The proposed model can also serve as a risk analysis tool for farmers facing seasonal irrigation water limits as well as a quantitative tool to explore the impact of precision agriculture. PMID:28346499

Microgrid Optimal Scheduling With Chance-Constrained Islanding Capability

DOE PAGES

Liu, Guodong; Starke, Michael R.; Xiao, B.; ...

2017-01-13

To facilitate the integration of variable renewable generation and improve the resilience of electricity sup-ply in a microgrid, this paper proposes an optimal scheduling strategy for microgrid operation considering constraints of islanding capability. A new concept, probability of successful islanding (PSI), indicating the probability that a microgrid maintains enough spinning reserve (both up and down) to meet local demand and accommodate local renewable generation after instantaneously islanding from the main grid, is developed. The PSI is formulated as mixed-integer linear program using multi-interval approximation taking into account the probability distributions of forecast errors of wind, PV and load. With themore » goal of minimizing the total operating cost while preserving user specified PSI, a chance-constrained optimization problem is formulated for the optimal scheduling of mirogrids and solved by mixed integer linear programming (MILP). Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator and a battery demonstrate the effectiveness of the proposed scheduling strategy. Lastly, we verify the relationship between PSI and various factors.« less

A hybrid inventory management system respondingto regular demand and surge demand

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mohammad S. Roni; Mingzhou Jin; Sandra D. Eksioglu

2014-06-01

This paper proposes a hybrid policy for a stochastic inventory system facing regular demand and surge demand. The combination of two different demand patterns can be observed in many areas, such as healthcare inventory and humanitarian supply chain management. The surge demand has a lower arrival rate but higher demand volume per arrival. The solution approach proposed in this paper incorporates the level crossing method and mixed integer programming technique to optimize the hybrid inventory policy with both regular orders and emergency orders. The level crossing method is applied to obtain the equilibrium distributions of inventory levels under a givenmore » policy. The model is further transformed into a mixed integer program to identify an optimal hybrid policy. A sensitivity analysis is conducted to investigate the impact of parameters on the optimal inventory policy and minimum cost. Numerical results clearly show the benefit of using the proposed hybrid inventory model. The model and solution approach could help healthcare providers or humanitarian logistics providers in managing their emergency supplies in responding to surge demands.« less

Chemotherapy appointment scheduling under uncertainty using mean-risk stochastic integer programming.

PubMed

Alvarado, Michelle; Ntaimo, Lewis

2018-03-01

Oncology clinics are often burdened with scheduling large volumes of cancer patients for chemotherapy treatments under limited resources such as the number of nurses and chairs. These cancer patients require a series of appointments over several weeks or months and the timing of these appointments is critical to the treatment's effectiveness. Additionally, the appointment duration, the acuity levels of each appointment, and the availability of clinic nurses are uncertain. The timing constraints, stochastic parameters, rising treatment costs, and increased demand of outpatient oncology clinic services motivate the need for efficient appointment schedules and clinic operations. In this paper, we develop three mean-risk stochastic integer programming (SIP) models, referred to as SIP-CHEMO, for the problem of scheduling individual chemotherapy patient appointments and resources. These mean-risk models are presented and an algorithm is devised to improve computational speed. Computational results were conducted using a simulation model and results indicate that the risk-averse SIP-CHEMO model with the expected excess mean-risk measure can decrease patient waiting times and nurse overtime when compared to deterministic scheduling algorithms by 42 % and 27 %, respectively.

Supporting Dynamic Spectrum Access in Heterogeneous LTE+ Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Luiz A. DaSilva; Ryan E. Irwin; Mike Benonis

As early as 2014, mobile network operators’ spectral capac- ity is expected to be overwhelmed by the demand brought on by new devices and applications. With Long Term Evo- lution Advanced (LTE+) networks likely as the future one world 4G standard, network operators may need to deploy a Dynamic Spectrum Access (DSA) overlay in Heterogeneous Networks (HetNets) to extend coverage, increase spectrum efficiency, and increase the capacity of these networks. In this paper, we propose three new management frameworks for DSA in an LTE+ HetNet: Spectrum Accountability Client, Cell Spectrum Management, and Domain Spectrum Man- agement. For these spectrum managementmore » frameworks, we define protocol interfaces and operational signaling scenar- ios to support cooperative sensing, spectrum lease manage- ment, and alarm scenarios for rule adjustment. We also quan- tify, through integer programs, the benefits of using DSA in an LTE+ HetNet, that can opportunistically reuse vacant TV and GSM spectrum. Using integer programs, we consider a topology using Geographic Information System data from the Blacksburg, VA metro area to assess the realistic benefits of DSA in an LTE+ HetNet.« less

Two Methods for Efficient Solution of the Hitting-Set Problem

NASA Technical Reports Server (NTRS)

Vatan, Farrokh; Fijany, Amir

2005-01-01

A paper addresses much of the same subject matter as that of Fast Algorithms for Model-Based Diagnosis (NPO-30582), which appears elsewhere in this issue of NASA Tech Briefs. However, in the paper, the emphasis is more on the hitting-set problem (also known as the transversal problem), which is well known among experts in combinatorics. The authors primary interest in the hitting-set problem lies in its connection to the diagnosis problem: it is a theorem of model-based diagnosis that in the set-theory representation of the components of a system, the minimal diagnoses of a system are the minimal hitting sets of the system. In the paper, the hitting-set problem (and, hence, the diagnosis problem) is translated from a combinatorial to a computational problem by mapping it onto the Boolean satisfiability and integer- programming problems. The paper goes on to describe developments nearly identical to those summarized in the cited companion NASA Tech Briefs article, including the utilization of Boolean-satisfiability and integer- programming techniques to reduce the computation time and/or memory needed to solve the hitting-set problem.

Integer-Linear-Programing Optimization in Scalable Video Multicast with Adaptive Modulation and Coding in Wireless Networks

PubMed Central

Lee, Chaewoo

2014-01-01

The advancement in wideband wireless network supports real time services such as IPTV and live video streaming. However, because of the sharing nature of the wireless medium, efficient resource allocation has been studied to achieve a high level of acceptability and proliferation of wireless multimedia. Scalable video coding (SVC) with adaptive modulation and coding (AMC) provides an excellent solution for wireless video streaming. By assigning different modulation and coding schemes (MCSs) to video layers, SVC can provide good video quality to users in good channel conditions and also basic video quality to users in bad channel conditions. For optimal resource allocation, a key issue in applying SVC in the wireless multicast service is how to assign MCSs and the time resources to each SVC layer in the heterogeneous channel condition. We formulate this problem with integer linear programming (ILP) and provide numerical results to show the performance under 802.16 m environment. The result shows that our methodology enhances the overall system throughput compared to an existing algorithm. PMID:25276862

Checking Equivalence of SPMD Programs Using Non-Interference

DTIC Science & Technology

2010-01-29

with it hopes to go beyond the limits of Moore’s law, but also worries that programming will become harder [5]. One of the reasons why parallel...array name in G or L, and e is an arithmetic expression of integer type. In the CUDA code shown in Section 3, b and t are represented by coreId and...b+ t. A second, optimized version of the program (using function “reverse2”, see Section 3) can be modeled as a tuple P2 = ( G ,L2, F 2), with G same

Parallel scheduling of recursively defined arrays

NASA Technical Reports Server (NTRS)

Myers, T. J.; Gokhale, M. B.

1986-01-01

A new method of automatic generation of concurrent programs which constructs arrays defined by sets of recursive equations is described. It is assumed that the time of computation of an array element is a linear combination of its indices, and integer programming is used to seek a succession of hyperplanes along which array elements can be computed concurrently. The method can be used to schedule equations involving variable length dependency vectors and mutually recursive arrays. Portions of the work reported here have been implemented in the PS automatic program generation system.

Securing Voice over IP Conferencing with Decentralized Group Encryption

DTIC Science & Technology

2007-09-04

media stream. Call data can then be encrypted and decrypted. Zfone is available as a plug-in for a number of VoIP programs, including Gizmo [13...Terminal. http://www.l- 3com.com/csw/product/specs/Airborne/TCDLAir.asp. [13] The Gizmo Project. http://gizmoproject.com. [14] The OpenSSL

Sums of Consecutive Integers

ERIC Educational Resources Information Center

Pong, Wai Yan

2007-01-01

We begin by answering the question, "Which natural numbers are sums of consecutive integers?" We then go on to explore the set of lengths (numbers of summands) in the decompositions of an integer as such sums.

The effectiveness of incorporating a real-time oculometer system in a commercial flight training program

NASA Technical Reports Server (NTRS)

Jones, D. H.; Coates, G. D.; Kirby, R. H.

1983-01-01

The effectiveness of incroporating a real-time oculometer system into a Boeing 737 commercial flight training program was studied. The study combined a specialized oculometer system with sophisticated video equipment that would allow instructor pilots (IPs) to monitor pilot and copilot trainees' instrument scan behavior in real-time, and provide each trainee with video tapes of his/her instrument scanning behavior for each training session. The IPs' performance ratings and trainees' self-ratings were compared to the performance ratings by IPs and trainees in a control group. The results indicate no difference in IP ratings or trainees' self-ratings for the control and experimental groups. The results indicated that the major beneficial role of a real-time oculometer system for pilots and copilots having a significant amount of flight experience would be for problem solving or refinement of instrument scanning behavior rather than a general instructional scheme. It is suggested that this line of research be continued with the incorporation of objective data (e.g., state of the aircraft data), measures of cost effectiveness and with trainees having less flight experience.

lsjk—a C++ library for arbitrary-precision numeric evaluation of the generalized log-sine functions

NASA Astrophysics Data System (ADS)

Kalmykov, M. Yu.; Sheplyakov, A.

2005-10-01

Generalized log-sine functions Lsj(k)(θ) appear in higher order ɛ-expansion of different Feynman diagrams. We present an algorithm for the numerical evaluation of these functions for real arguments. This algorithm is implemented as a C++ library with arbitrary-precision arithmetics for integer 0⩽k⩽9 and j⩾2. Some new relations and representations of the generalized log-sine functions are given. Program summaryTitle of program:lsjk Catalogue number:ADVS Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVS Program obtained from: CPC Program Library, Queen's University of Belfast, N. Ireland Licensing terms: GNU General Public License Computers:all Operating systems:POSIX Programming language:C++ Memory required to execute:Depending on the complexity of the problem, at least 32 MB RAM recommended No. of lines in distributed program, including testing data, etc.:41 975 No. of bytes in distributed program, including testing data, etc.:309 156 Distribution format:tar.gz Other programs called:The CLN library for arbitrary-precision arithmetics is required at version 1.1.5 or greater External files needed:none Nature of the physical problem:Numerical evaluation of the generalized log-sine functions for real argument in the region 0<θ<π. These functions appear in Feynman integrals Method of solution:Series representation for the real argument in the region 0<θ<π Restriction on the complexity of the problem:Limited up to Lsj(9)(θ), and j is an arbitrary integer number. Thus, all function up to the weight 12 in the region 0<θ<π can be evaluated. The algorithm can be extended up to higher values of k(k>9) without modification Typical running time:Depending on the complexity of problem. See text below.

Vectors to Increase Production Efficiency of Inducible Pluripotent Stem Cell (iPSC) | NCI Technology Transfer Center | TTC

Cancer.gov

This invention describes the discovery that specific p53 isoform increase the number of inducible pluripotent stem cells (iPS). It is known that the activity of p53 regulates the self-renewal and pluripotency of normal and cancer stem cells, and also affects re-programming efficiency of iPS cells. This p53 isoform-based technology provides a more natural process of increasing iPS cell production than previous methods of decreasing p53. NCI seeks licensees for this technology.

Ascent/Descent Software

NASA Technical Reports Server (NTRS)

Brown, Charles; Andrew, Robert; Roe, Scott; Frye, Ronald; Harvey, Michael; Vu, Tuan; Balachandran, Krishnaiyer; Bly, Ben

2012-01-01

The Ascent/Descent Software Suite has been used to support a variety of NASA Shuttle Program mission planning and analysis activities, such as range safety, on the Integrated Planning System (IPS) platform. The Ascent/Descent Software Suite, containing Ascent Flight Design (ASC)/Descent Flight Design (DESC) Configuration items (Cis), lifecycle documents, and data files used for shuttle ascent and entry modeling analysis and mission design, resides on IPS/Linux workstations. A list of tools in Navigation (NAV)/Prop Software Suite represents tool versions established during or after the IPS Equipment Rehost-3 project.

DB90: A Fortran Callable Relational Database Routine for Scientific and Engineering Computer Programs

NASA Technical Reports Server (NTRS)

Wrenn, Gregory A.

2005-01-01

This report describes a database routine called DB90 which is intended for use with scientific and engineering computer programs. The software is written in the Fortran 90/95 programming language standard with file input and output routines written in the C programming language. These routines should be completely portable to any computing platform and operating system that has Fortran 90/95 and C compilers. DB90 allows a program to supply relation names and up to 5 integer key values to uniquely identify each record of each relation. This permits the user to select records or retrieve data in any desired order.

Synchronic interval Gaussian mixed-integer programming for air quality management.

PubMed

Cheng, Guanhui; Huang, Guohe Gordon; Dong, Cong

2015-12-15

To reveal the synchronism of interval uncertainties, the tradeoff between system optimality and security, the discreteness of facility-expansion options, the uncertainty of pollutant dispersion processes, and the seasonality of wind features in air quality management (AQM) systems, a synchronic interval Gaussian mixed-integer programming (SIGMIP) approach is proposed in this study. A robust interval Gaussian dispersion model is developed for approaching the pollutant dispersion process under interval uncertainties and seasonal variations. The reflection of synchronic effects of interval uncertainties in the programming objective is enabled through introducing interval functions. The proposition of constraint violation degrees helps quantify the tradeoff between system optimality and constraint violation under interval uncertainties. The overall optimality of system profits of an SIGMIP model is achieved based on the definition of an integrally optimal solution. Integer variables in the SIGMIP model are resolved by the existing cutting-plane method. Combining these efforts leads to an effective algorithm for the SIGMIP model. An application to an AQM problem in a region in Shandong Province, China, reveals that the proposed SIGMIP model can facilitate identifying the desired scheme for AQM. The enhancement of the robustness of optimization exercises may be helpful for increasing the reliability of suggested schemes for AQM under these complexities. The interrelated tradeoffs among control measures, emission sources, flow processes, receptors, influencing factors, and economic and environmental goals are effectively balanced. Interests of many stakeholders are reasonably coordinated. The harmony between economic development and air quality control is enabled. Results also indicate that the constraint violation degree is effective at reflecting the compromise relationship between constraint-violation risks and system optimality under interval uncertainties. This can help decision makers mitigate potential risks, e.g. insufficiency of pollutant treatment capabilities, exceedance of air quality standards, deficiency of pollution control fund, or imbalance of economic or environmental stress, in the process of guiding AQM. Copyright © 2015 Elsevier B.V. All rights reserved.

TH-EF-BRB-04: 4π Dynamic Conformal Arc Therapy Dynamic Conformal Arc Therapy (DCAT) for SBRT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chiu, T; Long, T; Tian, Z.

2016-06-15

Purpose: To develop an efficient and effective trajectory optimization methodology for 4π dynamic conformal arc treatment (4π DCAT) with synchronized gantry and couch motion; and to investigate potential clinical benefits for stereotactic body radiation therapy (SBRT) to breast, lung, liver and spine tumors. Methods: The entire optimization framework for 4π DCAT inverse planning consists of two parts: 1) integer programming algorithm and 2) particle swarm optimization (PSO) algorithm. The integer programming is designed to find an optimal solution for arc delivery trajectory with both couch and gantry rotation, while PSO minimize a non-convex objective function based on the selected trajectorymore » and dose-volume constraints. In this study, control point interaction is explicitly taken into account. Beam trajectory was modeled as a series of control points connected together to form a deliverable path. With linear treatment planning objectives, a mixed-integer program (MIP) was formulated. Under mild assumptions, the MIP is tractable. Assigning monitor units to control points along the path can be integrated into the model and done by PSO. The developed 4π DCAT inverse planning strategy is evaluated on SBRT cases and compared to clinically treated plans. Results: The resultant dose distribution of this technique was evaluated between 3D conformal treatment plan generated by Pinnacle treatment planning system and 4π DCAT on a lung SBRT patient case. Both plans share the same scale of MU, 3038 and 2822 correspondingly to 3D conformal plan and 4π DCAT. The mean doses for most of OARs were greatly reduced at 32% (cord), 70% (esophagus), 2.8% (lung) and 42.4% (stomach). Conclusion: Initial results in this study show the proposed 4π DCAT treatment technique can achieve better OAR sparing and lower MUs, which indicates that the developed technique is promising for high dose SBRT to reduce the risk of secondary cancer.« less

Bi-objective integer programming for RNA secondary structure prediction with pseudoknots.

PubMed

Legendre, Audrey; Angel, Eric; Tahi, Fariza

2018-01-15

RNA structure prediction is an important field in bioinformatics, and numerous methods and tools have been proposed. Pseudoknots are specific motifs of RNA secondary structures that are difficult to predict. Almost all existing methods are based on a single model and return one solution, often missing the real structure. An alternative approach would be to combine different models and return a (small) set of solutions, maximizing its quality and diversity in order to increase the probability that it contains the real structure. We propose here an original method for predicting RNA secondary structures with pseudoknots, based on integer programming. We developed a generic bi-objective integer programming algorithm allowing to return optimal and sub-optimal solutions optimizing simultaneously two models. This algorithm was then applied to the combination of two known models of RNA secondary structure prediction, namely MEA and MFE. The resulting tool, called BiokoP, is compared with the other methods in the literature. The results show that the best solution (structure with the highest F 1 -score) is, in most cases, given by BiokoP. Moreover, the results of BiokoP are homogeneous, regardless of the pseudoknot type or the presence or not of pseudoknots. Indeed, the F 1 -scores are always higher than 70% for any number of solutions returned. The results obtained by BiokoP show that combining the MEA and the MFE models, as well as returning several optimal and several sub-optimal solutions, allow to improve the prediction of secondary structures. One perspective of our work is to combine better mono-criterion models, in particular to combine a model based on the comparative approach with the MEA and the MFE models. This leads to develop in the future a new multi-objective algorithm to combine more than two models. BiokoP is available on the EvryRNA platform: https://EvryRNA.ibisc.univ-evry.fr .

AKLSQF - LEAST SQUARES CURVE FITTING

NASA Technical Reports Server (NTRS)

Kantak, A. V.

1994-01-01

The Least Squares Curve Fitting program, AKLSQF, computes the polynomial which will least square fit uniformly spaced data easily and efficiently. The program allows the user to specify the tolerable least squares error in the fitting or allows the user to specify the polynomial degree. In both cases AKLSQF returns the polynomial and the actual least squares fit error incurred in the operation. The data may be supplied to the routine either by direct keyboard entry or via a file. AKLSQF produces the least squares polynomial in two steps. First, the data points are least squares fitted using the orthogonal factorial polynomials. The result is then reduced to a regular polynomial using Sterling numbers of the first kind. If an error tolerance is specified, the program starts with a polynomial of degree 1 and computes the least squares fit error. The degree of the polynomial used for fitting is then increased successively until the error criterion specified by the user is met. At every step the polynomial as well as the least squares fitting error is printed to the screen. In general, the program can produce a curve fitting up to a 100 degree polynomial. All computations in the program are carried out under Double Precision format for real numbers and under long integer format for integers to provide the maximum accuracy possible. AKLSQF was written for an IBM PC X/AT or compatible using Microsoft's Quick Basic compiler. It has been implemented under DOS 3.2.1 using 23K of RAM. AKLSQF was developed in 1989.

Analysis misconception of integers in microteaching activities

NASA Astrophysics Data System (ADS)

Setyawati, R. D.; Indiati, I.

2018-05-01

This study view to analyse student misconceptions on integers in microteaching activities. This research used qualitative research design. An integers test contained questions from eight main areas of integers. The Integers material test includes (a) converting the image into fractions, (b) examples of positive numbers including rational numbers, (c) operations in fractions, (d) sorting fractions from the largest to the smallest, and vice versa; e) equate denominator, (f) concept of ratio mark, (g) definition of fraction, and (h) difference between fractions and parts. The results indicated an integers concepts: (1) the students have not been able to define concepts well based on the classification of facts in organized part; (2) The correlational concept: students have not been able to combine interrelated events in the form of general principles; and (3) theoretical concepts: students have not been able to use concepts that facilitate in learning the facts or events in an organized system.

Dynamic Flow Management Problems in Air Transportation

NASA Technical Reports Server (NTRS)

Patterson, Sarah Stock

1997-01-01

In 1995, over six hundred thousand licensed pilots flew nearly thirty-five million flights into over eighteen thousand U.S. airports, logging more than 519 billion passenger miles. Since demand for air travel has increased by more than 50% in the last decade while capacity has stagnated, congestion is a problem of undeniable practical significance. In this thesis, we will develop optimization techniques that reduce the impact of congestion on the national airspace. We start by determining the optimal release times for flights into the airspace and the optimal speed adjustment while airborne taking into account the capacitated airspace. This is called the Air Traffic Flow Management Problem (TFMP). We address the complexity, showing that it is NP-hard. We build an integer programming formulation that is quite strong as some of the proposed inequalities are facet defining for the convex hull of solutions. For practical problems, the solutions of the LP relaxation of the TFMP are very often integral. In essence, we reduce the problem to efficiently solving large scale linear programming problems. Thus, the computation times are reasonably small for large scale, practical problems involving thousands of flights. Next, we address the problem of determining how to reroute aircraft in the airspace system when faced with dynamically changing weather conditions. This is called the Air Traffic Flow Management Rerouting Problem (TFMRP) We present an integrated mathematical programming approach for the TFMRP, which utilizes several methodologies, in order to minimize delay costs. In order to address the high dimensionality, we present an aggregate model, in which we formulate the TFMRP as a multicommodity, integer, dynamic network flow problem with certain side constraints. Using Lagrangian relaxation, we generate aggregate flows that are decomposed into a collection of flight paths using a randomized rounding heuristic. This collection of paths is used in a packing integer programming formulation, the solution of which generates feasible and near-optimal routes for individual flights. The algorithm, termed the Lagrangian Generation Algorithm, is used to solve practical problems in the southwestern portion of United States in which the solutions are within 1% of the corresponding lower bounds.

Multidisciplinary Mentoring Programs to Enhance Junior Faculty Research Grant Success.

PubMed

Freel, Stephanie A; Smith, Paige C; Burns, Ebony N; Downer, Joanna B; Brown, Ann J; Dewhirst, Mark W

2017-10-01

Junior faculty face challenges in establishing independent research careers. Declining funding combined with a shift to multidisciplinary, collaborative science necessitates new mentorship models and enhanced institutional support. Two multidisciplinary mentorship programs to promote grant success for junior faculty were established at the Duke University School of Medicine beginning in 2011. These four-month programs-the Path to Independence Program (PtIP) for National Institutes of Health (NIH) R applicants and the K Club for NIH K applicants-use multiple senior faculty mentors and professional grant-writing staff to provide a 20-hour joint curriculum comprising a series of lectures, hands-on workshops, career development counseling, peer groups, and an internal study section. In March 2016, the authors analyzed the success rate for all NIH grants submitted by participants since program enrollment. In a 2015 postprogram survey, participants rated their feelings of support and competency across six skill factors. From October 2011 to March 2016, the programs engaged 265 senior faculty mentors, 145 PtIP participants, and 138 K Club participants. Success rates for NIH grant applications were 28% (61 awards/220 decisions) for PtIP participants-an increase over the 2010 Duke University junior faculty baseline of 11%-and 64% (38/59) for K Club participants. Respondents reported significantly increased feelings of support and self-ratings for each competency post program. The authors plan to expand the breadth of both the mentorship pool and faculty served. Broad implementation of similar programs elsewhere could bolster success, satisfaction, and retention of junior faculty investigators.

Transgenerational programming of longevity and reproduction by post-eclosion dietary manipulation in Drosophila

PubMed Central

Xia, Brian; de Belle, Steven

2016-01-01

Accumulating evidence suggests that early-life diet may program one's health status by causing permanent alternations in specific organs, tissues, or metabolic or homeostatic pathways, and such programming effects may propagate across generations through heritable epigenetic modifications. However, it remains uninvestigated whether postnatal dietary changes may program longevity across generations. To address this question of important biological and public health implications, newly-born flies (F0) were collected and subjected to various post-eclosion dietary manipulations (PDMs) with different protein-carbohydrate (i.e., LP, IP or HP for low-, intermediate- or high-protein) contents or a control diet (CD). Longevity and fecundity analyses were performed with these treated F0 flies and their F1, F2 and F3 offspring, while maintained on CD at all times. The LP and HP PDMs shortened longevity, while the IP PDM extended longevity significantly up to the F3 generation. Furthermore, the LP reduced while the IP PDM increased lifetime fecundity across the F0-F2 generations. Our observations establish the first animal model for studying transgenerational inheritance of nutritional programming of longevity, making it possible to investigate the underlying epigenetic mechanisms and identify gene targets for drug discovery in future studies. PMID:27025190

Thin Film Phase Transition Materials Development Program

DTIC Science & Technology

1985-04-01

and ̂ from f are consistent with a real, positive film thickness d. These conditions are written IP( td /4) = 0, d > 0, (49) where IP denotes...surface of the substrate of the form . aAC(a) + bBD (a) >< cAB(a) + dCD(a) where (a) represents a phase adsorbed on the substrate surface, and the

Training Interpreter Paraprofessionals to Assist in the Language Assessment of English Language Learners in Utah.

ERIC Educational Resources Information Center

Yoakum, Susie; Manuel-Dupont, Sonia

1997-01-01

Describes development of an interpreter paraprofessional (IP) program by Utah State University and Granite (Utah) school district in response to the unavailability of certified interpreters to assist in special education assessment of students who are English Language Learners. Stresses the importance of providing IPs with job-relevant training,…

Infusing Integrated Behavioral Health in an MSW Program: Curricula, Field, and Interprofessional Educational Activities

ERIC Educational Resources Information Center

Zerden, Lisa de Saxe; Jones, Anne; Brigham, Rebecca; Kanfer, Meryl; Zomorodi, Margaret

2017-01-01

An essential aspect of integrated care is the coordination of medical and behavioral health needs concurrently. This has sparked renewed emphasis on interprofessional (IP) education and practice. The impetus for IP efforts was crystalized in large part because of health care reforms, and federal funding to expand the behavioral health work force.…

76 FR 45796 - Information Collection Being Submitted to the Office of Management and Budget for Review and...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-01

... organizational structure, including the names of its executives, officers, partners, and board of directors; A... Control Number: 3060-1145. Title: Structure and Practices of the Video Relay Service Program, CG Docket No... end times; (5) incoming telephone number and IP address (if call originates with an IP-based device...

Fractal electrodynamics via non-integer dimensional space approach

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2015-09-01

Using the recently suggested vector calculus for non-integer dimensional space, we consider electrodynamics problems in isotropic case. This calculus allows us to describe fractal media in the framework of continuum models with non-integer dimensional space. We consider electric and magnetic fields of fractal media with charges and currents in the framework of continuum models with non-integer dimensional spaces. An application of the fractal Gauss's law, the fractal Ampere's circuital law, the fractal Poisson equation for electric potential, and equation for fractal stream of charges are suggested. Lorentz invariance and speed of light in fractal electrodynamics are discussed. An expression for effective refractive index of non-integer dimensional space is suggested.

A combinatorial approach to the design of vaccines.

PubMed

Martínez, Luis; Milanič, Martin; Legarreta, Leire; Medvedev, Paul; Malaina, Iker; de la Fuente, Ildefonso M

2015-05-01

We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.

A randomized pilot clinical trial to evaluate the efficacy of Community Reinforcement and Family Training for Treatment Retention (CRAFT-T) for improving outcomes for patients completing opioid detoxification.

PubMed

Brigham, Gregory S; Slesnick, Natasha; Winhusen, Theresa M; Lewis, Daniel F; Guo, Xiamei; Somoza, Eugene

2014-05-01

Detoxification with psychosocial counseling remains a standard opioid-use disorder treatment practice but is associated with poor outcomes. This study tested the efficacy of a newly developed psychosocial intervention, Community Reinforcement Approach and Family Training for Treatment Retention (CRAFT-T), relative to psychosocial treatment as usual (TAU), for improving treatment outcomes. A randomized, 14-week trial with follow-up visits at 6 and 9 months post-randomization conducted at two substance use disorder (SUD) treatment programs. Opioid-dependent adults (i.e., identified patient - IP) enrolled in a residential buprenorphine-detoxification program and their identified concerned significant other (CSO) was randomized to CRAFT-T (n=28 dyads) or TAU (n=24 dyads). CRAFT-T consisted of two sessions with the IP and CSO together and 10 with the CSO alone, over 14 weeks. TAU for the CSOs was primarily educational and referral to self-help. All IPs received treatment as usually provided by the SUD program in which they were enrolled. The primary outcome was time to first IP drop from treatment lasting 30 days or more. Opioid and other drug use were key secondary outcomes. CRAFT-T resulted in a moderate but non-significant effect on treatment retention (p=0.058, hazard ratio=0.57). When the CSO was parental family, CRAFT-T had a large and significant effect on treatment retention (p<0.01, hazard ratio=.040). CRAFT-T had a significant positive effect on IP opioid and other drug use (p<0.0001). CRAFT-T is a promising treatment for opioid use disorder but replication is needed to confirm these results. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

Individual Placement and Support in Spinal Cord Injury: A Longitudinal Observational Study of Employment Outcomes.

PubMed

Ottomanelli, Lisa; Goetz, Lance L; Barnett, Scott D; Njoh, Eni; Dixon, Thomas M; Holmes, Sally Ann; LePage, James P; Ota, Doug; Sabharwal, Sunil; White, Kevin T

2017-08-01

To determine the effects of a 24-month program of Individual Placement and Support (IPS) supported employment (SE) on employment outcomes for veterans with spinal cord injury (SCI). Longitudinal, observational multisite study of a single-arm, nonrandomized cohort. SCI centers in the Veterans Health Administration (n=7). Veterans with SCI (N=213) enrolled during an episode of either inpatient hospital care (24.4%) or outpatient care (75.6%). More than half the sample (59.2%) had a history of traumatic brain injury (TBI). IPS SE for 24 months. Competitive employment. Over the 24-month period, 92 of 213 IPS participants obtained competitive jobs for an overall employment rate of 43.2%. For the subsample of participants without TBI enrolled as outpatients (n=69), 36 obtained competitive jobs for an overall employment rate of 52.2%. Overall, employed participants averaged 38.2±29.7 weeks of employment, with an average time to first employment of 348.3±220.0 days. Nearly 25% of first jobs occurred within 4 to 6 months of beginning the program. Similar employment characteristics were observed in the subsample without TBI history enrolled as outpatients. Almost half of the veterans with SCI participating in the 24-month IPS program as part of their ongoing SCI care achieved competitive employment, consistent with their expressed preferences at the start of the study. Among a subsample of veterans without TBI history enrolled as outpatients, employment rates were >50%. Time to first employment was highly variable, but quite long in many instances. These findings support offering continued IPS services as part of ongoing SCI care to achieve positive employment outcomes. Copyright © 2017 American Congress of Rehabilitation Medicine. Published by Elsevier Inc. All rights reserved.

Density of Primitive Pythagorean Triples

ERIC Educational Resources Information Center

Killen, Duncan A.

2004-01-01

Based on the properties of a Primitive Pythagorean Triple (PPT), a computer program was written to generate, print, and count all PPTs greater than or equal to I[subscript x], where I[subscript x] is an arbitrarily chosen integer. The Density of Primitive Pythagorean Triples may be defined as the ratio of the number of PPTs whose hypotenuse is…

Applying ant colony optimization metaheuristic to solve forest transportation planning problems with side constraints

Treesearch

Marco A. Contreras; Woodam Chung; Greg Jones

2008-01-01

Forest transportation planning problems (FTPP) have evolved from considering only the financial aspects of timber management to more holistic problems that also consider the environmental impacts of roads. These additional requirements have introduced side constraints, making FTPP larger and more complex. Mixed-integer programming (MIP) has been used to solve FTPP, but...

Going Around On Circles: Mathematics and Computer Art. Part 2.

ERIC Educational Resources Information Center

Gordon, Sheldon P.; Gordon, Florence S.

1984-01-01

Discusses properties of epicycloids. (The easiest way to picture them is to think of a piece of radioactive bubble gum attached to a wheel which is rolling around the outside of a larger wheel.) Includes a computer program (TRS-80 color computer) that will graph any epicycloid with integer values for the radii. (JN)

Dynamic reserve selection: Optimal land retention with land-price feedbacks

Treesearch

Sandor F. Toth; Robert G. Haight; Luke W. Rogers

2011-01-01

Urban growth compromises open space and ecosystem functions. To mitigate the negative effects, some agencies use reserve selection models to identify conservation sites for purchase or retention. Existing models assume that conservation has no impact on nearby land prices. We propose a new integer program that relaxes this assumption via adaptive cost coefficients. Our...

Integrating Test-Form Formatting into Automated Test Assembly

ERIC Educational Resources Information Center

Diao, Qi; van der Linden, Wim J.

2013-01-01

Automated test assembly uses the methodology of mixed integer programming to select an optimal set of items from an item bank. Automated test-form generation uses the same methodology to optimally order the items and format the test form. From an optimization point of view, production of fully formatted test forms directly from the item pool using…

Large-Scale Multiobjective Static Test Generation for Web-Based Testing with Integer Programming

ERIC Educational Resources Information Center

Nguyen, M. L.; Hui, Siu Cheung; Fong, A. C. M.

2013-01-01

Web-based testing has become a ubiquitous self-assessment method for online learning. One useful feature that is missing from today's web-based testing systems is the reliable capability to fulfill different assessment requirements of students based on a large-scale question data set. A promising approach for supporting large-scale web-based…

A Unified Approach to Optimization

DTIC Science & Technology

2014-10-02

employee scheduling, ad placement, latin squares, disjunctions of linear systems, temporal modeling with interval variables, and traveling salesman problems ...integrating technologies. A key to integrated modeling is to formulate a problem with high-levelmetaconstraints, which are inspired by the “global... problem substructure to the solver. This contrasts with the atomistic modeling style of mixed integer programming (MIP) and satisfiability (SAT) solvers

Equitably Distributing Quality of Marine Security Guards Using Integer Programming

DTIC Science & Technology

2013-03-01

Model for Fix-It Shop-Assignment (From Balakrishnan et al ., 2007...LP; Balakrishnan et al ., 2007). The Soviet mathematician A. N. Kolmogorov is recognized as the first person to conceptually develop the idea of LP...commercial sector today. Balakrishnan et al . (2007) captured the three major steps in LP, which are formulation, solution, and interpretation and

Parameterizing by the Number of Numbers

NASA Astrophysics Data System (ADS)

Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.

The usefulness of parameterized algorithmics has often depended on what Niedermeier has called "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of numbers. Several classic numerical problems, such as Subset Sum, Partition, 3-Partition, Numerical 3-Dimensional Matching, and Numerical Matching with Target Sums, have multisets of integers as input. We initiate the study of parameterizing these problems by the number of distinct integers in the input. We rely on an FPT result for Integer Linear Programming Feasibility to show that all the above-mentioned problems are fixed-parameter tractable when parameterized in this way. In various applied settings, problem inputs often consist in part of multisets of integers or multisets of weighted objects (such as edges in a graph, or jobs to be scheduled). Such number-of-numbers parameterized problems often reduce to subproblems about transition systems of various kinds, parameterized by the size of the system description. We consider several core problems of this kind relevant to number-of-numbers parameterization. Our main hardness result considers the problem: given a non-deterministic Mealy machine M (a finite state automaton outputting a letter on each transition), an input word x, and a census requirement c for the output word specifying how many times each letter of the output alphabet should be written, decide whether there exists a computation of M reading x that outputs a word y that meets the requirement c. We show that this problem is hard for W[1]. If the question is whether there exists an input word x such that a computation of M on x outputs a word that meets c, the problem becomes fixed-parameter tractable.

Engineering calculations for solving the orbital allotment problem

NASA Technical Reports Server (NTRS)

Reilly, C.; Walton, E. K.; Mount-Campbell, C.; Caldecott, R.; Aebker, E.; Mata, F.

1988-01-01

Four approaches for calculating downlink interferences for shaped-beam antennas are described. An investigation of alternative mixed-integer programming models for satellite synthesis is summarized. Plans for coordinating the various programs developed under this grant are outlined. Two procedures for ordering satellites to initialize the k-permutation algorithm are proposed. Results are presented for the k-permutation algorithms. Feasible solutions are found for 5 of the 6 problems considered. Finally, it is demonstrated that the k-permutation algorithm can be used to solve arc allotment problems.

Mixed Integer Programming and Heuristic Scheduling for Space Communication

NASA Technical Reports Server (NTRS)

Lee, Charles H.; Cheung, Kar-Ming

2013-01-01

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Analysis of Modeling Assumptions used in Production Cost Models for Renewable Integration Studies

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stoll, Brady; Brinkman, Gregory; Townsend, Aaron

2016-01-01

Renewable energy integration studies have been published for many different regions exploring the question of how higher penetration of renewable energy will impact the electric grid. These studies each make assumptions about the systems they are analyzing; however the effect of many of these assumptions has not been yet been examined and published. In this paper we analyze the impact of modeling assumptions in renewable integration studies, including the optimization method used (linear or mixed-integer programming) and the temporal resolution of the dispatch stage (hourly or sub-hourly). We analyze each of these assumptions on a large and a small systemmore » and determine the impact of each assumption on key metrics including the total production cost, curtailment of renewables, CO2 emissions, and generator starts and ramps. Additionally, we identified the impact on these metrics if a four-hour ahead commitment step is included before the dispatch step and the impact of retiring generators to reduce the degree to which the system is overbuilt. We find that the largest effect of these assumptions is at the unit level on starts and ramps, particularly for the temporal resolution, and saw a smaller impact at the aggregate level on system costs and emissions. For each fossil fuel generator type we measured the average capacity started, average run-time per start, and average number of ramps. Linear programming results saw up to a 20% difference in number of starts and average run time of traditional generators, and up to a 4% difference in the number of ramps, when compared to mixed-integer programming. Utilizing hourly dispatch instead of sub-hourly dispatch saw no difference in coal or gas CC units for either start metric, while gas CT units had a 5% increase in the number of starts and 2% increase in the average on-time per start. The number of ramps decreased up to 44%. The smallest effect seen was on the CO2 emissions and total production cost, with a 0.8% and 0.9% reduction respectively when using linear programming compared to mixed-integer programming and 0.07% and 0.6% reduction, respectively, in the hourly dispatch compared to sub-hourly dispatch.« less

Developing research and recruitment while fostering stakeholder engagement in a National Institutes of Mental Health-funded Interventions and Practice Research Infrastructure Programs grant for depression.

PubMed

Stirman, Shannon Wiltsey; Goldstein, Lizabeth A; Wrenn, Glenda; Barrett, Marna; Gibbons, Mary Beth Connolly; Casiano, Delane; Thompson, Donald; Green, Patricia P; Heintz, Laura; Barber, Jacques P; Crits-Christoph, Paul

2010-01-01

In the context of a National Institutes of Mental Health-funded Interventions and Practice Research Infrastructure Programs (IP-RISP) grant for the treatment of depression, a partnership was developed between a community mental health organization and a team of researchers. This paper describes the collaborative process, key challenges, and strategies employed to meet the goals of the first phase of the grant, which included development of a working and sustainable partnership and building capacity for recruitment and research. This paper was developed through the use of qualitative interviews and discussion with a variety of IP-RISP partners. Communication with multiple stakeholders through varied channels, feedback from stakeholders on research procedures, and employing a research liaison at the clinic have been key strategies in the first phase of the grant. The strategies we employed allowed multiple stakeholders to contribute to the larger mission of the IP-RISP and helped to establish an ongoing research program within the mental health organization.

Impact of daily chlorhexidine baths and hand hygiene compliance on nosocomial infection rates in critically ill patients.

PubMed

Martínez-Reséndez, Michel Fernando; Garza-González, Elvira; Mendoza-Olazaran, Soraya; Herrera-Guerra, Alexis; Rodríguez-López, Juan Manuel; Pérez-Rodriguez, Edelmiro; Mercado-Longoria, Roberto; Camacho-Ortiz, Adrián

2014-07-01

Up to 25% of all nosocomial infections (NIs) develop in critically ill patients. Our objective was to evaluate chlorhexidine (CHX) bathing and hand hygiene (HH) compliance in the reduction of NIs in the intensive care unit. The study comprised three 6-month periods: preintervention (PIP; soap/water bathing), intervention (IP; bathing with CHX-impregnated wipes), and postintervention (PoIP; soap/water bathing). An HH program was implemented during the IP and PoIP. Primary outcomes were global and specific NI rates. A total of 1007 patients were included. Infection rates per 100 discharges were higher in the PIP compared with the IP and also higher in the PoIP compared with the IP (P = .0004 and .0109, respectively). Global infection rates per 1000 hospital-days were higher in the PIP than in the IP (P = .0268). The rates of ventilator-associated pneumonia (VAP) and catheter-associated urinary tract infection (CAUTI) were higher in the PIP than in the IP (P = .036 and .0001, respectively). Isolation of Acinetobacter baumannii from VAP specimens (P = .0204) and isolation of Candida spp from CAUTI specimens (P = .0005) decreased as well. The combined intervention reduced global and specific infection rates, including rates of VAP associated with A baumannii and CAUTI associated with Candida spp. Copyright © 2014 Association for Professionals in Infection Control and Epidemiology, Inc. Published by Mosby, Inc. All rights reserved.

Interfacing the Controllogics PLC over Ethernet/IP.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kasemir, K. U.; Dalesio, L. R.

2001-01-01

The Allen-Bradley ControlLogix [1] line of programmable logic controllers (PLCs) offers several interfaces: Ethernet, ControlNet, DeviceNet, RS-232 and others. The ControlLogix Ethernet interface module 1756-ENET uses EtherNet/IP, the ControlNet protocol [2], encapsulated in Ethernet packages, with specific service codes [3]. A driver for the Experimental Physics and Industrial Control System (EPICS) has been developed that utilizes this EtherNet/IP protocol for controllers running the vxWorks RTOS as well as a Win32 and Unix/Linux test program. Features, performance and limitations of this interface are presented.

VON and Its Use in NASA's International Space Station Science Operation

NASA Technical Reports Server (NTRS)

Bradford, Robert N.; Chamberlain, Jim

1999-01-01

This presentation will provide a brief overview of a International Space Station (ISS) remote user (scientist/experimenter) operation. Specifically, the presentation will show how Voice over IP (VoIP) is integrated into the ISS science payload operation and in the mission voice system. Included will be the details on how a scientist, using VON, will talk to the ISS onboard crew and ground based cadre from a scientist's home location (lab, office or garage) over tile public Internet and science nets. Benefit(s) to tile ISS Program (and taxpayer) and of VoIP versus other implementations also will be presented.

Oilfield flooding polymer

DOEpatents

Martin, Fred D.; Hatch, Melvin J.; Shepitka, Joel S.; Donaruma, Lorraine G.

1986-01-01

A monomer, polymers containing the monomer, and the use of the polymer in oilfield flooding is disclosed. The subject monomer is represented by the general formula: ##STR1## wherein: n is an integer from 0 to about 4; m is an integer from 0 to about 6; a is an integer equal to at least 1 except where m is equal to 0, a must equal 0 and where m is equal to 1, a must equal 0 or 1; p is an integer from 2 to about 10; b is an integer equal to at least 1 and is of sufficient magnitude that the ratio b/p is at least 0.2; and q is an integer from 0 to 2. The number of hydroxy groups in the monomer is believed to be critical, and therefore the sum of (a+b) divided by the sum (m+p) should be at least 0.2. The moieties linked to the acrylic nitrogen can be joined to provide a ringed structure.

A decentralized software bus based on IP multicas ting

NASA Technical Reports Server (NTRS)

Callahan, John R.; Montgomery, Todd

1995-01-01

We describe decentralized reconfigurable implementation of a conference management system based on the low-level Internet Protocol (IP) multicasting protocol. IP multicasting allows low-cost, world-wide, two-way transmission of data between large numbers of conferencing participants through the Multicasting Backbone (MBone). Each conference is structured as a software bus -- a messaging system that provides a run-time interconnection model that acts as a separate agent (i.e., the bus) for routing, queuing, and delivering messages between distributed programs. Unlike the client-server interconnection model, the software bus model provides a level of indirection that enhances the flexibility and reconfigurability of a distributed system. Current software bus implementations like POLYLITH, however, rely on a centralized bus process and point-to-point protocols (i.e., TCP/IP) to route, queue, and deliver messages. We implement a software bus called the MULTIBUS that relies on a separate process only for routing and uses a reliable IP multicasting protocol for delivery of messages. The use of multicasting means that interconnections are independent of IP machine addresses. This approach allows reconfiguration of bus participants during system execution without notifying other participants of new IP addresses. The use of IP multicasting also permits an economy of scale in the number of participants. We describe the MULITIBUS protocol elements and show how our implementation performs better than centralized bus implementations.

The Impact of an Online Orientation Program on the Impostor Phenomenon, Self-Efficacy, and Anxiety

ERIC Educational Resources Information Center

Ives, Sujata Kolhatkar

2010-01-01

The imposter phenomenon (IP), defined as the fear that others may perceive one to be an intellectual "phony", and its association to one's self-efficacy (SE) and anxiety, requires further research. This dissertation investigates the IP, SE, and anxiety and their interrelationships at the beginning and at the end of an orientation program…

An Ada Linear-Algebra Software Package Modeled After HAL/S

NASA Technical Reports Server (NTRS)

Klumpp, Allan R.; Lawson, Charles L.

1990-01-01

New avionics software written more easily. Software package extends Ada programming language to include linear-algebra capabilities similar to those of HAL/S programming language. Designed for such avionics applications as Space Station flight software. In addition to built-in functions of HAL/S, package incorporates quaternion functions used in Space Shuttle and Galileo projects and routines from LINPAK solving systems of equations involving general square matrices. Contains two generic programs: one for floating-point computations and one for integer computations. Written on IBM/AT personal computer running under PC DOS, v.3.1.

A Paper-and-Pencil gcd Algorithm for Gaussian Integers

ERIC Educational Resources Information Center

Szabo, Sandor

2005-01-01

As with natural numbers, a greatest common divisor of two Gaussian (complex) integers "a" and "b" is a Gaussian integer "d" that is a common divisor of both "a" and "b". This article explores an algorithm for such gcds that is easy to do by hand.

Robust design of (s, S) inventory policy parameters in supply chains with demand and lead time uncertainties

NASA Astrophysics Data System (ADS)

Karimi Movahed, Kamran; Zhang, Zhi-Hai

2015-09-01

Demand and lead time uncertainties have significant effects on supply chain behaviour. In this paper, we present a single-product three-level multi-period supply chain with uncertain demands and lead times by using robust techniques to study the managerial insights of the supply chain inventory system under uncertainty. We formulate this problem as a robust mixed-integer linear program with minimised expected cost and total cost variation to determine the optimal (s, S) values of the inventory parameters. Several numerical studies are performed to investigate the supply chain behaviour. Useful guidelines for the design of a robust supply chain are also provided. Results show that the order variance and the expected cost in a supply chain significantly increase when the manufacturer's review period is an integer ratio of the distributor's and the retailer's review periods.

Inositol pyrophosphates mediate the DNA-PK/ATM-p53 cell death pathway by regulating CK2 phosphorylation of Tti1/Tel2

PubMed Central

Rao, Feng; Cha, Jiyoung; Xu, Jing; Xu, Risheng; Vandiver, M. Scott; Tyagi, Richa; Tokhunts, Robert; Koldobskiy, Michael A.; Fu, Chenglai; Barrow, Roxanne; Wu, Mingxuan; Fiedler, Dorothea; Barrow, James C.; Snyder, Solomon H.

2014-01-01

The apoptotic actions of p53 require its phosphorylation by a family of phosphoinositide-3-kinase-related-kinases (PIKKs), which include DNA-PKcs and ATM. These kinases are stabilized by the TTT (Tel2, Tti1, Tti2) co-chaperone family, whose actions are mediated by CK2 phosphorylation. The inositol pyrophosphates, such as 5-diphosphoinositol pentakisphosphate (IP7), are generated by a family of inositol hexakisphosphate kinases (IP6Ks) of which IP6K2 has been implicated in p53-associated cell death. In the present study we report a novel apoptotic signaling cascade linking CK2, TTT, the PIKKs, and p53. We demonstrate that IP7, formed by IP6K2, binds CK2 to enhance its phosphorylation of the TTT complex thereby stabilizing DNA-PKcs and ATM. This process stimulates p53 phosphorylation at serine-15 to activate the cell death program in human cancer cells and in murine B cells. PMID:24657168

Reusable, extensible, and modifiable R scripts and Kepler workflows for comprehensive single set ChIP-seq analysis.

PubMed

Cormier, Nathan; Kolisnik, Tyler; Bieda, Mark

2016-07-05

There has been an enormous expansion of use of chromatin immunoprecipitation followed by sequencing (ChIP-seq) technologies. Analysis of large-scale ChIP-seq datasets involves a complex series of steps and production of several specialized graphical outputs. A number of systems have emphasized custom development of ChIP-seq pipelines. These systems are primarily based on custom programming of a single, complex pipeline or supply libraries of modules and do not produce the full range of outputs commonly produced for ChIP-seq datasets. It is desirable to have more comprehensive pipelines, in particular ones addressing common metadata tasks, such as pathway analysis, and pipelines producing standard complex graphical outputs. It is advantageous if these are highly modular systems, available as both turnkey pipelines and individual modules, that are easily comprehensible, modifiable and extensible to allow rapid alteration in response to new analysis developments in this growing area. Furthermore, it is advantageous if these pipelines allow data provenance tracking. We present a set of 20 ChIP-seq analysis software modules implemented in the Kepler workflow system; most (18/20) were also implemented as standalone, fully functional R scripts. The set consists of four full turnkey pipelines and 16 component modules. The turnkey pipelines in Kepler allow data provenance tracking. Implementation emphasized use of common R packages and widely-used external tools (e.g., MACS for peak finding), along with custom programming. This software presents comprehensive solutions and easily repurposed code blocks for ChIP-seq analysis and pipeline creation. Tasks include mapping raw reads, peakfinding via MACS, summary statistics, peak location statistics, summary plots centered on the transcription start site (TSS), gene ontology, pathway analysis, and de novo motif finding, among others. These pipelines range from those performing a single task to those performing full analyses of ChIP-seq data. The pipelines are supplied as both Kepler workflows, which allow data provenance tracking, and, in the majority of cases, as standalone R scripts. These pipelines are designed for ease of modification and repurposing.

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

NASA Technical Reports Server (NTRS)

Truong, T. K.; Hsu, I. S.; Chang, J. J.; Shyu, H. C.; Reed, I. S.

1986-01-01

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-pw technology.

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

NASA Technical Reports Server (NTRS)

Shyu, H. C.; Reed, I. S.; Truong, T. K.; Hsu, I. S.; Chang, J. J.

1987-01-01

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-Pw technology.

Elasticity of fractal materials using the continuum model with non-integer dimensional space

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2015-01-01

Using a generalization of vector calculus for space with non-integer dimension, we consider elastic properties of fractal materials. Fractal materials are described by continuum models with non-integer dimensional space. A generalization of elasticity equations for non-integer dimensional space, and its solutions for the equilibrium case of fractal materials are suggested. Elasticity problems for fractal hollow ball and cylindrical fractal elastic pipe with inside and outside pressures, for rotating cylindrical fractal pipe, for gradient elasticity and thermoelasticity of fractal materials are solved.

Innovative Teaching Games: Climbing the Hills of Math Skills. California Demonstration Mathematics Program.

ERIC Educational Resources Information Center

Pittsburg Unified School District, CA.

The card games in this publication are an alternative activity to help students master computational skills. Games for operations with whole numbers, fractions, decimals, percents, integers, and square roots are included. They can be used to introduce math topics and for practice and review, with either the whole class or in small groups with 2 to…

Optimizing Marine Corps Personnel Assignments Using an Integer Programming Model

DTIC Science & Technology

2012-12-01

Corps. vi THIS PAGE INTENTIONALLY LEFT BLANK vii TABLE OF CONTENTS I. INTRODUCTION ...throughout our careers. xvi THIS PAGE INTENTIONALLY LEFT BLANK 1 I. INTRODUCTION The Marine Corps Manpower and Reserve Affairs (M&RA) office has the...2012 BAH Rates-with Dependents. Defense Travel Mangement Office. (2011, December). 2012 BAH Rates-without Dependents. M ileage C ost 1 Per D iem

Discrete Optimization of Electronic Hyperpolarizabilities in a Chemical Subspace

DTIC Science & Technology

2009-05-01

molecular design. Methods for optimization in discrete spaces have been studied extensively and recently reviewed ( 5). Optimization methods include...integer programming, as in branch-and-bound techniques (including dead-end elimination [ 6]), simulated annealing ( 7), and genetic algorithms ( 8...These algorithms have found renewed interest and application in molecular and materials design (9- 12) . Recently, new approaches have been

Development of a Prototype H-46 Helicopter Diagnostic Expert System.

DTIC Science & Technology

1987-09-01

SQUADRON MAINTEN\\NCE: CURRENT PROCESS AND CA D S INTEG R ,ATIO N ........................................ 14 A. MAINTENANCE DATA SYSTEM...increasce the effectiveness of the maintenance process should enhance the ability of achieving :hee objectives. Artificial intelligence techniques offer a...completeiy validated. G. ORGANIZATION OF STUDY Chapter II contains a description of the Naval Aviation Maintenance Program’s Maintenance Data System (MDS

Learning oncogenetic networks by reducing to mixed integer linear programming.

PubMed

Shahrabi Farahani, Hossein; Lagergren, Jens

2013-01-01

Cancer can be a result of accumulation of different types of genetic mutations such as copy number aberrations. The data from tumors are cross-sectional and do not contain the temporal order of the genetic events. Finding the order in which the genetic events have occurred and progression pathways are of vital importance in understanding the disease. In order to model cancer progression, we propose Progression Networks, a special case of Bayesian networks, that are tailored to model disease progression. Progression networks have similarities with Conjunctive Bayesian Networks (CBNs) [1],a variation of Bayesian networks also proposed for modeling disease progression. We also describe a learning algorithm for learning Bayesian networks in general and progression networks in particular. We reduce the hard problem of learning the Bayesian and progression networks to Mixed Integer Linear Programming (MILP). MILP is a Non-deterministic Polynomial-time complete (NP-complete) problem for which very good heuristics exists. We tested our algorithm on synthetic and real cytogenetic data from renal cell carcinoma. We also compared our learned progression networks with the networks proposed in earlier publications. The software is available on the website https://bitbucket.org/farahani/diprog.

Should We Stop Developing Heuristics and Only Rely on Mixed Integer Programming Solvers in Automated Test Assembly? A Rejoinder to van der Linden and Li (2016).

PubMed

Chen, Pei-Hua

2017-05-01

This rejoinder responds to the commentary by van der Linden and Li entiled "Comment on Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" on the article "Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" by Chen. Van der Linden and Li made a strong statement calling for the cessation of test assembly heuristics development, and instead encouraged embracing mixed integer programming (MIP). This article points out the nondeterministic polynomial (NP)-hard nature of MIP problems and how solutions found using heuristics could be useful in an MIP context. Although van der Linden and Li provided several practical examples of test assembly supporting their view, the examples ignore the cases in which a slight change of constraints or item pool data might mean it would not be possible to obtain solutions as quickly as before. The article illustrates the use of heuristic solutions to improve both the performance of MIP solvers and the quality of solutions. Additional responses to the commentary by van der Linden and Li are included.

A bi-objective integer programming model for partly-restricted flight departure scheduling

PubMed Central

Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

2018-01-01

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows. PMID:29715299

Accurate construction of consensus genetic maps via integer linear programming.

PubMed

Wu, Yonghui; Close, Timothy J; Lonardi, Stefano

2011-01-01

We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which is a directed graph that includes and is consistent with all (or, the vast majority of) the markers in the input maps. However, when markers in the individual maps have ordering conflicts, the resulting consensus map will contain cycles. Here, we formulate the problem of resolving cycles in the context of a parsimonious paradigm that takes into account two types of errors that may be present in the input maps, namely, local reshuffles and global displacements. The resulting combinatorial optimization problem is, in turn, expressed as an integer linear program. A fast approximation algorithm is proposed, and an additional speedup heuristic is developed. Our algorithms were implemented in a software tool named MERGEMAP which is freely available for academic use. An extensive set of experiments shows that MERGEMAP consistently outperforms JOINMAP, which is the most popular tool currently available for this task, both in terms of accuracy and running time. MERGEMAP is available for download at http://www.cs.ucr.edu/~yonghui/mgmap.html.

Analysis of the single-vehicle cyclic inventory routing problem

NASA Astrophysics Data System (ADS)

Aghezzaf, El-Houssaine; Zhong, Yiqing; Raa, Birger; Mateo, Manel

2012-11-01

The single-vehicle cyclic inventory routing problem (SV-CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer, selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each and to design the vehicle route so that the resulting profit (difference between the total reward and the total logistical cost) is maximised while preventing stockouts at each of the selected customers. This problem appears often as a sub-problem in many logistical problems. In this article, the SV-CIRP is formulated as a mixed-integer program with a nonlinear objective function. After a thorough analysis of the structure of the problem and its features, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of linear mixed-integer programs. Values of a savings-based heuristic for this problem are compared to the optimal values obtained for a set of some test problems. In general, the gap may get as large as 25%, which justifies the effort to continue exploring and developing exact and approximation algorithms for the SV-CIRP.

MIP models for connected facility location: A theoretical and computational study☆

PubMed Central

Gollowitzer, Stefan; Ljubić, Ivana

2011-01-01

This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facility opening costs and the assignment costs need to be minimized. We model ConFL using seven compact and three mixed integer programming formulations of exponential size. We also show how to transform ConFL into the Steiner arborescence problem. A full hierarchy between the models is provided. For two exponential size models we develop a branch-and-cut algorithm. An extensive computational study is based on two benchmark sets of randomly generated instances with up to 1300 nodes and 115,000 edges. We empirically compare the presented models with respect to the quality of obtained bounds and the corresponding running time. We report optimal values for all but 16 instances for which the obtained gaps are below 0.6%. PMID:25009366

Quantum-Inspired Maximizer

NASA Technical Reports Server (NTRS)

Zak, Michail

2008-01-01

A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).

A bi-objective integer programming model for partly-restricted flight departure scheduling.

PubMed

Zhong, Han; Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

2018-01-01

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.

Discovery of Boolean metabolic networks: integer linear programming based approach.

PubMed

Qiu, Yushan; Jiang, Hao; Ching, Wai-Ki; Cheng, Xiaoqing

2018-04-11

Traditional drug discovery methods focused on the efficacy of drugs rather than their toxicity. However, toxicity and/or lack of efficacy are produced when unintended targets are affected in metabolic networks. Thus, identification of biological targets which can be manipulated to produce the desired effect with minimum side-effects has become an important and challenging topic. Efficient computational methods are required to identify the drug targets while incurring minimal side-effects. In this paper, we propose a graph-based computational damage model that summarizes the impact of enzymes on compounds in metabolic networks. An efficient method based on Integer Linear Programming formalism is then developed to identify the optimal enzyme-combination so as to minimize the side-effects. The identified target enzymes for known successful drugs are then verified by comparing the results with those in the existing literature. Side-effects reduction plays a crucial role in the study of drug development. A graph-based computational damage model is proposed and the theoretical analysis states the captured problem is NP-completeness. The proposed approaches can therefore contribute to the discovery of drug targets. Our developed software is available at " http://hkumath.hku.hk/~wkc/APBC2018-metabolic-network.zip ".

A combined MOIP-MCDA approach to building and screening atmospheric pollution control strategies in urban regions.

PubMed

Mavrotas, George; Ziomas, Ioannis C; Diakouaki, Danae

2006-07-01

This article presents a methodological approach for the formulation of control strategies capable of reducing atmospheric pollution at the standards set by European legislation. The approach was implemented in the greater area of Thessaloniki and was part of a project aiming at the compliance with air quality standards in five major cities in Greece. The methodological approach comprises two stages: in the first stage, the availability of several measures contributing to a certain extent to reducing atmospheric pollution indicates a combinatorial problem and favors the use of Integer Programming. More specifically, Multiple Objective Integer Programming is used in order to generate alternative efficient combinations of the available policy measures on the basis of two conflicting objectives: public expenditure minimization and social acceptance maximization. In the second stage, these combinations of control measures (i.e., the control strategies) are then comparatively evaluated with respect to a wider set of criteria, using tools from Multiple Criteria Decision Analysis, namely, the well-known PROMETHEE method. The whole procedure is based on the active involvement of local and central authorities in order to incorporate their concerns and preferences, as well as to secure the adoption and implementation of the resulting solution.

Mixed Integer Linear Programming based machine learning approach identifies regulators of telomerase in yeast.

PubMed

Poos, Alexandra M; Maicher, André; Dieckmann, Anna K; Oswald, Marcus; Eils, Roland; Kupiec, Martin; Luke, Brian; König, Rainer

2016-06-02

Understanding telomere length maintenance mechanisms is central in cancer biology as their dysregulation is one of the hallmarks for immortalization of cancer cells. Important for this well-balanced control is the transcriptional regulation of the telomerase genes. We integrated Mixed Integer Linear Programming models into a comparative machine learning based approach to identify regulatory interactions that best explain the discrepancy of telomerase transcript levels in yeast mutants with deleted regulators showing aberrant telomere length, when compared to mutants with normal telomere length. We uncover novel regulators of telomerase expression, several of which affect histone levels or modifications. In particular, our results point to the transcription factors Sum1, Hst1 and Srb2 as being important for the regulation of EST1 transcription, and we validated the effect of Sum1 experimentally. We compiled our machine learning method leading to a user friendly package for R which can straightforwardly be applied to similar problems integrating gene regulator binding information and expression profiles of samples of e.g. different phenotypes, diseases or treatments. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

Optimising the selection of food items for FFQs using Mixed Integer Linear Programming.

PubMed

Gerdessen, Johanna C; Souverein, Olga W; van 't Veer, Pieter; de Vries, Jeanne Hm

2015-01-01

To support the selection of food items for FFQs in such a way that the amount of information on all relevant nutrients is maximised while the food list is as short as possible. Selection of the most informative food items to be included in FFQs was modelled as a Mixed Integer Linear Programming (MILP) model. The methodology was demonstrated for an FFQ with interest in energy, total protein, total fat, saturated fat, monounsaturated fat, polyunsaturated fat, total carbohydrates, mono- and disaccharides, dietary fibre and potassium. The food lists generated by the MILP model have good performance in terms of length, coverage and R 2 (explained variance) of all nutrients. MILP-generated food lists were 32-40 % shorter than a benchmark food list, whereas their quality in terms of R 2 was similar to that of the benchmark. The results suggest that the MILP model makes the selection process faster, more standardised and transparent, and is especially helpful in coping with multiple nutrients. The complexity of the method does not increase with increasing number of nutrients. The generated food lists appear either shorter or provide more information than a food list generated without the MILP model.

A Combined MOIP-MCDA Approach to Building and Screening Atmospheric Pollution Control Strategies in Urban Regions

NASA Astrophysics Data System (ADS)

Mavrotas, George; Ziomas, Ioannis C.; Diakouaki, Danae

2006-07-01

This article presents a methodological approach for the formulation of control strategies capable of reducing atmospheric pollution at the standards set by European legislation. The approach was implemented in the greater area of Thessaloniki and was part of a project aiming at the compliance with air quality standards in five major cities in Greece. The methodological approach comprises two stages: in the first stage, the availability of several measures contributing to a certain extent to reducing atmospheric pollution indicates a combinatorial problem and favors the use of Integer Programming. More specifically, Multiple Objective Integer Programming is used in order to generate alternative efficient combinations of the available policy measures on the basis of two conflicting objectives: public expenditure minimization and social acceptance maximization. In the second stage, these combinations of control measures (i.e., the control strategies) are then comparatively evaluated with respect to a wider set of criteria, using tools from Multiple Criteria Decision Analysis, namely, the well-known PROMETHEE method. The whole procedure is based on the active involvement of local and central authorities in order to incorporate their concerns and preferences, as well as to secure the adoption and implementation of the resulting solution.

Benchmarking image fusion system design parameters

NASA Astrophysics Data System (ADS)

Howell, Christopher L.

2013-06-01

A clear and absolute method for discriminating between image fusion algorithm performances is presented. This method can effectively be used to assist in the design and modeling of image fusion systems. Specifically, it is postulated that quantifying human task performance using image fusion should be benchmarked to whether the fusion algorithm, at a minimum, retained the performance benefit achievable by each independent spectral band being fused. The established benchmark would then clearly represent the threshold that a fusion system should surpass to be considered beneficial to a particular task. A genetic algorithm is employed to characterize the fused system parameters using a Matlab® implementation of NVThermIP as the objective function. By setting the problem up as a mixed-integer constraint optimization problem, one can effectively look backwards through the image acquisition process: optimizing fused system parameters by minimizing the difference between modeled task difficulty measure and the benchmark task difficulty measure. The results of an identification perception experiment are presented, where human observers were asked to identify a standard set of military targets, and used to demonstrate the effectiveness of the benchmarking process.

Sum-Difference Numbers

ERIC Educational Resources Information Center

Shi, Yixun

2010-01-01

Starting with an interesting number game sometimes used by school teachers to demonstrate the factorization of integers, "sum-difference numbers" are defined. A positive integer n is a "sum-difference number" if there exist positive integers "x, y, w, z" such that n = xy = wz and x ? y = w + z. This paper characterizes all sum-difference numbers…

Order and Value: Transitioning to Integers

ERIC Educational Resources Information Center

Bofferding, Laura

2014-01-01

As students progress from working with whole numbers to working with integers, they must wrestle with the big ideas of number values and order. Using objects to show positive quantities is easy, but no physical negative quantities exist. Therefore, when talking about integers, the author refers to number values instead of number quantities. The…

A time series model: First-order integer-valued autoregressive (INAR(1))

NASA Astrophysics Data System (ADS)

Simarmata, D. M.; Novkaniza, F.; Widyaningsih, Y.

2017-07-01

Nonnegative integer-valued time series arises in many applications. A time series model: first-order Integer-valued AutoRegressive (INAR(1)) is constructed by binomial thinning operator to model nonnegative integer-valued time series. INAR (1) depends on one period from the process before. The parameter of the model can be estimated by Conditional Least Squares (CLS). Specification of INAR(1) is following the specification of (AR(1)). Forecasting in INAR(1) uses median or Bayesian forecasting methodology. Median forecasting methodology obtains integer s, which is cumulative density function (CDF) until s, is more than or equal to 0.5. Bayesian forecasting methodology forecasts h-step-ahead of generating the parameter of the model and parameter of innovation term using Adaptive Rejection Metropolis Sampling within Gibbs sampling (ARMS), then finding the least integer s, where CDF until s is more than or equal to u . u is a value taken from the Uniform(0,1) distribution. INAR(1) is applied on pneumonia case in Penjaringan, Jakarta Utara, January 2008 until April 2016 monthly.

Vector calculus in non-integer dimensional space and its applications to fractal media

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2015-02-01

We suggest a generalization of vector calculus for the case of non-integer dimensional space. The first and second orders operations such as gradient, divergence, the scalar and vector Laplace operators for non-integer dimensional space are defined. For simplification we consider scalar and vector fields that are independent of angles. We formulate a generalization of vector calculus for rotationally covariant scalar and vector functions. This generalization allows us to describe fractal media and materials in the framework of continuum models with non-integer dimensional space. As examples of application of the suggested calculus, we consider elasticity of fractal materials (fractal hollow ball and fractal cylindrical pipe with pressure inside and outside), steady distribution of heat in fractal media, electric field of fractal charged cylinder. We solve the correspondent equations for non-integer dimensional space models.

Trace of totally positive algebraic integers and integer transfinite diameter

NASA Astrophysics Data System (ADS)

Flammang, V.

2009-06-01

Explicit auxiliary functions can be used in the ``Schur-Siegel- Smyth trace problem''. In the previous works, these functions were constructed only with polynomials having all their roots positive. Here, we use several polynomials with complex roots, which are found with Wu's algorithm, and we improve the known lower bounds for the absolute trace of totally positive algebraic integers. This improvement has a consequence for the search of Salem numbers that have a negative trace. The same method also gives a small improvement of the upper bound for the integer transfinite diameter of [0,1].

Integer cosine transform for image compression

NASA Technical Reports Server (NTRS)

Cheung, K.-M.; Pollara, F.; Shahshahani, M.

1991-01-01

This article describes a recently introduced transform algorithm called the integer cosine transform (ICT), which is used in transform-based data compression schemes. The ICT algorithm requires only integer operations on small integers and at the same time gives a rate-distortion performance comparable to that offered by the floating-point discrete cosine transform (DCT). The article addresses the issue of implementation complexity, which is of prime concern for source coding applications of interest in deep-space communications. Complexity reduction in the transform stage of the compression scheme is particularly relevant, since this stage accounts for most (typically over 80 percent) of the computational load.

A multistage stochastic programming model for a multi-period strategic expansion of biofuel supply chain under evolving uncertainties

DOE Office of Scientific and Technical Information (OSTI.GOV)

Xie, Fei; Huang, Yongxi

Here, we develop a multistage, stochastic mixed-integer model to support biofuel supply chain expansion under evolving uncertainties. By utilizing the block-separable recourse property, we reformulate the multistage program in an equivalent two-stage program and solve it using an enhanced nested decomposition method with maximal non-dominated cuts. We conduct extensive numerical experiments and demonstrate the application of the model and algorithm in a case study based on the South Carolina settings. The value of multistage stochastic programming method is also explored by comparing the model solution with the counterparts of an expected value based deterministic model and a two-stage stochastic model.

A multistage stochastic programming model for a multi-period strategic expansion of biofuel supply chain under evolving uncertainties

DOE PAGES

Xie, Fei; Huang, Yongxi

2018-02-04

Here, we develop a multistage, stochastic mixed-integer model to support biofuel supply chain expansion under evolving uncertainties. By utilizing the block-separable recourse property, we reformulate the multistage program in an equivalent two-stage program and solve it using an enhanced nested decomposition method with maximal non-dominated cuts. We conduct extensive numerical experiments and demonstrate the application of the model and algorithm in a case study based on the South Carolina settings. The value of multistage stochastic programming method is also explored by comparing the model solution with the counterparts of an expected value based deterministic model and a two-stage stochastic model.

Use of IPsec by Manned Space Missions

NASA Technical Reports Server (NTRS)

Pajevski, Michael J.

2009-01-01

NASA's Constellation Program is developing its next generation manned space systems for missions to the International Space Station (ISS) and the Moon. The Program is embarking on a path towards standards based Internet Protocol (IP) networking for space systems communication. The IP based communications will be paired with industry standard security mechanisms such as Internet Protocol Security (IPsec) to ensure the integrity of information exchanges and prevent unauthorized release of sensitive information in-transit. IPsec has been tested in simulations on the ground and on at least one Earth orbiting satellite, but the technology is still unproven in manned space mission situations and significant obstacles remain.

Enabling IP Header Compression in COTS Routers via Frame Relay on a Simplex Link

NASA Technical Reports Server (NTRS)

Nguyen, Sam P.; Pang, Jackson; Clare, Loren P.; Cheng, Michael K.

2010-01-01

NASA is moving toward a networkcentric communications architecture and, in particular, is building toward use of Internet Protocol (IP) in space. The use of IP is motivated by its ubiquitous application in many communications networks and in available commercial off-the-shelf (COTS) technology. The Constellation Program intends to fit two or more voice (over IP) channels on both the forward link to, and the return link from, the Orion Crew Exploration Vehicle (CEV) during all mission phases. Efficient bandwidth utilization of the links is key for voice applications. In Voice over IP (VoIP), the IP packets are limited to small sizes to keep voice latency at a minimum. The common voice codec used in VoIP is G.729. This new algorithm produces voice audio at 8 kbps and in packets of 10-milliseconds duration. Constellation has designed the VoIP communications stack to use the combination of IP/UDP/RTP protocols where IP carries a 20-byte header, UDP (User Datagram Protocol) carries an 8-byte header, and RTP (Real Time Transport Protocol) carries a 12-byte header. The protocol headers total 40 bytes and are equal in length to a 40-byte G.729 payload, doubling the VoIP latency. Since much of the IP/UDP/RTP header information does not change from IP packet to IP packet, IP/UDP/RTP header compression can avoid transmission of much redundant data as well as reduce VoIP latency. The benefits of IP header compression are more pronounced at low data rate links such as the forward and return links during CEV launch. IP/UDP/RTP header compression codecs are well supported by many COTS routers. A common interface to the COTS routers is through frame relay. However, enabling IP header compression over frame relay, according to industry standard (Frame Relay IP Header Compression Agreement FRF.20), requires a duplex link and negotiations between the compressor router and the decompressor router. In Constellation, each forward to and return link from the CEV in space is treated independently as a simplex link. Without negotiation, the COTS routers are prevented from entering into the IP header compression mode, and no IP header compression would be performed. An algorithm is proposed to enable IP header compression in COTS routers on a simplex link with no negotiation or with a one-way messaging. In doing so, COTS routers can enter IP header compression mode without the need to handshake through a bidirectional link as required by FRF.20. This technique would spoof the routers locally and thereby allow the routers to enter into IP header compression mode without having the negotiations between routers actually occur. The spoofing function is conducted by a frame relay adapter (also COTS) with the capability to generate control messages according to the FRF.20 descriptions. Therefore, negotiation is actually performed between the FRF.20 adapter and the connecting COTS router locally and never occurs over the space link. Through understanding of the handshaking protocol described by FRF.20, the necessary FRF.20 negotiations messages can be generated to control the connecting router, not only to turn on IP header compression but also to adjust the compression parameters. The FRF.20 negotiation (or control) message is composed in the FRF.20 adapter by interpreting the incoming router request message. Many of the fields are simply transcribed from request to response while the control field indicating response and type are modified.

DROMPA: easy-to-handle peak calling and visualization software for the computational analysis and validation of ChIP-seq data.

PubMed

Nakato, Ryuichiro; Itoh, Tahehiko; Shirahige, Katsuhiko

2013-07-01

Chromatin immunoprecipitation with high-throughput sequencing (ChIP-seq) can identify genomic regions that bind proteins involved in various chromosomal functions. Although the development of next-generation sequencers offers the technology needed to identify these protein-binding sites, the analysis can be computationally challenging because sequencing data sometimes consist of >100 million reads/sample. Herein, we describe a cost-effective and time-efficient protocol that is generally applicable to ChIP-seq analysis; this protocol uses a novel peak-calling program termed DROMPA to identify peaks and an additional program, parse2wig, to preprocess read-map files. This two-step procedure drastically reduces computational time and memory requirements compared with other programs. DROMPA enables the identification of protein localization sites in repetitive sequences and efficiently identifies both broad and sharp protein localization peaks. Specifically, DROMPA outputs a protein-binding profile map in pdf or png format, which can be easily manipulated by users who have a limited background in bioinformatics. © 2013 The Authors Genes to Cells © 2013 by the Molecular Biology Society of Japan and Wiley Publishing Asia Pty Ltd.

Elliptic Curve Integral Points on y2 = x3 + 3x ‑ 14

NASA Astrophysics Data System (ADS)

Zhao, Jianhong

2018-03-01

The positive integer points and integral points of elliptic curves are very important in the theory of number and arithmetic algebra, it has a wide range of applications in cryptography and other fields. There are some results of positive integer points of elliptic curve y 2 = x 3 + ax + b, a, b ∈ Z In 1987, D. Zagier submit the question of the integer points on y 2 = x 3 ‑ 27x + 62, it count a great deal to the study of the arithmetic properties of elliptic curves. In 2009, Zhu H L and Chen J H solved the problem of the integer points on y 2 = x 3 ‑ 27x + 62 by using algebraic number theory and P-adic analysis method. In 2010, By using the elementary method, Wu H M obtain all the integral points of elliptic curves y 2 = x 3 ‑ 27x ‑ 62. In 2015, Li Y Z and Cui B J solved the problem of the integer points on y 2 = x 3 ‑ 21x ‑ 90 By using the elementary method. In 2016, Guo J solved the problem of the integer points on y 2 = x 3 + 27x + 62 by using the elementary method. In 2017, Guo J proved that y 2 = x 3 ‑ 21x + 90 has no integer points by using the elementary method. Up to now, there is no relevant conclusions on the integral points of elliptic curves y 2 = x 3 + 3x ‑ 14, which is the subject of this paper. By using congruence and Legendre Symbol, it can be proved that elliptic curve y 2 = x 3 + 3x ‑ 14 has only one integer point: (x, y) = (2, 0).

Program Evaluation of Outcomes Based Orthotic and Prosthetic Education

DTIC Science & Technology

2006-12-01

Rheumatoid Arthritis; synovial joints ; tendon sheaths. b. Osteoarthritis; weight bearing joints ; loading areas. c. Osteoporosis; cancellous bone...flexion. 32. The desirable length of a thumb post is: a. to the thumb IP joint . b. proximal to the IP joint . c. to the nail bed. d. just...assist hyperextension of the thoracic spine. b. eliminate motion. c. prevent lumbar flexion. d. reduce axial load on lumbar vertebrae. 44

Communication-Gateway Software For NETEX, DECnet, And TCP/IP

NASA Technical Reports Server (NTRS)

Keith, B.; Ferry, D.; Fendler, E.

1990-01-01

Communications gateway software, GATEWAY, provides process-to-process communication between remote applications programs in different protocol domains. Communicating peer processes may be resident on any paired combination of NETEX, DECnet, or TCP/IP hosts. Provides necessary mapping from one protocol to another and facilitates practical intermachine communications in cost-effective manner by eliminating need to standardize on single protocol or to implement multiple protocols in host computers. Written in Ada.

Integer aperture ambiguity resolution based on difference test

NASA Astrophysics Data System (ADS)

Zhang, Jingyu; Wu, Meiping; Li, Tao; Zhang, Kaidong

2015-07-01

Carrier-phase integer ambiguity resolution (IAR) is the key to highly precise, fast positioning and attitude determination with Global Navigation Satellite System (GNSS). It can be seen as the process of estimating the unknown cycle ambiguities of the carrier-phase observations as integers. Once the ambiguities are fixed, carrier phase data will act as the very precise range data. Integer aperture (IA) ambiguity resolution is the combination of acceptance testing and integer ambiguity resolution, which can realize better quality control of IAR. Difference test (DT) is one of the most popular acceptance tests. This contribution will give a detailed analysis about the following properties of IA ambiguity resolution based on DT: 1. The sharpest and loose upper bounds of DT are derived from the perspective of geometry. These bounds are very simple and easy to be computed, which give the range for the critical values of DT.

Naval Postgraduate School Aircraft Synthesis Program (User’s Manual)

DTIC Science & Technology

1991-09-01

LOGICAL DVFLAG CHARACTER ANS*6, TITLE*80, PHASE*8 INTEGER EN REAL MACHI, M&CH2 DIMENSION ALTD(6), XM& CH (6) 6590 IF(DVFLAG.EQ. .FALSE.) THEN !GIVE OPTION TO...7800 7840 WRITE (6, 78 45) 7845 FORMAT(/7X,’ENTER THE HORIZONTAL TAIL/CANARD’/ &7X,’WEIGHT SLOPE: ’,$) READ(5,7826,ERR-7840) SLOPE(3) IF((SLOPE(3).LT

Formal Semanol Specification of Ada.

DTIC Science & Technology

1980-09-01

concurrent task modeling involved very little change to the SEMANOL metalanguage. A primitive capable of initiating concurrent SEMANOL task processors...i.e., #CO-COMPUTE) and two primitivc-; corresponding to integer semaphores (i.c., #P and #V) were all that were required. In addition, these changes... synchronization techniques and choice of correct unblocking alternatives. We should note that it had been our original intention to use the Ada Translator program

HIPPO Unit Commitment Version 1

DOE Office of Scientific and Technical Information (OSTI.GOV)

2017-01-17

Developed for the Midcontinent Independent System Operator, Inc. (MISO), HIPPO-Unit Commitment Version 1 is for solving security constrained unit commitment problem. The model was developed to solve MISO's cases. This version of codes includes I/O module to read in MISO's csv files, modules to create a state-based mixed integer programming formulation for solving MIP, and modules to test basic procedures to solve MIP via HPC.

Item Selection for the Development of Parallel Forms from an IRT-Based Seed Test Using a Sampling and Classification Approach

ERIC Educational Resources Information Center

Chen, Pei-Hua; Chang, Hua-Hua; Wu, Haiyan

2012-01-01

Two sampling-and-classification-based procedures were developed for automated test assembly: the Cell Only and the Cell and Cube methods. A simulation study based on a 540-item bank was conducted to compare the performance of the procedures with the performance of a mixed-integer programming (MIP) method for assembling multiple parallel test…

Optimum use of air tankers in initial attack: selection, basing, and transfer rules

Treesearch

Francis E. Greulich; William G. O' Regan

1982-01-01

Fire managers face two interrelated problems in deciding the most efficient use of air tankers: where best to base them, and how best to reallocate them each day in anticipation of fire occurrence. A computerized model based on a mixed integer linear program can help in assigning air tankers throughout the fire season. The model was tested using information from...

Towards a theory of automated elliptic mesh generation

NASA Technical Reports Server (NTRS)

Cordova, J. Q.

1992-01-01

The theory of elliptic mesh generation is reviewed and the fundamental problem of constructing computational space is discussed. It is argued that the construction of computational space is an NP-Complete problem and therefore requires a nonstandard approach for its solution. This leads to the development of graph-theoretic, combinatorial optimization and integer programming algorithms. Methods for the construction of two dimensional computational space are presented.

A Generalized Distance’ Estimation Procedure for Intra-Urban Interaction

DTIC Science & Technology

Bettinger . It is found that available estimation techniques necessarily result in non-integer solutions. A mathematical device is therefore...The estimation of urban and regional travel patterns has been a necessary part of current efforts to establish land use guidelines for the Texas...paper details computational experience with travel estimation within Corpus Christi, Texas, using a new convex programming approach of Charnes, Raike and

MIADS2 ... an alphanumeric map information assembly and display system for a large computer

Treesearch

Elliot L. Amidon

1966-01-01

A major improvement and extension of the Map Information Assembly and Display System (MIADS) developed in 1964 is described. Basic principles remain unchanged, but the computer programs have been expanded and rewritten for a large computer, in Fortran IV and MAP languages. The code system is extended from 99 integers to about 2,200 alphanumeric 2-character codes. Hand-...

Cloud-based large-scale air traffic flow optimization

NASA Astrophysics Data System (ADS)

Cao, Yi

The ever-increasing traffic demand makes the efficient use of airspace an imperative mission, and this paper presents an effort in response to this call. Firstly, a new aggregate model, called Link Transmission Model (LTM), is proposed, which models the nationwide traffic as a network of flight routes identified by origin-destination pairs. The traversal time of a flight route is assumed to be the mode of distribution of historical flight records, and the mode is estimated by using Kernel Density Estimation. As this simplification abstracts away physical trajectory details, the complexity of modeling is drastically decreased, resulting in efficient traffic forecasting. The predicative capability of LTM is validated against recorded traffic data. Secondly, a nationwide traffic flow optimization problem with airport and en route capacity constraints is formulated based on LTM. The optimization problem aims at alleviating traffic congestions with minimal global delays. This problem is intractable due to millions of variables. A dual decomposition method is applied to decompose the large-scale problem such that the subproblems are solvable. However, the whole problem is still computational expensive to solve since each subproblem is an smaller integer programming problem that pursues integer solutions. Solving an integer programing problem is known to be far more time-consuming than solving its linear relaxation. In addition, sequential execution on a standalone computer leads to linear runtime increase when the problem size increases. To address the computational efficiency problem, a parallel computing framework is designed which accommodates concurrent executions via multithreading programming. The multithreaded version is compared with its monolithic version to show decreased runtime. Finally, an open-source cloud computing framework, Hadoop MapReduce, is employed for better scalability and reliability. This framework is an "off-the-shelf" parallel computing model that can be used for both offline historical traffic data analysis and online traffic flow optimization. It provides an efficient and robust platform for easy deployment and implementation. A small cloud consisting of five workstations was configured and used to demonstrate the advantages of cloud computing in dealing with large-scale parallelizable traffic problems.

76 FR 18555 - Disease, Disability, and Injury Prevention and Control Special Emphasis Panel (SEP): Initial Review

Federal Register 2010, 2011, 2012, 2013, 2014

2011-04-04

... announced below concerns Economic Studies of Vaccines and Immunization Policies, Programs, and Practices... to ``Economic Studies of Vaccines and Immunization Policies, Programs, and Practices, FOA IP11-007...

A Converse of a Result about the Floor Function by Hermite

ERIC Educational Resources Information Center

Mortici, Cristinel

2012-01-01

The floor function maps a real number to the largest previous integer. More precisely, floor(x)=[x] is the largest integer not greater than x. The square bracket notation [x] for the floor function was introduced by Gauss in his third proof of quadratic reciprocity in 1808. The floor function is also called the greatest integer or entier (French…

Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol

NASA Technical Reports Server (NTRS)

Huang, Xiaowan; Singh, Anu; Smolka, Scott A.

2010-01-01

We use the UPPAAL model checker for Timed Automata to verify the Timing-Sync time-synchronization protocol for sensor networks (TPSN). The TPSN protocol seeks to provide network-wide synchronization of the distributed clocks in a sensor network. Clock-synchronization algorithms for sensor networks such as TPSN must be able to perform arithmetic on clock values to calculate clock drift and network propagation delays. They must be able to read the value of a local clock and assign it to another local clock. Such operations are not directly supported by the theory of Timed Automata. To overcome this formal-modeling obstacle, we augment the UPPAAL specification language with the integer clock derived type. Integer clocks, which are essentially integer variables that are periodically incremented by a global pulse generator, greatly facilitate the encoding of the operations required to synchronize clocks as in the TPSN protocol. With this integer-clock-based model of TPSN in hand, we use UPPAAL to verify that the protocol achieves network-wide time synchronization and is devoid of deadlock. We also use the UPPAAL Tracer tool to illustrate how integer clocks can be used to capture clock drift and resynchronization during protocol execution

System and method for generating attitude determinations using GPS

NASA Technical Reports Server (NTRS)

Cohen, Clark E. (Inventor)

1996-01-01

A GPS attitude receiver for determining the attitude of a moving vehicle in conjunction with a first, a second, a third, and a fourth antenna mounted to the moving vehicle. Each of the antennas receives a plurality of GPS signals that each include a carrier component. For each of the carrier components of the received GPS signals there is an integer ambiguity associated with the first and fourth antennas, an integer ambiguity associated with second and fourth antennas, and an integer ambiguity associated with the third and fourth antennas. The GPS attitude receiver measures phase values for the carrier components of the GPS signals received from each of the antennas at a plurality of measurement epochs during an initialization period and at a measurement epoch after the initialization period. In response to the phase values measured at the measurement epochs during the initialization period, the GPS attitude receiver computes integer ambiguity resolution values representing resolution of the integer ambiguities. Then, in response to the computed integer ambiguity resolution values and the phase value measured at the measurement epoch after the initialization period, it computes values defining the attitude of the moving vehicle at the measurement epoch after the initialization period.

ACTS 118x: High Speed TCP Interoperability Testing

NASA Technical Reports Server (NTRS)

Brooks, David E.; Buffinton, Craig; Beering, Dave R.; Welch, Arun; Ivancic, William D.; Zernic, Mike; Hoder, Douglas J.

1999-01-01

With the recent explosion of the Internet and the enormous business opportunities available to communication system providers, great interest has developed in improving the efficiency of data transfer over satellite links using the Transmission Control Protocol (TCP) of the Internet Protocol (IP) suite. The NASA's ACTS experiments program initiated a series of TCP experiments to demonstrate scalability of TCP/IP and determine to what extent the protocol can be optimized over a 622 Mbps satellite link. Through partnerships with the government technology oriented labs, computer, telecommunication, and satellite industries NASA Glenn was able to: (1) promote the development of interoperable, high-performance TCP/IP implementations across multiple computing / operating platforms; (2) work with the satellite industry to answer outstanding questions regarding the use of standard protocols (TCP/IP and ATM) for the delivery of advanced data services, and for use in spacecraft architectures; and (3) conduct a series of TCP/IP interoperability tests over OC12 ATM over a satellite network in a multi-vendor environment using ACTS. The experiments' various network configurations and the results are presented.

Who Benefits From Supported Employment: A Meta-analytic Study

PubMed Central

Campbell, Kikuko; Drake, Robert E.

2011-01-01

Aims: This meta-analysis sought to identify which subgroups of clients with severe mental illness (SMI) benefited from evidence-based supported employment. Methods: We used meta-analysis to pool the samples from 4 randomized controlled trials comparing the Individual Placement and Support (IPS) model of supported employment to well-regarded vocational approaches using stepwise models and brokered services. Meta-analysis was used to determine the magnitude of effects for IPS/control group differences within specific client subgroups (defined by 2 work history, 7 sociodemographic, and 8 clinical variables) on 3 competitive employment outcomes (obtaining a job, total weeks worked, and job tenure). Results: The findings strongly favored IPS, with large effect sizes across all outcomes: 0.96 for job acquisition, 0.79 for total weeks worked, and 0.74 for job tenure. Overall, 90 (77%) of the 117 effect sizes calculated for the 39 subgroups exceeded 0.70, and all 117 favored IPS. Conclusions: IPS produces better competitive employment outcomes for persons with SMI than alternative vocational programs regardless of background demographic, clinical, and employment characteristics. PMID:19661196

Straddling care and education: Developing interprofessional collaboration through a hotspotting service learning project.

PubMed

Jones, Anne C; Li, Trudy; Zomorodi, Meg; Broadhurst, Rob; Weil, Amy B

2018-06-01

Interprofessional (IP) team work has been shown to decrease burnout and improve care and decrease costs. However, institutional barriers have challenged adoption in practice and education. Faculty and students are turning to IP service-learning projects to help students gain experience and provide needed services. This paper highlights a "hotspotting" program where students from different health professions work collaboratively to improve high utilizing patients' health. Benefits, challenges and preliminary results including cost savings and student efficacy are shared. Institutions should surmount barriers that make hotspotting service-learning challenging as IP team-based experiences prepare students for the workplace and can help mitigate burnout. Copyright © 2018 Elsevier Inc. All rights reserved.

Energy star compliant voice over internet protocol (VoIP) telecommunications network including energy star compliant VoIP devices

DOEpatents

Kouchri, Farrokh Mohammadzadeh

2012-11-06

A Voice over Internet Protocol (VoIP) communications system, a method of managing a communications network in such a system and a program product therefore. The system/network includes an ENERGY STAR (E-star) aware softswitch and E-star compliant communications devices at system endpoints. The E-star aware softswitch allows E-star compliant communications devices to enter and remain in power saving mode. The E-star aware softswitch spools messages and forwards only selected messages (e.g., calls) to the devices in power saving mode. When the E-star compliant communications devices exit power saving mode, the E-star aware softswitch forwards spooled messages.

Scheduling the resident 80-hour work week: an operations research algorithm.

PubMed

Day, T Eugene; Napoli, Joseph T; Kuo, Paul C

2006-01-01

The resident 80-hour work week requires that programs now schedule duty hours. Typically, scheduling is performed in an empirical "trial-and-error" fashion. However, this is a classic "scheduling" problem from the field of operations research (OR). It is similar to scheduling issues that airlines must face with pilots and planes routing through various airports at various times. The authors hypothesized that an OR approach using iterative computer algorithms could provide a rational scheduling solution. Institution-specific constraints of the residency problem were formulated. A total of 56 residents are rotating through 4 hospitals. Additional constraints were dictated by the Residency Review Committee (RRC) rules or the specific surgical service. For example, at Hospital 1, during the weekday hours between 6 am and 6 pm, there will be a PGY4 or PGY5 and a PGY2 or PGY3 on-duty to cover Service "A." A series of equations and logic statements was generated to satisfy all constraints and requirements. These were restated in the Optimization Programming Language used by the ILOG software suite for solving mixed integer programming problems. An integer programming solution was generated to this resource-constrained assignment problem. A total of 30,900 variables and 12,443 constraints were required. A total of man-hours of programming were used; computer run-time was 25.9 hours. A weekly schedule was generated for each resident that satisfied the RRC regulations while fulfilling all stated surgical service requirements. Each required between 64 and 80 weekly resident duty hours. The authors conclude that OR is a viable approach to schedule resident work hours. This technique is sufficiently robust to accommodate changes in resident numbers, service requirements, and service and hospital rotations.

Pattern-Based Design of Insider Threat Programs

DTIC Science & Technology

2014-12-01

also applied these models to develop best practices and technical controls for mitigating insider threat. In some cases of in- sider threat...departing insiders might take valuable IP with them. One set of practices and controls designed to reduce the risk of insider IP theft is based on case data...describing this set of practices and controls helps to balance the costs of monitoring employee behavior for suspicious actions against the risk of

DDN (Defense Data Network) Protocol Implementations and Vendors Guide,

DTIC Science & Technology

1988-02-01

TELNET) TCP/IP on an ethernet network. The program simulates a Hayes modem through the serial port. BWFTP is a thorough implementation of the FTP...25 IMP interface at VV from 19.2 Kbps to 56K bps. The IP, ICMP, TCP, Telnet. FFP and SMTP protocols are implemented along with R-Utxities...WANs. microcomputers, dataswitches. minicomputers. "black boxes" and modems . DOCUMENTATION: Software System Overview, Generic X.25 Porting Guide

Transition to an IP Environment. A Report of the Annual Aspen Institute Conference on Telecommunications Policy (15th, Aspen, Colorado, August 12-16, 2000) with Thoughts on the Implications of Technological Change for Telecommunications Policy.

ERIC Educational Resources Information Center

Entman, Robert M.; Katz, Michael L.

The Aspen Institute's Communications and Society Program convened leaders and experts in the telecommunications and related fields to address telecommunications regulation in an IP (Internet Protocols) environment at the 15th annual Aspen Institute Telecommunications Policy Conference (Aspen, Colorado, August 12-16, 2000). The report from this…

Research into alternative network approaches for space operations

NASA Technical Reports Server (NTRS)

Kusmanoff, Antone L.; Barton, Timothy J.

1990-01-01

The main goal is to resolve the interoperability problem of applications employing DOD TCP/IP (Department of Defence Transmission Control Protocol/Internet Protocol) family of protocols on a CCITT/ISO based network. The objective is to allow them to communicate over the CCITT/ISO protocol GPLAN (General Purpose Local Area Network) network without modification to the user's application programs. There were two primary assumptions associated with the solution that was actually realized. The first is that the solution had to allow for future movement to the exclusive use of the CCITT/ISO standards. The second is that the solution had to be software transparent to the currently installed TCP/IP and CCITT/ISO user application programs.

Scoping review of resources for integrating evidence-based supported employment into spinal cord injury rehabilitation.

PubMed

Cotner, Bridget A; Ottomanelli, Lisa; Keleher, Virginia; Dirk, Lynn

2018-02-27

Individual placement and support (IPS), an evidence-based supported employment (SE) program, has helped Veterans with spinal cord injury (SCI) receiving care in the Veterans Health Administration to obtain work. To facilitate integration of IPS into SCI rehabilitation, resources are needed. A scoping review was conducted to identify tools and resources suitable for providers of SCI care. Applying a modified version of Arksey and O'Malley's framework, a scoping review of literature on SE tools or resources was conducted. The original review focused on resources published between 2002 and 2015 and available in English. Prior to publication an updated review through 2017 was conducted. From 1822 tools and resources identified in the initial review, 24 met criteria for inclusion and were evaluated by an advisory panel of experts, who selected 16 tools that addressed five topics: IPS in SCI (n = 2) orientation to SCI (n = 3); IPS SE (n = 7), job accommodations (n = 2), and benefits planning (n = 2). The updated review yielded no tools or resources that met inclusion criteria. Despite few resources to guide implementation of IPS in SCI, 16 essential resources were identified that, combined into a toolkit, may facilitate translation of IPS in SCI from research to clinical care. Implications for rehabilitation The toolkit consists of 16 essential resources and is currently available online to all persons involved in spinal cord injury rehabilitation to educate them about this effective means of assisting persons with spinal cord injury to find employment and to facilitate translation of individual placement and support in spinal cord injury from research to clinical care. While expert-informed, the toolkit is being field tested with both clinical and vocational providers to facilitate the adoption of individual placement and support by spinal cord injury rehabilitation programs. The revised version will be made available online.

Dynamic Distributed Cooperative Control of Multiple Heterogeneous Resources

DTIC Science & Technology

2012-10-01

of the UAVs to maximize the total sensor footprint over the region of interest. The algorithm utilized to solve this problem was based on sampling a...and moving obstacles. Obstacle positions were assumed known a priori. Kingston and Beard [22] presented an algorithm to keep moving UAVs equally spaced...Planning Algorithms , Cambridge University Press, 2006. 11. Ma, C. S. and Miller, R. H., “Mixed integer linear programming trajectory generation for

An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem

DTIC Science & Technology

2009-03-01

cargo, and the problem therefore becomes trivial. 3. Shoring: Some cargo requires shoring which is small planks of plywood stacked on top of each...Integer Programming Method In 1989, Kevin Ng examined the bin-packing MPALP for Canada’s C-130 aircraft (Ng 1992). His goal was to move a set of... leadership & ethics [ ] warfighting [ ] international security [ ] doctrine [X] other (specify): Military Airlift

Optimized Waterspace Management and Scheduling Using Mixed-Integer Linear Programming

DTIC Science & Technology

2016-01-01

Complete [30]. Proposition 4.1 satisfies the first criterion. For the second criterion, we will use the Traveling Salesman Problem (TSP), which has been...A branch and cut algorithm for the symmetric generalized traveling salesman problem , Operations Research 45 (1997) 378–394. [33] J. Silberholz, B...Golden, The generalized traveling salesman problem : A new genetic algorithm ap- proach, Extended Horizons: Advances in Computing, Optimization, and

Uncluttered Single-Image Visualization of Vascular Structures using GPU and Integer Programming

PubMed Central

Won, Joong-Ho; Jeon, Yongkweon; Rosenberg, Jarrett; Yoon, Sungroh; Rubin, Geoffrey D.; Napel, Sandy

2013-01-01

Direct projection of three-dimensional branching structures, such as networks of cables, blood vessels, or neurons onto a 2D image creates the illusion of intersecting structural parts and creates challenges for understanding and communication. We present a method for visualizing such structures, and demonstrate its utility in visualizing the abdominal aorta and its branches, whose tomographic images might be obtained by computed tomography or magnetic resonance angiography, in a single two-dimensional stylistic image, without overlaps among branches. The visualization method, termed uncluttered single-image visualization (USIV), involves optimization of geometry. This paper proposes a novel optimization technique that utilizes an interesting connection of the optimization problem regarding USIV to the protein structure prediction problem. Adopting the integer linear programming-based formulation for the protein structure prediction problem, we tested the proposed technique using 30 visualizations produced from five patient scans with representative anatomical variants in the abdominal aortic vessel tree. The novel technique can exploit commodity-level parallelism, enabling use of general-purpose graphics processing unit (GPGPU) technology that yields a significant speedup. Comparison of the results with the other optimization technique previously reported elsewhere suggests that, in most aspects, the quality of the visualization is comparable to that of the previous one, with a significant gain in the computation time of the algorithm. PMID:22291148

Automatic design of synthetic gene circuits through mixed integer non-linear programming.

PubMed

Huynh, Linh; Kececioglu, John; Köppe, Matthias; Tagkopoulos, Ilias

2012-01-01

Automatic design of synthetic gene circuits poses a significant challenge to synthetic biology, primarily due to the complexity of biological systems, and the lack of rigorous optimization methods that can cope with the combinatorial explosion as the number of biological parts increases. Current optimization methods for synthetic gene design rely on heuristic algorithms that are usually not deterministic, deliver sub-optimal solutions, and provide no guaranties on convergence or error bounds. Here, we introduce an optimization framework for the problem of part selection in synthetic gene circuits that is based on mixed integer non-linear programming (MINLP), which is a deterministic method that finds the globally optimal solution and guarantees convergence in finite time. Given a synthetic gene circuit, a library of characterized parts, and user-defined constraints, our method can find the optimal selection of parts that satisfy the constraints and best approximates the objective function given by the user. We evaluated the proposed method in the design of three synthetic circuits (a toggle switch, a transcriptional cascade, and a band detector), with both experimentally constructed and synthetic promoter libraries. Scalability and robustness analysis shows that the proposed framework scales well with the library size and the solution space. The work described here is a step towards a unifying, realistic framework for the automated design of biological circuits.

Predicting protein contact map using evolutionary and physical constraints by integer programming.

PubMed

Wang, Zhiyong; Xu, Jinbo

2013-07-01

Protein contact map describes the pairwise spatial and functional relationship of residues in a protein and contains key information for protein 3D structure prediction. Although studied extensively, it remains challenging to predict contact map using only sequence information. Most existing methods predict the contact map matrix element-by-element, ignoring correlation among contacts and physical feasibility of the whole-contact map. A couple of recent methods predict contact map by using mutual information, taking into consideration contact correlation and enforcing a sparsity restraint, but these methods demand for a very large number of sequence homologs for the protein under consideration and the resultant contact map may be still physically infeasible. This article presents a novel method PhyCMAP for contact map prediction, integrating both evolutionary and physical restraints by machine learning and integer linear programming. The evolutionary restraints are much more informative than mutual information, and the physical restraints specify more concrete relationship among contacts than the sparsity restraint. As such, our method greatly reduces the solution space of the contact map matrix and, thus, significantly improves prediction accuracy. Experimental results confirm that PhyCMAP outperforms currently popular methods no matter how many sequence homologs are available for the protein under consideration. http://raptorx.uchicago.edu.

The whole number axis integer linear transformation reversible information hiding algorithm on wavelet domain

NASA Astrophysics Data System (ADS)

Jiang, Zhuo; Xie, Chengjun

2013-12-01

This paper improved the algorithm of reversible integer linear transform on finite interval [0,255], which can realize reversible integer linear transform in whole number axis shielding data LSB (least significant bit). Firstly, this method use integer wavelet transformation based on lifting scheme to transform the original image, and select the transformed high frequency areas as information hiding area, meanwhile transform the high frequency coefficients blocks in integer linear way and embed the secret information in LSB of each coefficient, then information hiding by embedding the opposite steps. To extract data bits and recover the host image, a similar reverse procedure can be conducted, and the original host image can be lossless recovered. The simulation experimental results show that this method has good secrecy and concealment, after conducted the CDF (m, n) and DD (m, n) series of wavelet transformed. This method can be applied to information security domain, such as medicine, law and military.

An RCT Evaluating the Effects of Skills Training and Medication Type on Work Outcomes Among Patients With Schizophrenia.

PubMed

Glynn, Shirley M; Marder, Stephen R; Noordsy, Douglas L; O'Keefe, Christopher; Becker, Deborah R; Drake, Robert E; Sugar, Catherine A

2017-03-01

Although supported employment increases job acquisition for people with serious mental illness, data on participants' job tenure have been variable. This study evaluated the effects of a standardized work skills training program (the Workplace Fundamentals Module [WPFM]) on job tenure and other work outcomes among individuals receiving individual placement and support (IPS). The effects of two atypical antipsychotic medications on side effects were also tested. The primary hypothesis tested was that participants in IPS plus WPFM would have increased job tenure compared with those enrolled in IPS only, and the secondary hypothesis was that different antipsychotic medications would yield unique side effects. A 2×2 randomized controlled trial compared work outcomes, including job tenure, of participants receiving IPS with or without WPFM for up to two years after obtaining a job. Participants were also randomly assigned to olanzapine or risperidone. Measures of work outcomes, clinical status, and medication side effects were collected. Among 107 participants, 63% obtained at least one job. WPFM did not increase job tenure (51.53 and 41.37 total weeks worked for IPS only and IPS plus WPFM, respectively) or affect other work outcomes. Participants on olanzapine experienced increased body mass index, whereas those on risperidone lost weight, but medications did not differentially affect clinical or job outcomes. Clinic-based skills training did not improve work outcomes accruing from IPS. Risperidone, compared with olanzapine, may reduce body mass but has no differential effect on other work or clinical outcomes.

Telemetry and Communication IP Video Player

NASA Technical Reports Server (NTRS)

OFarrell, Zachary L.

2011-01-01

Aegis Video Player is the name of the video over IP system for the Telemetry and Communications group of the Launch Services Program. Aegis' purpose is to display video streamed over a network connection to be viewed during launches. To accomplish this task, a VLC ActiveX plug-in was used in C# to provide the basic capabilities of video streaming. The program was then customized to be used during launches. The VLC plug-in can be configured programmatically to display a single stream, but for this project multiple streams needed to be accessed. To accomplish this, an easy to use, informative menu system was added to the program to enable users to quickly switch between videos. Other features were added to make the player more useful, such as watching multiple videos and watching a video in full screen.

A GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliability of components

NASA Astrophysics Data System (ADS)

Gupta, R. K.; Bhunia, A. K.; Roy, D.

2009-10-01

In this paper, we have considered the problem of constrained redundancy allocation of series system with interval valued reliability of components. For maximizing the overall system reliability under limited resource constraints, the problem is formulated as an unconstrained integer programming problem with interval coefficients by penalty function technique and solved by an advanced GA for integer variables with interval fitness function, tournament selection, uniform crossover, uniform mutation and elitism. As a special case, considering the lower and upper bounds of the interval valued reliabilities of the components to be the same, the corresponding problem has been solved. The model has been illustrated with some numerical examples and the results of the series redundancy allocation problem with fixed value of reliability of the components have been compared with the existing results available in the literature. Finally, sensitivity analyses have been shown graphically to study the stability of our developed GA with respect to the different GA parameters.

Optimizing Multi-Product Multi-Constraint Inventory Control Systems with Stochastic Replenishments

NASA Astrophysics Data System (ADS)

Allah Taleizadeh, Ata; Aryanezhad, Mir-Bahador; Niaki, Seyed Taghi Akhavan

Multi-periodic inventory control problems are mainly studied employing two assumptions. The first is the continuous review, where depending on the inventory level orders can happen at any time and the other is the periodic review, where orders can only happen at the beginning of each period. In this study, we relax these assumptions and assume that the periodic replenishments are stochastic in nature. Furthermore, we assume that the periods between two replenishments are independent and identically random variables. For the problem at hand, the decision variables are of integer-type and there are two kinds of space and service level constraints for each product. We develop a model of the problem in which a combination of back-order and lost-sales are considered for the shortages. Then, we show that the model is of an integer-nonlinear-programming type and in order to solve it, a search algorithm can be utilized. We employ a simulated annealing approach and provide a numerical example to demonstrate the applicability of the proposed methodology.

Challenges in implementing individual placement and support in the Australian mental health service and policy context.

PubMed

Stirling, Yolande; Higgins, Kate; Petrakis, Melissa

2018-02-01

Objective Although Australia's service and policy context differs from that of the US, studies have highlighted potential for individual placement and support (IPS) to support competitive employment outcomes for people with severe and persistent mental illness. The aim of the present study was to explore why the model is not yet widely available. Methods A document analysis was conducted to discern reasons for challenges in implementation of IPS practice principles within the Australian service context. Results The document analysis illustrated that although policy acknowledges the importance of increasing employment rates for people with severe and persistent mental illness, consistent measures, change indicators, direction and time frames are lacking in policy and strategy documentation. Further, IPS principles are not consistently evident in guiding operational documentation that government-funded Disability Employment Services (DES) programs are mandated to adhere to. Conclusions For IPS to be readily implemented, it is necessary for government to offer support to agencies to partner and formal endorsement of the model as a preferred approach in tendering processes. Obligations and processes must be reviewed to ensure that model fidelity is achievable within the Australian Commonwealth policy and service context for programs to achieve competitive employment rates comparable to the most successful international programs. What is known about the topic? The IPS model has been established as the most efficacious approach to support people with severe and persistent mental ill health to gain and sustain employment internationally, yet little is known as to why this model has had very limited uptake in the Australian adult mental health service and policy context. What does this paper add? This paper provides an investigation into the achievability of IPS within DES philosophical and contractual arrangements. What are the implications for practitioners? Mental health practitioners are typically skilled in their understanding of individual or micro-level challenges faced by consumers in achieving vocational goals: working with symptoms, medication side effects, motivation and anxiety. The present study was designed to offer practitioners an increased understanding of service-level factors, because these present considerable challenges to achieving sustained employment. This paper is a call for greater advocacy towards better integration of employment and mental health service delivery in the Australian policy and practice context.

Java Programming Language

NASA Technical Reports Server (NTRS)

Shaykhian, Gholam Ali

2007-01-01

The Java seminar covers the fundamentals of Java programming language. No prior programming experience is required for participation in the seminar. The first part of the seminar covers introductory concepts in Java programming including data types (integer, character, ..), operators, functions and constants, casts, input, output, control flow, scope, conditional statements, and arrays. Furthermore, introduction to Object-Oriented programming in Java, relationships between classes, using packages, constructors, private data and methods, final instance fields, static fields and methods, and overloading are explained. The second part of the seminar covers extending classes, inheritance hierarchies, polymorphism, dynamic binding, abstract classes, protected access. The seminar conclude by introducing interfaces, properties of interfaces, interfaces and abstract classes, interfaces and cailbacks, basics of event handling, user interface components with swing, applet basics, converting applications to applets, the applet HTML tags and attributes, exceptions and debugging.

Edgelist phase unwrapping algorithm for time series InSAR analysis.

PubMed

Shanker, A Piyush; Zebker, Howard

2010-03-01

We present here a new integer programming formulation for phase unwrapping of multidimensional data. Phase unwrapping is a key problem in many coherent imaging systems, including time series synthetic aperture radar interferometry (InSAR), with two spatial and one temporal data dimensions. The minimum cost flow (MCF) [IEEE Trans. Geosci. Remote Sens. 36, 813 (1998)] phase unwrapping algorithm describes a global cost minimization problem involving flow between phase residues computed over closed loops. Here we replace closed loops by reliable edges as the basic construct, thus leading to the name "edgelist." Our algorithm has several advantages over current methods-it simplifies the representation of multidimensional phase unwrapping, it incorporates data from external sources, such as GPS, where available to better constrain the unwrapped solution, and it treats regularly sampled or sparsely sampled data alike. It thus is particularly applicable to time series InSAR, where data are often irregularly spaced in time and individual interferograms can be corrupted with large decorrelated regions. We show that, similar to the MCF network problem, the edgelist formulation also exhibits total unimodularity, which enables us to solve the integer program problem by using efficient linear programming tools. We apply our method to a persistent scatterer-InSAR data set from the creeping section of the Central San Andreas Fault and find that the average creep rate of 22 mm/Yr is constant within 3 mm/Yr over 1992-2004 but varies systematically with ground location, with a slightly higher rate in 1992-1998 than in 1999-2003.

Introducing difference recurrence relations for faster semi-global alignment of long sequences.

PubMed

Suzuki, Hajime; Kasahara, Masahiro

2018-02-19

The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith-Waterman-Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors. We proposed a faster semi-global alignment algorithm, "difference recurrence relations," that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs. Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba .

Quantum Hall effect in ac driven graphene: From the half-integer to the integer case

NASA Astrophysics Data System (ADS)

Ding, Kai-He; Lim, Lih-King; Su, Gang; Weng, Zheng-Yu

2018-01-01

We theoretically study the quantum Hall effect (QHE) in graphene with an ac electric field. Based on the tight-binding model, the structure of the half-integer Hall plateaus at σxy=±(n +1 /2 ) 4 e2/h (n is an integer) gets qualitatively changed with the addition of new integer Hall plateaus at σxy=±n (4 e2/h ) starting from the edges of the band center regime towards the band center with an increasing ac field. Beyond a critical field strength, a Hall plateau with σxy=0 can be realized at the band center, hence fully restoring a conventional integer QHE with particle-hole symmetry. Within a low-energy Hamiltonian for Dirac cones merging, we show a very good agreement with the tight-binding calculations for the Hall plateau transitions. We also obtain the band structure for driven graphene ribbons to provide a further understanding on the appearance of the new Hall plateaus, showing a trivial insulator behavior for the σxy=0 state. In the presence of disorder, we numerically study the disorder-induced destruction of the quantum Hall states in a finite driven sample and find that qualitative features known in the undriven disordered case are maintained.

A Polynomial Time, Numerically Stable Integer Relation Algorithm

NASA Technical Reports Server (NTRS)

Ferguson, Helaman R. P.; Bailey, Daivd H.; Kutler, Paul (Technical Monitor)

1998-01-01

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

An fMRI Investigation of Preparatory Set in the Human Cerebral Cortex and Superior Colliculus for Pro- and Anti-Saccades

PubMed Central

Furlan, Michele; Smith, Andrew T.; Walker, Robin

2016-01-01

Previous studies have identified several cortical regions that show larger BOLD responses during preparation and execution of anti-saccades than pro-saccades. We confirmed this finding with a greater BOLD response for anti-saccades than pro-saccades during the preparation phase in the FEF, IPS and DLPFC and in the FEF and IPS in the execution phase. We then applied multi-voxel pattern analysis (MVPA) to establish whether different neural populations are involved in the two types of saccade. Pro-saccades and anti-saccades were reliably decoded during saccade execution in all three cortical regions (FEF, DLPFC and IPS) and in IPS during saccade preparation. This indicates neural specialization, for programming the desired response depending on the task rule, in these regions. In a further study tailored for imaging the superior colliculus in the midbrain a similar magnitude BOLD response was observed for pro-saccades and anti-saccades and the two saccade types could not be decoded with MVPA. This was the case both for activity related to the preparation phase and also for that elicited during the execution phase. We conclude that separate cortical neural populations are involved in the task-specific programming of a saccade while in contrast, the SC has a role in response preparation but may be less involved in high-level, task-specific aspects of the control of saccades. PMID:27391390

78 FR 39619 - Closed Captioning of Internet Protocol-Delivered Video Programming: Implementation of the Twenty...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-02

... covered apparatus may convey from the source device to the consumer equipment the information necessary to... using Internet protocol (``IP'') and apparatus used by consumers to view video programming. The action...-delivered video programming and rules governing the closed captioning capabilities of certain apparatus on...

NICA project at JINR: status and prospects

NASA Astrophysics Data System (ADS)

Kekelidze, V. D.

2017-06-01

The project NICA (Nuclotron-based Ion Collider fAcility) is aimed to study hot and dense baryonic matter in heavy-ion collisions in the energy range up to 11.0 AGeV . The plan of NICA accelerator block development includes an upgrade of the existing superconducting (SC) synchrotron Nuclotron and construction of the new injection complex, SC Booster, and SC Collider with two interaction points (IP). The heavy-ion collision program will be performed with the fixed target experiment Baryonic Matter at Nuclotron (BM@N) at the beam extracted from the Nuclotron, and with Multi-Purpose Detector (MPD) at the first IP of NICA Collider. Investigation of nucleon spin structure and polarization phenomena is foreseen with the Spin Physics Detector (SPC) at the second IP of the Collider.

Evolution of interprofessional learning: Dalhousie University's "From Family Violence to Health" module.

PubMed

Johnston, Grace M; Ryding, Helen A; Campbell, Lindsay M

2003-11-01

At Dalhousie University, interprofessional (IP) learning modules are used to help future health care professionals learn to work together in resolving complex problems. One module, "From Family Violence to Health," features the role of dental professionals. This paper describes the evolution of this module from the year 2000. By February 2003, 1,182 students from 15 health care professions had completed the module. Qualitative evaluation in years 1 and 2 of the program (2000 and 2001) revealed that, before participating in the IP module, many students were able to identify a role for themselves in the recognition of family violence and knew their responsibility to report incidents. However, after participating in the module, they had a greater understanding of the reporting of family violence, a more comprehensive and supportive perspective, increased recognition of how health care professionals could work together and improved awareness of the roles of other professions. In a quantitative evaluation in year 3 (2002), mean student ratings on a scale of 1 to 5 indicated that the IP module was relevant (4.2), increased their understanding of family violence (4.0), and had some impact in promoting IP learning (3.8). As health care delivery becomes more focused on care teams and system thinking, the provision of IP training is expected to increase. The Dalhousie University IP modules (available at http://www.dal.ca/~fhp/ipl/index.html) address health and social problems for which it is critical that health care and other professionals work together. Feedback from practitioners on the development of IP education is welcomed, particularly with regard to the IP module addressing family violence.

Imaging Coronal Mass Ejections and Large-Scale Solar Wind Structure Using IPS and Thomson-Scattered Sunlight (Invited)

NASA Astrophysics Data System (ADS)

Clover, J. M.; Jackson, B. V.; Buffington, A.; Hick, P. P.; Bisi, M. M.; Tokumaru, M.; Fujiki, K.

2010-12-01

The Solar Mass Ejection Imager (SMEI) observes Thomson-scattered white light from heliospheric electrons across almost all of the sky nearly all of the time since early 2003. Interplanetary scintillation (IPS) observations of velocity and g-level provide similar structure information but with a less-complete sky-and-time coverage. The Solar TErrestrial RElations Observatory (STEREO) twin spacecraft outer Heliospheric Imagers (HI-2) currently image the heliosphere in Thomson-scattered light near the ecliptic plane far from Earth. The Solar-Terrestrial Environment Laboratory (STELab) IPS observations provide IPS velocity and g-level values, which in conjunction with our tomographic reconstruction program, yield velocities and densities of the inner heliosphere in three dimensions. The same tomographic program substitutes SMEI Thomson-scattering brightness information for the g-level values to derive heliospheric densities from these data alone. We look at the global structure of the heliosphere concentrating mainly on three events from 2007 through the rise phase of Solar Cycle 24. The first event, observed in both the IPS and SMEI defines the three-dimensional velocity and density structure around the time of the shock observed at Earth on 02:02 UT 17 December 2007. The second event, seen only by SMEI, is that of the 23-26 April 2008 coronal mass ejection (CME) and its interplanetary counterpart. The third event is the CME (and its interplanetary counterpart) that took place 17 January 2010 and arrived at STEREO-B about four days later. For each event, we isolate the particular portion of the heliosphere attributed to the transient density structure using our tomographic technique, and then estimate its extent.

Multi-wavelength Observations of the Enduring Type IIn Supernovae 2005ip and 2006jd

NASA Astrophysics Data System (ADS)

Stritzinger, Maximilian; Taddia, Francesco; Fransson, Claes; Fox, Ori D.; Morrell, Nidia; Phillips, M. M.; Sollerman, Jesper; Anderson, J. P.; Boldt, Luis; Brown, Peter J.; Campillay, Abdo; Castellon, Sergio; Contreras, Carlos; Folatelli, Gastón; Habergham, S. M.; Hamuy, Mario; Hjorth, Jens; James, Phil A.; Krzeminski, Wojtek; Mattila, Seppo; Persson, Sven E.; Roth, Miguel

2012-09-01

We present an observational study of the Type IIn supernovae (SNe IIn) 2005ip and 2006jd. Broadband UV, optical, and near-IR photometry, and visual-wavelength spectroscopy of SN 2005ip complement and extend upon published observations to 6.5 years past discovery. Our observations of SN 2006jd extend from UV to mid-infrared wavelengths, and like SN 2005ip, are compared to reported X-ray measurements to understand the nature of the progenitor. Both objects display a number of similarities with the 1988Z-like subclass of SN IIn including (1) remarkably similar early- and late-phase optical spectra, (2) a variety of high-ionization coronal lines, (3) long-duration optical and near-IR emission, and (4) evidence of cold and warm dust components. However, diversity is apparent, including an unprecedented late-time r-band excess in SN 2006jd. The observed differences are attributed to differences between the mass-loss history of the progenitor stars. We conclude that the progenitor of SN 2006jd likely experienced a significant mass-loss event during its pre-SN evolution akin to the great 19th century eruption of η Carinae. Contrarily, as advocated by Smith et al., the circumstellar environment of SN 2005ip is found to be more consistent with a clumpy wind progenitor. This paper includes data gathered with the 6.5 m Magellan Telescopes, located at Las Campanas Observatory, Chile; the Gemini-North Telescope, Mauna Kea, USA (Gemini Program GN-2010B-Q-67, PI: Stritzinger); the ESO NTT, La Silla, Chile (Program 076.A-0156 and 078.D-0048, PI: Hamuy); and the INT and the NOT (Proposal number 45 - 004, PI: Taddia), La Palma, Spain.

TECHNICAL AND REGULATORY CONSIDERATIONS IN USING FREIGHT CONTAINERS AS INDUSTRIAL PACKAGES

DOE Office of Scientific and Technical Information (OSTI.GOV)

Opperman, E; Mark Hawk, M; Ron Natali, R

2007-10-16

The United States (US) Department of Energy (DOE), Office of Environmental Management (EM), is actively pursuing activities to reduce the radiological risk and clean up the environmental legacy of the nation's nuclear weapons programs. EM has made significant progress in recent years in the clean-up and closure of sites and is also focusing on longer-term activities necessary for the completion of the clean-up program. The packaging and transportation of contaminated demolition debris and low-level waste (LLW) materials in a safe and cost-effective manner are essential in completing this mission. Toward this end, the US Department of Transportation's (DOT) Final Rulemore » on Hazardous Materials Regulation Final Rule issued January 26, 2004, included a new provision authorizing the use of Freight Containers (e.g., 20 and 40-foot ISO Containers) as Industrial Packages Type 1, 2, or 3 (IP-1, IP-2, and IP-3). This paper will discuss the technical and regulatory considerations in using these newly authorized and large packages for the packaging and transportation of LLW materials.« less

IP-Based Video Modem Extender Requirements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pierson, L G; Boorman, T M; Howe, R E

2003-12-16

Visualization is one of the keys to understanding large complex data sets such as those generated by the large computing resources purchased and developed by the Advanced Simulation and Computing program (aka ASCI). In order to be convenient to researchers, visualization data must be distributed to offices and large complex visualization theaters. Currently, local distribution of the visual data is accomplished by distance limited modems and RGB switches that simply do not scale to hundreds of users across the local, metropolitan, and WAN distances without incurring large costs in fiber plant installation and maintenance. Wide Area application over the DOEmore » Complex is infeasible using these limited distance RGB extenders. On the other hand, Internet Protocols (IP) over Ethernet is a scalable well-proven technology that can distribute large volumes of data over these distances. Visual data has been distributed at lower resolutions over IP in industrial applications. This document describes requirements of the ASCI program in visual signal distribution for the purpose of identifying industrial partners willing to develop products to meet ASCI's needs.« less

Are Current Insulin Pumps Accessible to Blind and Visually Impaired People?

PubMed Central

Burton, Darren M.; Uslan, Mark M.; Blubaugh, Morgan V.; Clements, Charles W.

2009-01-01

Background In 2004, Uslan and colleagues determined that insulin pumps (IPs) on the market were largely inaccessible to blind and visually impaired persons. The objective of this study is to determine if accessibility status changed in the ensuing 4 years. Methods Five IPs on the market in 2008 were acquired and analyzed for key accessibility traits such as speech and other audio output, tactual nature of control buttons, and the quality of visual displays. It was also determined whether or not a blind or visually impaired person could independently complete tasks such as programming the IP for insulin delivery, replacing batteries, and reading manuals and other documentation. Results It was found that IPs have not improved in accessibility since 2004. None have speech output, and with the exception of the Animas IR 2020, no significantly improved visual display characteristics were found. Documentation is still not completely accessible. Conclusion Insulin pumps are relatively complex devices, with serious health consequences resulting from improper use. For IPs to be used safely and independently by blind and visually impaired patients, they must include voice output to communicate all the information presented on their display screens. Enhancing display contrast and the size of the displayed information would also improve accessibility for visually impaired users. The IPs must also come with accessible user documentation in alternate formats. PMID:20144301

Intraperitoneal chemotherapy for advanced ovarian and peritoneal cancers in patients following interval debulking surgery or primary cytoreductive surgery: Tom Baker Cancer Centre experience from 2006 to 2009.

PubMed

Nelson, Gregory; Lucero, Carlos Aspe; Chu, Pamela; Nation, Jill; Ghatage, Prafull

2010-03-01

To describe our experience with cisplatin- and paclitaxel-based IP chemotherapy in patients treated initially with either neoadjuvant chemotherapy and interval debulking surgery (IDS) or primary cytoreductive surgery (PCRS). We performed a retrospective review of the records of 67 patients (38 IDS, 29 PCRS) enrolled in the intraperitoneal (IP) chemotherapy program at the Tom Baker Cancer Centre between 2006 and 2009. Information pertaining to patient demographics, IP chemotherapy toxicity, and catheter complications was extracted, and the median time to recurrence was calculated. Most patients in the study were aged 50 to 70 years and had a diagnosis of stage III serous ovarian cancer. Overall, 295/393 IP cycles (75%) were successfully administered. The proportion of patients completing six cycles of chemotherapy in the IDS and PCRS groups was 53% and 59%, respectively. Frequent (> 25%) Grade 1 to 2 chemotherapy toxicities included fatigue, peripheral neuropathy, and nausea. Catheter complications were observed in 34% of patients (23/67). The recurrence rates for patients completing four or more cycles of IP chemotherapy in the IDS and PCRS groups were 58% and 35%, respectively, with the median time to recurrence approximately one year. Although IP chemotherapy is well tolerated in both IDS and PCRS patients, the median time to recurrence is shorter than expected.

Are current insulin pumps accessible to blind and visually impaired people?

PubMed

Burton, Darren M; Uslan, Mark M; Blubaugh, Morgan V; Clements, Charles W

2009-05-01

In 2004, Uslan and colleagues determined that insulin pumps (IPs) on the market were largely inaccessible to blind and visually impaired persons. The objective of this study is to determine if accessibility status changed in the ensuing 4 years. Five IPs on the market in 2008 were acquired and analyzed for key accessibility traits such as speech and other audio output, tactual nature of control buttons, and the quality of visual displays. It was also determined whether or not a blind or visually impaired person could independently complete tasks such as programming the IP for insulin delivery, replacing batteries, and reading manuals and other documentation. It was found that IPs have not improved in accessibility since 2004. None have speech output, and with the exception of the Animas IR 2020, no significantly improved visual display characteristics were found. Documentation is still not completely accessible. Insulin pumps are relatively complex devices, with serious health consequences resulting from improper use. For IPs to be used safely and independently by blind and visually impaired patients, they must include voice output to communicate all the information presented on their display screens. Enhancing display contrast and the size of the displayed information would also improve accessibility for visually impaired users. The IPs must also come with accessible user documentation in alternate formats. 2009 Diabetes Technology Society.

An Analysis of the Multiple Objective Capital Budgeting Problem via Fuzzy Linear Integer (0-1) Programming.

DTIC Science & Technology

1980-05-31

34 International Journal of Man- Machine Studies , Vol. 9, No. 1, 1977, pp. 1-68. [16] Zimmermann, H. J., Theory and Applications of Fuzzy Sets, Institut...Boston, Inc., Hingham, MA, 1978. [18] Yager, R. R., "Multiple Objective Decision-Making Using Fuzzy Sets," International Journal of Man- Machine Studies ...Professor of Industria Engineering ... iv t TABLE OF CONTENTS page ABSTRACT .. .. . ...... . .... ...... ........ iii LIST OF TABLES

Extension of the firefly algorithm and preference rules for solving MINLP problems

NASA Astrophysics Data System (ADS)

Costa, M. Fernanda P.; Francisco, Rogério B.; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.

2017-07-01

An extension of the firefly algorithm (FA) for solving mixed-integer nonlinear programming (MINLP) problems is presented. Although penalty functions are nowadays frequently used to handle integrality conditions and inequality and equality constraints, this paper proposes the implementation within the FA of a simple rounded-based heuristic and four preference rules to find and converge to MINLP feasible solutions. Preliminary numerical experiments are carried out to validate the proposed methodology.

Generating a 2D Representation of a Complex Data Structure

NASA Technical Reports Server (NTRS)

James, Mark

2006-01-01

A computer program, designed to assist in the development and debugging of other software, generates a two-dimensional (2D) representation of a possibly complex n-dimensional (where n is an integer >2) data structure or abstract rank-n object in that other software. The nature of the 2D representation is such that it can be displayed on a non-graphical output device and distributed by non-graphical means.

Graph Structured Program Evolution: Evolution of Loop Structures

NASA Astrophysics Data System (ADS)

Shirakawa, Shinichi; Nagao, Tomoharu

Recently, numerous automatic programming techniques have been developed and applied in various fields. A typical example is genetic programming (GP), and various extensions and representations of GP have been proposed thus far. Complex programs and hand-written programs, however, may contain several loops and handle multiple data types. In this chapter, we propose a new method called Graph Structured Program Evolution (GRAPE). The representation of GRAPE is a graph structure; therefore, it can represent branches and loops using this structure. Each programis constructed as an arbitrary directed graph of nodes and a data set. The GRAPE program handles multiple data types using the data set for each type, and the genotype of GRAPE takes the form of a linear string of integers. We apply GRAPE to three test problems, factorial, exponentiation, and list sorting, and demonstrate that the optimum solution in each problem is obtained by the GRAPE system.

The effects of high intensity short rest resistance exercise on muscle damage markers in men and women.

PubMed

Heavens, Kristen R; Szivak, Tunde K; Hooper, David R; Dunn-Lewis, Courtenay; Comstock, Brett A; Flanagan, Shawn D; Looney, David P; Kupchak, Brian R; Maresh, Carl M; Volek, Jeff S; Kraemer, William J

2014-04-01

Within and between sexes, universal load prescription (as assigned in extreme conditioning programs) creates extreme ranges in individual training intensities. Exercise intensity has been proposed to be the main factor determining the degree of muscle damage. Thus, the purpose of this study was to examine markers of muscle damage in resistance-trained men (n = 9) and women (n = 9) from a high intensity (HI) short rest (SR) (HI/SR) resistance exercise protocol. The HI/SR consisted of a descending pyramid scheme starting at 10 repetitions, decreasing 1 repetition per set for the back squat, bench press, and deadlift, as fast as possible. Blood was drawn pre-exercise (pre), immediately postexercise (IP), 15 minutes postexercise (+15), 60 minutes postexercise (+60), and 24 hours postexercise (+24). Women demonstrated significant increases in interleukin 6 (IL-6; IP), creatine kinase (CK; +24), myoglobin (IP, +15, +60), and a greater relative increase when compared with men (+15, +60). Men demonstrated significant increases in myoglobin (IP, +15, +60, +24), IL-6 (IP, +15), CK (IP, +60, +24), and testosterone (IP, +15). There were significant sex interactions observed in CK (IP, +60, +24) and testosterone (IP, +15, +60, +24). Women completed the protocol faster (women: 34:04 ± 9:40 minutes, men: 39:22 ± 14:43 minutes), and at a slightly higher intensity (women: 70.1 ± 3.5%, men 68.8 ± 3.1%); however, men performed significantly more work (men: 14384.6 ± 1854.5 kg, women: 8774.7 ± 1612.7 kg). Overall, women demonstrated a faster inflammatory response with increased acute damage, whereas men demonstrated a greater prolonged damage response. Therefore, strength and conditioning professionals need to be aware of the level of stress imposed on individuals when creating such volitional high intensity metabolic type workouts and allow for adequate progression and recovery from such workouts.

Parent–Adolescent Relationship Education (PARE): Program Delivery to Reduce Risks for Adolescent Pregnancy and STDs

PubMed Central

Lederman, Regina P.; Chan, Wenyaw; Roberts-Gray, Cynthia

2008-01-01

The first author recruited parent–adolescent dyads (N = 192) into after-school prevention education groups at middle schools in southeast Texas. This author placed participants in either (1) an Interactive Program (IP) in which they role-played, practiced resistance skills, and held parent–child discussions or (2) an Attention Control Program (ACP) that used the same curriculum but was delivered in a traditional, didactic format. Questionnaires administered at the beginning and end of the 4-session program and again after booster sessions in 3 subsequent semesters provided measures of social controls (eg, communication with parents) and self controls (eg, protection against risk) on the youths' sexual health behaviors. Linear mixed models adjusted for gender, age, and ethnicity showed that the IP, in comparison with the ACP, achieved significant gains in social control by increasing parental rules about having sex and other risky behaviors and also enhanced students' self-control by increasing their knowledge about prevention and enhancing resistance responses when pressured to have sex. PMID:18316271

Parent-adolescent relationship education (PARE): program delivery to reduce risks for adolescent pregnancy and STDs.

PubMed

Lederman, Regina P; Chan, Wenyaw; Roberts-Gray, Cynthia

2008-01-01

The first author recruited parent-adolescent dyads (N = 192) into after-school prevention education groups at middle schools in southeast Texas. This author placed participants in either (1) an Interactive Program (IP) in which they roleplayed, practiced resistance skills, and held parent-child discussions or (2) an Attention Control Program (ACP) that used the same curriculum but was delivered in a traditional, didactic format. Questionnaires administered at the beginning and end of the 4-session program and again after booster sessions in 3 subsequent semesters provided measures of social controls (eg, communication with parents) and self controls (eg, protection against risk) on the youths' sexual health behaviors. Linear mixed models adjusted for gender, age, and ethnicity showed that the IP, in comparison with the ACP, achieved significant gains in social control by increasing parental rules about having sex and other risky behaviors and also enhanced students' self-control by increasing their knowledge about prevention and enhancing resistance responses when pressured to have sex.

Recommendations for the Interagency Ship Structure Committee’s Fiscal 1985 Research Program.

DTIC Science & Technology

1984-01-01

Houston, TX Mr. D. Price , (84), National Ocean and Atmospheric Administration, Rockville, MD Mr. D. A. Sarno, (84), ARMCO Inc., Middletown, OH Mr. R. W...A. B. Stevovy Dr. V. R. Porter AMERICAN BUREAU Of SKIPPING U.S. COAST GUARD ACADEMY Dr. D. Liu* Lt. John Tuttle - Liaison Mr. 1. L. Stern T-TU.S...which defines the combination of fastest running crack length and stress level that must be exceeded for a crack to 4 % % k ipS penetrate a structural

Mobile Vehicle Teleoperated Over Wireless IP

DTIC Science & Technology

2007-06-13

VideoLAN software suite. The VLC media player portion of this suite handles net- work streaming of video, as well as the receipt and display of the video...is found in appendix C.7. Video Display The video feed is displayed for the operator using VLC opened independently from the control sending program...This gives the operator the most choice in how to configure the display. To connect VLC to the feed all you need is the IP address from the Java

Non-integer expansion embedding techniques for reversible image watermarking

NASA Astrophysics Data System (ADS)

Xiang, Shijun; Wang, Yi

2015-12-01

This work aims at reducing the embedding distortion of prediction-error expansion (PE)-based reversible watermarking. In the classical PE embedding method proposed by Thodi and Rodriguez, the predicted value is rounded to integer number for integer prediction-error expansion (IPE) embedding. The rounding operation makes a constraint on a predictor's performance. In this paper, we propose a non-integer PE (NIPE) embedding approach, which can proceed non-integer prediction errors for embedding data into an audio or image file by only expanding integer element of a prediction error while keeping its fractional element unchanged. The advantage of the NIPE embedding technique is that the NIPE technique can really bring a predictor into full play by estimating a sample/pixel in a noncausal way in a single pass since there is no rounding operation. A new noncausal image prediction method to estimate a pixel with four immediate pixels in a single pass is included in the proposed scheme. The proposed noncausal image predictor can provide better performance than Sachnev et al.'s noncausal double-set prediction method (where data prediction in two passes brings a distortion problem due to the fact that half of the pixels were predicted with the watermarked pixels). In comparison with existing several state-of-the-art works, experimental results have shown that the NIPE technique with the new noncausal prediction strategy can reduce the embedding distortion for the same embedding payload.

Designing optimal cell factories: integer programming couples elementary mode analysis with regulation

PubMed Central

2012-01-01

Background Elementary mode (EM) analysis is ideally suited for metabolic engineering as it allows for an unbiased decomposition of metabolic networks in biologically meaningful pathways. Recently, constrained minimal cut sets (cMCS) have been introduced to derive optimal design strategies for strain improvement by using the full potential of EM analysis. However, this approach does not allow for the inclusion of regulatory information. Results Here we present an alternative, novel and simple method for the prediction of cMCS, which allows to account for boolean transcriptional regulation. We use binary linear programming and show that the design of a regulated, optimal metabolic network of minimal functionality can be formulated as a standard optimization problem, where EM and regulation show up as constraints. We validated our tool by optimizing ethanol production in E. coli. Our study showed that up to 70% of the predicted cMCS contained non-enzymatic, non-annotated reactions, which are difficult to engineer. These cMCS are automatically excluded by our approach utilizing simple weight functions. Finally, due to efficient preprocessing, the binary program remains computationally feasible. Conclusions We used integer programming to predict efficient deletion strategies to metabolically engineer a production organism. Our formulation utilizes the full potential of cMCS but adds additional flexibility to the design process. In particular our method allows to integrate regulatory information into the metabolic design process and explicitly favors experimentally feasible deletions. Our method remains manageable even if millions or potentially billions of EM enter the analysis. We demonstrated that our approach is able to correctly predict the most efficient designs for ethanol production in E. coli. PMID:22898474

AN ADA LINEAR ALGEBRA PACKAGE MODELED AFTER HAL/S

NASA Technical Reports Server (NTRS)

Klumpp, A. R.

1994-01-01

This package extends the Ada programming language to include linear algebra capabilities similar to those of the HAL/S programming language. The package is designed for avionics applications such as Space Station flight software. In addition to the HAL/S built-in functions, the package incorporates the quaternion functions used in the Shuttle and Galileo projects, and routines from LINPAK that solve systems of equations involving general square matrices. Language conventions in this package follow those of HAL/S to the maximum extent practical and minimize the effort required for writing new avionics software and translating existent software into Ada. Valid numeric types in this package include scalar, vector, matrix, and quaternion declarations. (Quaternions are fourcomponent vectors used in representing motion between two coordinate frames). Single precision and double precision floating point arithmetic is available in addition to the standard double precision integer manipulation. Infix operators are used instead of function calls to define dot products, cross products, quaternion products, and mixed scalar-vector, scalar-matrix, and vector-matrix products. The package contains two generic programs: one for floating point, and one for integer. The actual component type is passed as a formal parameter to the generic linear algebra package. The procedures for solving systems of linear equations defined by general matrices include GEFA, GECO, GESL, and GIDI. The HAL/S functions include ABVAL, UNIT, TRACE, DET, INVERSE, TRANSPOSE, GET, PUT, FETCH, PLACE, and IDENTITY. This package is written in Ada (Version 1.2) for batch execution and is machine independent. The linear algebra software depends on nothing outside the Ada language except for a call to a square root function for floating point scalars (such as SQRT in the DEC VAX MATHLIB library). This program was developed in 1989, and is a copyrighted work with all copyright vested in NASA.

Informing the Design and Evaluation of Superuser Care Management Initiatives: Accounting for Regression-to-the-Mean.

PubMed

Chakravarty, Sujoy; Cantor, Joel C

2016-09-01

Health care spending is concentrated among a small number of high-cost patients, and the popularity of initiatives to improve care and reduce cost among such "superusers" (SUs) is growing. However, SU costs decline naturally over time, even without intervention, a statistical phenomenon known as regression-to-the-mean (RTM). We assess the magnitude of RTM in hospital costs for cohorts of hospital SUs identified on the basis of high inpatient (IP) or emergency department (ED) utilization. We further examine how cost and RTM are associated with patient characteristics including behavioral health (BH) problems, multiple chronic conditions, and indicators of vulnerability. Using longitudinally linked all-payer hospital billing data, we selected patient cohorts with ≥2 IP stays (IP SUs) or ≥6 ED visits (ED SUs) during a 6-month baseline period, and additional subgroups defined by combinations of IP and ED superuse. A total of 289,060 NJ hospital IP and treat-and-release ED patients over 2009-2011. Hospital costs among IP and ED SUs declined 70% and 38%, respectively, over 8 quarters following the baseline period. The decrease occurs more quickly for IP SUs compared with ED SUs. Presence of BH problems was positively associated with costs among patients overall, but the relationship varied by SU cohort. Understanding patterns of RTM among SU populations is important for designing intervention strategies, as there is greater potential for savings among patients with more persistent costs (less RTM). Further, as many SU initiatives lack resources for rigorous evaluation, quantifying the extent of RTM is vital for interpreting program outcomes.

Ethernet direct display: a new dimension for in-vehicle video connectivity solutions

NASA Astrophysics Data System (ADS)

Rowley, Vincent

2009-05-01

To improve the local situational awareness (LSA) of personnel in light or heavily armored vehicles, most military organizations recognize the need to equip their fleets with high-resolution digital video systems. Several related upgrade programs are already in progress and, almost invariably, COTS IP/Ethernet is specified as the underlying transport mechanism. The high bandwidths, long reach, networking flexibility, scalability, and affordability of IP/Ethernet make it an attractive choice. There are significant technical challenges, however, in achieving high-performance, real-time video connectivity over the IP/Ethernet platform. As an early pioneer in performance-oriented video systems based on IP/Ethernet, Pleora Technologies has developed core expertise in meeting these challenges and applied a singular focus to innovating within the required framework. The company's field-proven iPORTTM Video Connectivity Solution is deployed successfully in thousands of real-world applications for medical, military, and manufacturing operations. Pleora's latest innovation is eDisplayTM, a smallfootprint, low-power, highly efficient IP engine that acquires video from an Ethernet connection and sends it directly to a standard HDMI/DVI monitor for real-time viewing. More costly PCs are not required. This paper describes Pleora's eDisplay IP Engine in more detail. It demonstrates how - in concert with other elements of the end-to-end iPORT Video Connectivity Solution - the engine can be used to build standards-based, in-vehicle video systems that increase the safety and effectiveness of military personnel while fully leveraging the advantages of the lowcost COTS IP/Ethernet platform.

Circularly polarized harmonic generation by intense bicircular laser pulses: electron recollision dynamics and frequency dependent helicity

NASA Astrophysics Data System (ADS)

Bandrauk, André D.; Mauger, François; Yuan, Kai-Jun

2016-12-01

Numerical solutions of time-dependent Schrödinger equations for one and two electron cyclic molecules {{{H}}}nq+ exposed to intense bichromatic circularly polarized laser pulses of frequencies {ω }1 and {ω }2, such that {ω }1/{ω }2={n}1/{n}2 (integer) produce circularly polarized high order harmonics with a cut-off recollision maximum energy at and greater than the linear polarization law (in atomic units) {N}m{ω }1={I}p+3.17{U}p, where I p is the ionization potential and {U}p={(2{E}0)}2/4{ω }2 is the ponderomotive energy defined by the field E 0 (intensity I={{cE}}02/8π ) from each pulse and mean frequency ω =({ω }1+{ω }2)/2 . An electron recollision model in a rotating frame at rotating frequency {{Δ }}ω =({ω }1-{ω }2)/2 predicts this simple result as a result of recollision dynamics in a combination of bichromatic circularly polarized pulses. The harmonic helicities and their intensities are shown to depend on compatible symmetries of the net pulse electric fields with that of the molecules.

Imaging probe for breast cancer localization

NASA Astrophysics Data System (ADS)

Soluri, A.; Scafè, R.; Capoccetti, F.; Burgio, N.; Schiaratura, A.; Pani, R.; Pellegrini, R.; Cinti, M. N.; Mechella, M.; Amanti, A.; David, V.; Scopinaro, F.

2003-01-01

High spatial resolution, small Field Of View (FOV), fully portable scintillation cameras are lower cost and obviously lower weight than large FOV, not transportable Anger gamma cameras. Portable cameras allow easy transfer of the detector, thus of radioisotope imaging, where the bioptical procedure takes place. In this paper we describe a preliminary experience on radionuclide Breast Cancer (BC) imaging with a 22.8×22.8 mm 2 FOV minicamera, already used by our group for sentinel node detection with the name of Imaging Probe (IP). In this work IP BC detection was performed with the aim of guiding biopsy, in particular open biopsy, or to help or modify fine needle or needle addressing when main driving method was echography or digital radiography. The IP prototype weight was about 1 kg. This small scintillation camera is based on the compact Position Sensitive Photomultiplier Tube Hamamatsu R7600-00-C8, coupled to a CsI(Tl) scintillation array 2.6×2.6×5.0 mm 3 crystal-pixel size. Spatial resolution of the IP was 2.5 mm Full-Width at Half-Maximum at laboratory tests. IP was provided with acquisition software allowing quick change of pixels number on the computer acquisition frame and an on-line image-smoothing program. Both these programs were developed in order to allow nuclear physicians to quickly get target source when the patient was anesthetized in the operator room, with sterile conditions. 99mTc Sestamibi (MIBI) was injected at the dose of 740 MBq 1 h before imaging and biopsy to 14 patients with suspicious or known BC. Scintigraphic images were acquired before and after biopsy in each patient. Operator was allowed to take into account scintigraphic images as well as previously performed X-ray mammograms and echographies. High-resolution IP images were able to guide biopsy toward cancer or washout zones of the cancer, that are thought to be chemoresistant in 7 patients out of 10. Four patients, in whom IP and MIBI were not able to guide biopsy, did not show cancer. Two patients in whom biopsy was performed in the high washout zone, did show Multi Drug Resistance (MDR) gene product at immunohistochemistry on bioptical samples. Specific radioactivity was measured on biopsy specimens and measurement confirmed the etherogeneous distribution of MIBI within cancers. Our study confirms the ability of IP to guide breast biopsy even when our mini-camera has to be manually handled by trained physicians during operation.

Vocational Counselors in France: Comparison to Competencies of Employment Specialists Working in Canadian IPS Programs.

PubMed

de Pierrefeu, Inès; Corbière, Marc; Pachoud, Bernard

2017-10-01

Supported employment programs are evidence-based practices to help people with severe mental illness to obtain competitive employment. The competencies of employment specialists working in these programs are key elements related to work integration. In France, the Messidor Association, a prevocational organisation, has developed a practice with similarities to supported employment and is beginning to develop supported employment programs in their context. The objective of this quantitative study was to evaluate the Messidor vocational counselors' competencies using the Behaviors, Attitudes and Knowledge in Employment Specialists' scale by comparing their results to those of employment specialists working in IPS programs in Canada. Descriptive analyses and a MANOVA highlighted similarities between French and Canadian counselors such as the same importance given to the working alliance with clients and the development of relationships with different stakeholders (e.g., employers). Skills that should be developed in vocational counselors in France include those related to rapid job search and dealing with stigma. In addition, clinical implications are suggested to ensure the development of vocational counselors' competencies in France.

Tools for Administration of a UNIX-Based Network

NASA Technical Reports Server (NTRS)

LeClaire, Stephen; Farrar, Edward

2004-01-01

Several computer programs have been developed to enable efficient administration of a large, heterogeneous, UNIX-based computing and communication network that includes a variety of computers connected to a variety of subnetworks. One program provides secure software tools for administrators to create, modify, lock, and delete accounts of specific users. This program also provides tools for users to change their UNIX passwords and log-in shells. These tools check for errors. Another program comprises a client and a server component that, together, provide a secure mechanism to create, modify, and query quota levels on a network file system (NFS) mounted by use of the VERITAS File SystemJ software. The client software resides on an internal secure computer with a secure Web interface; one can gain access to the client software from any authorized computer capable of running web-browser software. The server software resides on a UNIX computer configured with the VERITAS software system. Directories where VERITAS quotas are applied are NFS-mounted. Another program is a Web-based, client/server Internet Protocol (IP) address tool that facilitates maintenance lookup of information about IP addresses for a network of computers.

Example Level 1 Ada/SQL (Structured Query Language) System Software

DTIC Science & Technology

1987-09-01

PUTLINE ("EMPNAME JOB SALARY COMMISSION"); loop FETCH ( CURSOR ); INTO ( VEMP NAME , STR LAST ); T LEN INTEGER (STR LAST - V EMP NAME’FIRST + 1); for I in 1...begin PUT_LINE ("EMPNAME JOB SALARY DEPT"); loop FETCH (CURSOR); INTO ( VEMP NAME , STRLAST ); T_LEN := INTEGER (STRLAST - V_EMPNAME’FIRST + 1); for I in...NUMBERS OPEN ( CURSOR ); begin PUT_LINE ("EMP_NAME SALARY JOB"); loop FETCH ( CURSOR ); INTO ( VEMP NAME , STRLAST ); T_LEN := INTEGER (STR_LAST

Recognition and prevention of computed radiography image artifacts.

PubMed

Hammerstrom, Kevin; Aldrich, John; Alves, Len; Ho, Andrew

2006-09-01

Initiated by complaints of image artifacts, a thorough visual and radiographic investigation of 197 Fuji, 35 Agfa, and 37 Kodak computed radiography (CR) cassettes with imaging plates (IPs) in clinical use at four radiology departments was performed. The investigation revealed that the physical deterioration of the cassettes and IPs was more extensive than previously believed. It appeared that many of the image artifacts were the direct result of premature wear of the cassettes and imaging plates. The results indicate that a quality control program for CR cassettes and IPs is essential and should include not only cleaning of the cassettes and imaging plates on a regular basis, but also visual and radiographic image inspection to limit the occurrence of image artifacts and to prolong the life cycle of the CR equipment.

Mathematical programming (MP) model to determine optimal transportation infrastructure for geologic CO2 storage in the Illinois basin

NASA Astrophysics Data System (ADS)

Rehmer, Donald E.

Analysis of results from a mathematical programming model were examined to 1) determine the least cost options for infrastructure development of geologic storage of CO2 in the Illinois Basin, and 2) perform an analysis of a number of CO2 emission tax and oil price scenarios in order to implement development of the least-cost pipeline networks for distribution of CO2. The model, using mixed integer programming, tested the hypothesis of whether viable EOR sequestration sites can serve as nodal points or hubs to expand the CO2 delivery infrastructure to more distal locations from the emissions sources. This is in contrast to previous model results based on a point-to- point model having direct pipeline segments from each CO2 capture site to each storage sink. There is literature on the spoke and hub problem that relates to airline scheduling as well as maritime shipping. A large-scale ship assignment problem that utilized integer linear programming was run on Excel Solver and described by Mourao et al., (2001). Other literature indicates that aircraft assignment in spoke and hub routes can also be achieved using integer linear programming (Daskin and Panayotopoulos, 1989; Hane et al., 1995). The distribution concept is basically the reverse of the "tree and branch" type (Rothfarb et al., 1970) gathering systems for oil and natural gas that industry has been developing for decades. Model results indicate that the inclusion of hubs as variables in the model yields lower transportation costs for geologic carbon dioxide storage over previous models of point-to-point infrastructure geometries. Tabular results and GIS maps of the selected scenarios illustrate that EOR sites can serve as nodal points or hubs for distribution of CO2 to distal oil field locations as well as deeper saline reservoirs. Revenue amounts and capture percentages both show an improvement over solutions when the hubs are not allowed to come into the solution. Other results indicate that geologic storage of CO2 into saline aquifers does not come into solutions selected by the model until the CO 2 emissions tax approaches 50/tonne. CO2 capture and storage begins to occur when the oil price is above 24.42 a barrel based on the constraints of the model. The annual storage capacity of the basin is nearly maximized when the net price of oil is as low as 40 per barrel and the CO2 emission tax is 60/tonne. The results from every subsequent scenario that was examined by this study demonstrate that EOR utilizing anthropogenically captured CO2 will earn net revenue, and thus represents an economically viable option for CO2 storage in the Illinois Basin.

Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming

NASA Astrophysics Data System (ADS)

Sikora, Jamie; Selby, John

2018-04-01

Bit commitment is a fundamental cryptographic task, in which Alice commits a bit to Bob such that she cannot later change the value of the bit, while, simultaneously, the bit is hidden from Bob. It is known that ideal bit commitment is impossible within quantum theory. In this work, we show that it is also impossible in generalized probabilistic theories (under a small set of assumptions) by presenting a quantitative trade-off between Alice's and Bob's cheating probabilities. Our proof relies crucially on a formulation of cheating strategies as cone programs, a natural generalization of semidefinite programs. In fact, using the generality of this technique, we prove that this result holds for the more general task of integer commitment.

Optimal planning of co-firing alternative fuels with coal in a power plant by grey nonlinear mixed integer programming model.

PubMed

Ko, Andi Setiady; Chang, Ni-Bin

2008-07-01

Energy supply and use is of fundamental importance to society. Although the interactions between energy and environment were originally local in character, they have now widened to cover regional and global issues, such as acid rain and the greenhouse effect. It is for this reason that there is a need for covering the direct and indirect economic and environmental impacts of energy acquisition, transport, production and use. In this paper, particular attention is directed to ways of resolving conflict between economic and environmental goals by encouraging a power plant to consider co-firing biomass and refuse-derived fuel (RDF) with coal simultaneously. It aims at reducing the emission level of sulfur dioxide (SO(2)) in an uncertain environment, using the power plant in Michigan City, Indiana as an example. To assess the uncertainty by a comparative way both deterministic and grey nonlinear mixed integer programming (MIP) models were developed to minimize the net operating cost with respect to possible fuel combinations. It aims at generating the optimal portfolio of alternative fuels while maintaining the same electricity generation simultaneously. To ease the solution procedure stepwise relaxation algorithm was developed for solving the grey nonlinear MIP model. Breakeven alternative fuel value can be identified in the post-optimization stage for decision-making. Research findings show that the inclusion of RDF does not exhibit comparative advantage in terms of the net cost, albeit relatively lower air pollution impact. Yet it can be sustained by a charge system, subsidy program, or emission credit as the price of coal increases over time.

Obesity prevention for Mexican American children: for whom is it most effective?

USDA-ARS?s Scientific Manuscript database

The objective of the current study was to determine which Mexican American children benefited most from an obesity prevention program. Data used were taken from a larger randomized clinical trial in which participants received either an intensive (IP) or a self-help (SH) program for preventing the ...

Magnetic impurity effect on charge and magnetic order in doped La1.5Ca0.5CoO4

NASA Astrophysics Data System (ADS)

Horigane, K.; Hiraka, H.; Tomiyasu, K.; Ohoyama, K.; Louca, D.; Yamada, K.

2012-02-01

Neutron scattering experiments were performed on single crystals of magnetic impurity doped cobalt oxides La1.5Ca0.5CoO4 to characterize the charge and spin orders. We newly found contrasting impurity effects. Two types of magnetic peaks are observed at q = (0.5,0,L) with L = half-integer and integer in La1.5Ca0.5CoO4, while magnetic peak at L = half-integer (integer) was only observed in Mn (Fe)-substituted sample. Although Mn and Fe impurities degrade charge and magnetic order, Cr impurity stabilizes the ordering at x = 0.5. Based on the crystal structural analysis of Cr doped sample, we found that the excess oxygen and change of octahedron around Co3+ were realized in Cr doped sample.

Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.

PubMed

Chang, Weng-Long

2012-03-01

Assume that n is a positive integer. If there is an integer such that M (2) ≡ C (mod n), i.e., the congruence has a solution, then C is said to be a quadratic congruence (mod n). If the congruence does not have a solution, then C is said to be a quadratic noncongruence (mod n). The task of solving the problem is central to many important applications, the most obvious being cryptography. In this article, we describe a DNA-based algorithm for solving quadratic congruence and factoring integers. In additional to this novel contribution, we also show the utility of our encoding scheme, and of the algorithm's submodules. We demonstrate how a variety of arithmetic, shifted and comparative operations, namely bitwise and full addition, subtraction, left shifter and comparison perhaps are performed using strands of DNA.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Xiaohu; Shi, Di; Wang, Zhiwei

Shunt FACTS devices, such as, a Static Var Compensator (SVC), are capable of providing local reactive power compensation. They are widely used in the network to reduce the real power loss and improve the voltage profile. This paper proposes a planning model based on mixed integer conic programming (MICP) to optimally allocate SVCs in the transmission network considering load uncertainty. The load uncertainties are represented by a number of scenarios. Reformulation and linearization techniques are utilized to transform the original non-convex model into a convex second order cone programming (SOCP) model. Numerical case studies based on the IEEE 30-bus systemmore » demonstrate the effectiveness of the proposed planning model.« less

Optimization techniques applied to spectrum management for communications satellites

NASA Astrophysics Data System (ADS)

Ottey, H. R.; Sullivan, T. M.; Zusman, F. S.

This paper describes user requirements, algorithms and software design features for the application of optimization techniques to the management of the geostationary orbit/spectrum resource. Relevant problems include parameter sensitivity analyses, frequency and orbit position assignment coordination, and orbit position allotment planning. It is shown how integer and nonlinear programming as well as heuristic search techniques can be used to solve these problems. Formalized mathematical objective functions that define the problems are presented. Constraint functions that impart the necessary solution bounds are described. A versatile program structure is outlined, which would allow problems to be solved in stages while varying the problem space, solution resolution, objective function and constraints.

The Neighborhood Covering Heuristic (NCH) Approach for the General Mixed Integer Programming Problem

DTIC Science & Technology

2004-02-02

5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Creative Action LLC 680 N. Portage Path Akron, OH 44303; The...University of Akron Department of Theoretical and Applied Mathematics Akron OH 44325-4002 8. PERFORMING ORGANIZATION REPORT NUMBER SF309 9...algorithm is naturally adaptable to a parallel architechture . In particular, under NCH, one could parcel out pieces of the problem to many processors

Neuro Inspired Adaptive Perception and Control for Agile Mobility of Autonomous Vehicles in Uncertain and Hostile Environments

DTIC Science & Technology

2017-02-08

Georgia Tech Research Corporation 505 Tenth Street NW Atlanta, GA 30332 -0420 ABSTRACT Final Report: MURI: Neuro-Inspired Adaptive Perception and...Conquer Strategy for Optimal Trajectory Planning via Mixed-Integer Programming, IEEE Transactions on Robotics, (12 2015): 0. doi: 10.1109/TRO...Learning Day, Microsoft Corporation , Cambridge, MA, May 18, 2015. (c) Presentations 09/06/2015 09/08/2015 125 131 Ali Borji, Dicky N. Sihite, Laurent Itti

Program Manager: Journal of the Defense Systems Management College. Volume 19, Number 4, July-August 1990

DTIC Science & Technology

1990-08-01

officials making process, innovation, integ- would be focused on customer were committed, as well as the Con- rity, and accountability. satisrceion...staff in the Department of The bill contains the following - Research and Information at the Defensetion which has as its goal to make S ms Managmnt Cov...Cost/Quantity Dynamics There is a necessary relationship 7 between unit costs and quantities procured, and the budget changes made. This relationship

Stochastic search in structural optimization - Genetic algorithms and simulated annealing

NASA Technical Reports Server (NTRS)

Hajela, Prabhat

1993-01-01

An account is given of illustrative applications of genetic algorithms and simulated annealing methods in structural optimization. The advantages of such stochastic search methods over traditional mathematical programming strategies are emphasized; it is noted that these methods offer a significantly higher probability of locating the global optimum in a multimodal design space. Both genetic-search and simulated annealing can be effectively used in problems with a mix of continuous, discrete, and integer design variables.

A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings

DOE PAGES

Lin, Fu; Leyffer, Sven; Munson, Todd

2016-04-12

We study a two-stage mixed-integer linear program (MILP) with more than 1 million binary variables in the second stage. We develop a two-level approach by constructing a semi-coarse model that coarsens with respect to variables and a coarse model that coarsens with respect to both variables and constraints. We coarsen binary variables by selecting a small number of prespecified on/off profiles. We aggregate constraints by partitioning them into groups and taking convex combination over each group. With an appropriate choice of coarsened profiles, the semi-coarse model is guaranteed to find a feasible solution of the original problem and hence providesmore » an upper bound on the optimal solution. We show that solving a sequence of coarse models converges to the same upper bound with proven finite steps. This is achieved by adding violated constraints to coarse models until all constraints in the semi-coarse model are satisfied. We demonstrate the effectiveness of our approach in cogeneration for buildings. Here, the coarsened models allow us to obtain good approximate solutions at a fraction of the time required by solving the original problem. Extensive numerical experiments show that the two-level approach scales to large problems that are beyond the capacity of state-of-the-art commercial MILP solvers.« less

A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

NASA Technical Reports Server (NTRS)

Montoya, Justin Vincent; Wood, Zachary Paul; Rathinam, Sivakumar; Malik, Waqar Ahmad

2010-01-01

Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

Automatic Design of Synthetic Gene Circuits through Mixed Integer Non-linear Programming

PubMed Central

Huynh, Linh; Kececioglu, John; Köppe, Matthias; Tagkopoulos, Ilias

2012-01-01

Automatic design of synthetic gene circuits poses a significant challenge to synthetic biology, primarily due to the complexity of biological systems, and the lack of rigorous optimization methods that can cope with the combinatorial explosion as the number of biological parts increases. Current optimization methods for synthetic gene design rely on heuristic algorithms that are usually not deterministic, deliver sub-optimal solutions, and provide no guaranties on convergence or error bounds. Here, we introduce an optimization framework for the problem of part selection in synthetic gene circuits that is based on mixed integer non-linear programming (MINLP), which is a deterministic method that finds the globally optimal solution and guarantees convergence in finite time. Given a synthetic gene circuit, a library of characterized parts, and user-defined constraints, our method can find the optimal selection of parts that satisfy the constraints and best approximates the objective function given by the user. We evaluated the proposed method in the design of three synthetic circuits (a toggle switch, a transcriptional cascade, and a band detector), with both experimentally constructed and synthetic promoter libraries. Scalability and robustness analysis shows that the proposed framework scales well with the library size and the solution space. The work described here is a step towards a unifying, realistic framework for the automated design of biological circuits. PMID:22536398

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs

NASA Astrophysics Data System (ADS)

Chekuri, Chandra; Ene, Alina; Korula, Nitish

We consider the unsplittable flow problem (UFP) and the closely related column-restricted packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G = (V,E) and k request pairs R 1, ..., R k , where each R i consists of a source-destination pair (s i ,t i ), a demand d i and a weight w i . The goal is to find a maximum weight subset of requests that can be routed unsplittably in G. Most previous work on UFP has focused on the no-bottleneck case in which the maximum demand of the requests is at most the smallest edge capacity. Inspired by the recent work of Bansal et al. [3] on UFP on a path without the above assumption, we consider UFP on paths as well as trees. We give a simple O(logn) approximation for UFP on trees when all weights are identical; this yields an O(log2 n) approximation for the weighted case. These are the first non-trivial approximations for UFP on trees. We develop an LP relaxation for UFP on paths that has an integrality gap of O(log2 n); previously there was no relaxation with o(n) gap. We also consider UFP in general graphs and CPIPs without the no-bottleneck assumption and obtain new and useful results.

A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lin, Fu; Leyffer, Sven; Munson, Todd

We study a two-stage mixed-integer linear program (MILP) with more than 1 million binary variables in the second stage. We develop a two-level approach by constructing a semi-coarse model that coarsens with respect to variables and a coarse model that coarsens with respect to both variables and constraints. We coarsen binary variables by selecting a small number of prespecified on/off profiles. We aggregate constraints by partitioning them into groups and taking convex combination over each group. With an appropriate choice of coarsened profiles, the semi-coarse model is guaranteed to find a feasible solution of the original problem and hence providesmore » an upper bound on the optimal solution. We show that solving a sequence of coarse models converges to the same upper bound with proven finite steps. This is achieved by adding violated constraints to coarse models until all constraints in the semi-coarse model are satisfied. We demonstrate the effectiveness of our approach in cogeneration for buildings. Here, the coarsened models allow us to obtain good approximate solutions at a fraction of the time required by solving the original problem. Extensive numerical experiments show that the two-level approach scales to large problems that are beyond the capacity of state-of-the-art commercial MILP solvers.« less

Employee and family assistance video counseling program: a post launch retrospective comparison with in-person counseling outcomes.

PubMed

Veder, Barbara; Pope, Stan; Mani, Michèle; Beaudoin, Kelly; Ritchie, Janice

2014-01-01

Access to technologically mediated information and services under the umbrella of mental and physical health has become increasingly available to clients via Internet modalities, according to a recent study. In May 2010, video counseling was added to the counseling services offered through the Employee and Family Assistance Program at Shepell·fgi as a pilot project with a full operational launch in September 2011. The objective of this study was to conduct a retrospective post launch examination of the video counseling service through an analysis of the reported clinical outcomes of video and in-person counseling modalities. A chronological sample of 68 video counseling (VC) cases and 68 in-person (IP) cases were collected from a pool of client clinical files closed in 2012. To minimize the variables impacting the study and maintain as much clinical continuity as possible, the IP and the VC clients must have attended clinical sessions with any one of six counselors who provided both the VC and the IP services. The study compared the two counseling modalities along the following data points (see glossary of terms): (1) client demographic profiles (eg, age, gender, whether the sessions involved individuals or conjoint sessions with couples or families, etc), (2) presenting issue, (3) average session hours, (4) client rating of session helpfulness, (5) rates of goal completion, (6) client withdrawal rates, (7) no show and late cancellation rates, and (8) pre/post client self-assessment. Specific to VC, we examined client geographic location. Data analysis demonstrates that the VC and the IP showed a similar representation of presenting issues with nearly identical outcomes for client ratings of session helpfulness, rates of goal completion, pre/post client self-assessment, average session duration, and client geographic location. There were no statistically significant differences in the rates of withdrawal from counseling, no shows, and late cancellations between the VC and the IP counseling. The statistical analysis of the data was done on SPSS statistical software using 2-sample and pairwise comparison t tests at a 95% level of significance. Based on the study, VC and IP show similar outcomes in terms of client rating of session and goal attainment.

Effects of the Voice over Internet Protocol on Perturbation Analysis of Normal and Pathological Phonation

PubMed Central

Zhu, Yanmei; Witt, Rachel E.; MacCallum, Julia K.; Jiang, Jack J.

2010-01-01

Objective In this study, a Voice over Internet Protocol (VoIP) communication based on G.729 protocol was simulated to determine the effects of this system on acoustic perturbation parameters of normal and pathological voice signals. Patients and Methods: Fifty recordings of normal voice and 48 recordings of pathological voice affected by laryngeal paralysis were transmitted through a VoIP communication system. The acoustic analysis programs of CSpeech and MDVP were used to determine the percent jitter and percent shimmer from the voice samples before and after VoIP transmission. The effects of three frequently used audio compression protocols (MP3, WMA, and FLAC) on the perturbation measures were also studied. Results It was found that VoIP transmission disrupts the waveform and increases the percent jitter and percent shimmer of voice samples. However, after VoIP transmission, significant discrimination between normal and pathological voices affected by laryngeal paralysis was still possible. It was found that the lossless compression method FLAC does not exert any influence on the perturbation measures. The lossy compression methods MP3 and WMA increase percent jitter and percent shimmer values. Conclusion This study validates the feasibility of these transmission and compression protocols in developing remote voice signal data collection and assessment systems. PMID:20588051

Mixed integer simulation optimization for optimal hydraulic fracturing and production of shale gas fields

NASA Astrophysics Data System (ADS)

Li, J. C.; Gong, B.; Wang, H. G.

2016-08-01

Optimal development of shale gas fields involves designing a most productive fracturing network for hydraulic stimulation processes and operating wells appropriately throughout the production time. A hydraulic fracturing network design-determining well placement, number of fracturing stages, and fracture lengths-is defined by specifying a set of integer ordered blocks to drill wells and create fractures in a discrete shale gas reservoir model. The well control variables such as bottom hole pressures or production rates for well operations are real valued. Shale gas development problems, therefore, can be mathematically formulated with mixed-integer optimization models. A shale gas reservoir simulator is used to evaluate the production performance for a hydraulic fracturing and well control plan. To find the optimal fracturing design and well operation is challenging because the problem is a mixed integer optimization problem and entails computationally expensive reservoir simulation. A dynamic simplex interpolation-based alternate subspace (DSIAS) search method is applied for mixed integer optimization problems associated with shale gas development projects. The optimization performance is demonstrated with the example case of the development of the Barnett Shale field. The optimization results of DSIAS are compared with those of a pattern search algorithm.

Interplay of Hofstadter and quantum Hall states in bilayer graphene

NASA Astrophysics Data System (ADS)

Spanton, Eric M.; Zibrov, Alexander A.; Zhou, Haoxin; Taniguchi, Takashi; Watanabe, Kenji; Young, Andrea

Electron interactions in ultraclean systems such as graphene lead to the fractional quantum Hall effect in an applied magnetic field. Long wavelength periodic potentials from a moiré pattern in aligned boron nitride-graphene heterostructures may compete with such interactions and favor spatially ordered states (e.g. Wigner crystals orcharge density waves). To investigate this competition, we studied the bulk phase diagram of asymmetrically moiré-coupled bilayer graphene via multi-terminal magnetocapacitance measurements at ultra-high magnetic fields. Two quantum numbers characterize energy gaps in this regime: t, which indexes the Bloch bands, and s, which indexes the Landau level. Similar to past experiments, we observe the conventional integer and fractional quantum Hall gaps (t = 0), integer Hofstadter gaps (integer s and integer t ≠ 0), and fractional Bloch states associated with an expanded superlattice unit cell (fractional s and integer t). Additionally, we find states with fractional values for both s and t. Measurement of the capacitance matrix shows that these states occur on the layer exposed to the strong periodic potential. We discuss the results in terms of possible fractional quantum hall states unique to periodically modulated systems.

A geometric analysis of hallux valgus: correlation with clinical assessment of severity

PubMed Central

Piqué-Vidal, Carlos; Vila, Joan

2009-01-01

Background Application of plane geometry to the study of bunion deformity may represent an interesting and novel approach in the research field of hallux valgus. For the purpose of contributing to development of a different perspective in the assessment of hallux valgus, this study was conducted with three objectives: a) to determine the position on the intersection point of the perpendicular bisectors of the longitudinal axes of the first metatarsal and proximal phalanx (IP), b) to correlate the location of this point with hallux valgus deformity according to angular measurements and according to visual assessment of the severity carried out by three independent observers, and c) to assess whether this IP correlated with the radius of the first metatarsophalangeal arc circumference. Methods Measurements evaluated were intermetatarsal angle (IMA), hallux valgus angle (HVA), and proximal phalangeal articular angle (PPAA). The Autocad® program computed the location of the IP inside or outside of the foot. Three independent observers rated the severity of hallux valgus in photographs using a 100-mm visual analogue scale (VAS). Results Measurements of all angles except PPAA showed significantly lower values when the IP was located out of the foot more distantly and vice versa, significantly higher values for severe deformities in which the IP was found inside the foot (p < 0.001). The IP correlated significantly with VAS scores and with the length of the radius of the circle that included the first metatarsophalangeal arc circumference (p < 0.001) Conclusion The IP is a useful indicator of hallux valgus deformity because correlated significantly with IMA and HVA measurements, VAS scores obtained by visual inspection of the degree of deformity, and location of the center of the first metatarsophalangeal arc circumference. PMID:19442286

In vivo programming of tumor antigen-specific T lymphocytes from pluripotent stem cells to promote cancer immunosurveillance.

PubMed

Lei, Fengyang; Zhao, Baohua; Haque, Rizwanul; Xiong, Xiaofang; Budgeon, Lynn; Christensen, Neil D; Wu, Yuzhang; Song, Jianxun

2011-07-15

Adoptive T-cell immunotherapy has garnered wide attention, but its effective use is limited by the need of multiple ex vivo manipulations and infusions that are complex and expensive. In this study, we show how highly reactive antigen (Ag)-specific CTLs can be generated from induced pluripotent stem (iPS) cells to provide an unlimited source of functional CTLs for adoptive immunotherapy. iPS cell-derived T cells can offer the advantages of avoiding possible immune rejection and circumventing ethical and practical issues associated with other stem cell types. iPS cells can be differentiated into progenitor T cells in vitro by stimulation with the Notch ligand Delta-like 1 (DL1) overexpressed on bone marrow stromal cells, with complete maturation occurring upon adoptive transfer into Rag1-deficient mice. Here, we report that these iPS cells can be differentiated in vivo into functional CTLs after overexpression of MHC I-restricted Ag-specific T-cell receptors (TCR). In this study, we generated murine iPS cells genetically modified with ovalbumin (OVA)-specific and MHC-I restricted TCR (OT-I) by retrovirus-mediated transduction. After their adoptive transfer into recipient mice, the majority of OT-I/iPS cells underwent differentiation into CD8+ CTLs. TCR-transduced iPS cells developed in vivo responded in vitro to peptide stimulation by secreting interleukin 2 and IFN-γ. Most importantly, adoptive transfer of TCR-transduced iPS cells triggered infiltration of OVA-reactive CTLs into tumor tissues and protected animals from tumor challenge. Taken together, our findings offer proof of concept for a potentially more efficient approach to generate Ag-specific T lymphocytes for adoptive immunotherapy. ©2011 AACR.

Army Illumination Model v2 User’s Manual

DTIC Science & Technology

2011-09-01

Fraction of city luminosity escaping above the horizontal from lamp fixtures 10–15% suggested month4 integer Month of year 2 digits day4 integer Day...of month 2 digits yr4 integer Year 4 digits utc4 real UTC time of observer Equivalent to Zulu or GMT 4 Table 1. AIM input values, their...from 0.10 to 0.15. 2.1.4 Record 4 2.1.4.1 Date and Time The month (1–12), day (1–31), 4- digit year and coordinated universal time (UTC) for the

Modelling with Integer Variables.

DTIC Science & Technology

1984-01-01

Computational Comparison of * ’Equivalent’ Mixed Integer Formulations," Naval Research Logistics Quarterly 28 (1981), pp. 115- 131 . 39. R. R, Meyer and...jE(i) 3 K ".- .e I " Z A . .,.. x jCI (i) IJ ~s ;:. ... i=I 1 1X. integer A- k . . . . . . . . . . . ... . ... . . . . . . . . . o...be such that Z X.. = 1 andIfxCi’e k jcI (i) 11 13 kx m). *x + E okv . Then by putting Xil and X.=O for j* i, j£I(i) kE (2.3.4) holds. Hence S’ Pi" As

Radial Instabilities of a Pulsating Air Bubble in Water

DTIC Science & Technology

1990-01-30

ERASEDISPLAY GOTO 100 ELSE C CALL ERASEDISPLAY CALL EXIr ENDIF END I 1 257 3 PRCA PM SHAPE VIRTUAL DRIVE(16384) WAVE1 (16384) , WAVE2 (16L8 4 ’ ,DC(16384)3...INTEGER DRIVE, WAVE1, WAVE2 , DC INTEGER ROW, COL, NCHAR, I, OSCADR, GENADR, INFO (50) , MAXVAL, MAXV INTEGER KOUNT REAL GEN, ATEMP, WTEMP, WATT, FREQ...IREC=1 26D CALL GETWAV (1, DC, OSCADR, I REC) CALL GETWAV (2, DRIVE, OSCADR, IREC) CALL GETWAV (3, WAVE1, OSCADR, IREC) CALL GETWAV (4, WAVE2 ,OSCADR

New Epigenetic Therapeutic Intervention for Metastatic Breast Cancer

DTIC Science & Technology

2017-04-01

papers as listed in 3.4B. Article Distinct Roles of Brd2 and Brd4 in Potentiating the Transcriptional Program for Th17 Cell Differentiation Graphical...this paper and include the following:d KEY RESOURCES TABLE d CONTACT FOR REAGENT AND RESOURCE SHARING d EXPERIMENTAL MODEL AND SUBJECT DETAILS d METHOD...Brd4, Smc1, Smc3, Nipbl, H3K27ac, H3K4me1 ChIP-seq data This paper GEO: GSE90788 and GSE63778 Other ChIP-seq data Ciofani et al., 2012 GEO: GSE40918

Enhanced ant colony optimization for inventory routing problem

NASA Astrophysics Data System (ADS)

Wong, Lily; Moin, Noor Hasnah

2015-10-01

The inventory routing problem (IRP) integrates and coordinates two important components of supply chain management which are transportation and inventory management. We consider a one-to-many IRP network for a finite planning horizon. The demand for each product is deterministic and time varying as well as a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, delivers the products from the warehouse to meet the demand specified by the customers in each period. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount of inventory and to construct a delivery routing that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (best integer) for each instance considered. We propose an enhanced ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. The computational experiments demonstrating the effectiveness of our approach is presented.

The quantitative transperitoneal absorption of a fat emulsion: implications for intraperitoneal nutrition.

PubMed

Klein, M D; Coran, A G; Drongowski, R A; Wesley, J R

1983-12-01

Intraperitoneal (IP) administration of nutrients would be an attractive alternative to intravenous nutrition since it eliminates intravascular complications. If glucose alone were used as the nonprotein calorie source, associated fluid shifts might not be well tolerated by the patient. A fat emulsion does not have osmotic properties and thus might be incorporated into a program of IP nutrition as a calorie source. Transperitoneal absorption of a commercial fat emulsion (Liposyn 10%, Abbott Laboratories, N Chicago, IL) was studied in 12 beagle puppies divided into two groups. One group received 2.5 gm/kg of fat and the other group received a similar volume of 3.5% crystalline amino acids and 5% glucose in one IP dose. In the first group, the serum triglyceride (TG) increased three fold from 61 +/- 25 mg% to 185 +/- 61 mg% at 15 minutes and then decreased slowly while remaining significantly elevated (p less than 0.05) at 4 hours. 1.94 +/- 0.20 gm/kg of TG were absorbed from the peritoneal cavity over 4 hours. Concommitant IP administration of amino acids and glucose did not affect that absorption. Radiolabeled amino acids and glucose instilled IP were demonstrated in the blood immediately after administration and their absorption was not affected by the presence of a fat emulsion. Plasma free fatty acids showed a small increase at 4 hours (from 0.32 +/- 0.09 mEq/L to 0.59 +/- 0.22 mEq/L). Animals receiving no IP fat showed no change in serum TG. Serum glucose rose in both groups and serum cholesterol showed no changes in either group. Peritoneal fluid accumulation 4 hours after IP fat administration was minimal at 12.7 +/- 6.4 mL/kg. This study shows that a fat emulsion can be quantitatively absorbed from the peritoneal cavity over four hours and that IP nutrition may be feasible.

Statistical analysis of the limitation of half integer resonances on the available momentum acceptance of the High Energy Photon Source

NASA Astrophysics Data System (ADS)

Jiao, Yi; Duan, Zhe

2017-01-01

In a diffraction-limited storage ring, half integer resonances can have strong effects on the beam dynamics, associated with the large detuning terms from the strong focusing and strong sextupoles as required for an ultralow emittance. In this study, the limitation of half integer resonances on the available momentum acceptance (MA) was statistically analyzed based on one design of the High Energy Photon Source (HEPS). It was found that the probability of MA reduction due to crossing of half integer resonances is closely correlated with the level of beta beats at the nominal tunes, but independent of the error sources. The analysis indicated that for the presented HEPS lattice design, the rms amplitude of beta beats should be kept below 1.5% horizontally and 2.5% vertically to reach a small MA reduction probability of about 1%.

Fabry-Perot Interferometry in the Integer and Fractional Quantum Hall Regimes

NASA Astrophysics Data System (ADS)

McClure, Douglas; Chang, Willy; Kou, Angela; Marcus, Charles; Pfeiffer, Loren; West, Ken

2011-03-01

We present measurements of electronic Fabry-Perot interferometers in the integer and fractional quantum Hall regimes. Two classes of resistance oscillations may be seen as a function of magnetic field and gate voltage, as we have previously reported. In small interferometers in the integer regime, oscillations of the type associated with Coulomb interaction are ubiquitous, while those consistent with single-particle Aharonov-Bohm interference are seen to co-exist in some configurations. The amplitude scaling of both types with temperature and device size is consistent with a theoretical model. Oscillations are further observed in the fractional quantum Hall regime. Here the dependence of the period on the filling factors in the constrictions and bulk of the interferometer can shed light on the effective charge of the interfering quasiparticles, but care is needed to distinguish these oscillations from those associated with integer quantum Hall states. We acknowledge funding from Microsoft Project Q and IBM.

Numerical bias in bounded and unbounded number line tasks.

PubMed

Cohen, Dale J; Blanc-Goldhammer, Daryn

2011-04-01

The number line task is often used to assess children's and adults' underlying representations of integers. Traditional bounded number line tasks, however, have limitations that can lead to misinterpretation. Here we present a new task, an unbounded number line task, that overcomes these limitations. In Experiment 1, we show that adults use a biased proportion estimation strategy to complete the traditional bounded number line task. In Experiment 2, we show that adults use a dead-reckoning integer estimation strategy in our unbounded number line task. Participants revealed a positively accelerating numerical bias in both tasks, but showed scalar variance only in the unbounded number line task. We conclude that the unbounded number line task is a more pure measure of integer representation than the bounded number line task, and using these results, we present a preliminary description of adults' underlying representation of integers.

Accountability and Accreditation for Special Libraries: It Can Be Done!

ERIC Educational Resources Information Center

Glockner, Brigitte

2004-01-01

Health librarians are very familiar with the accreditation process in hospitals. In 2000 the first ALIA National Policy Congress recommended that accreditation of special libraries should be implemented. The proposed guidelines have been roughly based on the EQuIP Program of the Australian Council on Healthcare Standards. This program is…

78 FR 40581 - Structure and Practices of the Video Relay Service Program; Telecommunications Relay Services and...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-05

... Relay Service (IP Relay) providers; Adopts rules to protect the privacy of customer information relating... Structure and Practices of the Video Relay Service Program; Telecommunications Relay Services and Speech-to-Speech Services for Individuals With Hearing and Speech Disabilities; Final Rule #0;#0;Federal Register...

Summing up the Euler [phi] Function

ERIC Educational Resources Information Center

Loomis, Paul; Plytage, Michael; Polhill, John

2008-01-01

The Euler [phi] function counts the number of positive integers less than and relatively prime to a positive integer n. Here we look at perfect totient numbers, number for which [phi](n) + [phi]([phi](n)) + [phi]([phi]([phi](n))) + ... + 1 = n.

Multicriteria Cost Assessment and Logistics Modeling for Military Humanitarian Assistance and Disaster Relief Aerial Delivery Operations

DTIC Science & Technology

2015-03-01

vulnerable people will have access to this airdropped consumable aid (since nobody 1 is necessarily coordinating the distribution on the ground... VBA ) platforms (see Appendix B). In particular, we used GAMS v.23.9.3 with IBM ILOG CPLEX 12.4.0.1 to solve the stochastic, mixed-integer weighted...goal programming model, and we used Excel/ VBA to create an auto- matic, user-friendly interface with the decision maker for model input and analysis of

A Low-Cost Part-Task Flight Training System: An Application of a Head Mounted Display

DTIC Science & Technology

1990-12-01

architecture. The task at hand was to develop a software emulation libary that would emulate the function calls used within the Flight and Dog programs. This...represented in two hexadecimal digits for each color. The format of the packed long integer looks like aaggbbrr with each color value representing a...Western Digital ethernet card as the cheapest compatible card available. Good fortune arrived, as I was calling to order the card, I saw an unused card

Computer program for Bessel and Hankel functions

NASA Technical Reports Server (NTRS)

Kreider, Kevin L.; Saule, Arthur V.; Rice, Edward J.; Clark, Bruce J.

1991-01-01

A set of FORTRAN subroutines for calculating Bessel and Hankel functions is presented. The routines calculate Bessel and Hankel functions of the first and second kinds, as well as their derivatives, for wide ranges of integer order and real or complex argument in single or double precision. Depending on the order and argument, one of three evaluation methods is used: the power series definition, an Airy function expansion, or an asymptotic expansion. Routines to calculate Airy functions and their derivatives are also included.

The Staircase and Related Structures in Integer Programming.

DTIC Science & Technology

1980-06-01

objective value of the incumbent x; 38 zk(i) = optimal objective value of the LP relaxation of node i (descended from subproblem k); GPk (i) = maximum...following fathoming conditions holds at the current node i: (a) the LP relaxation of node i is infeasible. (b) cumobj + FLOOR(Zk(i) + GPk (i)) + maxc(k...zk(i) + GPk (i), where (as before) GPk (i) is the maximum Gomory penalty associated with node i of subproblem k, and zk(i) is the objective value of the

An Airlift Hub-and-Spoke Location-Routing Model with Time Windows: Case Study of the CONUS-to-Korea Airlift Problem

DTIC Science & Technology

1998-03-01

a point of embarkation to a point of debarkation. This study develops an alternative hub-and-spoke combined location-routing integer linear...programming prototype model, and uses this model to determine what advantages a hub-and-spoke system offers, and in which scenarios it is better-suited than the...extension on the following works: the hierarchical model of Perl and Daskin (1983), time windows features of Chan (1991), combining subtour-breaking and range

Solving a Class of Stochastic Mixed-Integer Programs With Branch and Price

DTIC Science & Technology

2006-01-01

a two-dimensional knapsack problem, but for a given m, the objective value gi does not depend on the variance index v. This will be used in a final...optimization. Journal of Multicriteria Decision Analysis 11, 139–150 (2002) 29. Ford, L.R., Fulkerson, D.R.: A suggested computation for the maximal...for solution by a branch-and-price algorithm (B&P). We then survey a number of examples, and use a stochastic facility-location problem (SFLP) for a