1,721,041 research outputs found
Study of Solving Linear Equations by Hybrid Evolutionary Computation Techniques
No full textThis thesis is submitted to the Department of Mathematics, Khulna University of Engineering & Technology in partial fulfillment of the requirements for the degree of Master of Philosophy in Mathematics, October 2004.Cataloged from PDF Version of Thesis.Includes bibliographical references (pages 90-95).Solving a set of simultaneous linear equations is a fundamental problem that occurs in diverse
applications. For solving large sets of linear equations, iterative methods are preferred over
other methods specially when the coefficient matrix of the linear system is sparse. The rate of
convergence of iterative (Jacobi & Gauss-Seidel) methods is increased by using successive
relaxation (SR) technique. But SR technique is very sensitive to relaxation factor, . Recently,
hybridization of evolutionary computation techniques with classical Gauss-Seidel-based SR
method has successfully been used to solve large set of linear equations in which relaxation
factors are self-adapted. Under this paradigm, this research work has developed a new class of
hybrid evolutionary algorithms for solving system of linear equations. The first algorithm is
the Jacobi-Based Uniform Adaptive (JBUA) hybrid algorithm, which has been developed
within the framework of contemporary Gauss-Seidel-Based Uniform Adaptive (GSBUA)
hybrid algorithm, and classical Jacobi method. The proposed JBUA hybrid algorithm can be
implemented, inherently, in parallel processing environment efficiently whereas GSBUA
hybrid algorithm cannot be implemented in parallel processing environment efficiently. The
second algorithm is the Gauss-Seidel-Based Time-Variant Adaptive (GSBTVA) hybrid
algorithm that has been developed within the framework of contemporary GSBUA hybrid
algorithm and time-variant adaptive technique. In this algorithm two new time-variant
adaptive operators have been introduced based on some observed biological evidences. The
third algorithm is the Jacobi-Based Time-Variant Adaptive (JBTVA) hybrid algorithm that
has been developed within the framework of GSBTVA and JBUA hybrid algorithms. This
proposed JBTVA algorithm also can be implemented, inherently, in parallel processing
environment efficiently. All the proposed hybrid algorithms have been tested on some test
problems and compared with other hybrid evolutionary algorithms and classical iterative
methods. Also the validity of the rapid convergence of the proposed algorithms are proved
theoretically. The proposed hybrid algorithms outperform the contemporary GSBUA hybrid
algorithm as well as classical iterative methods in terms of convergence speed and
effectiveness.Abdur Rakib Muhammad Jalal Uddin JamaliMaster of Philosophy in Mathematic
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe 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
Full text link“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
Full text linkWe 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
Full text linkWe 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
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
Heuristic Approaches for Maximin Distance and Packing Problems
No full textThis thesis is submitted to the Dipartimento di Informatica (Computer Science), Università Degli Studi di Torino, Italy in partial fulfillment of the requirements for the degree of Doctor of Philosophy, February 18, 2009.Cataloged from PDF Version of Thesis.Includes bibliographical references (pages 150-168).In this thesis we mainly deal with two problems - experimental design and packing problems. In the field of experimental design problems we consider maximin Latin Hypercube Designs (LHDs). In the field of packing problems we consider those of packing n equal or unequal circles in a circular container with minimum radius. Both problems can be formulated as optimization ones. The former is a combinatorial problem, while the latter is a continuous one.
We propose heuristic approaches to tackle these problems. These are Iterated Local Search (ILS) heuristics for maximin LHDs, and Basin Hopping (BH) heuristics for packing problems. Actually, ILS and BH approaches have strong similarities and could be described within an unified framework. However, following the literature, where ILS approaches are mainly applied to combinatorial problems, while BH approaches are mainly applied to continuous problems, we will keep them apart.
In order to deal with maximin LHDs, we propose two ILS variants, corresponding to two distinct optimality criteria which are employed to drive the search among LHDs. Extensive experiments are performed for the investigation of the strengths and weaknesses of the algorithms. A remarkable finding is that the most efficient method, though time consuming, performs a non monotonic search, driven by an appropriate objective function, within the space of LHDs. The proposed approaches are extensively compared with the existing ones in the literature, and many improved results with respect to best known ones, are obtained. In particular, the proposed methods seem to outperform the existing ones when the dimension of the design points increases. Finally, we also discuss about the time complexity of the algorithms; by mixing theoretical results with experimental ones, we derive an empirical formula for each ILS variant, returning the expected run time as a function of the number of design points and of their dimension.
To deal with the problem of packing equal circles in a circular container with minimum radius, we propose a variant of BH, namely Monotonic BH (MBH) and its population based counterpart, Population BH (PBH). Extensive computational experiments are performed both to analyze the problem at hand, and to choose in an appropriate way the parameter values for the proposed methods. Different improvements with respect to the best results reported in the literature are detected. The problem of packing unequal circles in a circular container with minimum radius is also attacked with the MBH and PBH approaches, but some components of these approaches are adapted in order to fully exploit the peculiarities of the problem with unequal circles (in particular, its combinatorial nature due to the different radii of the circles). Again extensive computational experiments are performed and improvements with respect
to the existing literature are detected.Abdur Rakib Muhammad Jalal Uddin JamaliDoctor of Philosoph
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
- …
