Search results for "ALGORITHMS"
showing 10 items of 1716 documents
New Encodings of Pseudo-Boolean Constraints into CNF
2009
International audience; This paper answers affirmatively the open question of the existence of a polynomial size CNF encoding of pseudo-Boolean (PB) constraints such that generalized arc consistency (GAC) is maintained through unit propagation (UP). All previous encodings of PB constraints either did not allow UP to maintain GAC, or were of exponential size in the worst case. This paper presents an encoding that realizes both of the desired properties. From a theoretical point of view, this narrows the gap between the expressive power of clauses and the one of pseudo-Boolean constraints.
A genetic system based on simulated crossover of sequences of two-bit genes
2006
AbstractWe introduce a genetic model based on simulated crossover of fixed sequences of two-bit genes. Results are(1)a lower bound on population size is exhibited such that a transition takes the stochastic finite population genetic system near the next state of the deterministic infinite population genetic system (provided both begin in the same state);(2)states and dynamics of the deterministic infinite population genetic system are derived for arbitrary (finite) fitness functions (expressed in terms of multivariate polynomials);(3)in the case of quadratic fitness defined by weight matrices with m nonnull entries it is shown that each state transition can be implemented in time O(m+l), wh…
Developing and Integrating Advanced Movement Features Improves Automated Classification of Ciliate Species
2015
Recent advances in tracking technologies such as GPS or video tracking systems describe the movement paths of individuals in unprecedented details and are increasingly used in different fields, including ecology. However, extracting information from raw movement data requires advanced analysis techniques, for instance to infer behaviors expressed during a certain period of the recorded trajectory, or gender or species identity in case data is obtained from remote tracking. In this paper, we address how different movement features affect the ability to automatically classify the species identity, using a dataset of unicellular microbes (i.e., ciliates). Previously, morphological attributes a…
Automated detection and localization system of myocardial infarction in single-beat ECG using Dual-Q TQWT and wavelet packet tensor decomposition.
2019
Abstract Background and objective It is challenging to conduct real-time identification of myocardial infarction (MI) due to artifact corruption and high dimensionality of multi-lead electrocardiogram (ECG). In the present study, we proposed an automated single-beat MI detection and localization system using dual-Q tunable Q-factor wavelet transformation (Dual-Q TQWT) denoising algorithm. Methods After denoising and segmentation of ECG, a fourth-order wavelet tensor (leads × subbands × samples × beats) was constructed based on the discrete wavelet packet transform (DWPT), to represent the features considering the information of inter-beat, intra-beat, inter-frequency, and inter-lead. To red…
The effect of wavelet and discrete cosine transform compression of digital radiographs on the detection of subtle proximal caries. ROC analysis.
2007
The study compared diagnostic performances of 2 different image compression methods: JPEG (discrete cosine transform; Joint Photographic Experts Group compression standard) versus JPEG2000 (discrete wavelet transform), both at a compression ratio of 12:1, from the original uncompressed TIFF radiograph with respect to the detection of non-cavitated carious lesions. Therefore, 100 approximal surfaces of 50 tooth pairs were evaluated on the radiographs by 10 experienced observers using a 5-point confidence scale. Observations were carried out on a standardized viewing monitor under subdued light conditions. The proportion of diseased surfaces was balanced to approximately 50% to avoid bias. Tr…
A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms
2013
Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.
Production Planning in Production Networks: Models for Medium and Short-term Planning
2008
Distributed production networks are structures which are considered able to provide the organisational agility and efficiency necessary to compete in the global market. The performance of such organisations heavily depends on the ability of those involved in the network to coordinate their activities. Two approaches are available for managing complex distributed production networks: a centralised approach, where a unique entity (the planner, for instance) has all the necessary information to make planning decisions for the entire network; or a decentralised approach where each entity in the network has the necessary information and knowledge to make autonomous planning decisions, while the …
Computer simulations for bioequivalence trials: selection of analyte in BCS drugs with first-pass metabolism and two metabolic pathways.
2010
The objective of this work is to use a computer simulation approach to define the most sensitive analyte for in vivo bioequivalence studies of all types of Biopharmaceutics Classification System (BCS) drugs undergoing first-pass hepatic metabolism with two metabolic pathways. A semi-physiological model was developed in NONMEM VI to simulate bioequivalence trials. Four BCS classes (from Class I to IV) of drugs, with three possible saturation scenarios (non-saturation, saturation and saturation of only the major route of metabolism), two (high or low) dose schemes, and six types of pharmaceutical quality for the drug products were simulated. The number of investigated scenarios was 144 (4 × 3…
Computer simulations of bioequivalence trials: selection of design and analyte in BCS drugs with first-pass hepatic metabolism: linear kinetics (I).
2008
Modeling and simulation approaches are useful tools to assess the potential outcome of different scenarios in bioequivalence studies. The aim of this study is to propose a new and improved semi-physiological model for bioequivalence trial simulations and apply it for all BCS (Biopharmaceutic Classification System) drug classes with non-saturated first-pass hepatic metabolism. The semi-physiological model was developed in NONMEM VI to simulate bioequivalence trials. Parent drug and metabolite levels for both reference and test were simulated. Eight types of drugs (with high or low permeability and high or low solubility (class I to IV) and high or low intrinsic clearance) were considered in …
Controlled transdermal iontophoresis by ion-exchange fiber
2000
The objective of this study was to assess the transdermal delivery of drugs using iontophoresis with cation- and anion-exchange fibers as controlled drug delivery vehicles. Complexation of charged model drugs with the ion-exchange fibers was studied as a method to achieve controlled transdermal drug delivery. Drug release from the cation-exchange fiber into a physiological saline was dependent on the lipophilicity of the drug. The release rates of lipophilic tacrine and propranolol were significantly slower than that of hydrophilic nadolol. Permeation of tacrine across the skin was directly related to the iontophoretic current density and drug concentration used. Anion-exchange fiber was te…