A Scoping Review of Psychological Interventions for PTSD in Military Personnel and Veterans.

Post-traumatic stress disorder (PTSD) has emerged as a key concern for military and veteran populations. This article describes what is being done programmatically and therapeutically to treat PTSD in military personnel and veterans returning from deployment. This scoping review demonstrates that (1) research published in this area has been rapidly increasing since its inception in the 1980s; (2) the vast majority of articles focus on cognitive-behavioral approaches to treatment, and this area of the literature presents strong evidence for these approaches; and (3) there is a lack of randomized controlled trials for treatments, such as art therapies and group therapies.

Feasibility study and flow scheduling optimization of a multi-product pipeline system

The first goal of this study is to analyse a real-world multiproduct onshore pipeline system in order to verify its hydraulic configuration and operational feasibility by constructing a simulation model step by step from its elementary building blocks that permits to copy the operation of the real system as precisely as possible. The second goal is to develop this simulation model into a user-friendly tool that one could use to find an “optimal” or “best” product batch schedule for a one year time period. Such a batch schedule could change dynamically as perturbations occur during operation that influence the behaviour of the entire system. The result of the simulation, the ‘best’ batch schedule is the one that minimizes the operational costs in the system. The costs involved in the simulation are inventory costs, interface costs, pumping costs, and penalty costs assigned to any unforeseen situations. The key factor to determine the performance of the simulation model is the way time is represented. In our model an event based discrete time representation is selected as most appropriate for our purposes. This means that the time horizon is divided into intervals of unequal lengths based on events that change the state of the system. These events are the arrival/departure of the tanker ships, the openings and closures of loading/unloading valves of storage tanks at both terminals, and the arrivals/departures of trains/trucks at the Delivery Terminal. In the feasibility study we analyse the system’s operational performance with different Head Terminal storage capacity configurations. For these alternative configurations we evaluated the effect of different tanker ship delay magnitudes on the number of critical events and product interfaces generated, on the duration of pipeline stoppages, the satisfaction of the product demand and on the operative costs. Based on the results and the bottlenecks identified, we propose modifications in the original setup.

Multi-agent system for distributed manufacturing scheduling with genetic algorithms and tabu search

Computerized scheduling methods and computerized scheduling systems according to exemplary embodiments. A computerized scheduling method may be stored in a memory and executed on one or more processors. The method may include defining a main multi-machine scheduling problem as a plurality of single machine scheduling problems; independently solving the plurality of single machine scheduling problems thereby calculating a plurality of near optimal single machine scheduling problem solutions; integrating the plurality of near optimal single machine scheduling problem solutions into a main multi-machine scheduling problem solution; and outputting the main multi-machine scheduling problem solution.

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.

Constraint based methods for allocation and scheduling of periodic applications

This work presents exact algorithms for the Resource Allocation and Cyclic Scheduling Problems (RA&CSPs). Cyclic Scheduling Problems arise in a number of application areas, such as in hoist scheduling, mass production, compiler design (implementing scheduling loops on parallel architectures), software pipelining, and in embedded system design. The RA&CS problem concerns time and resource assignment to a set of activities, to be indefinitely repeated, subject to precedence and resource capacity constraints. In this work we present two constraint programming frameworks facing two different types of cyclic problems. In first instance, we consider the disjunctive RA&CSP, where the allocation problem considers unary resources. Instances are described through the Synchronous Data-flow (SDF) Model of Computation. The key problem of finding a maximum-throughput allocation and scheduling of Synchronous Data-Flow graphs onto a multi-core architecture is NP-hard and has been traditionally solved by means of heuristic (incomplete) algorithms. We propose an exact (complete) algorithm for the computation of a maximum-throughput mapping of applications specified as SDFG onto multi-core architectures. Results show that the approach can handle realistic instances in terms of size and complexity. Next, we tackle the Cyclic Resource-Constrained Scheduling Problem (i.e. CRCSP). We propose a Constraint Programming approach based on modular arithmetic: in particular, we introduce a modular precedence constraint and a global cumulative constraint along with their filtering algorithms. Many traditional approaches to cyclic scheduling operate by fixing the period value and then solving a linear problem in a generate-and-test fashion. Conversely, our technique is based on a non-linear model and tackles the problem as a whole: the period value is inferred from the scheduling decisions. The proposed approaches have been tested on a number of non-trivial synthetic instances and on a set of realistic industrial instances achieving good results on practical size problem.

