Efficient GPU-based parallelization of solvation calculation for the blind docking problem

The Journal of Supercomputing - Molecular docking techniques are widely used in computational drug discovery. Most of these techniques simulate the way that a ligand interacts with a protein target...     

Multifold behavior of the information transmission by the quantum 3-switch

Quantum Information Processing - A Correction to this paper has been published: https://doi.org/10.1007/s11128-019-2234-5     

Interactive sonification to assist children with autism during motor therapeutic interventions

Personal and Ubiquitous Computing - Interactive sonification is an effective tool used to guide individuals when practicing movements. Little research has shown the use of interactive sonification...     

Preference-based multi-objective evolutionary algorithms for power-aware application mapping on NoC platforms

Network-on-chip (NoC) are considered the next generation of communication infrastructure in embedded systems. In the platform-based design methodology, an application is implemented by a set of collaborative intellectual property (IP) blocks. The selection of the most suited set of IPs as well as their physical mapping onto the NoC infrastructure to implement efficiently the application at hand are two hard combinatorial problems that occur during the synthesis process of Noc-based embedded system implementation. In this paper, we propose an innovative preference-based multi-objective evolutionary methodology to perform the assignment and mapping stages. We use one of the well-known and efficient multi-objective evolutionary algorithms NSGA-II and microGA as a kernel. The optimization processes of assignment and mapping are both driven by the minimization of the required silicon area and imposed execution time of the application, considering that the decision maker’s preference is a pre-specified value of the overall power consumption of the implementation.     

A GPU framework for parallel segmentation of volumetric images using discrete deformable models

Despite the ability of current GPU processors to treat heavy parallel computation tasks, its use for solving medical image segmentation problems is still not fully exploited and remains challenging. A lot of difficulties may arise related to, for example, the different image modalities, noise and artifacts of source images, or the shape and appearance variability of the structures to segment. Motivated by practical problems of image segmentation in the medical field, we present in this paper a GPU framework based on explicit discrete deformable models, implemented over the NVidia CUDA architecture, aimed for the segmentation of volumetric images. The framework supports the segmentation in parallel of different volumetric structures as well as interaction during the segmentation process and real-time visualization of the intermediate results. Promising results in terms of accuracy and speed on a real segmentation experiment have demonstrated the usability of the system.     

Mimetic Discretizations of Elliptic Control Problems

We investigate the performance of the Mimetic Finite Difference (MFD) method for the approximation of a constraint optimal control problem governed by an elliptic operator. Low-order and high-order mimetic discretizations are considered and a priori error estimates are derived, in a suitable discrete norm, for both the control and the state variables. A wide class of numerical experiments performed on a set of examples selected from the literature assesses the robustness of the MFD method and confirms the convergence analysis.     

Sensorless fault tolerant control for induction motors

In this paper, a sensorless fault tolerant controller for induction motors is developed. In the proposed approach, a robust controller based on backstepping strategy is designed in order to compensate for both the load torque disturbance and the rotor resistance variation caused by the broken rotor bars faults. The proposed approach needs neither fault detection and isolation schemes nor controller re-design. Moreover, to avoid the use of speed and flux sensors, a second order sliding mode observer is introduced to estimate the flux and the speed. The observer converges in a finite time and leads to good estimates of the flux and the speed even in the presence of the rotor resistance variation and the load torque disturbance. Since the observer converges in the finite time, the stability of the closed-loop system (controller with observer) is shown in two steps. First, the boundedness of the closed-loop system trajectories before the convergence of the observer is proved. Second, the convergence of the closed-loop system trajectories is proved after the convergence of the observer. To highlight the efficiency and applicability of the proposed control scheme, simulation and experimental results are conducted for a 1.5 kW induction motor.     

Personalized video adaptation framework (PIAF): high-level semantic adaptation

Despite much work on Universal Multimedia Experience (UME), existing video adaptation approaches cannot yet be considered as truly user-centric, mostly due to their poor handling of semantic user preferences. Indeed, these works mainly concentrate on lower-level user preferences but do neither consider any fine-grained object-level adaptation nor evaluate different adaptation options based on predicted user expectations. Moreover, these works do not provide owners with property rights that enable them to place restrictions on the types of modifications to be made to the video content. To address these shortcomings, we propose the Personalized vIdeo Adaptation Framework (PIAF) for high-level semantic video adaptation. PIAF is a fully integrated framework providing all the requirements for a semantic video adaptation. It defines a video annotation model and a user profile model comprising semantic constraints that are delineated in a consistent way, based on the standards MPEG-7 and MPEG-21. At the heart of the framework, the Adaptation Decision Taking Engine (ADTE) computes utility values for different adaptation options, considering each shot separately. The corresponding utility function evaluates the possible choices by evaluating multiple parameters that capture different dimensions of a multimedia experience: amount of modified content, modifications to key objects and shots with respect to the semantic integrity of the original content, expected processing cost of the adaptation, and the anticipated visual and temporal quality of the adapted content. Furthermore, the ADTE can deal with intellectual property issues by selecting an adaptation plan of good quality that also satisfies constraints specified by the content owner. This paper places a significant emphasis on theoretical details of the utility function and the computation of the adaptation plan. It also presents the results and evaluation of the adaptation process both in simulation and user study.