Search results for "A* algorithm"
showing 10 items of 2538 documents
Solvent selection in liquid chromatography
2017
Many solvents and additives are used to prepare mobile phases in liquid chromatography (LC). Also, mixtures of solvents at different ratios are used to modify the mobile-phase properties. This can make solvent selection for method development a puzzling task, unless suitable guidelines are followed. This chapter summarizes the most common strategies used by skilled chromatographers in reversed-phase, normal-phase, and hydrophilic interaction LC. These are based on considerations about the global polarity of solutes, stationary phase, and mobile phase, which determine the elution strength, and on the particular profile of the contributions of intermolecular interactions to the global polarit…
Identification of Key Gin Aroma Compounds
2014
Potential impact aroma compounds of gin have been identified using Gas Chromatogry Olfactometry Mass-Spectrometry (GC-O-MS). In order to select some of them for a recombination study, we developed a specific procedure. Instead of only choosing the compounds on criteria such as their odor quality or their odor activity values, we also used physico-chemical parameters and information on their botanical origin. Data were organized in blocks homogeneous in terms of parameter type. Different statistical treatments were used in order to classify the compounds either by analyzing the parameters altogether or separately block by block.
Analytical methodologies for chromium speciation in solid matrices: a survey of literature
1998
The analytical literature about chromium speciation in solid samples has been surveyed. From 451 articles published on the speciation of chromium from 1983 to 1997, the methodologies to do speciation in solids after sample pretreatment are discussed, through consideration of the types of samples and their dissolution, the analytical techniques employed for chromium measurement, and the figures of merit of the 86 papers reported in the Analytical Abstracts data base.
Chromium speciation in liquid matrices: a survey of the literature
2000
A thorough review of the literature published (1983 - March 1999) on chromium speciation in liquid samples is presented, and analytical techniques used in the 404 articles are summarized. The discussion focuses on atomic spectrometric techniques, which are mainly employed for chromium speciation in liquid matrices (134 articles). Details on the type of pretreatment, species, samples, techniques and analytical features of the methodologies proposed are given.
The DrosDel Deletion Collection: A Drosophila Genomewide Chromosomal Deficiency Resource
2007
AbstractWe describe a second-generation deficiency kit for Drosophila melanogaster composed of molecularly mapped deletions on an isogenic background, covering ∼77% of the Release 5.1 genome. Using a previously reported collection of FRT-bearing P-element insertions, we have generated 655 new deletions and verified a set of 209 deletion-bearing fly stocks. In addition to deletions, we demonstrate how the P elements may also be used to generate a set of custom inversions and duplications, particularly useful for balancing difficult regions of the genome carrying haplo-insufficient loci. We describe a simple computational resource that facilitates selection of appropriate elements for generat…
Diagnostic algorithm for familial chylomicronemia syndrome
2016
International audience; Background: Familial chylomicronemia syndrome (FCS) is a rare genetic disease that leads to severe hypertriglyceridemia often associated with recurrent episodes of pancreatitis. The recognition and correct diagnosis of the disease is challenging due to its rarity, and to the lack of specificity of signs and symptoms. Lipid experts, endocrinologists, gastroenterologists, pancreatologists, and general practitioners may encounter patients who potentially have FCS. Therefore, cooperation between experts and improved knowledge of FCS is essential in improving the diagnosis. Currently, a consensus on best practice for the diagnosis of FCS is lacking. Methods: Aiming to def…
Incremental linear model trees on massive datasets
2013
The existence of massive datasets raises the need for algorithms that make efficient use of resources like memory and computation time. Besides well-known approaches such as sampling, online algorithms are being recognized as good alternatives, as they often process datasets faster using much less memory. The important class of algorithms learning linear model trees online (incremental linear model trees or ILMTs in the following) offers interesting options for regression tasks in this sense. However, surprisingly little is known about their performance, as there exists no large-scale evaluation on massive stationary datasets under equal conditions. Therefore, this paper shows their applica…
One-Sided Prototype Selection on Class Imbalanced Dissimilarity Matrices
2012
In the dissimilarity representation paradigm, several prototype selection methods have been used to cope with the topic of how to select a small representation set for generating a low-dimensional dissimilarity space. In addition, these methods have also been used to reduce the size of the dissimilarity matrix. However, these approaches assume a relatively balanced class distribution, which is grossly violated in many real-life problems. Often, the ratios of prior probabilities between classes are extremely skewed. In this paper, we study the use of renowned prototype selection methods adapted to the case of learning from an imbalanced dissimilarity matrix. More specifically, we propose the…
The expressive power of the shuffle product
2010
International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…
Fast Matrix Multiplication
2015
Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O(n2.3755). Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le~Gall has led to an improved algorithm running in time O(n2.3729). These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show that this exact approach cannot result in an algorithm with running time O(n2.3725), and identify a wide class of variants of this approach which cannot result in an algorithm with running time $O(n^{2.3078}); in particular, this approach cannot prove the conjecture that for every e > 0, …