953 research outputs found
Revenge is a dish best served on a broken plate: the enfant terrible in Igor Stravinsky and Arnold Schoenberg
No full textDoes an artist create in a vacuum or is there more at stake in a work’s
production than art for art’s sake? A great deal has been written about The Rite
of Spring by Igor Stravinsky and the atonal works of Arnold Schoenberg, much of
which has depicted their works as autonomous objects – objects that embodied
an inevitable step in a natural evolution of Western art music. This essay
reconsiders these works not as the product of Hegelian evolution, but as social
acts of symbolic violence against cultural establishments in Saint Petersburg and
Vienna by two remarkably similar personalities. Following an overview of their
social and professional development, this essay considers primary sources on
Stravinsky and Schoenberg in light of recent psychological research on identity.
The system of sign and myth outlined by semiologist Roland Barthes is then
brought to bear on Stravinsky’s Rite and Schoenberg’s Erwartung to further
analyze conservative versus radical reception of these works. The essay concludes with a discussion of the concepts of cultural capital, symbolic violence and collective misrecognition proposed by the sociologist Pierre Bourdieu as they relate to theoretical and historical writing on Stravinsky and Schoenberg later in the twentieth-century.Ph. D.Includes bibliographical referencesby Dag Gabrielse
Cut-elimination, substitution and normalisation
No full textDate of Acceptance: 01/2015We present a proof (of the main parts of which there is a formal version, checked with the Isabelle proof assistant) that, for a G3-style calculus covering all of intuitionistic zero-order logic, with an associated term calculus, and with a particular strongly normalising and confluent system of cut-reduction rules, every reduction step has, as its natural deduction translation, a sequence of zero or more reduction steps (detour reductions, permutation reductions or simplifications). This complements and (we believe) clarifies earlier work by (e.g.) Zucker and Pottinger on a question raised in 1971 by Kreisel.Peer reviewe
Book Review: Die dag is bros. Sandton City Grootdoop
No full textBook Title: Die dag is bros. Sandton City GrootdoopBook Author: Wessel PretoriusProtea Boekhuis, 2017. 137 pp. ISBN 978-1-4853-0652-8 (gedrukte boek). ISBN 978-1-4853-0653-5 (e-boek). ISBN 978-1-4853-0654-2 (ePub)
A Resiliency-First Approach to Distributed DAG Computations
No full textA framework is introduced for computations with transformations on immutable data. Inspiration is taken from Apache Spark, however the model of computation is generalized from an emphasis on narrow and wide dependencies, to an arbitrary set of transformations that form a directed acyclic graph (DAG). A distributed scheduling algorithm is developed with resiliency mechanisms that can account for stopping failure. Furthermore some properties of the system are derived. Finally future work is discussed showing there is fertile ground for further research and development to extend this work.Computer Engineerin
Size of interventional Markov equivalence classes in random DAG models
No full text© 2019 by the author(s). Directed acyclic graph (DAG) models are popular for capturing causal relationships. From observational and interventional data, a DAG model can only be determined up to its interventional Markov equivalence class (I-MEC). We investigate the size of MECs for random DAG models generated by uniformly sampling and ordering an Erdős-Rényi graph. For constant density, we show that the expected log observational MEC size asymptotically (in the number of vertices) approaches a constant. We characterize I-MEC size in a similar fashion in the above settings with high precision. We show that the asymptotic expected number of interventions required to fully identify a DAG is a constant. These results are obtained by exploiting Meek rules and coupling arguments to provide sharp upper and lower bounds on the asymptotic quantities, which are then calculated numerically up to high precision. Our results have important consequences for experimental design of interventions and the development of algorithms for causal inference
Response-Time Analysis of Limited-Preemptive Parallel DAG Tasks Under Global Scheduling
No full textMost recurrent real-time applications can be modeled as a set of sequential code segments (or blocks) that must be (repeatedly) executed in a specific order. This paper provides a schedulability analysis for such systems modeled as a set of parallel DAG tasks executed under any limited-preemptive global job-level fixed priority scheduling policy. More precisely, we derive response-time bounds for a set of jobs subject to precedence constraints, release jitter, and execution-time uncertainty, which enables support for a wide variety of parallel, limited-preemptive execution models (e.g., periodic DAG tasks, transactional tasks, generalized multi-frame tasks, etc.). Our analysis explores the space of all possible schedules using a powerful new state abstraction and state-pruning technique. An empirical evaluation shows the analysis to identify between 10 to 90 percentage points more schedulable task sets than the state-of-the-art schedulability test for limited-preemptive sporadic DAG tasks. It scales to systems of up to 64 cores with 20 DAG tasks. Moreover, while our analysis is almost as accurate as the state-of-the-art exact schedulability test based on model checking (for sequential non-preemptive tasks), it is three orders of magnitude faster and hence capable of analyzing task sets with more than 60 tasks on 8 cores in a few seconds
Size of interventional Markov equivalence classes in random DAG models
No full text© 2019 by the author(s). Directed acyclic graph (DAG) models are popular for capturing causal relationships. From observational and interventional data, a DAG model can only be determined up to its interventional Markov equivalence class (I-MEC). We investigate the size of MECs for random DAG models generated by uniformly sampling and ordering an Erdős-Rényi graph. For constant density, we show that the expected log observational MEC size asymptotically (in the number of vertices) approaches a constant. We characterize I-MEC size in a similar fashion in the above settings with high precision. We show that the asymptotic expected number of interventions required to fully identify a DAG is a constant. These results are obtained by exploiting Meek rules and coupling arguments to provide sharp upper and lower bounds on the asymptotic quantities, which are then calculated numerically up to high precision. Our results have important consequences for experimental design of interventions and the development of algorithms for causal inference.NSF (Grant DMS- 1651995)ONR (Contracts N00014-17-1-2147 and N00014-18-1- 2765
Fine-grained Scheduling of Real-Time Recurrent DAG Tasks upon Multiprocessor Platforms
No full textWith the strong demand for computing capacity in industrial applications and the rapid development of the hardware industry in recent years, multiprocessor platforms have been widely used in real-time embedded systems. The quest for performance has led to existing multiprocessor platforms often featuring complex interconnected hardware components and multiple levels of cache. This brings negative interference to the execution of tasks and challenges the predictability of real-time systems. However, existing non-preemptive execution models are an effective solution to eliminate these negative effects. In addition to this, the tasks that modern real-time systems process are becoming increasingly complex. Traditional sequential task models cannot cope with this situation and a stronger expressive model is required. A directed acyclic graph (DAG) that can express the complexity and parallelism of these tasks is a suitable model.In this thesis, we focus on priority-based scheduling algorithms for multiple parallel DAG tasks on non-preemptive multiprocessor platforms, investigating, analysing, and improving existing global and partitioned scheduling algorithms.We propose the concept of stacks to simulate a multi-processor platform and apply release-time tuning techniques based on its simulation of a task set in a hyperperiod. This allows us to impose tighter constraints on the execution of each job released from a task set in a fine-grained manner. We improved the existing priority-based global scheduling algorithm through the release-time tuning technique mentioned above. We also tried to construct a partitioned scheduling algorithm using the simulation results of stacks, i.e. so that all jobs are restricted to run on only one processor, consistent with the simulation results. Furthermore, to compare different scheduling algorithms more efficiently and to facilitate future researchers, we have developed the evaluation framework, a customisable experimental platform that includes DAG generation, application of scheduling algorithms, generation and analysis of the test results, allowing users to specify their experiments according to their goals.Experiments with randomly generated workloads show that our improved algorithm consistently outperforms the state-of-the-art priority-based scheduling algorithm for different task graph structures and parameter configurations.Electrical Engineering | Embedded System
Smärta, skönhet och sociomaterialitet : En intervju med Dag Østerberg om begreppen form, förändring och socialitet
No full textPain, beauty, and socio-matter. An interview with Dag Østerberg concerning the concepts of form, process, and sociality. Professor Dag Østerberg (born 1938) is one of the most prominent Nordic sociologists and the author of many influential books. In this interview he discusses the concept of form in sociology and social thinking and relates it not only to change, but to sociality, pain, beauty, and socio-matter as well. In order to contextualise Østerberg’s discussion, the interview is prefaced by a brief introduction to the traditional understanding of form as related to matter and content.Sociologisk Forsknings digitala arkiv</p
- …
