Search results for "Databases"
showing 10 items of 937 documents
Effect of Motion Artifact on Digital Camera Based Heart Rate Measurement
2017
International audience; Depression is one of the most prevalent mental disorders, burdening many people world-wide. A system with the potential of serving as a decision support system is proposed, based on novel features extracted from facial expression geometry and speech, by interpreting non-verbal manifestations of depression. The proposed system has been tested both in gender independent and gender based modes, and with different fusion methods. The algorithms were evaluated for several combinations of parameters and classification schemes, on the dataset provided by the Audio/Visual Emotion Challenge of 2013 and 2014. The proposed framework achieved a precision of 94.8% for detecting p…
Thermodynamic Interaction Parameters of Tetra-n-undecylcalix[4]resorcinarenes with Selected Solvents Studied by Inverse Gas Chromatography
2004
The basic thermodynamic parameters, characterising intermolecular interactions of tetra-n-undecylcalix[4]resorcinarene and its octaacetate derivative with simple organic solutes, were calculated by using the inverse gas chromatography method. Free energy, enthalpy and entropy of sorption were determined.
Rapid and improved identification of drinking water bacteria using the Drinking Water Library, a dedicated MALDI-TOF MS database.
2021
Abstract According to the European Directives (UE) 2020/2184 and 2009/54/EC, which establishes the sanitary criteria for water intended for human consumption in Europe, water suitable for human consumption must be free of the bacterial indicators Escherichia coli, Clostridium perfringens and Enterococcus spp. Drinking water is also monitored for heterotrophic bacteria, which are not a human health risk, but can serve as an index of bacteriological water quality. Therefore, a rapid, accurate, and cost-effective method for the identification of these colonies would improve our understanding of the culturable bacteria of drinking water and facilitate the task of water management by treatment f…
Genome-wide promoter methylation analysis in neuroblastoma identifies prognostic methylation biomarkers.
2012
Background: Accurate outcome prediction in neuroblastoma, which is necessary to enable the optimal choice of risk-related therapy, remains a challenge. To improve neuroblastoma patient stratification, this study aimed to identify prognostic tumor DNA methylation biomarkers.Results: To identify genes silenced by promoter methylation, we first applied two independent genome-wide methylation screening methodologies to eight neuroblastoma cell lines. Specifically, we used re-expression profiling upon 5-aza-2'-deoxycytidine (DAC) treatment and massively parallel sequencing after capturing with a methyl-CpG-binding domain (MBD-seq). Putative methylation markers were selected from DAC-upregulated …
Scientific collaborations: Principles of wikibridge design
2010
Semantic wikis, wikis enhanced with Semantic Web technologies, are appropriate systems for community-authored knowledge models. They are particularly suitable for scientific collaboration. This paper details the design principles ofWikiBridge, a semantic wiki.
Tandem repeats lead to sequence assembly errors and impose multi-level challenges for genome and protein databases
2019
AbstractThe widespread occurrence of repetitive stretches of DNA in genomes of organisms across the tree of life imposes fundamental challenges for sequencing, genome assembly, and automated annotation of genes and proteins. This multi-level problem can lead to errors in genome and protein databases that are often not recognized or acknowledged. As a consequence, end users working with sequences with repetitive regions are faced with ‘ready-to-use’ deposited data whose trustworthiness is difficult to determine, let alone to quantify. Here, we provide a review of the problems associated with tandem repeat sequences that originate from different stages during the sequencing-assembly-annotatio…
Adaptive learning of compressible strings
2020
Suppose an oracle knows a string $S$ that is unknown to us and that we want to determine. The oracle can answer queries of the form "Is $s$ a substring of $S$?". In 1995, Skiena and Sundaram showed that, in the worst case, any algorithm needs to ask the oracle $\sigma n/4 -O(n)$ queries in order to be able to reconstruct the hidden string, where $\sigma$ is the size of the alphabet of $S$ and $n$ its length, and gave an algorithm that spends $(\sigma-1)n+O(\sigma \sqrt{n})$ queries to reconstruct $S$. The main contribution of our paper is to improve the above upper-bound in the context where the string is compressible. We first present a universal algorithm that, given a (computable) compre…
Zero-Error Affine, Unitary, and Probabilistic OBDDs
2017
We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las Vegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results by considering the automata versions of these models.
Parallel In-Memory Evaluation of Spatial Joins
2019
The spatial join is a popular operation in spatial database systems and its evaluation is a well-studied problem. As main memories become bigger and faster and commodity hardware supports parallel processing, there is a need to revamp classic join algorithms which have been designed for I/O-bound processing. In view of this, we study the in-memory and parallel evaluation of spatial joins, by re-designing a classic partitioning-based algorithm to consider alternative approaches for space partitioning. Our study shows that, compared to a straightforward implementation of the algorithm, our tuning can improve performance significantly. We also show how to select appropriate partitioning parame…
A Two-level Spatial In-Memory Index
2020
Very large volumes of spatial data increasingly become available and demand effective management. While there has been decades of research on spatial data management, few works consider the current state of commodity hardware, having relatively large memory and the ability of parallel multi-core processing. In this work, we re-consider the design of spatial indexing under this new reality. Specifically, we propose a main-memory indexing approach for objects with spatial extent, which is based on a classic regular space partitioning into disjoint tiles. The novelty of our index is that the contents of each tile are further partitioned into four classes. This second-level partitioning not onl…