Trends in the use of antidepressants among older adults: Bambuí Project

OBJECTIVE To analyze the trends and factors associated with the antidepressant use among older adults. METHODS This population-based study evaluated older adults in 1997 (n = 351, baseline) and the survivors at the 15th follow-up year (n = 462, in 2012) among the aging cohort of Bambuí. The prevalence of antidepressant use was estimated, and the most commonly used antidepressants each year were identified. Prevalence ratios with 95% confidence intervals were estimated using Poisson regression with robust variance to investigate differences in the prevalence of use between 1997 and 2012. RESULTS The overall consumption of antidepressants (PR = 2.87, 95%CI 1.94;4.25) and of selective serotonin reuptake inhibitors (PR = 7.50, 95%CI 3.74;15.02) was significantly higher in 2012. However, no significant difference was observed in the use of tricyclic antidepressants between the two cohorts (PR = 0.89, 95%CI 0.49;1.62). In the 2012 cohort, antidepressant use was associated with females, increased age, increased income (≥ 4 minimum wages), self-assessment of health as reasonable, and attending ≥ 5 medical consultations in the last 12 months. CONCLUSIONS The increased consumption of antidepressants in the period due to increased use of selective serotonin reuptake inhibitors was consistent with results observed in international studies of different population groups and contexts. The positive correlation observed between antidepressant use and family income may be a warning of possible inequalities in access to mental health services.

A hybrid genetic algorithm for the multi-mode resource-constrained project scheduling

A construction project is a group of discernible tasks or activities that are conduct-ed in a coordinated effort to accomplish one or more objectives. Construction projects re-quire varying levels of cost, time and other resources. To plan and schedule a construction project, activities must be defined sufficiently. The level of detail determines the number of activities contained within the project plan and schedule. So, finding feasible schedules which efficiently use scarce resources is a challenging task within project management. In this context, the well-known Resource Constrained Project Scheduling Problem (RCPSP) has been studied during the last decades. In the RCPSP the activities of a project have to be scheduled such that the makespan of the project is minimized. So, the technological precedence constraints have to be observed as well as limitations of the renewable resources required to accomplish the activities. Once started, an activity may not be interrupted. This problem has been extended to a more realistic model, the multi-mode resource con-strained project scheduling problem (MRCPSP), where each activity can be performed in one out of several modes. Each mode of an activity represents an alternative way of combining different levels of resource requirements with a related duration. Each renewable resource has a limited availability for the entire project such as manpower and machines. This paper presents a hybrid genetic algorithm for the multi-mode resource-constrained pro-ject scheduling problem, in which multiple execution modes are available for each of the ac-tivities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme. It is evaluated the quality of the schedules and presents detailed comparative computational re-sults for the MRCPSP, which reveal that this approach is a competitive algorithm.

A genetic algorithm for the resource constrained multi-project scheduling problem

This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.

A genetic algorithm for project scheduling with multi-modes and renewable resources

This paper presents a genetic algorithm-based approach for project scheduling with multi-modes and renewable resources. In this problem activities of the project may be executed in more than one operating mode and renewable resource constraints are imposed. The objective function is the minimization of the project completion time. The idea of this approach is integrating a genetic algorithm with a schedule generation scheme. This study also proposes applying a local search procedure trying to yield a better solution when the genetic algorithm and the schedule generation scheme obtain a solution. The experimental results show that this algorithm is an effective method for solving this problem.

Intra-hospital organ and tissue donation coordination project: cost-effectiveness and social benefits

OBJECTIVE To evaluate the viability of a professional specialist in intra-hospital committees of organ and tissue donation for transplantation. METHODS Epidemiological, retrospective and cross-sectional study (2003-2011 and 2008-2012), which was performed using organ donation for transplants data in the state of Sao Paulo, Southeastern Brazil. Nine hospitals were evaluated (hospitals 1 to 9). Logistic regression was used to evaluate the differences in the number of brain death referrals and actual donors (dependent variables) after the professional specialist started work (independent variable) at the intra-hospital committee of organ and tissue donation for transplantation. To evaluate the hospital invoicing, the hourly wage of the doctor and registered nurse, according to the legislation of the Consolidation of Labor Laws, were calculated, as were the investment return and the time elapsed to do so. RESULTS Following the nursing specialist commencement on the committee, brain death referrals and the number of actual donors increased at hospital 2 (4.17 and 1.52, respectively). At hospital 7, the number of actual donors also increased from 0.005 to 1.54. In addition, after the nurse started working, hospital revenues increased by 190.0% (ranging 40.0% to 1.955%). The monthly cost for the nurse working 20 hours was US$397.97 while the doctor would cost US$3,526.67. The return on investment was 275% over the short term (0.36 years). CONCLUSIONS This paper showed that including a professional specialist in intra-hospital committees for organ and tissue donation for transplantation proved to be cost-effective. Further economic research in the area could contribute to the efficient public policy implementation of this organ and tissue harvesting model.