Evolution of multidrug-resistant Staphylococcus aureus infections in horses and colonized personnel in an equine clinic between 2005 and 2010

A total of 70 Staphylococcus aureus isolates from postoperative infections in hospitalized horses were isolated between January 2005 and January 2011. Among them, 12 isolates were methicillin-susceptible S. aureus (MSSA), 18 were borderline-oxacillin-resistant S. aureus (BORSA), and 40 were methicillin-resistant S. aureus (MRSA). During the same period, the equine clinic personnel were screened for nasal carriage of BORSA and MRSA. Genotyping revealed that BORSA ST1(MLST)-t2863(spa) isolates were responsible for most equine infections and were the main isolates found in colonized members of the personnel between 2005 and 2007, and that in 2007, MRSA ST398-t011-IVa(SCCmec) emerged in infection sites and personnel, replacing BORSA. Besides decreased susceptibility to oxacillin, all MRSA and BORSA of these two major clonal lineages displayed resistance to gentamicin and kanamycin conferred by the aac(6')-Ie-aph(2')-Ia gene and to trimethoprim conferred by dfr(K) in MRSA and dfr(A) in BORSA. All MRSA had additional resistance to tetracycline conferred by tet(M), whereas BORSA generally also display resistance to streptomycin conferred by str. The number of hospital-acquired MRSA infections in horses could be limited after the introduction of basic hygiene measures and personnel decolonization. Two MRSA carriers could not be decolonized using mupirocin, and a year after decolonization, additional members were recolonized with MRSA. Hygiene measures should, therefore, be maintained to limit the transmission of S. aureus between personnel and horses.

A Comparative Study of Central and Eastern European Social Policy Concernig Mental Disability

The main goal of this project was to identity whether an imported system of social policy can be suitable for a host country, and if not why not. Romanian social policy concerning the mentally disabled represents a paradoxical situation in that while social policy is designed to ensure both an institutional structure and a juridical environment, in practice it is far from successful. The central question which Ms. Ciumageanu asked therefore was whether this failure was due to systemic factors, or whether the problem lay in reworking an imported social policy system to meet local needs. She took a comparative approach, also considering both the Scandinavian model of social policy, particularly the Danish model which has been adopted in Romania, and the Hungarian system, which has inherited a similar universal welfare system and perpetuated it to some extent. In order to verify her hypothesis, she also studied the transformation of the welfare system in Great Britain, which meant a shift from state responsibility towards community care. In all these she concentrated on two major aspects: the structural design within the different countries and, at a micro level, the societal response. Following her analyses of the various in the other countries concerned, Ms. Ciumageanu concluded that the major differences lie first in the difference between the stages of policy design. Here Denmark is the most advanced and Romania the most backwards. Denmark has a fairly elaborate infrastructure, Britain a system with may gaps to bridge, and Hungary and Romania are struggling with severe difficulties owing both to the inherited structure and the limits imposed by an inadequate GDP. While in Denmark and Britain, mental patients are integrated into an elaborate system of care, designed and administered by the state (in Denmark) or communities (in Britain), in Hungary and Romania, the state designs and fails to implement the policy and community support is minimal, partly due to the lack of a fully developed civil society. At the micro level the differences are similar. While in Denmark and Britain there is a consensus about the roles of the state and of civil societies (although at different levels in the two countries, with the state being more supportive in Denmark), in Romania and to a considerable extent in Hungary, civil society tends to expect too much from the state, which in its turn is withdrawing faster from its social roles than from its economic ones, generating a gap between the welfare state and the market economy and disadvantaging the expected transition from a welfare state to a welfare society and, implicitly, the societal response towards those mentally disabled persons in it. On an intermediate level, the factors influencing social policy as a whole were much the same for Hungary and Romania. Economic factors include the accumulated economic resources of both state and citizens, and the inherited pattern of redistribution, as well as the infrastructure; institutional resources include the role of the state and the efficiency of the state bureaucracy, the strength and efficiency of the state apparatus, political stability and the complexity of political democratisation, the introduction of market institutions, the strength of civil society and civic sector institutions. From the standpoint of the societal response, some factors were common to all countries, particularly the historical context, the collective and institutional memories and established patterns of behaviour. In the specific case of Romania, general structural and environmental factors - industrialisation and forced urbanisation - have had a definite influence on family structure, values and behavioural patterns. The analysis of Romanian social policy revealed several causes for failure to date. The first was the instability of the policy and the failure to consider the structural network involved in developing it, rather than just the results obtained. The second was the failure to take into account the relationship between the individual and the group in all its aspects, followed by the lack of active assistance for prevention, re-socialisation or professional integration of persons with mental disabilities. Finally, the state fails to recognise its inability to support an expensive psychiatric enterprise and does not provide any incentive to the private sector. This creates tremendous social costs for both the state and the individual. NGOs working in the field in Romania have been somewhat more successful but are still limited by their lack of funding and personnel and the idea of a combined system is as yet utopian in the circumstances in the country.

