Sign of the Times, September 2006

Newsletter produced by Deaf Services Commission of Iowa

Sign of the Times, October 2006

Newsletter produced by Deaf Services Commission of Iowa

Sign of the Times, November 2006

Newsletter produced by Deaf Services Commission of Iowa

Sign of the Times, December 2006

Newsletter produced by Deaf Services Commission of Iowa

Sign of the Times, May 2008

Newsletter produced by Deaf Services Commission of Iowa

Sign of the Times, March 2007

Newsletter produced by Deaf Services Commission of Iowa

Sign of the Times, February 2007

Newsletter produced by Deaf Services Commission of Iowa

Cross-cultural adaptation of the Caregiver Reaction Assessment for use in Brazil with informal caregivers of the elderly

This study aimed to carry out the cross-cultural adaptation of the Caregiver Reaction Assessment CRA for use in Brazil with informal caregivers of dependent elderly METHOD A methodological study, of five steps: initial translation, synthesis of translations, retro-translation, evaluation by a judge committee and a pre-test, with 30 informal caregivers of older persons in Fortaleza, Brazil. Content validity was assessed by five experts in gerontology and geriatrics. The cross-cultural adaptation was rigorously conducted, allowing for inferring credibility. RESULTS The Brazilian version of the CRA had a simple and fast application (ten minutes), easily understood by the target audience. It is semantically, idiomatically, experimentally and conceptually equivalent to the original version, with valid content to assess the burden of informal caregivers for the elderly (Content Validity Index = 0.883). CONCLUSION It is necessary that other psychometric properties of validity and reliability are tested before using in care practice and research.

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.

Changes in spring-mass model characteristics during repeated running sprints.

This study investigated fatigue-induced changes in spring-mass model characteristics during repeated running sprints. Sixteen active subjects performed 12 × 40 m sprints interspersed with 30 s of passive recovery. Vertical and anterior-posterior ground reaction forces were measured at 5-10 m and 30-35 m and used to determine spring-mass model characteristics. Contact (P < 0.001), flight (P < 0.05) and swing times (P < 0.001) together with braking, push-off and total stride durations (P < 0.001) lengthened across repetitions. Stride frequency (P < 0.001) and push-off forces (P < 0.05) decreased with fatigue, whereas stride length (P = 0.06), braking (P = 0.08) and peak vertical forces (P = 0.17) changes approached significance. Center of mass vertical displacement (P < 0.001) but not leg compression (P > 0.05) increased with time. As a result, vertical stiffness decreased (P < 0.001) from the first to the last repetition, whereas leg stiffness changes across sprint trials were not significant (P > 0.05). Changes in vertical stiffness were correlated (r > 0.7; P < 0.001) with changes in stride frequency. When compared to 5-10 m, most of ground reaction force-related parameters were higher (P < 0.05) at 30-35 m, whereas contact time, stride frequency, vertical and leg stiffness were lower (P < 0.05). Vertical stiffness deteriorates when 40 m run-based sprints are repeated, which alters impact parameters. Maintaining faster stride frequencies through retaining higher vertical stiffness is a prerequisite to improve performance during repeated sprinting.

Driver scheduling problem modelling

The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, for example buses, trains, plane or boat drivers or pilots, for the transportation of passengers or goods. This is a complex problem because it involves several constraints related to labour and company rules and can also present different evaluation criteria and objectives. Being able to develop an adequate model for this problem that can represent the real problem as close as possible is an important research area.The main objective of this research work is to present new mathematical models to the DSP problem that represent all the complexity of the drivers scheduling problem, and also demonstrate that the solutions of these models can be easily implemented in real situations. This issue has been recognized by several authors and as important problem in Public Transportation. The most well-known and general formulation for the DSP is a Set Partition/Set Covering Model (SPP/SCP). However, to a large extend these models simplify some of the specific business aspects and issues of real problems. This makes it difficult to use these models as automatic planning systems because the schedules obtained must be modified manually to be implemented in real situations. Based on extensive passenger transportation experience in bus companies in Portugal, we propose new alternative models to formulate the DSP problem. These models are also based on Set Partitioning/Covering Models; however, they take into account the bus operator issues and the perspective opinions and environment of the user.We follow the steps of the Operations Research Methodology which consist of: Identify the Problem; Understand the System; Formulate a Mathematical Model; Verify the Model; Select the Best Alternative; Present the Results of theAnalysis and Implement and Evaluate. All the processes are done with close participation and involvement of the final users from different transportation companies. The planner s opinion and main criticisms are used to improve the proposed model in a continuous enrichment process. The final objective is to have a model that can be incorporated into an information system to be used as an automatic tool to produce driver schedules. Therefore, the criteria for evaluating the models is the capacity to generate real and useful schedules that can be implemented without many manual adjustments or modifications. We have considered the following as measures of the quality of the model: simplicity, solution quality and applicability. We tested the alternative models with a set of real data obtained from several different transportation companies and analyzed the optimal schedules obtained with respect to the applicability of the solution to the real situation. To do this, the schedules were analyzed by the planners to determine their quality and applicability. The main result of this work is the proposition of new mathematical models for the DSP that better represent the realities of the passenger transportation operators and lead to better schedules that can be implemented directly in real situations.

Histoplasma capsulatum var. duboisii infection in a patient with AIDS: rapid diagnosis using polymerase chain reaction-sequencing.

We describe an original case of disseminated infection with Histoplasma capsulatum (Hc) var. duboisii in an African patient with AIDS who migrated to Switzerland. The diagnosis of histoplasmosis was suggested using direct examination of tissues and confirmed in 24 h with a panfungal polymerase chain reaction assay. The variety duboisii of Hc was established using DNA sequencing of the polymorphic genomic region OLE. Molecular tools allow diagnosis of histoplasmosis in 24 h, which is drastically shorter than culture procedures.

Proton T1 relaxation times of metabolites in human occipital white and gray matter at 7 T.

Proton T1 relaxation times of metabolites in the human brain have not previously been published at 7 T. In this study, T1 values of CH3 and CH2 group of N-acetylaspartate and total creatine as well as nine other brain metabolites were measured in occipital white matter and gray matter at 7 T using an inversion-recovery technique combined with a newly implemented semi-adiabatic spin-echo full-intensity acquired localized spectroscopy sequence (echo time = 12 ms). The mean T1 values of metabolites in occipital white matter and gray matter ranged from 0.9 to 2.2 s. Among them, the T1 of glutathione, scyllo-inositol, taurine, phosphorylethanolamine, and N-acetylaspartylglutamate were determined for the first time in the human brain. Significant differences in T1 between white matter and gray matter were found for water (-28%), total choline (-14%), N-acetylaspartylglutamate (-29%), N-acetylaspartate (+4%), and glutamate (+8%). An increasing trend in T1 was observed when compared with previously reported values of N-acetylaspartate (CH3 ), total creatine (CH3 ), and total choline at 3 T. However, for N-acetylaspartate (CH3 ), total creatine, and total choline, no substantial differences compared to previously reported values at 9.4 T were discernible. The T1 values reported here will be useful for the quantification of metabolites and signal-to-noise optimization in human brain at 7 T. Magn Reson Med 69:931-936, 2013. © 2012 Wiley Periodicals, Inc.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.