Results 71 to 80 of about 1,031,530 (335)

Spatiotemporal Barcodes for Image Sequence Analysis [PDF]

open access: yes, 2015
Taking as input a time-varying sequence of two-dimensional (2D) binary images, we develop an algorithm for computing a spatiotemporal 0–barcode encoding lifetime of connected components on the image sequence over time.
González Díaz, Rocío   +2 more
core   +1 more source

Shortest path computation with no information leakage [PDF]

open access: yesProceedings of the VLDB Endowment, 2012
Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences ...
Kyriakos Mouratidis, Man Lung Yiu
openaire   +3 more sources

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

Monte Carlo evaluation of the equilibrium isotope effects using the Takahashi-Imada factorization of the Feynman path integral

open access: yes, 2013
The Feynman path integral approach for computing equilibrium isotope effects and isotope fractionation corrects the approximations made in standard methods, although at significantly increased computational cost.
Buchowiecki, Marcin, Vanicek, Jiri
core   +1 more source

Constrained Shortest Path Computation

open access: yes, 2005
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an a-autonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a.
Manolis Terrovitis   +3 more
openaire   +3 more sources

Directed evolution of enzymes at the crossroads of tradition and innovation

open access: yesFEBS Open Bio, EarlyView.
An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova   +2 more
wiley   +1 more source

An Improved Physarum polycephalum Algorithm for the Shortest Path Problem

open access: yesThe Scientific World Journal, 2014
Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P.
Xiaoge Zhang   +5 more
doaj   +1 more source

Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]

open access: yes, 2005
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries.
Ekkehard Köhler   +2 more
openaire   +1 more source

Effects of Biological Sex and Age on Cerebrospinal Fluid Markers—A Retrospective Observational Study

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Cerebrospinal fluid (CSF) analysis is a key diagnostic tool for neurological diseases. To date, only a few studies have investigated in larger cohorts the effect of age and biological sex on diagnostic markers extracted from CSF. Methods For this retrospective observational study, 4163 CSF findings (2012–2020) were evaluated.
Isabel‐Sophie Hafer   +3 more
wiley   +1 more source

Five‐Year Disease Progression in Synuclein Seeding Positive Sporadic Parkinson's Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To provide a comprehensive description of disease progression in synuclein seeding assay (SAA) positive sporadic Parkinson Disease participants, using Neuronal Synuclein Disease integrated biological and functional impairment staging framework.
Paulina Gonzalez‐Latapi   +19 more
wiley   +1 more source

Home - About - Disclaimer - Privacy