113,756 research outputs found
Francés : primer curso o curso preparatorio
No full textNo v. da portada: "Obras declaradas de texto por el Ministerio de Educación Nacional. (B. O. 16-10-1944, 18-3-1946, 24-3-1947)
author-bios-SRD-19-0063.R1 – Supplemental material for The Network Structure of Police Misconduct
No full textSupplemental material, author-bios-SRD-19-0063.R1 for The Network Structure of Police Misconduct by George Wood, Daria Roithmayr and Andrew V. Papachristos in Socius</p
Polynomial approach to the control of SISO periodic systems subject to input constraint
No full textB8
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe 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
Kucera v. Kucera
No full textDocket Number: 96-0169For access to these documents, please log in or contact the reference staff by emailing [email protected] or by calling 402-280-5541 for help locating the desired item
Variations on the Author
No full text“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
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
No full textThe Frequency Assignment Problem (FAP) in radio networks is the problem of
assigning frequencies to transmitters exploiting frequency reuse while keeping
signal interference to acceptable levels.
The FAP is usually modelled by variations of the graph coloring problem. The
Radiocoloring (RC) of a graph is an assignment function such that , when are neighbors in
, and when the distance of in is
two. The range of frequencies used is called {\em span}. Here, we consider the
optimization version of the Radiocoloring
Problem (RCP) of finding a radiocoloring assignment of minimum span, called
{\em min span RCP}.
In this paper, we deal with a variation of RCP: that of satisfying frequency
assignment requests with some {\em periodic} behavior. In this case, the
interference graph is an (infinite) periodic graph. Infinite periodic graphs
model finite networks that accept periodic (in time, e.g. daily) requests for
frequency assignment. Alternatively, they may model very
large networks produced by the repetition of a small graph.
A {\em periodic graph } is defined by an infinite two-way sequence of
repetitions of the same finite graph . The edge set of is
derived by connecting the vertices of each iteration to some of the
vertices of the next iteration , the same for all . The
model of periodic graphs considered here is similar to that of periodic graphs
in Orlin [13], Marathe et al [10]. We focus on planar periodic graphs, because
in many cases real networks are planar and also because of their independent
mathematical interest. We give two basic results:
- We prove that the min span RCP is PSPACE-complete for periodic planar graphs.
- We provide an time algorithm, (where , is the maximum degree of the graph and is the
number of edges connecting each to , which obtains a
radiocoloring of a periodic planar graph G that {\em approximates the minimum
span within a ratio which tends to 2 as tends to
infinity}
- …
