Gesture recognition for improved user experience in augmented biology lab
The Learning process in education systems is one of the most important issues that affect all societies. Advances in technology have influenced how people communicate and learn. Gaming Techniques (GT) and Augmented Reality (AR) technologies provide new opportunities for a learning process. They transform the student’s role from passive to active in the learning process. It can provide a realistic, authentic, engaging and interesting learning environment. Hand Gesture Recognition (HGR) is a major driver in the field of Augmented Reality (AR). In this paper, we propose an initiative Augmented
A fuzzy approach of sensitivity for multiple colonies on ant colony optimization
In order to solve combinatorial optimization problem are used mainly hybrid heuristics. Inspired from nature, both genetic and ant colony algorithms could be used in a hybrid model by using their benefits. The paper introduces a new model of Ant Colony Optimization using multiple colonies with different level of sensitivity to the ant’s pheromone. The colonies react different to the changing environment, based on their level of sensitivity and thus the exploration of the solution space is extended. Several discussion follows about the fuzziness degree of sensitivity and its influence on the
Parameter Estimation of Two Spiking Neuron Models With Meta-Heuristic Optimization Algorithms
The automatic fitting of spiking neuron models to experimental data is a challenging problem. The integrate and fire model and Hodgkin–Huxley (HH) models represent the two complexity extremes of spiking neural models. Between these two extremes lies two and three differential-equation-based models. In this work, we investigate the problem of parameter estimation of two simple neuron models with a sharp reset in order to fit the spike timing of electro-physiological recordings based on two problem formulations. Five optimization algorithms are investigated; three of them have not been used to
Constructing suffix array during decompression
The suffix array is an indexing data structure used in a wide range of applications in Bioinformatics. Biological DNA sequences are available to download from public servers in the form of compressed files, where the popular lossless compression program gzip [1] is employed. The straightforward method to construct the suffix array for this data involves decompressing the sequence file, storing it on disk, and then calling a suffix array construction program to build the suffix array. This scenario, albeit feasible, requires disk access and throws away valuable information in the compressed
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. However, this phylogenetic reconstruction is a very challenging task. For the most simple distance measures (the breakpoint distance and the reversal distance), the problem is NP-hard even if one considers only three genomes. Results: In this paper, we present a new heuristic algorithm that directly constructs a phylogenetic tree w.r.t. the weighted reversal and transposition distance. Experimental results on previously
Segmentation of left ventricle in cardiac MRI images using adaptive multi-seeded region growing
Multi-slice short-axis acquisitions of the left ventricle are fundamental for estimating the volume and mass of the left ventricle in cardiac MRI scans. Manual segmentation of the myocardium in all time frames per each cross-section is a cumbersome task. Therefore, automatic myocardium segmentation methods are essential for cardiac functional analysis. Region growing has been proposed to segment the myocardium. Although the technique is simple and fast, non uniform intensity and low-contrast interfaces of the myocardium are major challenges of the technique that limit its use in myocardial
Community assessment to advance computational prediction of cancer drug combinations in a pharmacogenomic screen
INVESTIGATION OF DIFFERENTIALLY EXPRESSED GENE RELATED TO HUNTINGTON'S DISEASE USING GENETIC ALGORITHM
neurodegenerative diseases have complex pathological mechanisms. Detecting disease-associated genes with typical differentially expressed gene selection approaches are ineffective. Recent studies have shown that wrappers Evolutionary optimization methods perform well in feature selection for high dimensional data, but they are computationally costly. This paper proposes a simple method based on a genetic algorithm engaged with the Empirical Bays T-statistics test to enhance the disease-associated gene selection process. The proposed method is applied to Affymetrix microarray data from
Chiral phase structure of the sixteen meson states in the SU(3) Polyakov linear-sigma model for finite temperature and chemical potential in a strong magnetic field
In characterizing the chiral phase-structure of pseudoscalar ( ), scalar ( ), vector ( ) and axial-vector ( t) meson states and their dependence on temperature, chemical potential, and magnetic field, we utilize the SU(3) Polyakov linear-sigma model (PLSM) in the mean-field approximation. We first determine the chiral (non)strange quark condensates, and , and the corresponding deconfinement order parameters, and , in thermal and dense (finite chemical potential) medium and finite magnetic field. The temperature and the chemical potential characteristics of nonet meson states normalized to the
AmpliconNet: Sequence Based Multi-layer Perceptron for Amplicon Read Classification Using Real-time Data Augmentation
Taxonomic assignment is the core of targeted metagenomics approaches that aims to assign sequencing reads to their corresponding taxonomy. Sequence similarity searching and machine learning (ML) are two commonly used approaches for taxonomic assignment based on the 16S rRNA. Similarity based approaches require high computation resources, while ML approaches dont need these resources in prediction. The majority of these ML approaches depend on k-mer frequency rather than direct sequence, which leads to low accuracy on short reads as k-mer frequency doesnt consider k-mer position. Moreover
Pagination
- Previous page ‹‹
- Page 7
- Next page ››