1,720,960 research outputs found
A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems
No full textThis paper presents a new hybrid natural algorithm based on Harmony Search Algorithm (HSA) and Quantum Computing (QC). The main features of the proposed algorithm called Quantum Inspired Harmony Search Algorithm (QIHSA) is the integration of quantum representation scheme in the basic harmony search algorithm that allows applying successfully some quantum inspired operators like measurement and interference. This hybridization between quantum inspired computing and harmony search algorithm has led to an efficient hybrid framework which achieves better balance between the exploration of HS algorithm and the exploitation capabilities of the quantum inspired computing. Experiments on knapsack problems show the effectiveness of the proposed framework and its ability to achieve good quality solutio253142
Trochoid Search Optimization
Get PDFThis paper introduces the Trochoid Search Optimization Algorithm (TSO), a
novel metaheuristic leveraging the mathematical properties of trochoid curves.
The TSO algorithm employs a unique combination of simultaneous translational
and rotational motions inherent in trochoids, fostering a refined equilibrium
between explorative and exploitative search capabilities. Notably, TSO consists
of two pivotal phases global and local search that collectively contribute to
its efficiency and efficacy. Experimental validation demonstrates the TSO
algorithm's remarkable performance across various benchmark functions,
showcasing its competitive edge in balancing exploration and exploitation
within the search space. A distinguishing feature of TSO lies in its
simplicity, marked by a minimal requirement for user-defined parameters, making
it an accessible yet powerful optimization tool
A Hybrid Quantum Genetic Algorithm and Local Search based DPLL for Max 3-SAT Problems
Get PDFIn this paper, we present a new framework for combining complete and incomplete methods in order to deal with the Max Sat problem. The objective is to find the best assignment for a set of Boolean variables, which gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem has been shown to be NP-hard (non-deterministic polynomial-time hard) if the number of variables per clause is greater than 3. The proposed approach is based on quantum inspired genetic principles and the well known exact algorithm DPLL. The underlying idea is to harness the optimization capabilities of quantum genetic algorithm to achieve good quality solutions for Max SAT problem. A new local search based on DPLL algorithm has been embodied in the quantum genetic algorithm leading to an efficient hybrid framework which achieves better balance between diversification and intensification search. The obtained results are very encouraging and show the feasibility and effectiveness of the proposed hybrid approach
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Metaheuristics Guided by the Apriori Principle for Association Rule Mining
No full textInternational audienceAssociation rule mining (ARM), one of the most known tasks in data mining, is considered as an optimization problem. The ARM problem can be solved either by exact methods or by metaheuristics. Exact methods such as Apriori algorithm are very efficient to deal with small and medium datasets. However, when dealing with large size datasets, these methods suffer from time complexity. Metaheuristics are proven faster but most of them suffer from accuracy. To deal with these two challenging issues, this work investigates to enhance metaheuristics and proposes hybrid approaches, which combine metaheuristics and the Apriori principle to intelligently explore the association rules space. To validate the proposed approaches the chemical reaction optimization metaheuristic (CRO) was used. Intensive experiments have been carried out and the first results are very promising in terms of accuracy and processing time
- …
