Search results for "Cluster computing"

showing 10 items of 120 documents

"Table 4" of "Inclusive production of neutral vector mesons in hadronic Z decays"

1995

Average multiplicity per hadronic event. Extrapolation to the full X range.

E+ E- --> OMEGA XInclusiveHigh Energy Physics::LatticeE+ E- ScatteringHigh Energy Physics::ExperimentComputer Science::Symbolic Computation91.2Nuclear ExperimentComputer Science::Distributed Parallel and Cluster ComputingMULT
researchProduct

A state-space approach to mathematical modeling and parameters identification of vehicle frontal crash

2014

In this paper a state-space estimation procedure that relies on the time-domain analysis of input and output signals is used for mathematical modeling of vehicle frontal crash. The model is a double-spring–mass–damper system, whereby the front mass and real mass represent the chassis and the passenger compartment, respectively. It is observed that the dynamic crash of the model is closer to the dynamic crash from experimental when the mass of the chassis is greater than the mass of the passenger compartment. The dynamic crash depends on pole placement and the estimated parameters. It is noted that when the poles of the model are closer to zero, the dynamic crash of the model is far from the…

EngineeringControl and OptimizationChassisState-space representationbusiness.industryStiffnessCrashIdentification (information)Nonlinear Sciences::Adaptation and Self-Organizing SystemsArtificial IntelligenceControl and Systems EngineeringControl theoryFull state feedbackmedicineState spacemedicine.symptombusinessComputer Science::Distributed Parallel and Cluster ComputingSimulationSystems Science & Control Engineering
researchProduct

Experimental validation of a general model for three phase inverters operating in healthy and faulty modes

2012

The paper presents the experimental verification of a general mathematical model of Voltage Source Inverters (VSI) able to simulate fault conditions and which is also useful for the simulation of fault-tolerant systems for different applications. In general, in the past, the problem of faulty inverters modeling has been addressed specifically by considering faults on the different phases as separate cases. Furthermore, traditional models include only the faulty mode and not the healthy mode, so resulting then not able to predict transient phenomena. The model hereafter presented overcomes this drawback. It was formulated by introducing the concept of “healthy leg binary variables”. Such var…

EngineeringCorrectnessCircuit faults Fault tolerance Fault tolerant systems Integrated circuit modeling Inverters Mathematical model Vectorsbusiness.industryFault toleranceControl engineeringHardware_PERFORMANCEANDRELIABILITYSettore ING-IND/32 - Convertitori Macchine E Azionamenti ElettriciFault (power engineering)Fault indicatorStuck-at faultComputer Science::Hardware ArchitectureThree-phaseTransient (oscillation)Voltage sourcebusinessComputer Science::Operating SystemsComputer Science::Distributed Parallel and Cluster ComputingInternational Symposium on Power Electronics Power Electronics, Electrical Drives, Automation and Motion
researchProduct

Scars Collaborative Telediagnosis Platform Using Adaptive Image Flow

2013

International audience; Telemedicine has been developed to allow practitioners to remotely connect with patients and with other medical staff.We propose a new system (hardware and software), named DICODERM (COllaborative DIagnosis of DERMatosis), which makes it possible to monitor the evolution of scars after the excision of a tumorous dermatosis (like melanoma). The hardware part of this system is composed of a new optical innovative probe with which two types of images can be acquired simultaneously: anatomic with a white light image and functional with a fluorescence image (using autofluorescence from the protoporphyrin within the cancer cell). The software part is composed of two compon…

