946 resultados para Parallel design multicenter
Resumo:
Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal
Resumo:
This paper presents the research and development of a 3-legged micro Parallel Kinematic Manipulator (PKM) for positioning in micro-machining and assembly operations. The structural characteristics associated with parallel manipulators are evaluated and the PKMs with translational and rotational movements are identified. Based on these identifications, a hybrid 3-UPU (Universal Joint-Prismatic Joint-Universal Joint) parallel manipulator is designed and fabricated. The principles of the operation and modeling of this micro PKM is largely similar to a normal size Stewart Platform (SP). A modular design methodology is introduced for the construction of this micro PKM. Calibration results of this hybrid 3-UPU PKM are discussed in this paper.
Resumo:
We propose a bridge between two important parallel programming paradigms: data parallelism and communicating sequential processes (CSP). Data parallel pipelined architectures obtained with the Alpha language can be embedded in a control intensive application expressed in CSP-based Handel formalism. The interface is formally defined from the semantics of the languages Alpha and Handel. This work will ease the design of compute intensive applications on FPGAs.
Resumo:
This paper is concerned with the uniformization of a system of afine recurrence equations. This transformation is used in the design (or compilation) of highly parallel embedded systems (VLSI systolic arrays, signal processing filters, etc.). In this paper, we present and implement an automatic system to achieve uniformization of systems of afine recurrence equations. We unify the results from many earlier papers, develop some theoretical extensions, and then propose effective uniformization algorithms. Our results can be used in any high level synthesis tool based on polyhedral representation of nested loop computations.
Resumo:
This work shows the design, simulation, and analysis of two optical interconnection networks for a Dataflow parallel computer architecture. To verify the optical interconnection network performance on the Dataflow architecture, we have analyzed the load balancing among the processors during the parallel programs executions. The load balancing is a very important parameter because it is directly associated to the dataflow parallelism degree. This article proves that optical interconnection networks designed with simple optical devices can provide efficiently the dataflow requirements of a high performance communication system.
Resumo:
Background Current recommendations for antithrombotic therapy after drug-eluting stent (DES) implantation include prolonged dual antiplatelet therapy (DAPT) with aspirin and clopidogrel >= 12 months. However, the impact of such a regimen for all patients receiving any DES system remains unclear based on scientific evidence available to date. Also, several other shortcomings have been identified with prolonged DAPT, including bleeding complications, compliance, and cost. The second-generation Endeavor zotarolimus-eluting stent (E-ZES) has demonstrated efficacy and safety, despite short duration DAPT (3 months) in the majority of studies. Still, the safety and clinical impact of short-term DAPT with E-ZES in the real world is yet to be determined. Methods The OPTIMIZE trial is a large, prospective, multicenter, randomized (1: 1) non-inferiority clinical evaluation of short-term (3 months) vs long-term (12-months) DAPT in patients undergoing E-ZES implantation in daily clinical practice. Overall, 3,120 patients were enrolled at 33 clinical sites in Brazil. The primary composite endpoint is death (any cause), myocardial infarction, cerebral vascular accident, and major bleeding at 12-month clinical follow-up post-index procedure. Conclusions The OPTIMIZE clinical trial will determine the clinical implications of DAPT duration with the second generation E-ZES in real-world patients undergoing percutaneous coronary intervention. (Am Heart J 2012;164:810-816.e3.)
Resumo:
Recent studies report that intracoronary administration of autologous bone marrow mononucleated cells (BM-MNCs) may improve remodeling of the left ventricle after acute myocardial infarction (AMI). Subgroup analysis suggest that early treatment between days 4 and 7 after AMI is probably most effective; however, the optimal time point of intracoronary cell administration has never been addressed in clinical trials. Furthermore, reliable clinical predictors are lacking for identifying patients who are thought to have most benefit from cellular therapy.
Resumo:
A genomic biomarker identifying patients likely to benefit from drotrecogin alfa (activated) (DAA) may be clinically useful as a companion diagnostic. This trial was designed to validate biomarkers (improved response polymorphisms (IRPs)). Each IRP (A and B) contains two single nucleotide polymorphisms that were associated with a differential DAA treatment effect.
Resumo:
BACKGROUND: Chronic idiopathic urticaria (CIU) is defined by the almost daily presence of urticaria for at least 6 weeks without an identifiable cause. Symptoms include short-lived wheals, itching, and erythema. CIU impedes significantly a patient's quality of life (QoL). Levocetirizine is an antihistamine from the latest generation approved for CIU. AIM: To investigate the efficacy of levocetirizine, 5 mg, and placebo for the symptoms and signs of CIU, as well as for the QoL and productivity. METHODS: The primary criteria of evaluation were the pruritus severity scores over 1 week of treatment and over 4 weeks. The QoL was assessed via the Dermatology Life Quality Index (DLQI). RESULTS: Baseline pruritus severity scores were comparable in the two treatment groups (2.06+/-0.58). After 1 week, levocetirizine was superior to placebo and demonstrated a considerable efficacy (difference=0.78, P<0.001). This efficacy was maintained over the entire study period (4 weeks, P<0.001). The number and size of wheals were considerably reduced compared with placebo over 1 week and over the total treatment period (P
Resumo:
In the field of thrombosis and haemostasis, many preanalytical variables influence the results of coagulation assays and measures to limit potential results variations should be taken. To our knowledge, no paper describing the development and maintenance of a haemostasis biobank has been previously published. Our description of the biobank of the Swiss cohort of elderly patients with venous thromboembolism (SWITCO65+) is intended to facilitate the set-up of other biobanks in the field of thrombosis and haemostasis. SWITCO65+ is a multicentre cohort that prospectively enrolled consecutive patients aged ≥65 years with venous thromboembolism at nine Swiss hospitals from 09/2009 to 03/2012. Patients will be followed up until December 2013. The cohort includes a biobank with biological material from each participant taken at baseline and after 12 months of follow-up. Whole blood from all participants is assayed with a standard haematology panel, for which fresh samples are required. Two buffy coat vials, one PAXgene Blood RNA System tube and one EDTA-whole blood sample are also collected at baseline for RNA/DNA extraction. Blood samples are processed and vialed within 1 h of collection and transported in batches to a central laboratory where they are stored in ultra-low temperature archives. All analyses of the same type are performed in the same laboratory in batches. Using multiple core laboratories increased the speed of sample analyses and reduced storage time. After recruiting, processing and analyzing the blood of more than 1,000 patients, we determined that the adopted methods and technologies were fit-for-purpose and robust.
Resumo:
BACKGROUND: Depressive disorders are among the leading causes of worldwide disability with mild to moderate forms of depression being particularly common. Low-intensity treatments such as online psychological treatments may be an effective way to treat mild to moderate depressive symptoms and prevent the emergence or relapse of major depression. METHODS/DESIGN: This study is a currently recruiting multicentre parallel-groups pragmatic randomized-controlled single-blind trial. A total of 1000 participants with mild to moderate symptoms of depression from various settings including in- and outpatient services will be randomized to an online psychological treatment or care as usual (CAU). We hypothesize that the intervention will be superior to CAU in reducing depressive symptoms assessed with the Personal Health Questionnaire (PHQ-9, primary outcome measure) following the intervention (12 wks) and at follow-up (24 and 48 wks). Further outcome parameters include quality of life, use of health care resources and attitude towards online psychological treatments. DISCUSSION: The study will yield meaningful answers to the question of whether online psychological treatment can contribute to the effective and efficient prevention and treatment of mild to moderate depression on a population level with a low barrier to entry. TRIAL REGISTRATION: Trial Registration Number: NCT01636752.
Resumo:
We informally discuss several issues related to the parallel execution of logic programming systems and concurrent logic programming systems, and their generalization to constraint programming. We propose a new view of these systems, based on a particular definition of parallelism. We argüe that, under this view, a large number of the actual systems and models can be explained through the application, at different levéis of granularity, of only a few basic principies: determinism, non-failure, independence (also referred to as stability), granularity, etc. Also, and based on the convergence of concepts that this view brings, we sketch a model for the implementation of several parallel constraint logic programming source languages and models based on a common, generic abstract machine and an intermedíate kernel language.
Resumo:
We informally discuss several issues related to the parallel execution of logic programming systems and concurrent logic programming systems, and their generalization to constraint programming. We propose a new view of these systems, based on a particular definition of parallelism. We argüe that, under this view, a large number of the actual systems and models can be explained through the application, at different levéis of granularity, of only a few basic principies: determinism, non-failure, independence (also referred to as stability), granularity, etc. Also, and based on the convergence of concepts that this view brings, we sketch a model for the implementation of several parallel constraint logic programming source languages and models based on a common, generic abstract machine and an intermedíate kernel language.
Resumo:
The term "Logic Programming" refers to a variety of computer languages and execution models which are based on the traditional concept of Symbolic Logic. The expressive power of these languages offers promise to be of great assistance in facing the programming challenges of present and future symbolic processing applications in Artificial Intelligence, Knowledge-based systems, and many other areas of computing. The sequential execution speed of logic programs has been greatly improved since the advent of the first interpreters. However, higher inference speeds are still required in order to meet the demands of applications such as those contemplated for next generation computer systems. The execution of logic programs in parallel is currently considered a promising strategy for attaining such inference speeds. Logic Programming in turn appears as a suitable programming paradigm for parallel architectures because of the many opportunities for parallel execution present in the implementation of logic programs. This dissertation presents an efficient parallel execution model for logic programs. The model is described from the source language level down to an "Abstract Machine" level suitable for direct implementation on existing parallel systems or for the design of special purpose parallel architectures. Few assumptions are made at the source language level and therefore the techniques developed and the general Abstract Machine design are applicable to a variety of logic (and also functional) languages. These techniques offer efficient solutions to several areas of parallel Logic Programming implementation previously considered problematic or a source of considerable overhead, such as the detection and handling of variable binding conflicts in AND-Parallelism, the specification of control and management of the execution tree, the treatment of distributed backtracking, and goal scheduling and memory management issues, etc. A parallel Abstract Machine design is offered, specifying data areas, operation, and a suitable instruction set. This design is based on extending to a parallel environment the techniques introduced by the Warren Abstract Machine, which have already made very fast and space efficient sequential systems a reality. Therefore, the model herein presented is capable of retaining sequential execution speed similar to that of high performance sequential systems, while extracting additional gains in speed by efficiently implementing parallel execution. These claims are supported by simulations of the Abstract Machine on sample programs.