Project scheduling under multiple resources constraints using a genetic algorithm

The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

Project scheduling using a competitive genetic algorithm

- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm

A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem

This paper presents a biased random-key genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are defined by the genetic algorithm. A forward-backward improvement procedure is applied to all solutions. The chromosomes supplied by the genetic algorithm are adjusted to reflect the solutions obtained by the improvement procedure. The heuristic is tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

A two-level genetic algorithm for the multi-mode resource-constrained project scheduling problem

This paper presents a genetic algorithm for the multimode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme by introducing an improvement procedure. It is evaluated the quality of the schedule and present detailed comparative computational results for the MRCPSP, which reveal that this approach is a competitive algorithm.

X Radiation dose implications in screening patients with ferromagnetic IOFBs prior to MRI: a literary review

Patients scheduled for a magnetic resonance imaging (MRI) scan sometimes require screening for ferromagnetic Intra Orbital Foreign Bodies (IOFBs). To assess this, they are required to fill out a screening protocol questionnaire before their scan. If it is established that a patient is at high risk, radiographic imaging is necessary. This review examines literature to evaluate which imaging modality should be used to screen for IOFBs, considering that the eye is highly sensitive to ionising radiation and any dose should be minimised. Method: Several websites and books were searched for information, these were as follows: PubMed, Science Direct, Web of Knowledge and Google Scholar. The terms searched related to IOFB, Ionising radiation, Magnetic Resonance Imaging Safety, Image Quality, Effective Dose, Orbits and X-ray. Thirty five articles were found, several were rejected due to age or irrelevance; twenty eight were eventually accepted. Results: There are several imaging techniques that can be used. Some articles investigated the use of ultrasound for investigation of ferromagnetic IOFBs of the eye and others discussed using Computed Tomography (CT) and X-ray. Some gaps in the literature were identified, mainly that there are no articles which discuss the lowest effective dose while having adequate image quality for orbital imaging. Conclusion: X-ray is the best method to identify IOFBs. The only problem is that there is no research which highlights exposure factors that maintain sufficient image quality for viewing IOFBs and keep the effective dose to the eye As Low As Reasonably Achievable (ALARA).

TRAILER project overview: tagging, recognition and acknowledgment of informal learning experiences

The evolution of new technology and its increasing use, have for some years been making the existence of informal learning more and more transparent, especially among young and older adults in both Higher Education and workplace contexts. However, the nature of formal and non-formal, course-based, approaches to learning has made it hard to accommodate these informal processes satisfactorily, and although technology bring us near to the solution, it has not yet achieved. TRAILER project aims to address this problem by developing a tool for the management of competences and skills acquired through informal learning experiences, both from the perspective of the user and the institution or company. This paper describes the research and development main lines of this project.

A random key based genetic algorithm for the resource constrained project scheduling problem

This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

Project, modelling and simulation of air stripping columns for the treatment of groundwater contaminated with volatile organic compounds

Volatile organic compounds are a common source of groundwater contamination that can be easily removed by air stripping in columns with random packing and using a counter-current flow between the phases. This work proposes a new methodology for the column design for any particular type of packing and contaminant avoiding the necessity of a pre-defined diameter used in the classical approach. It also renders unnecessary the employment of the graphical Eckert generalized correlation for pressure drop estimates. The hydraulic features are previously chosen as a project criterion and only afterwards the mass transfer phenomena are incorporated, in opposition to conventional approach. The design procedure was translated into a convenient algorithm using C++ as programming language. A column was built in order to test the models used either in the design or in the simulation of the column performance. The experiments were fulfilled using a solution of chloroform in distilled water. Another model was built to simulate the operational performance of the column, both in steady state and in transient conditions. It consists in a system of two partial non linear differential equations (distributed parameters). Nevertheless, when flows are steady, the system became linear, although there is not an evident solution in analytical terms. In steady state the resulting system of ODE can be solved, allowing for the calculation of the concentration profile in both phases inside the column. In transient state the system of PDE was numerically solved by finite differences, after a previous linearization.

Enhancing informal learning recognition through TRAILER project

International Workshop on solutions that Enhance Informal LEarning Recognition – WEILER 2013

Institutional factors governing the deployment of remote experiments: lessons from the rexnet project

Remote labs offer many unique advantages to students as they provide opportunities to access experiments and learning scenarios that would be otherwise unavailable. At the same time, however, these opportunities introduce real challenges to the institutions hosting the remote labs. This paper draws on the experiences of the REXNET project consortium to expose a number of these issues as a means of furthering the debate on the value of remote labs and the best practices in deploying them. The paper presents a brief outline of the various types of remote lab scenarios that might be deployed. It then describes the key human and technological actors that have an interest in or are intrinsic to a remote lab instance, with a description of the role of each actor and their interest. Some relationships between these various actors are then discussed with some factors that might influence those relationships. Finally some general issues are briefly described.