Search results for "Algorithm"
showing 10 items of 4887 documents
Privacy violations in Riga open data public transport system
2016
Over the recent years public transportation systems around the world have been migrating to digital ticketing solutions. This paper investigates security and privacy aspects of the one such system implemented by Riga municipality called e-talons by analysing published open data containing ride registrations.
Selection From Bibliographic Resources of an Analytical Method for Cosmetic Products
2018
Abstract This chapter is focussed on a general strategy to select an appropriate method from the scientific literature to solve an analytical problem in cosmetic analysis using useful and flexible web tools. A short introduction on the use of ScienceDirect (Elsevier), Scopus (Elsevier), SciFinder Scholar (American Chemical Society), Web of Science (Thomson Reuters) and the freely available Google Scholar is given. The main analytical features to be considered in the selection of the method, such as limit of detection, limit of quantification, linearity, precision (repeatability, intermediate precision and reproducibility), selectivity, robustness and accuracy, are briefly described. Additio…
Context-sensitive text mining with fitness leveling Genetic Algorithm
2015
Contextual processing is a great challenge for information retrieval study - the most approved techniques include scanning content of HTML web pages, user supported metadata analysis, automatic inference grounded on knowledge base, or content-oriented digital documents analysis. We propose a meta-heuristic by making use of Genetic Algorithms for Contextual Search (GACS) built on genetic programming (GP) and custom fitness leveling function to optimize contextual queries in exact search that represents unstructured phrases generated by the user. Our findings show that the queries built with GACS can significantly optimize the retrieval process.
Improving Efficacy of PubMed Clinical Queries for Retrieving Scientifically Strong Studies on Treatment
2006
The authors evaluated the retrieval power of PubMed "Clinical Queries," narrow search string, about therapy in comparison with a modified search string to avoid possible retrieval bias. PubMed search strategy was compared to a slightly modified string that included the Britannic English term "randomised." The authors tested the two strings joined onto each of four terms concerning topics of broad interest: hypertension, hepatitis, diabetes, and heart failure. In particular, precision was computed for not-indexed citations. The added word "randomised" improved total citation retrieval in any case. Total retrieval gain for not-indexed citations ranged from 11.1% to 21.4%. A significant number…
Compensating for instantaneous signal mixing in transfer entropy analysis of neurobiological time series
2013
The transfer entropy (TE) has recently emerged as a nonlinear model-free tool, framed in information theory, to detect directed interactions in coupled processes. Unfortunately, when applied to neurobiological time series TE is biased by signal cross-talk due to volume conduction. To compensate for this bias, in this study we introduce a modified TE measure which accounts for possible instantaneous effects between the analyzed time series. The new measure, denoted as compensated TE (cTE), is tested on simulated time series reproducing conditions typical of neuroscience applications, and on real magnetoencephalographic (MEG) multi-trial data measured during a visuo-tactile cognitive experime…
Towards efficient inductive synthesis of expressions from input/output examples
1993
Our goal through several years has been the development of efficient search algorithm for inductive inference of expressions using only input/output examples. The idea is to avoid exhaustive search by means of taking full advantage of semantic equality of many considered expressions. This might be the way that people avoid too big search when finding proof strategies for theorems, etc. As a formal model for the development of the method we use arithmetic expressions over the domain of natural numbers. A new approach for using weights associated with the functional symbols for restricting search space is considered. This allows adding constraints like the frequency of particular symbols in t…
Modelling the insect Mushroom Bodies: Application to sequence learning
2015
Learning and reproducing temporal sequences is a fundamental ability used by living beings to adapt behaviour repertoire to environmental constraints. This paper is focused on the description of a model based on spiking neurons, able to learn and autonomously generate a sequence of events. The neural architecture is inspired by the insect Mushroom Bodies (MBs) that are a crucial centre for multimodal sensory integration and behaviour modulation. The sequence learning capability coexists, within the insect brain computational model, with all the other features already addressed like attention, expectation, learning classification and others. This is a clear example that a unique neural struc…
Architectural improvements and FPGA implementation of a multimodel neuroprocessor
2003
Since neural networks (NNs) require an enormous amount of learning time, various kinds of dedicated parallel computers have been developed. In the paper a 2-D systolic array (SA) of dedicated processing elements (PEs) also called systolic cells (SCs) is presented as the heart of a multimodel neural-network accelerator. The instruction set of the SA allows the implementation of several neural algorithms, including error back propagation and a self organizing feature map algorithm. Several special architectural facilities are presented in the paper in order to improve the 2-D SA performance. A swapping mechanism of the weight matrix allows the implementation of NNs larger than 2-D SA. A systo…
SWAPHI-LS: Smith-Waterman Algorithm on Xeon Phi coprocessors for Long DNA Sequences
2014
As an optimal method for sequence alignment, the Smith-Waterman (SW) algorithm is widely used. Unfortunately, this algorithm is computationally demanding, especially for long sequences. This has motivated the investigation of its acceleration on a variety of high-performance computing platforms. However, most work in the literature is only suitable for short sequences. In this paper, we present SWAPHI-LS, the first parallel SW algorithm exploiting emerging Xeon Phi coprocessors to accelerate the alignment of long DNA sequences. In SWAPHI-LS, we have investigated three parallelization approaches (naive, tiled, and distributed) in order to deeply explore the inherent parallelism within Xeon P…
Generalized Dimension Distortion under Mappings of Sub-Exponentially Integrable Distortion
2010
We prove a dimension distortion estimate for mappings of sub-exponentially integrable distortion in Euclidean spaces, which is essentially sharp in the plane.