Search results for " Algorithms"

showing 10 items of 612 documents

"Table 1" of "$\Lambda$ polarization in associated K$^+$ - $\Lambda$ electro-production"

2000

LAMBDA polarization, with respect to the p_gamma x p_k axis.

POLMathematics::CombinatoricsStrange productionElectron productionComputer Science::Discrete Mathematics2.91PolarizationE- P --> LAMBDA K+ E-ExclusiveComputer Science::Data Structures and Algorithms
researchProduct

An enhanced memetic differential evolution in filter design for defect detection in paper production.

2008

This article proposes an Enhanced Memetic Differential Evolution (EMDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. Defect detection is handled by means of two Gabor filters and their design is performed by the EMDE. The EMDE is a novel adaptive evolutionary algorithm which combines the powerful explorative features of Differential Evolution with the exploitative features of three local search algorithms employing different pivot rules and neighborhood generating functions. These local search algorithms are the Hooke Jeeves Algorithm, a Stochastic Local Search, and Simulated Annealing. The local search algorithms are adap…

PaperQuality ControlMathematical optimizationPopulationEvolutionary algorithmmultimeme algorithmsdigital filter designArtificial IntelligenceImage Interpretation Computer-AssistedFIR filterHumansIndustryLocal search (optimization)Computer Simulationmemetic algorithmseducationMetaheuristicMathematicsProbabilityedge detectioneducation.field_of_studyElectronic Data ProcessingStochastic ProcessesModels Statisticalbusiness.industrydifferential evolutionpaper productionModels TheoreticalComputational MathematicsFilter designDifferential evolutionSimulated annealingMemetic algorithmbusinessAlgorithmsSoftware
researchProduct

IDEA: interface dynamics and energetics algorithm.

2007

IDEA, interface dynamics and energetics algorithm, was implemented, in FORTRAN, under different operating systems to mimic dynamics and energetics of elementary events involved in interfacial processes. The code included a parallel elaboration scheme in which both the stochastic and the deterministic components, involved in the developed physical model, worked simultaneously. IDEA also embodied an optionally running VISUAL subroutine, showing the dynamic energy changes caused by the surface events, e.g., occurring at the gas-solid interface. Monte Carlo and ordinary differential equation system subroutines were employed in a synergistic way to drive the occurrence of the elementary events a…

Parallel algorithmsInterface (Java)FortranComputer scienceSubroutineMonte Carlo methodOdeMolecular modelingGeneral ChemistryIsothermal processMonte Carlo methodComputational MathematicsOrdinary differential equationStatistical physicscomputerAlgorithmOrdinary differential equationEnergy (signal processing)computer.programming_languageJournal of computational chemistry
researchProduct

Design and Digital Fabrication of a Parametric Joint for Bamboo Sustainable Structures

2019

The study deepens the design of a joining system for bamboo spatial structure by proposing new and advanced solutions that guarantee maximum freedom of composition to the designer. The joint allows to determine and control parametrically the adaptability to any spatial grid configuration of culms with heterogeneous dimensions. Despite the bamboo being one of the main natural building materials in the field of sustainable architecture, currently, it is not used enough due to the lack of adequate connection systems. Bamboo is a rapidly growing renewable resource, naturally available, which is quite strong and lends itself to structural applications. The paper proposes an innovative approach t…

Parametric modeling Bamboo Genetic algorithms 3D printing CAD/CAM designComputer sciencemedia_common.quotation_subjectComputational geometryGridAdaptabilityConstruction engineeringSettore ICAR/09 - Tecnica Delle CostruzioniParametric modelSustainable designJoint (building)Settore ICAR/17 - DisegnoNatural buildingmedia_commonParametric statistics
researchProduct

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…

Pareto optimalityDecision support systemdecision supportEnvironmental EngineeringProcess (engineering)Computer science0208 environmental biotechnologypäätöksentukijärjestelmät02 engineering and technologyActivated sludge model010501 environmental sciencesManagement Monitoring Policy and Law01 natural sciencesMulti-objective optimizationInteractive methodIND-NIMBUSWater treatmentSensitivity (control systems)Process engineeringWaste Management and DisposalGroundwater0105 earth and related environmental sciencesvedenpuhdistusNitratesSewagepareto optimalitypareto-tehokkuusbusiness.industrywater treatmentGeneral Medicineinteractive methodvedenkäsittelymonitavoiteoptimointi020801 environmental engineeringDecision supportRange (mathematics)Decision support; IND-NIMBUS; Interactive method; NIMBUS method; Pareto optimality; Water treatment; Algorithms; Denitrification; Nitrates; Sewage; GroundwaterDenitrificationA priori and a posterioriWater treatmentNIMBUS methodbusinessAlgorithms
researchProduct

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…

Pareto optimalityMathematical optimizationEvolutionary algorithmComputational intelligenceMOEA/DNonlinearGenetic operatorEvolutionary algorithmsMulti-objective optimizationPolynomialTheoretical Computer ScienceDEOperator (computer programming)Evolutionary algorithms; DE; Nonlinear; Multi-criteria optimization; Polynomial; Pareto optimality; MOEA/DPareto-optimaalisuusMathematicsMatematikMulti-criteria optimizationState (functional analysis)monitavoiteoptimointiNonlinear systemDifferential evolutionGeometry and TopologyAlgorithmSoftwareMathematics
researchProduct

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…

Pareto optimalityPareto-tehokkuus0209 industrial biotechnologyMathematical optimizationOptimization problemComputer sciencemodel managementpäätöksentekoEvolutionary algorithmInteractive evolutionary computation02 engineering and technologyEvolutionary computationTheoretical Computer Science020901 industrial engineering & automationKrigingalgoritmit0202 electrical engineering electronic engineering information engineeringvektorit (matematiikka)multiobjective optimizationcomputational costsurrogate-assisted evolutionary algorithmsBayesian optimizationta113Cultural algorithmpareto-tehokkuusbayesilainen menetelmäta111Approximation algorithmImperialist competitive algorithmmonitavoiteoptimointiKrigingkoneoppiminenComputational Theory and Mathematics020201 artificial intelligence & image processingreference vectorsSoftwareIEEE Transactions on Evolutionary Computation
researchProduct

Searching for Jumbled Patterns in Strings

2009

Parikh vectors permuted strings pattern matching string algorithms average case analysisString algorithmsAverage case analysis; Parikh vectors; Pattern matching; Permuted strings; String algorithmsPermuted stringsParikh vectorsAverage case analysisPattern matching
researchProduct

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 …

Parikh vectors: Average case analysiApproximate searchString algorithmsDiscrete mathematicsWeight functionanalysisSearch engine indexingParikh vectorsAverage case analysisApproximate string matchingSubstringString algorithmTheoretical Computer ScienceCombinatoricsComputational Theory and MathematicsString algorithms Pattern matching Parikh vectors Average case analysis Approximate search Permuted stringsPermuted stringsAverage caseTheory of computationWavelet TreePreprocessorPattern matchingPattern matchingMathematicsTheory of Computing Systems
researchProduct

Optimizing diagnostic algorithms to advance Hepatitis C elimination in Italy: A cost effectiveness evaluation

2021

Objectives: Optimized diagnostic algorithms to detect active infections are crucial to achieving HCV elimination. We evaluated the cost effectiveness and sustainability of different algorithms for HCV active infection diagnosis, in a context of a high endemic country for HCV infection. Methods: A Markov disease progression model, simulating six diagnostic algorithms in the birth cohort 1969‐1989 over a 10‐year horizon from a healthcare perspective was used. Conventionally diagnosis of active HCV infection is through detection of antibodies (HCV‐Ab) detection followed by HCV‐RNA or HCV core antigen (HCV‐Ag) confirmatory testing either on a second sample or by same sample reflex testing. The …

Pediatricsmedicine.medical_specialtyCost effectivenessCost-Benefit Analysiscost-effectiveneContext (language use)HepacivirusAntiviral AgentsLiver diseaseMedicineHumansbusinesshealth care economics and organizationsHepatologybusiness.industryscreeningDisease progressionHCV chronic infectionvirus diseasesDiagnostic algorithmshealthHepatitis CHepatitis C Chronicmedicine.diseaseHepatitis CHcv eliminationdigestive system diseasesWHO targetHcv core antigenbusinessAlgorithms
researchProduct