Effects of fixed night shift work on 24 hour blood pressure regulation, state anxiety levels and total sleep time

Nearly 22 million Americans operate as shift workers, and shift work has been linked to the development of cardiovascular disease (CVD). This study is aimed at identifying pivotal risk factors of CVD by assessing 24 hour ambulatory blood pressure, state anxiety levels and sleep patterns in 12 hour fixed shift workers. We hypothesized that night shift work would negatively affect blood pressure regulation, anxiety levels and sleep patterns. A total of 28 subjects (ages 22-60) were divided into two groups: 12 hour fixed night shift workers (n=15) and 12 hour fixed day shift workers (n=13). 24 hour ambulatory blood pressure measurements (Space Labs 90207) were taken twice: once during a regular work day and once on a non-work day. State anxiety levels were assessed on both test days using the Speilberger’s State Trait Anxiety Inventory. Total sleep time (TST) was determined using self recorded sleep diary. Night shift workers demonstrated increases in 24 hour systolic (122 ± 2 to 126 ± 2 mmHg, P=0.012); diastolic (75 ± 1 to 79 ± 2 mmHg, P=0.001); and mean arterial pressures (90 ± 2 to 94 ± 2mmHg, P<0.001) during work days compared to off days. In contrast, 24 hour blood pressures were similar during work and off days in day shift workers. Night shift workers reported less TST on work days versus off days (345 ± 16 vs. 552 ± 30 min; P<0.001), whereas day shift workers reported similar TST during work and off days (475 ± 16 minutes to 437 ± 20 minutes; P=0.231). State anxiety scores did not differ between the groups or testing days (time*group interaction P=0.248), suggesting increased 24 hour blood pressure during night shift work is related to decreased TST, not short term anxiety. Our findings suggest that fixed night shift work causes disruption of the normal sleep-wake cycle negatively affecting acute blood pressure regulation, which may increase the long-term risk for CVD.

Heuristic decomposition and LP-based scheduling in make-and-pack production

In this paper, we are concerned about the short-term scheduling of industrial make-and-pack production processes. The planning problem consists in minimizing the production makespan while meeting given end-product demands. Sequence-dependent changeover times, multi-purpose storage units with finite capacities, quarantine times, batch splitting, partial equipment connectivity, material transfer times, and a large number of operations contribute to the complexity of the problem. Known MILP formulations cover all technological constraints of such production processes, but only small problem instances can be solved in reasonable CPU times. In this paper, we develop a heuristic in order to tackle large instances. Under this heuristic, groups of batches are scheduled iteratively using a novel MILP formulation; the assignment of the batches to the groups and the scheduling sequence of the groups are determined using a priority rule. We demonstrate the applicability by means of a real-world production process.

