21,732 research outputs found
Richard Dorson (interview)
No full textThis interview is included in the American Folklore Society Oral History Project held at the Archive of Folk Culture, American Folklife Center, Library of Congress, Washington, D.C. In this item, Richard M. Dorson is interviewed by Richard Reuss at the American Folklore Society annual meeting in Nashville, Tennessee for the American Folklore Society Oral History Project. Biography/History note: Richard M. Dorson, folklorist, author, and educator, was born in New York City in 1916 and died in 1981. He earned his B.A., M.A. and Ph.D. at Harvard University and taught at Harvard and Michigan State University before becoming professor of history and folklore at Indiana University where he founded its Folklore Institute in 1963 and became the first director and first chair of the Folklore Department at Indiana University in 1978. This collection consists of 1 sound tape reel (40 min.) : analog, 7 1/2 ips, 2 track, mono. ; 7 in. It was originally recorded on November 2, 1973 at the American Folklore Society annual meeting in Nashville, Tennessee by Richard Reuss on a Sony audiocassette. This is a first-generation copy
Folder 9: Schwiderski, Richard Craig v. State of Texas 2, 1979-1984
No full textPhotocopy of a section of an article written by New York author Richard Reeves and titled 'Too Late to Kill the Messenger' and dated 1979, and argues for the role of media during violent situations
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
Efficient reduction of nondeterministic automata with application to language inclusion testing
Full text linkWe present efficient algorithms to reduce the size of nondeterministic Büchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalence, and inclusion for much larger instances than was previously possible (≥1000 states instead of 10-100). This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithms are based on new techniques for removing transitions (pruning) and adding transitions (saturation), as well as extensions of classic quotienting of the state space. These techniques use criteria based on combinations of backward and forward trace inclusions and simulation relations. Since trace inclusion relations are themselves PSPACE-complete, we introduce lookahead simulations as good polynomial time computable approximations thereof. Extensive experiments show that the average-case time complexity of our algorithms scales slightly above quadratically. (The space complexity is worst-case quadratic.) The size reduction of the automata depends very much on the class of instances, but our algorithm consistently reduces the size far more than all previous techniques. We tested our algorithms on NBA derived from LTL-formulae, NBA derived from mutual exclusion protocols and many classes of random NBA and NFA, and compared their performance to the well-known automata tool GOAL
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games
Full text linkWe consider simple stochastic games G with energy-parity objectives, a combination of quantitative rewards with a qualitative parity condition. The Maximizer tries to avoid running out of energy while simultaneously satisfying a parity condition.
We present an algorithm to approximate the value of a given configuration in 2-NEXPTIME. Moreover, ε-optimal strategies for either player require at most O(2-EXP(|G|)⋅log(1/ε)) memory modes
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs
Full text linkWe study countably infinite Markov decision processes (MDPs) with real-valued
transition rewards. Every infinite run induces the following sequences of
payoffs: 1. Point payoff (the sequence of directly seen transition rewards), 2.
Mean payoff (the sequence of the sums of all rewards so far, divided by the
number of steps), and 3. Total payoff (the sequence of the sums of all rewards
so far). For each payoff type, the objective is to maximize the probability
that the is non-negative. We establish the complete picture of the
strategy complexity of these objectives, i.e., how much memory is necessary and
sufficient for -optimal (resp. optimal) strategies. Some cases can
be won with memoryless deterministic strategies, while others require a step
counter, a reward counter, or both.Comment: arXiv admin note: substantial text overlap with arXiv:2107.0328
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
6. Winterscheidt (Hans). Aigina. Eine Untersuchung über seine Gesellschaft und Wirtschaff. Würzburg, Richard Mayr, 1938
No full textDaux Georges. 6. Winterscheidt (Hans). Aigina. Eine Untersuchung über seine Gesellschaft und Wirtschaff. Würzburg, Richard Mayr, 1938. In: Revue des Études Grecques, tome 53, fascicule 249, Janvier-mars 1940. pp. 86-87
- …
