1,720,963 research outputs found
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
On the correspondence between two classes of reduction systems
Get PDFPeer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/25754/1/0000314.pd
Full abstraction and limiting completeness in equational languages
Get PDFThis paper introduces a notion of full abstraction for equational languages under which each language has a unique fully abstract model which can also be characterized as the final object in a category of coherent computable models for the language. We describe two potentially different approaches to limiting completeness with respect to the fully abstract model--a traditional one based on normal forms and a new one based on the usable data content of terms. The former is used to prove limiting completeness for the language of regular systems [5] which includes as subsets and restrictions the equational parts of many other languages. The latter is used to define an abstract version of limiting completeness based on information systems [17] which allows us to derive a set of sufficient conditions for an equational language to be limiting complete for its fully abstract semantics. We discuss cases where the two notions coincide--as they do for regular systems--and cases where they do not. We believe that limiting completeness based on observable data content accurately reflects programming intuition. If this thesis is accepted, the appropriateness of the corresponding definition of approximant can be seen as a design principle to test the mutual suitability of the parameters defining a language.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/27882/1/0000296.pd
Finite Acyclic Theories are Unitary
No full textAbstractThe main result in this paper is that the class of finite acyclic theories contains only unitary theories. As far as we are aware, this is the first class of unitary theories to be discovered. Interestingly, two of the known unitary theories (those of left and right distributivity) belong to this class. Moreover, it is possible to construct a universal unification procedure for this class of theories—the procedure is similar to the one developed by Kirchner for decomposable theories (generalizing the efficient free-unification algorithm of Martelli and Montanari). The decidability of unification in an arbitrary finite acyclic theory is open. The termination technique developed by Tiden and Arnborg for one-sided distributivity appears to be adaptable for many but not for all theories in the class
Type inference with partial types
No full textAbstractAs a partial solution to the problem of combining static and dynamic typing in a language with parametric polymorphism, this paper introduces a new form of type expressions which represent partial type information. These expressions are meant to capture the type information statically derivable from heterogeneous objects. The new ground types form a semilattice of subtypes and require type inference based on inclusion constraints. We discuss the existence and form of principal types under this extension and present a semi-decision procedure for the complete type inference problem
Demand driven evaluation with equations
No full texthttp://deepblue.lib.umich.edu/bitstream/2027.42/7924/5/bad3272.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/7924/4/bad3272.0001.001.tx
BizTalk integration server architecture
No full textWe begin with a brief explanation of how we view the current integration landscape. The paper then describes the mission and architecture of BizTalk Server, which is Microsoft's integration server product. We conclude with some thoughts on the future of the business integration domain, which we believe is still in the early stages of its technology lifecycle. The range of target problems, processing models and even architecture principles for integration solutions are likely to be evolving rapidly for some time
Model-Driven and Pattern-Based Integration of Process-Driven SOA Models
No full textService-oriented architectures (SOA) are increasingly used in the context of business processes. However, the
modeling approaches for process-driven SOAs do not yet sufficiently integrate the various kinds of models relevant
for a process-driven SOA - ranging from process models to software architectural models to software design models.
We propose to integrate process-driven SOA models via a model-driven software development approach that is based
on proven practices documented as software patterns. We introduce pattern primitives as an intermediate abstraction
to formally model the participants in the solutions that patterns convey. To enable model-driven development, we
develop domain-specific modeling languages for each kind of process-driven SOA model - based on formal metamodels
that are extended with the pattern primitives. The various process-driven SOA models are integrated in a
model-driven tool chain via the meta-models. Our tool chain validates the process-driven SOA models with regard
to the constraints given by the meta-models and primitives
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
- …
