Search results for "algorithm."

showing 10 items of 4617 documents

Convergence of inertial prox-penalization and inertial forward-backward algorithms for solving bilevel monotone equilibrium problems

2023

The main focus of this paper is on bilevel optimization on Hilbert spaces involving two monotone equilibrium bifunctions. We present a new achievement consisting on the introduction of inertial methods for solving this type of problems. Indeed, two several inertial type methods are suggested: a proximal algorithm and a forwardbackward one. Under suitable conditions and without any restrictive assumption on the trajectories, the weak and strong convergence of the sequence generated by the both iterative methods are established. Two particular cases illustrating the proposed methods are thereafter discussed with respect to hierarchical minimization problems and equilibrium problems under a sa…

Weak and strong convergenceBilevel Equilibrium problemsEquilibrium Fitzpatrick transformProximal algorithm[MATH] Mathematics [math]Monotone bifunctions
researchProduct

Weak and strong convergence of an inertial proximal method for solving bilevel monotone equilibrium problems

2022

In this paper, we introduce an inertial proximal method for solving a bilevel problem involving two monotone equilibrium bifunctions in Hilbert spaces. Under suitable conditions and without any restrictive assumption on the trajectories, the weak and strong convergence of the sequence generated by the iterative method are established. Two particular cases illustrating the proposed method are thereafter discussed with respect to hierarchical minimization problems and equilibrium problems under saddle point constraint. Furthermore, a numerical example is given to demonstrate the implementability of our algorithm. The algorithm and its convergence results improve and develop previous results i…

Weak and strong convergenceBilevel Equilibrium problemsOptimization and Control (math.OC)G.1.6Equilibrium Fitzpatrick transformFOS: MathematicsProximal algorithm90C33 49J40 46N10 65K15 65K10[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]Monotone bifunctionsMathematics - Optimization and Control
researchProduct

Feature selection: A multi-objective stochastic optimization approach

2020

The feature subset task can be cast as a multiobjective discrete optimization problem. In this work, we study the search algorithm component of a feature subset selection method. We propose an algorithm based on the threshold accepting method, extended to the multi-objective framework by an appropriate definition of the acceptance rule. The method is used in the task of identifying relevant subsets of features in a Web bot recognition problem, where automated software agents on the Web are identified by analyzing the stream of HTTP requests to a Web server.

Web serverLinear programmingthreshold acceptingComputer scienceFeature extractionFeature selectionstochastic optimizationcomputer.software_genreMulti-objective optimizationfeature selection; multiobjective optimization; stochastic optimization; subset selection; threshold acceptingfeature selectionsubset selectionFeature (computer vision)Search algorithmStochastic optimizationmultiobjective optimizationData miningcomputer
researchProduct

Non-Technological Aspects on Web Searching Success

2008

This paper studies the influence of social, cultural and emotional background of typical Web users into the web searching process. Several variables, describing such aspects, are represented and statistically analyzed with well known clustering and classifying algorithms such, as COBWEB, J48, Bayes classification, and Correspondence analysis. Results indicate that the efficiency of the complete process of Information Retrieval will not be fully understood without considering subjectivity and personality facts.

Web standardsBayes' theoremInformation retrievalC4.5 algorithmComputer scienceProcess (engineering)media_common.quotation_subjectPersonalityCluster analysisCorrespondence analysisCategory utilitymedia_common
researchProduct

Gaussian quadrature rule for arbitrary weight function and interval

2005

Abstract A program for calculating abscissas and weights of Gaussian quadrature rules for arbitrary weight functions and intervals is reported. The program is written in Mathematica. The only requirement is that the moments of the weight function can be evaluated analytically in Mathematica. The result is a FORTRAN subroutine ready to be utilized for quadrature. Program summary Title of program: AWGQ Catalogue identifier:ADVB Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADVB Program obtained from: CPC Program Library, Queens University, Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Computers: Pentium IV 1.7 GHz processor Ins…

Weight functionComputer scienceFortranMathematicsofComputing_NUMERICALANALYSISGeneral Physics and AstronomyGauss–Kronrod quadrature formulaTanh-sinh quadratureQuadrature (mathematics)symbols.namesakeHardware and ArchitecturesymbolsGaussian quadratureAlgorithmcomputerClenshaw–Curtis quadratureTest datacomputer.programming_languageComputer Physics Communications
researchProduct

CN2-R: Faster CN2 with randomly generated complexes

2011

Among the rule induction algorithms, the classic CN2 is still one of the most popular ones; a great amount of enhancements and improvements to it is to witness this. Despite the growing computing capacities since the algorithm was proposed, one of the main issues is resource demand. The proposed modification, CN2-R, substitutes the star concept of the original algorithm with a technique of randomly generated complexes in order to substantially improve on running times without significant loss in accuracy.