Adapting mode switches into the hierarchical scheduling

Mode switches are used to partition the system’s behavior into different modes to reduce the complexity of large embedded systems. Such systems operate in multiple modes in which each one corresponds to a specific application scenario; these are called Multi-Mode Systems (MMS). A different piece of software is normally executed for each mode. At any given time, the system can be in one of the predefined modes and then be switched to another as a result of a certain condition. A mode switch mechanism (or mode change protocol) is used to shift the system from one mode to another at run-time. In this thesis we have used a hierarchical scheduling framework to implement a multi-mode system called Multi-Mode Hierarchical Scheduling Framework (MMHSF). A two-level Hierarchical Scheduling Framework (HSF) has already been implemented in an open source real-time operating system, FreeRTOS, to support temporal isolation among real-time components. The main contribution of this thesis is the extension of the HSF featuring a multimode feature with an emphasis on making minimal changes in the underlying operating system (FreeRTOS) and its HSF implementation. Our implementation uses fixed-priority preemptive scheduling at both local and global scheduling levels and idling periodic servers. It also now supports different modes of the system which can be switched at run-time. Each subsystem and task exhibit different timing attributes according to mode, and upon a Mode Change Request (MCR) the task-set and timing interfaces of the entire system (including subsystems and tasks) undergo a change. A Mode Change Protocol specifies precisely how the system-mode will be changed. However, an application may not only need to change a mode but also a different mode change protocol semantic. For example, the mode change from normal to shutdown can allow all the tasks to be completed before the mode itself is changed, while changing a mode from normal to emergency may require aborting all tasks instantly. In our work, both the system mode and the mode change protocol can be changed at run-time. We have implemented three different mode change protocols to switch from one mode to another: the Suspend/resume protocol, the Abort protocol, and the Complete protocol. These protocols increase the flexibility of the system, allowing users to select the way they want to switch to a new mode. The implementation of MMHSF is tested and evaluated on an AVR-based 32 bit board EVK1100 with an AVR32UC3A0512 micro-controller. We have tested the behavior of each system mode and for each mode change protocol. We also provide the results for the performance measures of all mode change protocols in the thesis. RESUMEN Los conmutadores de modo son usados para particionar el comportamiento del sistema en diferentes modos, reduciendo así la complejidad de grandes sistemas empotrados. Estos sistemas tienen multiples modos de operación, cada uno de ellos correspondiente a distintos escenarios y para distintas aplicaciones; son llamados Sistemas Multimodales (o en inglés “Multi-Mode Systems” o MMS). Normalmente cada modo ejecuta una parte de código distinto. En un momento dado el sistema, que está en un modo concreto, puede ser cambiado a otro modo distinto como resultado de alguna condicion impuesta previamente. Los mecanismos de cambio de modo (o protocolos de cambio de modo) son usados para mover el sistema de un modo a otro durante el tiempo de ejecución. En este trabajo se ha usado un modelo de sistema operativo para implementar un sistema multimodo llamado MMHSF, siglas en inglés correspondientes a (Multi-Mode Hierarchical Scheduling Framework). Este sistema está basado en el HSF (Hierarchical Scheduling Framework), un modelo de sistema operativo con jerarquía de dos niveles, implementado en un sistema operativo en tiempo real de libre distribución llamado FreeRTOS, capaz de permitir el aislamiento temporal entre componentes. La principal contribución de este trabajo es la ampliación del HSF convirtiendolo en un sistema multimodo realizando los cambios mínimos necesarios sobre el sistema operativo FreeRTOS y la implementación ya existente del HSF. Esta implementación usa un sistema de planificación de prioridad fija para ambos niveles de jerarquía, ocupando el tiempo entre tareas con un “modo reposo”. Además el sistema es capaz de cambiar de un modo a otro en tiempo de ejecución. Cada subsistema y tarea son capaces de tener distintos atributos de tiempo (prioridad, periodo y tiempo de ejecución) en función del modo. Bajo una demanda de cambio de modo (Mode Change Request MCR) se puede variar el set de tareas en ejecución, así como los atributos de los servidores y las tareas. Un protocolo de cambio de modo espeficica precisamente cómo será cambiado el sistema de un modo a otro. Sin embargo una aplicación puede requerir no solo un cambio de modo, sino que lo haga de una forma especifica. Por ejemplo, el cambio de modo de “normal” a “apagado” puede permitir a las tareas en ejecución ser finalizadas antes de que se complete la transición, pero sin embargo el cambio de “normal” a “emergencia” puede requerir abortar todas las tareas instantaneamente. En este trabajo ambas características, tanto el modo como el protocolo de cambio, pueden ser cambiadas en tiempo de ejecución, pero deben ser previamente definidas por el desarrollador. Han sido definidos tres protocolos de cambios: el protocolo “suspender/continuar”, protocolo “abortar” y el protocolo “completar”. Estos protocolos incrementan la flexibilidad del sistema, permitiendo al usuario seleccionar de que forma quieren cambiar hacia el nuevo modo. La implementación del MMHSF ha sido testada y evaluada en una placa AVR EVK1100, con un micro-controlador AVR32UC3A0. Se ha comprobado el comportamiento de los distintos modos para los distintos protocolos, definidos previamente. Como resultado se proporcionan las medidades de rendimiento de los distintos protocolos de cambio de modo.

