Search results for "Algorithms"

Potential of interactive multiobjective optimization in supporting the design of a groundwater biodenitrification process

2019

The design of water treatment plants requires simultaneous analysis of technical, economic and environmental aspects, identified by multiple conflicting objectives. We demonstrated the advantages of an interactive multiobjective optimization (MOO) method over a posteriori methods in an unexplored field, namely the design of a biological treatment plant for drinking water production, that tackles the process drawbacks, contrarily to what happens in a traditional volumetric-load-driven design procedure. Specifically, we consider a groundwater denitrification biofilter, simulated by the Activated Sludge Model modified with two-stage denitrification kinetics. Three objectives were defined (nitr…

A New Hybrid Mutation Operator for Multiobjective Optimization with Differential Evolution

2011

Differential evolution has become one of the most widely used evolution- ary algorithms in multiobjective optimization. Its linear mutation operator is a sim- ple and powerful mechanism to generate trial vectors. However, the performance of the mutation operator can be improved by including a nonlinear part. In this pa- per, we propose a new hybrid mutation operator consisting of a polynomial based operator with nonlinear curve tracking capabilities and the differential evolution’s original mutation operator, to be efficiently able to handle various interdependencies between decision variables. The resulting hybrid operator is straightforward to implement and can be used within most evoluti…

A Surrogate-assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-objective Optimization

2018

We propose a surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed evolutionary algorithm for many-objective optimization that relies on a set of adaptive reference vectors for selection. The proposed surrogateassisted evolutionary algorithm uses Kriging to approximate each objective function to reduce the computational cost. In managing the Kriging models, the algorithm focuses on the balance of diversity and convergence by making use of the uncertainty information in the approximated objective values given by the Kriging models, the distr…

Searching for Jumbled Patterns in Strings

2009

On Approximate Jumbled Pattern Matching in Strings

2011

Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of a Parikh vector q in the text s requires finding a substring t of s with p(t) = q. This can be viewed as the task of finding a jumbled (permuted) version of a query pattern, hence the term Jumbled Pattern Matching. We present several algorithms for the approximate version of the problem: Given a string s and two Parikh vectors u, v (the query bounds), find all maximal occurrences in s of some Parikh vector q such that u <= q <= v. This definition encompasses several natural versions of approximate Parikh vector search. We present an algorithm solving this problem …

Modulation of voltage-gated K(+) channels Kv11 and Kv1 4 by forskolin.

2002

Forskolin (FSK) affects voltage-gated K + (Kv) currents in different cell types, but it is not known which of the various subunits form FSK-sensitive Kv channels. We compared the effect of the compound at Kv1.1 and Kv1.4 channels ectopically expressed in HEK 293 cells. Low FSK concentrations induced a phosphorylation-dependent potentiation of Kv1.1 currents. At higher concentrations, this effect was superimposed by a fast, cAMP-independent channel block. Kv1.4 currents were inhibited with lower potency by FSK but were not modified by phosphorylation. The variable effect of the compound might help to distinguish between Kv subunits expressed by native cells.  2002 Elsevier Science Ltd. All …

Quantification of the heterogeneity of prognostic cellular biomarkers in ewing sarcoma using automated image and random survival forest analysis

2014

Driven by genomic somatic variation, tumour tissues are typically heterogeneous, yet unbiased quantitative methods are rarely used to analyse heterogeneity at the protein level. Motivated by this problem, we developed automated image segmentation of images of multiple biomarkers in Ewing sarcoma to generate distributions of biomarkers between and within tumour cells. We further integrate high dimensional data with patient clinical outcomes utilising random survival forest (RSF) machine learning. Using material from cohorts of genetically diagnosed Ewing sarcoma with EWSR1 chromosomal translocations, confocal images of tissue microarrays were segmented with level sets and watershed algorithm…

Quantification of vesicles in differentiating human SH-SY5Y neuroblastoma cells by automated image analysis

2005

A new automated image analysis method for quantification of fluorescent dots is presented. This method facilitates counting the number of fluorescent puncta in specific locations of individual cells and also enables estimation of the number of cells by detecting the labeled nuclei. The method is here used for counting the AM1-43 labeled fluorescent puncta in human SH-SY5Y neuroblastoma cells induced to differentiate with all-trans retinoic acid (RA), and further stimulated with high potassium (K+) containing solution. The automated quantification results correlate well with the results obtained manually through visual inspection. The manual method has the disadvantage of being slow, labor-i…

Assessment of the fundamental flexural guided wave in cortical bone by an ultrasonic axial-transmission array transducer

2013

Abstract The fundamental flexural guided wave (FFGW), as modeled, for example, by the A0 Lamb mode, is a clinically useful indicator of cortical bone thickness. In the work described in this article, we tested so-called multiridge-based analysis, based on the crazy climber algorithm and short-time Fourier transform, for assessment of the FFGW component recorded by a clinical array transducer featuring a limited number of elements. Methods included numerical finite-element simulations and experiments in bone phantoms and human radius specimens ( n  = 41). The proposed approach enabled extraction of the FFGW component and determination of its group velocity. This group velocity was in good ag…

An optimal code for patient identifiers.

2004

How to distinguish 1 billion individuals by an identifier consisting of eight characters, allowing a reasonable amount of error detection or even error correction? Our solution of this problem is an optimal code over a 32-character alphabet that detects up to two errors and corrects one error as well as a transposition of two adjacent characters. The corresponding encoding and error checking algorithms are available for free; they are also embedded as components of the pseudonymisation service that is used in the TMF-the German telematics platform for health research networks.