Search results for "Parallel"

IntentStreams

2015

The user's understanding of information needs and the information available in the data collection can evolve during an exploratory search session. Search systems tailored for well-defined narrow search tasks may be suboptimal for exploratory search where the user can sequentially refine the expressions of her information needs and explore alternative search directions. A major challenge for exploratory search systems design is how to support such behavior and expose the user to relevant yet novel information that can be difficult to discover by using conventional query formulation techniques. We introduce IntentStreams, a system for exploratory search that provides interactive query refine…

Concurrent Molecular Dynamics Simulation of ST2 Water on a Transputer Array

1988

Abstract A concurrent implementation of a Molecular Dynamics program for ST2 water molecules is presented, which exploits the great potentialities of the Transputer arrays for statistical mechanical calculations. High load-balance efficiency is obtained using a new task decomposition algorithm which evenly distributes particles and interaction calculations among the processors. This approach can also help to solve efficiently the more general problem of task distribution in parallel computing of symmetric pairwise system properties.

Application based on dynamic reconfiguration of field-programmable gate arrays: JPEG 2000 arithmetic decoder

2005

This paper describes the implementation of a part of the JPEG 2000 algorithm (MQ decoder and arithmetic decoder) on a field-programmable gate array (FPGA) board by using dynamic reconfiguration. A comparison between static and dynamic reconfiguration is presented, and new analysis criteria (spatiotemporal efficiency, logic cost, and performance time) have been defined. The MQ decoder and arithmetic decoder are attractive for dynamic reconfiguration implementation in applications without parallel processing. This implementation is done on an architecture designed to study the dynamic reconfiguration of FPGAs: the ARDOISE architecture. The obtained implementation, based on four partial config…

Optimizing PolyACO Training with GPU-Based Parallelization

2016

A central part of Ant Colony Optimisation (ACO) is the function calculating the quality and cost of solutions, such as the distance of a potential ant route. This cost function is used to deposit an opportune amount of pheromones to achieve an apt convergence, and in an active ACO implementation a significant part of the runtime is spent in this part of the code. In some cases, the cost function accumulates up towards 94 % in its run time making it a performance bottle neck.

Optimised assembly mode reconfiguration of the 5-DOF Gantry-Tau using mixed-integer programming

2010

Pulished version of an article in the journal: Meccanica. Also available from the publisher at: http://dx.doi.org/10.1007/s11012-010-9404-y This paper presents a systematic approach based on Mixed Integer Linear Programming for finding an optimal singularity-free reconfiguration path of the 5-DOF Gantry-Tau parallel kinematic machine. The results in the paper demonstrate that singularity-free reconfiguration (change of assembly mode) of the machine is possible, which significantly increases the usable workspace. The method has been applied to a full-scale prototype and the singularity-free path has been verified both in simulations and with physical experiments using real-time control of th…

CLUSTER MONTE CARLO ALGORITHMS IN STATISTICAL MECHANICS

1992

The cluster Monte Carlo method, where variables are updated in groups, is very efficient at second order phase transitions. Much better results can be obtained with less computer time. This article reviews the method of Swendsen and Wang and some of its applications.

Constant Time Garbage Collection in SSDs

2021

Localization Based on Parallel Robots Kinematics as an Alternative to Trilateration

2022

In this article, a new scheme for range-based localization is proposed. The main goal is to estimate the position of a mobile point based on distance measurements from fixed devices, called anchors, and on inertial measurements. Due to the nonlinear nature of the problem, an analytic relation to compute the position starting from these measurements does not exist, and often trilateration methods are used, generally based on least-square algorithms. The proposed scheme is based on the modeling of the localization process as a parallel robot, thereby methodologies and control algorithms used in the robotic area can be exploited. In particular, a closed-loop control system is designed for trac…

An Optimization Device for Series Parallel Connected PV Plants

2017

In this paper it is presented a testing prototype of a reconfiguration system for photovoltaic (PV) plants. The system enables to increase the total energy output by reducing the electrical mismatch between the PV array modules. The architecture of the implemented switching matrix, performing the dynamic electrical interconnections of the PV panels, enables to reconfigure nine solar modules in a series-parallel (SP) configuration. The contribution is organized as follows. A brief state of the art is first presented, followed by a comparison between the SP and Total-Cross-Tied (TCT) connections. The prototype then is thoroughly described as well as the main design choices. Finally some tests…

Efficient anomaly detection on sampled data streams with contaminated phase I data

2020

International audience; Control chart algorithms aim to monitor a process over time. This process consists of two phases. Phase I, also called the learning phase, estimates the normal process parameters, then in Phase II, anomalies are detected. However, the learning phase itself can contain contaminated data such as outliers. If left undetected, they can jeopardize the accuracy of the whole chart by affecting the computed parameters, which leads to faulty classifications and defective data analysis results. This problem becomes more severe when the analysis is done on a sample of the data rather than the whole data. To avoid such a situation, Phase I quality must be guaranteed. The purpose…