1,720,972 research outputs found
Asignación de frecuencias en redes móviles GSM utilizando Meta Heurística ACO
Get PDFIn this research a real problem of telecommunications networks is analyzed, we intend to apply Meta heuristic techniques to problems of frequency allocation, using the algorithm Ant System (AS) in scenarios that simulate a GSM cellular network.The telecommunications industry has provided, and continues to provide, a lot of optimization problems that arise from the design of the communication system itself to some aspects of its operation and here are the Meta heuristic procedures which are a class of approximate methods they are designed to solve complex optimization problems, where the classic heuristics are not effective. The meta-heuristics provide a general framework to create new hybrid algorithms combining different concepts derived from artificial intelligence.With all this we want to reach a mathematical modeling of optimization based on ant algorithms (ACO) for assignment of frequencies.En este trabajo de investigación se analiza un problema real de las redes de telecomunicaciones, nos proponemos aplicar técnicas meta heurísticas a problemas de asignación de frecuencias, utilizando el algoritmo Ant System (AS) en escenarios que simulan una red celular GSM.
La industria de las telecomunicaciones ha proporcionado, y sigue proporcionando, una gran cantidad de problemas de optimización que surgen desde el propio diseño del sistema de comunicación hasta algunos aspectos de su funcionamiento y aquí entran los procedimientos meta heurísticos que son una clase de métodos aproximados que están diseñados para resolver problemas complejos de optimización, en los que los heurísticos clásicos no son efectivos. Los meta-heurísticos proporcionan un marco general para crear nuevos algoritmos híbridos combinando diferentes conceptos derivados de la inteligencia artificial.
Con todo esto se quiere llegar a una modelación matemática de Optimización basada en algoritmos de hormigas (ACO) para asignación de frecuencias
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
Uso da Otimização de Malhas Variáveis para o “Viajante do Comércio”
No full textIntroduction This paper presents a
proposal to apply the meta-heuristic
Optimization Based on Variable Meshes
(VMO) to the discreet problem of the
Traveler Seller (TSP); This model
explores the search space to Objective
from a population of solutions called
mesh that expands and contracts in
order to find good quality solutions. In
this context, the expansion operator
is modified in such a way that it is
applicable in a discrete domain, making
combinations among the solutions in
order to obtain new nodes. Another
element that is modified is the clearing
operator, which is responsible for
maintaining the diversity of the mesh in
each interaction. Methodology. A study
of VMO model parameters is summarized
in this paper, using a set of TSP instances
with different characteristics; In addition,
it can be observed that the proposal of
this work obtains competitive results
when compared with other international
reference algorithms mentioned in the
state of the art. The work is structured
as follows: Section 1 describes the
fundamental aspects of the TSP study
problem. Then, in the second, the general
functioning of VMO is explained, in the
third one, each of the expansion and
contraction operators is defined for the
study problem. Later in the fourth section
a study of the parameters of the proposal
and an experimental comparative
analysis with the results obtained with
other algorithms mentioned in the state
of the art is made. Conclusions Other
operators of generation of new nodes
were applied in the expansion process,
where a combination of solutions is made
in order to comply with the restrictions
imposed by the problem.Introducción En este trabajo se
presenta una propuesta para aplicar la
meta-heurística Optimización Basada
en Mallas Variables (VMO) al problema
discreto del Viajero Vendedor (TSP);
este modelo explora el espacio de
búsqueda a Objetivo partir de una
población de soluciones llamada
malla que se expande y contrae con
la finalidad de encontrar soluciones
de buena calidad. En este contexto
se modifica el operador de expansión
de manera tal que sea aplicable
en un dominio discreto, realizando
combinaciones entre las soluciones a
fin de obtener nuevos nodos. Otro de
los elementos que se modifica es el
operador de clearing, el cual se encarga
de mantener la diversidad de la malla
en cada interacción. Metodología. Se
resume en este trabajo un estudio de
parámetros del modelo VMO utilizando
un conjunto de instancias de TSP con
diferentes características; además,
se puede observar que la propuesta
de este trabajo obtiene Resultados
competitivos al compararlos con otros
algoritmos de referencia internacional
mencionado en el estado del arte. El
trabajo está estructurado de la siguiente
manera: En el apartado 1 se describe los
aspectos fundamentales de problema
de estudio TSP. Seguidamente en el
segundo se explica el funcionamiento
general de VMO, en el tercero se
define cada uno de los operadores
de expansión y contracción para el
problema de estudio. Posteriormente en el apartado cuarto se realiza un
estudio de parámetros de la propuesta
y un análisis comparativo experimental
con los resultados obtenidos con otros
algoritmos mencionado en el estado del
arte. Conclusiones Se aplicaron otros
operadores de generación de nuevos
nodos en el proceso de expansión,
donde se realiza una combinación de
soluciones de manera que cumpla
con las restricciones impuestas por el
problema.Introdução Este artigo apresenta uma
proposta para aplicar a Otimização
meta-heurística Baseada em Malhas
Variáveis (VMO) ao problema discreto
do Vendedor Vendedor (TSP); Esse modelo explora o espaço de pesquisa
para o Objective a partir de uma
população de soluções chamada
malha que se expande e se contrai
para encontrar soluções de boa
qualidade. Neste contexto, o operador
de expansão é modificado de tal
maneira que é aplicável em um domínio
discreto, fazendo combinações entre as
soluções para obter novos nós. Outro
elemento que é modificado é o operador
de limpeza, que é responsável por
manter a diversidade da malha em cada
interação. Metodologia Um estudo dos
parâmetros do modelo VMO é resumido
neste artigo, usando um conjunto
de instâncias do TSP com diferentes
características; Além disso, pode-se
observar que a proposta deste trabalho
obtém resultados competitivos quando
comparados com outros algoritmos de
referência internacionais mencionados
no estado da arte. O trabalho está
estruturado da seguinte forma: a seção
1 descreve os aspectos fundamentais
do problema do estudo TSP. Então,
no segundo, o funcionamento geral
do VMO é explicado, no terceiro, cada
operador de expansão e contração é
definido para o problema do estudo.
Posteriormente na quarta seção é feito
um estudo dos parâmetros da proposta
e uma análise comparativa experimental
com os resultados obtidos com outros
algoritmos mencionados no estado da
arte. Conclusões Outros operadores de
geração de novos nós foram aplicados
no processo de expansão, onde uma
combinação de soluções é feita a fim
de cumprir as restrições impostas pelo
problema
koamabayili/VECTRON-author-checklist: VECTRON author checklist
No full textWe have done our best to complete the author checklist relating to the use of animals in the hut study. Note that the objective for the hut study was to evaluate the IRS treatment applications for residual efficacy against Anopheles mosquitoes, including the local An. coluzzii mosquito population. Cows were only used to attract mosquitoes into the huts and no tests were carried out directly on the cows. The author checklist is intended for use with studies where experiments are carried out on animals, which is why we have had such difficulty in completing this for the hut study, as many of the questions do not relate to how the cows were used
THE PERFORMANCE OF SOME META-HEURISTICS IN CONTINUOUS PROBLEMS STUDIED ACCORDING TO THE LOCATION OF THE OPTIMA IN THE SEARCH SPACE
No full textMany hard optimization problems can only be effectively handled by meta-heuristic methods. Some continuous optimization problems have specifi c characteristics that demand a particular interest. These features include the location of the optima in a specifi c region of search space. Hence the main goal of this paper is assessing the performance of some outstanding population-based meta-heuristics on functions with optima on bounds and problems with optima off bounds. It is studied by taking a set of benchmark functions from the fi eld of optimization as a point of departure
- …
