Parenteral anticoagulants in heart disease: Current status and perspectives (Section II). Position Paper of the ESC Working Group on Thrombosis - Task Force on Anticoagulants in Heart Disease.

Anticoagulants are a mainstay of cardiovascular therapy, and parenteral anticoagulants have widespread use in cardiology, especially in acute situations. Parenteral anticoagulants include unfractionated heparin, low-molecular-weight heparins, the synthetic pentasaccharides fondaparinux, idraparinux and idrabiotaparinux, and parenteral direct thrombin inhibitors. The several shortcomings of unfractionated heparin and of low-molecular-weight heparins have prompted the development of the other newer agents. Here we review the mechanisms of action, pharmacological properties and side effects of parenteral anticoagulants used in the management of coronary heart disease treated with or without percutaneous coronary interventions, cardioversion for atrial fibrillation, and prosthetic heart valves and valve repair. Using an evidence-based approach, we describe the results of completed clinical trials, highlight ongoing research with currently available agents, and recommend therapeutic options for specific heart diseases.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Septal lesions impair the acquisition of a cued place navigation task: attentional or memory deficit?

These experiments were designed to analyze how medial septal lesions reducing the cholinergic innervation in the hippocampus might affect place learning. Rats with quisqualic lesions of the medial septal area (MS) were trained in a water maze and on a homing table where the escape position was located at a spatially fixed position and further indicated by a salient cue suspended above it. The lesioned rats were significantly impaired in reaching the cued escape platform during training. In addition rats, did not show any discrimination of the training sector during a probe trial in which no platform or cue was present. This impairment remained significant during further training in the absence of the cue. When the cued escape platform was located at an unpredictable spatial location, the MS-lesioned rats showed no deficit and spent more time under the cue than control rats during the probe trial. On the homing board, with a salient object in close proximity to the escape hole, the MS rats showed no deficit in escape latencies, although a significant reduction in spatial memory was observed. However, this was overcome by additional training in the absence of the cue. Under these conditions, rats with septal lesions were prone to develop a pure guidance strategy, whereas normal rats combined a guidance strategy with a memory of the escape position relative to more distant landmarks. The presence of a salient cue appeared to decrease attention to environmental landmarks, thus reducing spatial memory. These data confirm the general hypothesis that MS lesions reduce the capacity to rely on a representation of the relation between several landmarks with different salience.

A Multi-Project Scheduling Procedure for Transportation Projects, Final Report, HR-339, 1993

This report proposes, that for certain types of highway construction projects undertaken by the Iowa Department of Transportation, a scheduling technique commonly referred to as linear scheduling may be more effective than the Critical Path Method scheduling technique that is currently being used. The types of projects that appear to be good candidates for the technique are those projects that have a strong linear orientation. Like a bar chart, this technique shows when an activity is scheduled to occur and like a CPM schedule it shows the sequence in which activities are expected to occur. During the 1992 construction season, the authors worked with an inlay project on Interstate 29 to demonstrate the linear scheduling technique to the Construction Office. The as-planned schedule was developed from the CPM schedule that the contractor had developed for the project. Therefore, this schedule represents what a linear representation of a CPM schedule would look like, and not necessarily what a true linear schedule would look like if it had been the only scheduling technique applied to the project. There is a need to expand the current repertoire of scheduling techniques to address those projects for which the bar chart and CPM may not be appropriate either because of the lack of control information or due to overly complex process for the actual project characteristics. The scheduling approaches used today on transportation projects have many shortcomings for properly modeling the real world constraints and conditions which are encountered. Linear project's predilection for activities with variable production rates, a concept very difficult to handle with the CPM, is easily handled and visualized with the linear technique. It is recommended that work proceed with the refinement of the method of linear scheduling described above and the development of a microcomputer based system for use by the Iowa Department of Transportation and contractors for its implementation. The system will be designed to provide the information needed to adjust schedules in a rational understandable method for monitoring progress on the projects and alerting Iowa Department of Transportation personnel when the contractor is deviating from the plan.

Local optima networks of hard combinatorial landscapes

