St. Francis Hospice: Medicare and health care reform

The St. Francis Hospice Program is symbolic of more than 100 years of Franciscan dedication to the people of Hawaii. Since Mother Marianne's arrival in November of 1883, the Sisters of the Third Franciscan Order Syracuse, New York have responded to the calling; "the charity of Christ impels us." It is through this calling that care and comfort for the terminally ill is a part of the mission of St. Francis Healthcare System. The magnificent spirit through which Hospice services have been made possible, is a reflection of God's great generosity to us throughout the years.     

A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications

We review the literature on approximate dynamic programming, with the goal of better understanding the theory behind practical algorithms for solving dynamic programs with continuous and vector-valued states and actions and complex information processes. We build on the literature that has addressed the well-known problem of multidimensional (and possibly continuous) states, and the extensive literature on model-free dynamic programming, which also assumes that the expectation in Bellman’s equation cannot be computed. However, we point out complications that arise when the actions/controls are vector-valued and possibly continuous. We then describe some recent research by the authors on approximate policy iteration algorithms that offer convergence guarantees (with technical assumptions) for both parametric and nonparametric architectures for the value function.     

C-PSA: Constrained Pareto simulated annealing for constrained multi-objective optimization

In recent years, evolutionary algorithms (EAs) have been extensively developed and utilized to solve multi-objective optimization problems. However, some previous studies have shown that for certain problems, an approach which allows for non-greedy or uphill moves (unlike EAs), can be more beneficial. One such approach is simulated annealing (SA). SA is a proven heuristic for solving numerical optimization problems. But owing to its point-to-point nature of search, limited efforts has been made to explore its potential for solving multi-objective problems. The focus of the presented work is to develop a simulated annealing algorithm for constrained multi-objective problems. The performance of the proposed algorithm is reported on a number of difficult constrained benchmark problems. A comparison with other established multi-objective optimization algorithms, such as infeasibility driven evolutionary algorithm (IDEA), Non-dominated sorting genetic algorithm II (NSGA-II) and multi-objective Scatter search II (MOSS-II) has been included to highlight the benefits of the proposed approach.     

Free-living inferential modeling of blood glucose level using only noninvasive inputs

The goal of this work is to present a causation modeling methodology with the ability to accurately infer blood glucose levels using a large set of highly correlated noninvasive input variables over an extended period of time. These models can provide insight to improve glucose monitoring, and glucose regulation through advanced model-based control technologies. The efficacy of this approach is demonstrated using real data from a type 2 diabetic (T2D) subject collected under free-living conditions over a period of 25 consecutive days. The model was identified and tested using eleven variables that included three food variables as well as several activity and stress variables. The model was trained using 20 days of data and validated using 5 days of data. This gave a fitted correlation coefficient of 0.70 and an average absolute error (AAE) (i.e., the average of the absolute values for the measured glucose concentration minus modeled glucose concentration) of 13.3 mg/dL for the validation data. This AAE result was significantly better than the subject’s personal glucose meter AAE of 15.3 mg/dL for replicated measurements.     

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.     

Two hybrid differential evolution algorithms for engineering design optimization

This paper presents two hybrid differential evolution algorithms for optimizing engineering design problems. One hybrid algorithm enhances a basic differential evolution algorithm with a local search operator, i.e., random walk with direction exploitation, to strengthen the exploitation ability, while the other adding a second metaheuristic, i.e., harmony search, to cooperate with the differential evolution algorithm so as to produce the desirable synergetic effect. For comparison, the differential evolution algorithm that the two hybrids are based on is also implemented. All algorithms incorporate a generalized method to handle discrete variables and Deb's parameterless penalty method for handling constraints. Fourteen engineering design problems selected from different engineering fields are used for testing. The test results show that: (i) both hybrid algorithms overall outperform the differential evolution algorithms; (ii) among the two hybrid algorithms, the cooperative hybrid overall outperforms the other hybrid with local search; and (iii) the performance of proposed hybrid algorithms can be further improved with some effort of tuning the relevant parameters.     

ONTRACK: Dynamically adapting music playback to support navigation

Listening to music on personal, digital devices whilst mobile is an enjoyable, everyday activity. We explore a scheme for exploiting this practice to immerse listeners in navigation cues. Our prototype, ONTRACK, continuously adapts audio, modifying the spatial balance and volume to lead listeners to their target destination. First we report on an initial lab-based evaluation that demonstrated the approach’s efficacy: users were able to complete tasks within a reasonable time and their subjective feedback was positive. Encouraged by these results we constructed a handheld prototype. Here, we discuss this implementation and the results of field-trials. These indicate that even with a low-fidelity realisation of the concept, users can quite effectively navigate complicated routes.

---

Chiasma interference as a function of genetic distance

For many organisms, meiotic double crossing over is less frequent than expected on the assumption that exchanges occur at random with respect to each other. This "interference," which can be almost total for nearby intervals, diminishes as the intervals in which the double crossovers are scored are moved farther apart. Most models for interference have assumed, at least implicitly, that the intensity of interference depends inversely on the physical distance separating the intervals. However, several observations suggest that interference depends on genetic distance (Morgans) rather than physical distance (base pairs or micrometers). Accordingly, we devise a model in which interference is related directly to genetic distance. Its central feature is that recombinational intermediates (C's) have two fates--they can be resolved with crossing over (Cx) or without (Co). We suppose that C's are distributed at random with respect to each other (no interference); interference results from constraints on the resolution of C's. The basic constraint is that each pair of neighboring Cx's must have between them a certain number of Co's. The required number of intervening Co's for a given organism or chromosome is estimated from the fraction of gene conversions that are unaccompanied by crossover of flanking markers. The predictions of the model are compared with data from Drosophila and Neurospora.     

Promoting positive relations between parents and child--a counseling service for families with infants and young children in Sydney

The "Early Intervention Programme" (EIP) in Sydney, Australia, is a home-based service for distressed families with children 0-3 years of age. It is funded as a child abuse prevention unit. The concept is based on the work of Selma Fraiberg (1980), who developed the first infant mental health program in Michigan, USA. The goal of the EIP is to strengthen the relationship between parents and child through developmental guidance, psychotherapy and/or provision of active help. The child is seen as an important partner in the intervention process.