FRAX® International Task Force of the 2010 Joint International Society for Clinical Densitometry & International Osteoporosis Foundation Position Development Conference.

Osteoporosis is a serious worldwide epidemic. FRAX® is a web-based tool developed by the Sheffield WHO Collaborating Center team, that integrates clinical risk factors and femoral neck BMD and calculates the 10 year fracture probability in order to help health care professionals identify patients who need treatment. However, only 31 countries have a FRAX® calculator. In the absence of a FRAX® model for a particular country, it has been suggested to use a surrogate country for which the epidemiology of osteoporosis most closely approximates the index country. More specific recommendations for clinicians in these countries are not available. In North America, concerns have also been raised regarding the assumptions used to construct the US ethnic specific FRAX® calculators with respect to the correction factors applied to derive fracture probabilities in Blacks, Asians and Hispanics in comparison to Whites. In addition, questions were raised about calculating fracture risk in other ethnic groups e.g., Native Americans and First Canadians. The International Society for Clinical Densitometry (ISCD) in conjunction with the International Osteoporosis Foundation (IOF) assembled an international panel of experts that ultimately developed joint Official Positions of the ISCD and IOF advising clinicians regarding FRAX® usage. As part of the process, the charge of the FRAX® International Task Force was to review and synthesize data regarding geographic and race/ethnic variability in hip fractures, non-hip osteoporotic fractures, and make recommendations about the use of FRAX® in ethnic groups and countries without a FRAX® calculator. This synthesis was presented to the expert panel and constitutes the data on which the subsequent Official Positions are predicated. A summary of the International Task Force composition and charge is presented here.

Iowa Sex Offender Treatment and Supervision Task Force Report to the Iowa General Assembly, January 15, 2006

Over the last several years, lawmakers have been responding to several highly publicized child abduction, assault and murder cases. While such cases remain rare in Iowa, the public debates they have generated are having far-reaching effects. Policy makers are responsible for controlling the nature of such effects. Challenges they face stem from the need to avoid primarily politically-motivated responses and the desire to make informed decisions that recognize both the strengths and the limitations of the criminal justice system as a vehicle for promoting safe and healthy families and communities. Consensus was reached by the Task Force at its first meeting that one of its standing goals is to provide nonpartisan guidance to help avoid or fix problematic sex offense policies and practices. Setting this goal was a response to the concern over what can result from elected officials’ efforts to respond to the types of sex offender-related concerns that can easily become emotionally laden and politically charged due to the universally held abhorrence of sex crimes against children. The meetings of the Task Force and the various work groups it has formed have included some spirited and perhaps emotionally charged discussions, despite the above-stated ground rule. However, as is described in the report, the Task Force’s first set of recommendations and plans for further study were approved through consensus. It is hoped that in upcoming legislative deliberations, it will be remembered that the non-legislative members of the Task Force all agreed on the recommendations contained in this report. The topics discussed in this first report from the Task Force are limited to the study issues specifically named in H.F. 619, the Task Force’s enabling legislation. However, other topics of concern were discussed by the Task Force because of their immediacy or because of their possible relationships with one or more of the Task Force’s mandated study issues. For example, it has been reported by some probation/parole officers and others that the 2000 feet rule has had a negative influence on treatment participation and supervision compliance. While such concerns were noted, the Task Force did not take it upon itself to investigate them at this time and thus broaden the agenda it was given by the General Assembly last session. As a result, the recently reinstated 2000 feet rule, the new cohabitation/child endangerment law and other issues of interest to Task Force members but not within the scope of their charge are not discussed in the body of this report. An issue of perhaps the greatest interest to most Task Force members that was not a part of their charge was a belief in the benefit of viewing Iowa’s efforts to protect children from sex crimes with as comprehensive a platform as possible. It has been suggested that much more can be done to prevent child-victim sex crimes than would be accomplished by only concentrating on what to do with offenders after a crime has occurred. To prevent child victimization, H.F. 619 policy provisions rely largely on incapacitation and future deterrent effects of increased penalties, more restrictive supervision practices and greater public awareness of the risk presented by a segment of Iowa’s known sex offenders. For some offenders, these policies will no doubt prevent future sex crimes against children, and the Task Force has begun long-term studies to look for the desired results and for ways to improve such results through better supervision tools and more effective offender treatment. Unfortunately, much of the effects from the new policies may primarily influence persons who have already committed sex offenses against minors and who have already been caught doing so. Task Force members discussed the need for a range of preventive efforts and a need to think about sex crimes against children from other than just a “reaction- to-the-offender” perspective. While this topic is not addressed in the report that follows, it was suggested that some of the Task Force’s discussions could be briefly shared through these opening comments. Along with incapacitation and deterrence, comprehensive approaches to the prevention of child-victim sex crimes would also involve making sure parents have the tools they need to detect signs of adults with sex behavior problems, to help teach their children about warning signs and to find the support they need for healthy parenting. School, faithbased and other community organizations might benefit from stronger supports and better tools they can use to more effectively promote positive youth development and the learning of respect for others, respect for boundaries and healthy relationships. All of us who have children, or who live in communities where there are children, need to understand the limitations of our justice system and the importance of our own ability to play a role in preventing sexual abuse and protecting children from sex offenders, which are often the child’s own family members. Over 1,000 incidences of child sexual abuse are confirmed or founded each year in Iowa, and most such acts take place in the child’s home or the residence of the caretaker of the child. Efforts to prevent child sexual abuse and to provide for early interventions with children and families at risk could be strategically examined and strengthened. The Sex Offender Treatment and Supervision Task Force was established to provide assistance to the General Assembly. It will respond to legislative direction for adjusting its future plans as laid out in this report. Its plans could be adjusted to broaden or narrow its scope or to assign different priority levels of effort to its current areas of study. Also, further Task Force considerations of the recommendations it has already submitted could be called for. In the meantime, it is hoped that the information and recommendations submitted through this report prove helpful.