Weighted Majority AlgorithmTheoretical computer scienceRule inductionComputer sciencePopulation-based incremental learningStability (learning theory)Online machine learningProbabilistic analysis of algorithmsAlgorithm designStar (graph theory)Algorithm2011 16th International Conference on Methods & Models in Automation & Robotics
researchProduct

Experimental introgression to evaluate the impact of sex specific traits onDrosophila melanogasterincipient speciation

2019

ABSTRACTSex specific traits are involved in speciation but it is difficult to determine whether their variation initiates or reinforces sexual isolation. In some insects, speciation depends of the rapid change of expression in desaturase genes coding for sex pheromones. Two closely related desaturase genes are involved inDrosophila melanogasterpheromonal communication:desat1affects both the production and the reception of sex pheromones whiledesat2is involved in their production in flies of Zimbabwe populations. There is a strong asymmetric sexual isolation between Zimbabwe populations and all other “Cosmopolitan” populations: Zimbabwe females rarely copulate with Cosmopolitan males whereas…

White (mutation)biologyEvolutionary biologySex pheromoneGenetic algorithmIntrogressionDrosophila melanogasterMatingIncipient speciationbiology.organism_classificationGene
researchProduct

Lightweight LCP construction for next-generation sequencing datasets

2012

The advent of "next-generation" DNA sequencing (NGS) technologies has meant that collections of hundreds of millions of DNA sequences are now commonplace in bioinformatics. Knowing the longest common prefix array (LCP) of such a collection would facilitate the rapid computation of maximal exact matches, shortest unique substrings and shortest absent words. CPU-efficient algorithms for computing the LCP of a string have been described in the literature, but require the presence in RAM of large data structures. This prevents such methods from being feasible for NGS datasets. In this paper we propose the first lightweight method that simultaneously computes, via sequential scans, the LCP and B…

Whole genome sequencingGenomics (q-bio.GN)FOS: Computer and information sciencesSequenceBWT; LCP; next-generation sequencing datasetsBWT LCP text indexes next-generation sequencing datasets massive datasetsSettore INF/01 - InformaticaComputer scienceComputationString (computer science)LCP arrayParallel computingData structureDNA sequencingSubstringBWTLCPFOS: Biological sciencesComputer Science - Data Structures and AlgorithmsQuantitative Biology - GenomicsData Structures and Algorithms (cs.DS)next-generation sequencing datasets
researchProduct

Temperature-dependence of spontaneous mutation rates

2020

Mutation is the source of genetic variation and the fundament of evolution. At the interphase of ecology and evolution, temperature has long been suggested to have a direct impact on realised spontaneous mutation rates. The question is whether mutation rates can be a species-specific constant under variable environmental conditions, such as variation of the ambient temperature. By combining mutation accumulation with whole genome sequencing in a multicellular organism, we provide empirical support to reject this null hypothesis. Instead mutation rates depend on temperature in a U-shaped manner with increasing rates towards both temperature extremes. This relation has important implications …

Whole genome sequencingMutation rateMulticellular organismEvolutionary biologyMolecular evolutionGenetic variationMutation (genetic algorithm)Evolutionary ecologyBiologyMutation Accumulation
researchProduct

Parallel and Distributed Resource Allocation With Minimum Traffic Disruption for Network Virtualization

2017

Wireless network virtualization has been advocated as one of the most promising technologies to provide multifarious services and applications for the future Internet by enabling multiple isolated virtual wireless networks to coexist and share the same physical wireless resources. Based on the multiple concurrent virtual wireless networks running on the shared physical substrate, service providers can independently manage and deploy different end-users services. This paper proposes a new formulation for bandwidth allocation and routing problem for multiple virtual wireless networks that operate on top of a single substrate network to minimize the operation cost of the substrate network. We …

Wi-Fi arrayComputer scienceDistributed computingNetwork virtualizationresource allocationresursointi02 engineering and technologywireless network virtualizationcomputer.software_genre0203 mechanical engineering0202 electrical engineering electronic engineering information engineeringpreventive traffic disruptionResource managementElectrical and Electronic Engineeringta113distributed algorithmreititysta213Wireless networkbusiness.industry020206 networking & telecommunications020302 automobile design & engineeringWireless WANService providerVirtualizationWireless site surveyBandwidth allocationroutingResource allocationMulti-frequency networkThe InternetbusinessADMMcomputerMunicipal wireless networkComputer networkIEEE Transactions on Communications
researchProduct