EngineeringMedical staff[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image Processing[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technology[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingTheoretical Computer ScienceImage stitchingSoftware[ INFO.INFO-DC ] Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC][INFO.INFO-TS]Computer Science [cs]/Signal and Image Processingcollaborative medical telediagnosisArtificial IntelligenceComponent (UML)stitching0202 electrical engineering electronic engineering information engineeringWhite light[INFO.INFO-IM]Computer Science [cs]/Medical Imaging[INFO.INFO-DC] Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Computer visionLayer (object-oriented design)Adaptation (computer science)[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processingscar monitoringImage flow[ INFO.INFO-IM ] Computer Science [cs]/Medical Imagingbusiness.industry020206 networking & telecommunications3. Good healthComputer Science ApplicationsAdaptabilityComputational Theory and Mathematics020201 artificial intelligence & image processingArtificial intelligencetelemedicine[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]business[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingSoftware
researchProduct

Development and validation of a nonlinear dynamic impact model for a notch impact

2015

Finite element simulations are being more and more applied when studying the crash-worthiness of vehicles during impact. This paper deals with setting up such a simulation and discusses several ways to simplify and verify a simulated crash. For this purpose, a notch impact-testing machine will be released from a certain angle and crash into a model constructed with three different wall thicknesses. The plastic and elastic deformation is measured in the front of the model and is then used for validation of the simulation. In the end, the simulation was found to be in good agreement with the real crash data.

Engineeringbusiness.industryMechanical EngineeringMechanical engineeringCrashDissipationIndustrial and Manufacturing EngineeringFinite element methodComputer Science ApplicationsDynamic simulationNonlinear systemControl and Systems EngineeringImpact modelDevelopment (differential geometry)Crash databusinessComputer Science::Distributed Parallel and Cluster ComputingSoftwareThe International Journal of Advanced Manufacturing Technology
researchProduct

Scheduling on Two Types of Resources: a Survey

2020

International audience; We study the problem of executing an application represented by a precedence task graph on a parallel machine composed of standard computing cores and accelerators. Contrary to most existing approaches, we distinguish the allocation and the scheduling phases and we mainly focus on the allocation part of the problem: choose the most appropriate type of computing unit for each task. We address both off-line and on-line settings and design generic scheduling approaches. In the first case, we establish strong lower bounds on the worst-case performance of a known approach based on Linear Programming for solving the allocation problem. Then, we refine the scheduling phase …

FOS: Computer and information sciences020203 distributed computingScheduleGeneral Computer ScienceComputer scienceDistributed computingmedia_common.quotation_subject0102 computer and information sciences02 engineering and technology01 natural sciencesTheoretical Computer ScienceScheduling (computing)Computer Science - Distributed Parallel and Cluster Computing010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringQuality (business)Distributed Parallel and Cluster Computing (cs.DC)[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Implementationmedia_common
researchProduct

AnySeq: A High Performance Sequence Alignment Library based on Partial Evaluation

2020

Sequence alignments are fundamental to bioinformatics which has resulted in a variety of optimized implementations. Unfortunately, the vast majority of them are hand-tuned and specific to certain architectures and execution models. This not only makes them challenging to understand and extend, but also difficult to port to other platforms. We present AnySeq - a novel library for computing different types of pairwise alignments of DNA sequences. Our approach combines high performance with an intuitively understandable implementation, which is achieved through the concept of partial evaluation. Using the AnyDSL compiler framework, AnySeq enables the compilation of algorithmic variants that ar…

FOS: Computer and information sciences0301 basic medicineScheme (programming language)Computer Science - PerformanceComputer science0206 medical engineeringSequence alignment02 engineering and technologyParallel computingcomputer.software_genreMetaprogrammingDNA sequencingPartial evaluationPerformance (cs.PF)03 medical and health sciences030104 developmental biologyComputer Science - Distributed Parallel and Cluster ComputingFunction composition (computer science)MultithreadingDistributed Parallel and Cluster Computing (cs.DC)Compilercomputer020602 bioinformaticscomputer.programming_languageCodebase
researchProduct

Finding optimal finite biological sequences over finite alphabets: the OptiFin toolbox

2017

International audience; In this paper, we present a toolbox for a specific optimization problem that frequently arises in bioinformatics or genomics. In this specific optimisation problem, the state space is a set of words of specified length over a finite alphabet. To each word is associated a score. The overall objective is to find the words which have the lowest possible score. This type of general optimization problem is encountered in e.g 3D conformation optimisation for protein structure prediction, or largest core genes subset discovery based on best supported phylogenetic tree for a set of species. In order to solve this problem, we propose a toolbox that can be easily launched usin…

FOS: Computer and information sciences0301 basic medicineTheoretical computer scienceOptimization problemComputer Science - Artificial IntelligenceComputer science[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]Quantitative Biology - Quantitative MethodsSet (abstract data type)[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing03 medical and health sciences[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]State spaceMetaheuristicQuantitative Methods (q-bio.QM)Protein structure prediction[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationToolboxCore (game theory)Artificial Intelligence (cs.AI)030104 developmental biology[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]FOS: Biological sciences[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Word (computer architecture)
researchProduct

A Big Data Approach for Sequences Indexing on the Cloud via Burrows Wheeler Transform

2020

Indexing sequence data is important in the context of Precision Medicine, where large amounts of ``omics'' data have to be daily collected and analyzed in order to categorize patients and identify the most effective therapies. Here we propose an algorithm for the computation of Burrows Wheeler transform relying on Big Data technologies, i.e., Apache Spark and Hadoop. Our approach is the first that distributes the index computation and not only the input dataset, allowing to fully benefit of the available cloud resources.

FOS: Computer and information sciencesArtificial Intelligence (cs.AI)Computer Science - Distributed Parallel and Cluster ComputingComputer Science - Artificial IntelligenceComputer Science - Data Structures and AlgorithmsData_FILESData Structures and Algorithms (cs.DS)Distributed Parallel and Cluster Computing (cs.DC)
researchProduct

Parallel In-Memory Evaluation of Spatial Joins

2019

The spatial join is a popular operation in spatial database systems and its evaluation is a well-studied problem. As main memories become bigger and faster and commodity hardware supports parallel processing, there is a need to revamp classic join algorithms which have been designed for I/O-bound processing. In view of this, we study the in-memory and parallel evaluation of spatial joins, by re-designing a classic partitioning-based algorithm to consider alternative approaches for space partitioning. Our study shows that, compared to a straightforward implementation of the algorithm, our tuning can improve performance significantly. We also show how to select appropriate partitioning parame…

FOS: Computer and information sciencesComputer Science - DatabasesComputer Science - Distributed Parallel and Cluster ComputingParallel processing (DSP implementation)Computer scienceOrder (business)JoinsJoin (sigma algebra)Databases (cs.DB)Parallel computingDistributed Parallel and Cluster Computing (cs.DC)Computer Science::Databases
researchProduct