On Certain Greedoid Polyhedra, Partially Indexable Scheduling Problems, and Extended Restless Bandit Allocation Indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid (whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then the problem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Cognitive stimulation through task-oriented telerobotics

The project presented, iCognos, consists of a flexible platform to assist end-users in performing a series of mental tasks with a sensitized mobile telerobotic platform aimed at mitigating the problems associated to cognitive disorders with an ecological cognition approach.

Report of Task Force into Critical Incidents within the Iowa Prison System, 2004

Report #02-04 Concerns about the death of two Iowa inmates at the Anamosa State Penitentiary, asked the Ombudsman Office to review the incidents and provide an assessment of each incident. The Governor also asked the Ombudsman Office to propose a set of recommendations for improving inmate and staff safety within Anamosa State Penitentiary.

Audit report on a special investigation of the Bear Creek Narcotics Task Force for the period July 1, 2003 through November 30, 2006

Audit report on a special investigation of the Bear Creek Narcotics Task Force for the period July 1, 2003 through November 30, 2006

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs

Most research on single machine scheduling has assumedthe linearity of job holding costs, which is arguablynot appropriate in some applications. This motivates ourstudy of a model for scheduling $n$ classes of stochasticjobs on a single machine, with the objective of minimizingthe total expected holding cost (discounted or undiscounted). We allow general holding cost rates that are separable,nondecreasing and convex on the number of jobs in eachclass. We formulate the problem as a linear program overa certain greedoid polytope, and establish that it issolved optimally by a dynamic (priority) index rule,whichextends the classical Smith's rule (1956) for the linearcase. Unlike Smith's indices, defined for each class, ournew indices are defined for each extended class, consistingof a class and a number of jobs in that class, and yieldan optimal dynamic index rule: work at each time on a jobwhose current extended class has larger index. We furthershow that the indices possess a decomposition property,as they are computed separately for each class, andinterpret them in economic terms as marginal expected cost rate reductions per unit of expected processing time.We establish the results by deploying a methodology recentlyintroduced by us [J. Niño-Mora (1999). "Restless bandits,partial conservation laws, and indexability. "Forthcomingin Advances in Applied Probability Vol. 33 No. 1, 2001],based on the satisfaction by performance measures of partialconservation laws (PCL) (which extend the generalizedconservation laws of Bertsimas and Niño-Mora (1996)):PCL provide a polyhedral framework for establishing theoptimality of index policies with special structure inscheduling problems under admissible objectives, which weapply to the model of concern.

Solving two production scheduling problems with sequence-dependent set-up times

In today’s competitive markets, the importance of goodscheduling strategies in manufacturing companies lead to theneed of developing efficient methods to solve complexscheduling problems.In this paper, we studied two production scheduling problemswith sequence-dependent setups times. The setup times areone of the most common complications in scheduling problems,and are usually associated with cleaning operations andchanging tools and shapes in machines.The first problem considered is a single-machine schedulingwith release dates, sequence-dependent setup times anddelivery times. The performance measure is the maximumlateness.The second problem is a job-shop scheduling problem withsequence-dependent setup times where the objective is tominimize the makespan.We present several priority dispatching rules for bothproblems, followed by a study of their performance. Finally,conclusions and directions of future research are presented.

Summary Report for the Iowa Alzheimer's Task Force 2007 from the Iowa Alzheimer's Disease Demonstration Projects

The Iowa Department of Elder Affairs, in collaboration with the University of Iowa College of Nursing, has been engaged in developing and evaluating community based services for persons with dementia in the state of Iowa over the past 7 years under a grant form the Administration on Aging. This grant tested out several models of care (dementia nurse care manager, memory loss nurse specialist, “People Living Alone Need Support” (PLANS), varying models of respite care), surveyed agencies and service providers in regard to how they provide services for persons with dementia, and provided training to case management, community college instructors, adult day service providers and other related services providers including assisted living and nursing home facilities.

Relative and absolute reliability of the clinical version of the Narrow Path Walking Test (NPWT) under single and dual task conditions.

Decline in gait stability has been associated with increased fall risk in older adults. Reliable and clinically feasible methods of gait instability assessment are needed. This study evaluated the relative and absolute reliability and concurrent validity of the testing procedure of the clinical version of the Narrow Path Walking Test (NPWT) under single task (ST) and dual task (DT) conditions. Thirty independent community-dwelling older adults (65-87 years) were tested twice. Participants were instructed to walk within the 6-m narrow path without stepping out. Trial time, number of steps, trial velocity, number of step errors, and number of cognitive task errors were determined. Intraclass correlation coefficients (ICCs) were calculated as indices of agreement, and a graphic approach called "mountain plot" was applied to help interpret the direction and magnitude of disagreements between testing procedures. Smallest detectable change and smallest real difference (SRD) were computed to determine clinically relevant improvement at group and individual levels, respectively. Concurrent validity was assessed using Performance Oriented Mobility Assessment Tool (POMA) and the Short Physical Performance Battery (SPPB). Test-retest agreement (ICC1,2) varied from 0.77 to 0.92 in ST and from 0.78 to 0.92 in DT conditions, with no apparent systematic differences between testing procedures demonstrated by the mountain plot graphs. Smallest detectable change and smallest real change were small for motor task performance and larger for cognitive errors. Significant correlations were observed for trial velocity and trial time with POMA and SPPB. The present results indicate that the NPWT testing procedure is highly reliable and reproducible.

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.

The crew-scheduling module in the GIST system

The public transportation is gaining importance every year basically duethe population growth, environmental policies and, route and streetcongestion. Too able an efficient management of all the resources relatedto public transportation, several techniques from different areas are beingapplied and several projects in Transportation Planning Systems, indifferent countries, are being developed. In this work, we present theGIST Planning Transportation Systems, a Portuguese project involving twouniversities and six public transportation companies. We describe indetail one of the most relevant modules of this project, the crew-scheduling module. The crew-scheduling module is based on the application of meta-heuristics, in particular GRASP, tabu search and geneticalgorithm to solve the bus-driver-scheduling problem. The metaheuristicshave been successfully incorporated in the GIST Planning TransportationSystems and are actually used by several companies.