14,272 research outputs found

    On Becoming Human in Lingít Aaní: Encountering Levinas through Indigenous Inspirations

    Get PDF
    Calls for taking up wisdom in its place risk re-inscribing coloniality at the level of signification if attempts to resituate intelligibility in the specificity of place are not enacted through a careful translation of experience between victims and perpetrators of colonial violence. At some level, decolonization ought to be conceived as a kind of translation. Emmanuel Levinas' project to "translate" Judaism into Greek is one way of staging such decolonial translation by providing us an internal critique of coloniality while remaining receptive to indigenous inspirations that enrich eco-phenomenological ways of encountering place. In the final instance, however, this paper calls for encountering place through the indigenous languages that make place ethically legible. [ABSTRACT FROM AUTHOR]Ye

    It\u27s a Business: A Financial Analysis of the BCS System and Its Alternatives

    Get PDF
    There is an annual debate over the structure of the postseason format of college football. In this thesis, the current format is explained, along with two popular alternatives. Gameday profitability is determined for each of the three formats to provide an answer to the question of which format is the most lucrative

    A Lyapunov Optimization Approach to Repeated Stochastic Games

    Full text link
    This paper considers a time-varying game with NN players. Every time slot, players observe their own random events and then take a control action. The events and control actions affect the individual utilities earned by each player. The goal is to maximize a concave function of time average utilities subject to equilibrium constraints. Specifically, participating players are provided access to a common source of randomness from which they can optimally correlate their decisions. The equilibrium constraints incentivize participation by ensuring that players cannot earn more utility if they choose not to participate. This form of equilibrium is similar to the notions of Nash equilibrium and correlated equilibrium, but is simpler to attain. A Lyapunov method is developed that solves the problem in an online \emph{max-weight} fashion by selecting actions based on a set of time-varying weights. The algorithm does not require knowledge of the event probabilities and has polynomial convergence time. A similar method can be used to compute a standard correlated equilibrium, albeit with increased complexity.Comment: 13 pages, this version fixes an incorrect statement of the previous arxiv version (see footnote 1, page 5 in current version for the correction

    John Charles Wills: Reminiscences of the Three Days Battle of Gettysburg at the Globe Hotel

    Full text link
    John Charles Wills left the fullest account of what happened at and around the Globe Inn in the borough of Gettysburg during the Battle. In July of 1910, the Gettysburg Compiler interviewed Wills and printed a short story of his observations and experience during the Gettysburg Campaign entitled, Battle Days at Globe Inn. In September of 1915, Wills once again shared his memories of the Battle of Gettysburg, this time in greater length. Fifty two years had passed since the battle occurred and Wills was approximately 77 years old. The 1910 and 191 5 reminiscences are remarkably similar indicating perhaps a good memory or years of re-telling the same stories. Wills does not offer an introduction to his account nor comment on any limitation of his memory. He drifted outside of the timeline of his story on occasion; some of his stories can be refuted, while others cannot be substantiated with any evidence. Wills refers to certain homes and businesses in his account using them as landmarks. It would be easy to assume that his references are to the Gettysburg of 1863; however, several of these places mentioned did not yet exist in 1863 but were contemporary landmarks in the Gettysburg of the early twentieth-century. [excerpt

    Bridges to the Baccalaureate Program at J. Sargeant Reynolds Community College and Virginia Commonwealth University

    Get PDF
    This paper describes a research apprenticeship to encourage and to inspire minority students to major in disciplines that lead to careers in biomedical research

    Low Power Dynamic Scheduling for Computing Systems

    Full text link
    This paper considers energy-aware control for a computing system with two states: "active" and "idle." In the active state, the controller chooses to perform a single task using one of multiple task processing modes. The controller then saves energy by choosing an amount of time for the system to be idle. These decisions affect processing time, energy expenditure, and an abstract attribute vector that can be used to model other criteria of interest (such as processing quality or distortion). The goal is to optimize time average system performance. Applications of this model include a smart phone that makes energy-efficient computation and transmission decisions, a computer that processes tasks subject to rate, quality, and power constraints, and a smart grid energy manager that allocates resources in reaction to a time varying energy price. The solution methodology of this paper uses the theory of optimization for renewal systems developed in our previous work. This paper is written in tutorial form and develops the main concepts of the theory using several detailed examples. It also highlights the relationship between online dynamic optimization and linear fractional programming. Finally, it provides exercises to help the reader learn the main concepts and apply them to their own optimizations. This paper is an arxiv technical report, and is a preliminary version of material that will appear as a book chapter in an upcoming book on green communications and networking.Comment: 26 pages, 10 figures, single spac

    Application of improved numerical schemes

    Get PDF
    Two approaches which accelerate the solution of the steady state Navier-Stokes equations are discussed. The SIMPLER algorithm, a revised version of SIMPLE, provides a more accurate pressure field for each iteration through the momentum equations, thereby speeding convergence. PISO (Pressure Implicit Split Operator), performs a secondary correction of the velocity and pressure fields (after the typical pressure correction) which enhances convergence. Both schemes account for terms neglected in the SIMPLE approach, but do so in slightly different ways. Two dimensional driven cavity flow and flow over a step were calculated to examine the effect of geometry on the performance of these schemes. Computations were carried out on a series of progressively finer grids. The effect of relaxation number on convergence rate was analyzed, using results from SIMPLE as criteria for performance correlation. Results show: (1) the improved schemes promoted convergence by up to 60% for the driven cavity and 40% for flow over a step; (2) for the driven cavity problem, the efficiency of PISO and SIMPLER increased as the number of nodes increased; and (3) to ensure faster convergence, higher relaxation numbers must be applied
    corecore