Personnel management and industrial relations,

"Formerly Personnel and labor relations."

Scientific and technical personnel in the Federal Government

Mode of access: Internet.

The Ghana National Service Scheme: Perceptions of former educational personnel, students and guardians

The purpose of this inquiry was to investigate the perceptions of former service personnel, students and their parents about the organizational effectiveness of the Ghana National Service Scheme (GNSS). The inquiry addressed the following questions: How do the participants perceive the effectiveness of the national service program on the Ghanaian society? What are the perceptions of school administrators who worked with service personnel, parents and students vis-à-vis the over all impact of the GNSS on the educational system? What are the perceptions of former service personnel, students and their parents in regard to the impact of the GNSS on them? ^ The GNSS is a part within the ministry of education, which is also part in the Ghanaian social structure. Hence, a systems theory approach which asks, “How and why a system as a whole functions as it does” (Patton, 1990), was utilized in the study. Methodologies included purposive sampling; interviews; participant observation, and follow-up interviews. The study was conducted over a six-moth period. ^ A cross-sectional survey design was used to generate data. The survey was followed up with an ethnographic study where in-depth, face-to-face interviews were conducted together with observations. The results were described and interpreted. ^ The summary of findings concludes that perceptional determinants of the effectiveness of the GNSS were biased by the age and zone of origin but not gender. This partially agrees with Marenin's (1990) except for gender. A significant difference was detected between the responses of those who were officials of the National service Secretariat and of former service personnel. The administrators defended the status quo and demonstrated their deeper knowledge about the scheme. The former personnel and parents freely criticized the program when necessary and did not seem to know much about the GNSS. Respondents mostly stressed the need for the secretariat to focus on the following areas: (1) involvement in the agricultural sector of the economy, (2) involvement in rural mass, civic and health education, (3) adequacy of remuneration and personnel welfare, and (4) ensuring posting of personnel to areas of their expertise. Recommendation for further research concluded the study. ^

Internal and external time conflicts in adolescents: sleep characteristics and interventions

Daytime fatigue and lack of sleep seem to increase throughout adolescent years. Several environmental, psychological, and biological factors have been associated with the development of sleep across adolescence. The aim of the present article is to summarize these factors and to give examples of various outcomes in sleep patterns among adolescents studied in different cultural settings. It is obvious from earlier work that many adolescents have displaced circadian rhythms and lack of adaptation to school hours due to an early school start or additional burdens for work. Several interventions have aimed to help the adaptation process by supporting sleep processes and changing scheduling, in this way promoting classroom alertness. In summary, adolescents worldwide shorten their sleep due to schoolwork hours and additional work, especially by disturbing their sleep due to circadian misalignment