Search results for "hardware"
showing 10 items of 1372 documents
Aesthetic considerations for the min-max K-Windy Rural Postman Problem
2017
[EN] The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal of a proposed set of routes can have a strong influence on the willingness of a client to accept or reject a specific routing plan. While some work has analyzed algorithmic performance relative to traditional min-sum or min-max objective functions and aesthetic objective functions, we are not aware of any work that has considered a multi-objective approach. This work considers a multi-objective variant of the Min-Max K-Vehicles Windy Rural Postman Problem, discusses sever…
Terrorism in the Website
2020
Without any doubt, terrorism causes higher levels of anxiety and very well enhances our fears as never before. The post 9/11 context witnesses the multiplication of xenophobic expressions, such as Islamophobia or tourist-phobia, only to name a few. These expressions result from a culture of intolerance, which not only was enrooted in the ideological core of western capitalism but was accelerated just after 9/11. Some voices emphasize the needs of employing technology to make this world a safer place. This chapter goes in a contradictory direction. The authors focus on the ethical limitations of technologies when they are subordinated to the ideals of zero-risk society. Echoing Sunstein and …
Revealing community structures by ensemble clustering using group diffusion
2018
We propose an ensemble clustering approach using group diffusion to reveal community structures in data. We represent data points as a directed graph and assume each data point belong to single cluster membership instead of multiple memberships. The method is based on the concept of ensemble group diffusion with a parameter to represent diffusion depth in clustering. The ability to modulate the diffusion-depth parameter by varying it within a certain interval allows for more accurate construction of clusters. Depending on the value of the diffusion-depth parameter, the presented approach can determine very well both local clusters and global structure of data. At the same time, the ability …
Parallel Pairwise Epistasis Detection on Heterogeneous Computing Architectures
2016
This is a post-peer-review, pre-copyedit version of an article published in IEEE Transactions on Parallel and Distributed Systems. The final authenticated version is available online at: http://dx.doi.org/10.1109/TPDS.2015.2460247. [Abstract] Development of new methods to detect pairwise epistasis, such as SNP-SNP interactions, in Genome-Wide Association Studies is an important task in bioinformatics as they can help to explain genetic influences on diseases. As these studies are time consuming operations, some tools exploit the characteristics of different hardware accelerators (such as GPUs and Xeon Phi coprocessors) to reduce the runtime. Nevertheless, all these approaches are not able t…
Portable remote photoplethysmography device for monitoring of blood volume changes with high temporal resolution
2016
The compact remote photoplethysmography device for monitoring of blood volume pulsations from human skin were developed. The prototype device comprises electronics board with twelve circullary oriented bright near-infrared LED illuminators, which are precisely controlled, high-speed video camera and battery charging circuit. Device was tested in laboratory and could be used for non-contact monitoring of human blood volume changes in palm.
Transportation Assessment in Simulated Curved Canals after preparation with Twisted File Adaptive and BT-Race instruments.
2017
BACKGROUND This study compared the incidence of deviation along curved canals after preparation with two nickel-titanium (NiTi) rotary systems, Twisted File Adaptive and BT-RaCe. MATERIAL AND METHODS Forty resin training blocks with curved canals were filled with ink and divided into two groups according to the instrumentation technique. Preinstrumentation images were acquired by using a stereomicroscope. The canals were up to an instrument #35/0.04. Postinstrumentation images were captured using the same conditions, and the images were superimposed. The amount of resin removed was measured at 8 different points, beginning at the apical terminus of the canal. Differences in the mesial and d…
Demo
2017
We present an innovative smartphone-centric tracking system for indoor and outdoor environments, based on the joint utilization of dead-reckoning and computer vision (CV) techniques. The system is explicitly designed for visually impaired people (although it could be easily generalized to other users) and it is built under the assumption that special reference signals, such as painted lines, colored tapes or tactile pavings are deployed in the environment for guiding visually impaired users along pre-defined paths. Thanks to highly optimized software, we are able to execute the CV and sensor-fusion algorithms in run-time on low power hardware such as a normal smartphone, precisely tracking …
Clustering of low-correlated spatial gene expression patterns in the mouse brain in the Allen Brain Atlas
2018
In this paper, clustering techniques are applied to spatial gene expression patterns with a low genomic correlation between the sagittal and coronal projections. The data analysed here are hosted on an available public DB named ABA (Allen Brain Atlas). The results are compared to those obtained by Bohland et al. on the complementary dataset (high correlation values). We prove that, by analysing a reduced dataset,hence reducing the computational burden, we get the same accuracy in highlighting different neuroanatomical region.
CUDA-enabled hierarchical ward clustering of protein structures based on the nearest neighbour chain algorithm
2015
Clustering of molecular systems according to their three-dimensional structure is an important step in many bioinformatics workflows. In applications such as docking or structure prediction, many algorithms initially generate large numbers of candidate poses (or decoys), which are then clustered to allow for subsequent computationally expensive evaluations of reasonable representatives. Since the number of such candidates can easily range from thousands to millions, performing the clustering on standard central processing units (CPUs) is highly time consuming. In this paper, we analyse and evaluate different approaches to parallelize the nearest neighbour chain algorithm to perform hierarc…
An effective extension of the applicability of alignment-free biological sequence comparison algorithms with Hadoop
2016
Alignment-free methods are one of the mainstays of biological sequence comparison, i.e., the assessment of how similar two biological sequences are to each other, a fundamental and routine task in computational biology and bioinformatics. They have gained popularity since, even on standard desktop machines, they are faster than methods based on alignments. However, with the advent of Next-Generation Sequencing Technologies, datasets whose size, i.e., number of sequences and their total length, is a challenge to the execution of alignment-free methods on those standard machines are quite common. Here, we propose the first paradigm for the computation of k-mer-based alignment-free methods for…