Combinatorial optimization involves finding an optimal solution in a finite set of options; many everyday life problems are of this kind. However, the number of options grows exponentially with the size of the problem, such that an exhaustive search for the best solution is practically infeasible beyond a certain problem size. When efficient algorithms are not available, a practical approach to obtain an approximate solution to the problem at hand, is to start with an educated guess and gradually refine it until we have a good-enough solution. Roughly speaking, this is how local search heuristics work. These stochastic algorithms navigate the problem search space by iteratively turning the current solution into new candidate solutions, guiding the search towards better solutions. The search performance, therefore, depends on structural aspects of the search space, which in turn depend on the move operator being used to modify solutions. A common way to characterize the search space of a problem is through the study of its fitness landscape, a mathematical object comprising the space of all possible solutions, their value with respect to the optimization objective, and a relationship of neighborhood defined by the move operator. The landscape metaphor is used to explain the search dynamics as a sort of potential function. The concept is indeed similar to that of potential energy surfaces in physical chemistry. Borrowing ideas from that field, we propose to extend to combinatorial landscapes the notion of the inherent network formed by energy minima in energy landscapes. In our case, energy minima are the local optima of the combinatorial problem, and we explore several definitions for the network edges. At first, we perform an exhaustive sampling of local optima basins of attraction, and define weighted transitions between basins by accounting for all the possible ways of crossing the basins frontier via one random move. Then, we reduce the computational burden by only counting the chances of escaping a given basin via random kick moves that start at the local optimum. Finally, we approximate network edges from the search trajectory of simple search heuristics, mining the frequency and inter-arrival time with which the heuristic visits local optima. Through these methodologies, we build a weighted directed graph that provides a synthetic view of the whole landscape, and that we can characterize using the tools of complex networks science. We argue that the network characterization can advance our understanding of the structural and dynamical properties of hard combinatorial landscapes. We apply our approach to prototypical problems such as the Quadratic Assignment Problem, the NK model of rugged landscapes, and the Permutation Flow-shop Scheduling Problem. We show that some network metrics can differentiate problem classes, correlate with problem non-linearity, and predict problem hardness as measured from the performances of trajectory-based local search heuristics.

Quality of Learners' Time and Learning Performance Beyond Quantitative Time-on-Task

Peer-reviewed

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

Peer-reviewed

A Petri Nets-based Scheduling Methodology forMultipurpose Batch Plants.

This article presents an optimization methodology of batch production processes assembled by shared resources which rely on a mapping of state-events into time-events allowing in this way the straightforward use of a well consolidated scheduling policies developed for manufacturing systems. A technique to generate the timed Petri net representation from a continuous dynamic representation (Differential-Algebraic Equations systems (DAEs)) of the production system is presented together with the main characteristics of a Petri nets-based tool implemented for optimization purposes. This paper describes also how the implemented tool generates the coverability tree and how it can be pruned by a general purpose heuristic. An example of a distillation process with two shared batch resources is used to illustrate the optimization methodology proposed.

Scheduling forest road maintenance using the analytic hierarchy process and heuristics

Abstract

Production scheduling tools' evaluation in a global telecommunications and electronics company

Tutkimuksen päätavoite on arvioida, ovatko neljä ohjelmistovaihtoehtoa riittäviä tuotannon aikataulutuksen työkaluja ja mikä työkaluista sopii toimeksiantajayritykselle. Alatavoitteena on kuvata tuotannon aikataulutuksen nyky- ja tahtotila prosessimallinnuksen avulla, selvittää työkalun käyttäjätarpeet ja määritellä priorisoidut valintakriteerit työkalulle.Tutkimuksen teoriaosuudessa tutkitaan tuotannon aikataulutuksen logiikkaa ja haasteita. Työssä tarkastellaan aikataulutusohjelmiston valintaa rinnakkain prosessinmallinnuksen kanssa. Aikataulutusohjelmistovaihtoehdot ja metodit käyttäjätarpeiden selvittämiseksi käydään läpi. Empiriaosuudessa selvitetään tutkimuksen suhde toimeksiantajayrityksen strategiaan. Käyttäjätarpeet selvitetään haastattelujen avulla jaanalysoidaan QFD matriisin avulla. Toimeksiantajayrityksen tuotannon aikataulutuksen nyky- ja tahtotilaprosessit mallinnetaan, jotta ohjelmistojen sopivuutta, aikataulutusprosessia tukevana työkaluna voidaan arvioida.Tutkimustuloksena ovatpriorisoidut valintakriteerit aikataulutustyökalulle eli käyttäjätarpeista johdetut tärkeimmät toiminnalliset ominaisuudet, järjestelmätoimittaja-arvio sekä suositukset jatkotoimenpiteistä ja lisätutkimuksesta.

Therapeutisches Drug-Monitoring in der Psychiatrie : Kurze Zusammenfassung des neuen Konsensuspapiers der Arbeitsgruppe TDM der AGNP [Therapeutic drug monitoring in psychiatry : A brief summary of the new consensus paper by the task force on TDM of the AGNP].

In October 2011 the Task Force Therapeutic Drug Monitoring of the Association for Neuropsychopharmacology and Pharmacopsychiatry (AGNP) published an update (Pharmacopsychiatry 2011, 44: 195-235) of the first version of the consensus paper on therapeutic drug monitoring (TDM) published in 2004. This article summarizes the essential statements to make them accessible to a wider readership in German speaking countries.