1,720,972 research outputs found
Implementing first-order rewriting with constructor systems
No full textIn previous work [8] we described a technique for translating a general class of equational rewriting systems called regular systems [3] to constructor-based systems. This paper extends the previous results by showing that the translation technique described in [8] is much more generally applicable under a slight restriction of rewriting in the translated version of the system. The three additional classes we consider are those of semiregular systems (a generalization of regular systems), canonical systems, and arbitrary call-by-value confluent systems. It is shown that in each case the translation preserves the defining characteristics and normal forms of the class.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/27107/1/0000099.pd
A refinement of strong sequentiality for term rewriting with constructors
Get PDFThe notion of call-by-need evaluation has turned out to be very fruitful when applied to dialects of the [lambda]-calculus (Henderson and Morris, 1976, in "Proc. 3rd ACM Symp. on the Principles of Programming Languages, Atlanta; Kahn and Mac Queen, 1977, in "IFIP 77", North-Holland, Amsterdam; Turner, 1979, Software Practice and Experience, Vol. 9; Vuillemin, 1974, J. Comput. Systems Sci., 9, 332-354; Wadsworth, 1971, Ph.D. dissertation, Oxford University, England). The analogous idea of sequentiality for term rewriting systems described by firstorder equations has been considered by , in "Proc. 5th ACM Symp. on the Principles of Programming Languages, San Antonio", 1984, in "Proc. 11th ACM Symp. on the Principles of Programming Languages, Salt Lake City) and Huet-Levy (1979, Technical Report No. 359, INRIA, Le Chesney, France), of which the latter is generally considered to be the most complete theoretical treatment of the subject to date. Huet-Levy (1979) defined the notion of strong sequentiality to describe the class of linear term rewriting systems for which call-by-need computation is practical. This paper introduces an improved version of strong sequentiality called left sequentiality. Unlike strong sequentiality, left sequentiality is based on possible rather than arbitrary (and often impossible) sequences of reductions. We show that left sequentiality is more general than strong sequentiality when applied to individual terms, but is equivalent to the latter when cosidered as a property of admissible sets of left-hand sides for systems of equations. Huet-Levy (1979) showed that there are safe redex selection algorithms, i.e., algorithms deriving normal forms whenever possible, for systems based on strongly sequential sets of left-hand sides. We show that there is no algorithm which is safe for all systems based on a set of left-hand sides if that set is not left sequential. In other words, left sequentiality is not only sufficient, it is also necessary for safe computation based on the analysis of left-hand sides alone.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/26861/1/0000426.pd
Fault Diagnosis of Semiconductor Random Access Memories
Get PDFMade available in DSpace on 2015-04-22T02:53:37Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
B35-769.pdf: 22072178 bytes, checksum: 6d8ae34606e02a014858febbb4b36d56 (MD5)
Previous issue date: 1977-05Embargo set by: Seth Robbins for item 76376
Lift date: Forever
Reason: Restricted to UIUC communityMade available in DSpace on 2017-07-14T23:57:43Z (GMT). No. of bitstreams: 3
B35-769.pdf.txt: 88246 bytes, checksum: e6eb4632f2f2e1546024a4ecb5eccc21 (MD5)
B35-769.pdf: 23567999 bytes, checksum: 80722b6b1e9be1285263fe7b84321899 (MD5)
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
Previous issue date: 1977-05Embargo set by: Seth Robbins for item 100821
Lift date: Forever
Reason: Restricted to UIUC communityOpen Restriction set for Item 100821 on 2019-11-15T17:33:23Z with date null by [email protected] Services Electronics Program / DAAB-07-72-C-0259OpenCoordinated Science Laboratory was formerly known as Control Systems Laboratory"Author name appears as ""Satish Munkund Thatte"" in front matter
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
A type system for implicit scaling
No full textAbstractWe describe a novel application of subtyping in which a small orthogonal set of structural subtyping rules are used to capture the notion of scaling—an unusual variety of polymorphism found in APL-like languages which is attracting renewed interest due to its applications in data parallel programming. The subtyping approach allows us to provide a simple coercion-based semantics for an orthogonal interpretation of scaling whose generality goes well beyond what is available in APL dialects. Moreover, the results are independent of the structure to which scaling is applied—they apply equally well to lists, vectors, trees, or to any other structure usable for representing sets
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
- …
