1,721,048 research outputs found
Effective Use of Memory in Linear Space Best First Search
No full text. Classical best-first search algorithms like A* require space exponential in length of the solution path. To overcome this limitation algorithms like IDA* and RBFS regenerate parts of problem space trading space for time. These algorithms are probably too modest using only a tiny amount of memory today's computers can offer. We present a novel, RBFS based algorithm which uses all available memory. This is achieved by keeping the generated nodes in memory and pruning some of them away when the memory runs out. We describe three pruning methods and experiments confirming the advantage of our approach. 1 Introduction Although heuristic search is well-established area of research, new findings have great practical significance because of large number of applications and because search underlies many complex systems. In this paper we adopt a standard framework of heuristic search in which we try to find a sequence of steps from a given initial state to any goal state. The search is guide..
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
Classical and quantum mechanics with chaos
Full text linkThis thesis is concerned with the study, classically and quantum mechanically, of the square billiard with particular attention to chaos in both cases. Classically, we show that the rotating square billiard has two regular limits with a mixture of order and chaos between, depending on an energy parameter, E. This parameter ranges from -2w(^2) to oo, where w is the angular rotation, corresponding to the two integrable limits. The rotating square billiard has simple enough geometry to permit us to elucidate that the mechanism for chaos with rotation or curved trajectories is not flyaway, as previously suggested, but rather the accumulation of angular dispersion from a rotating line. Furthermore, we find periodic cycles which have asymmetric trajectories, below the value of E at which phase space becomes disjointed. These trajectories exhibit both left and right hand curvatures due to the fine balance between Centrifugal and Coriolis forces. Quantum mechanically, we compare the spectral analysis results for the square billiard with three different theoretical distribution functions. A new feature in the study is the correspondence we find, by utilising the Berry-Robnik parameter q, between classical E and a quantum rotation parameter w. The parameter q gives the ratio of chaotic quantum phase volume which we can link to the ratio of chaotic phase volume found classically for varying values of E. We find good correspondence, in particular, the different values of q as w is varied reflect the births and subsequent destructions of the different periodic cycles. We also study wave packet dynamics, necessitating the adaptation of a one dimensional unitary integration method to the two dimensional square billiard. In concluding we suggest how this work may be used, with the aid of the chaotic phase volumes calculated, in future directions for research work
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
Context-Sensitive Attribute Estimation in Regression
No full textOne of key issues in both discrete and continuous class prediction and in machine learning in general seems to be the problem of estimating the quality of attributes. Heuristic measures mostly assume independence of attributes so their use is non-optimal in domains with strong dependencies between attributes. For the same reason they are also mostly unable to recognize context dependent features. Relief and its extension ReliefF are statistical methods capable of correctly estimating the quality of attributes in classification problems with strong dependencies between attributes. By exploiting local information provided by different contexts they provide a global view and recognize contextual attributes. After the analysis of ReliefF we have extended it to continuous class problems. Regressional ReliefF (RReliefF) and ReliefF provide a unified view on estimating attribute quality. The experiments show that RReliefF correctly estimates the quality of attributes, recognizes the contextua..
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
- …
