Programmers forgo existing solutions to problems in other programming lan- guages where software interoperation proves too cumbersome; they remake so- lutions, rather than reuse them. To facilitate reuse, interoperation must resolve language incompatibilities transparently. To address part of this problem, we present a model of computation that resolves incompatible lazy and eager eval- uation strategies using dual notions of evaluation contexts and values to mirror the lazy evaluation strategy in the eager one. This method could be extended to resolve incompatible evaluation strategies for any pair of languages with common expressions.

Numerical information is ubiquitous and people are continuously engaged in evaluating it by means of intuitive statistical judgments. Much research has evaluated if people’s judgments live up to the norms of statistical theory but directed far less attention to the cognitive processes that underlie the judgments. The present thesis outlines, compares, and tests two cognitive models for intuitive statistical judgments, summarized in the metaphors of the lazy and eager intuitive statistician. In short, the lazy statistician postpones judgments to the time of a query when the properties of a small sample of values retrieved from memory serve as proxies for population properties. In contrast, the eager statistician abstracts summary representations of population properties online from incoming data. Four empirical studies were conducted. Study I outlined the two models and investigated whether an eager or a lazy statistician best describes how people make intuitive statistical judgments. In general the results supported the notion that people spontaneously engage in a lazy process. Under certain specific conditions, however, participants were able to induce abstract representations of the experienced data. Study II and Study III extended the models to describe naive point estimates (Study II) and inference about a generating distribution (Study III). The results indicated that both the former and the latter type of judgment was better described by a lazy than an eager model. Finally, Study IV, building on the support in Studies I-III, investigated boundary conditions for a lazy model by exploring if statistical judgments are influenced by common memory effects (primacy and recency). The results indicated no such effects, suggesting that the sampling from long-term memory in a lazy process is not conditional on when the data is encountered. The present thesis makes two major contributions. First, the lazy and eager models are first attempts at outlining a process model that could possibly be applied for a large variety of statistical judgments. Second, because a lazy process imposes boundary conditions on the accuracy of statistical judgments, the results suggest that the limitations of a lazy intuitive statistician would need to be taken into consideration in a variety of situations.

This thesis describes and evaluates a new approach to optimizing DRAM performance and energy consumption that is based on eagerly writing dirty cache lines to DRAM. Under this approach, dirty cache lines that have not been recently accessed are eagerly written to DRAM when the corresponding row has been activated by an ordinary access, such as a read. This approach enables clustering of reads and writes that target the same row, resulting in a significant reduction in row activations. Specifically, for 29 applications, it reduces the number of DRAM row activations by an average of 38% and a maximum of 81%. The results from a full system simulator show that for the 29 applications, 11 have performance improvements between 10% and 20%, and 9 have improvements in excess of 20%. Furthermore, 10 consume between 10% and 20% less DRAM energy, and 10 have energy consumption reductions in excess of 20%.

Software Transactional Memory (STM) helps programmers write correct concurrent code by allowing them to identify atomic sections rather than focusing on the mechanics of concurrency control. Given code with atomic sections, the compiler and STM runtime can work together to ensure proper controlled access to shared memory. STM runtimes use either lazy or eager version management. Lazy versioning buffers transaction updates, whereas eager versioning applies updates in-place. The current set of primitives suit lazy versioning since memory needs to be accessed through the runtime. We present a new set of runtime primitives that better suit eager versioned STM. We propose a novel extension to the compiler/runtime interface, consisting of memory reservations and memory releases. These extensions enable optimizations specific to eager versioned runtimes. A memory reservation allows a transaction to perform instrumentation-free access on a memory address. A release allows a read-only address to be modified by another transaction. Together, these reduce the instrumentation overhead required to support STM and improve concurrency between readers and writers. We have implemented these primitives and evaluated its performance on the STAMP benchmarks. Our results show strong performance and scalability improvements to eager versioned algorithms.

Software Transactional Memory (STM) helps programmers write correct concurrent code by allowing them to identify atomic sections rather than focusing on the mechanics of concurrency control. Given code with atomic sections, the compiler and STM runtime can work together to ensure proper controlled access to shared memory. STM runtimes use either lazy or eager version management. Lazy versioning buffers transaction updates, whereas eager versioning applies updates in-place. The current set of primitives suit lazy versioning since memory needs to be accessed through the runtime. We present a new set of runtime primitives that better suit eager versioned STM. We propose a novel extension to the compiler/runtime interface, consisting of memory reservations and memory releases. These extensions enable optimizations specific to eager versioned runtimes. A memory reservation allows a transaction to perform instrumentation-free access on a memory address. A release allows a read-only address to be modified by another transaction. Together, these reduce the instrumentation overhead required to support STM and improve concurrency between readers and writers. We have implemented these primitives and evaluated its performance on the STAMP benchmarks. Our results show strong performance and scalability improvements to eager versioned algorithms.

Många verksamheter representeras idag på internet i omodern stil vilket kan påverka besökarens uppfattning om verksamheten negativt. I detta arbete har en webbsida rekonstruerats. Webbsidan tillhör en förening med verksamhet inom gaming och esport. Rekonstruktionen är till för att ge besökare en klar bild av vad föreningens huvudverksamhet är och för att integrera streamingtjänsten Twitch för att ge besökare ytterligare en anledning att återbesöka sidan. Dessutom har laddningstiden för startsidan optimerats för att ge bättre besökupplevelse. Med hjälp av Redis och metoden Eager loading visar arbetet hur man kan sänka laddningstiden på en webbsida.

Annotation: Málková, Eva. Church Music of Johann Sebastian Bach. Prague: Hussite Theological Faculty, Charles University, 2012. Thesis. The aim of this thesis is to introduce church music of Johann Sebastian Bach and its theological announcement. By looking up and appraising musical-theological elements at Bach's work this thesis brings near to the reader the theological, philosophical and mystic thinking of Bach. By pre-understanding and complexity of perception of Bach's church music is possible to see deep sense and aim of artist's work. In the first (theoretical) part I am engaged in systems of thinking that could Bach's church work influence. Then I am specifying the pieces that are supposed to be church music. In the second (practical) part I am looking for musical- theological elements that could Bach be influenced with. By researching of Bach's artistic style I am trying to find correlation of musical and theological contents and I am trying to point out that the message of Bach's church work is relevant.

No description available.

The current popular, distributed, n-tiered, object-oriented application architecture pro- vokes many design debates. Designs of such applications are often divided into logical layer (or tiers) - usually user interface, business logic and domain object (or data) layer, each with their own design issues. In particular, the latter contains data that needs to be stored and retrieved from permanent storage. Decisions need to be made as to the most appropriate way of doing this - the choices are usually whether to use an object database, to communicate directly with a relational database, or to use object-relational mapping (ORM) tools to allow objects to be translated to and from their relational form. Most often, depending on the perceived profile of the application, software architects make these decisions using rules of thumb derived from particular experience or the design patterns literature. Although helpful, these rules are often highly context-dependent and are of- ten misapplied. Research into the nature and magnitude of 'design forces' in this area has resulted in a series of benchmarks, intended to allow architects to understand more clearly the implications of design decisions concerning persistence. This study provides some results to help guide the architect's decisions. The study investigated and focused on the <i.performance of object persistence and com- pared ORM tools to object databases. ORM tools provide an extra layer between the business logic layer and the data layer. This study began with the hypothesis that this extra layer and mapping that happens at that point, slows down the performance of object persistence. The aim was to investigate the influence of this extra layer against the use of object databases that remove the need for this extra mapping layer. The study also investigated the impact of certain optimisation techniques on performance. A benchmark was used to compare ORM tools to object databases. The benchmark provided criteria that were used to compare them with each other. The particular benchmark chosen for this study was OO7, widely used to comprehensively test object persistence performance. Part of the study was to investigate the OO7 benchmark in greater detail to get a clearer understanding of the OO7 benchmark code and inside workings thereof. Included in this study was a comparison of the performance of an open source object database, db4o, against a proprietary object database, Versant. These representatives of object databases were compared against one another as well as against Hibernate, a popular open source representative of the ORM stable. It is important to note that these applications were initially used in their default modes (out of the box). Later some optimisation techniques were incorporated into the study, based on feedback obtained from the application developers. There is a common perception that an extra layer as introduced by Hibernate nega- tively impacts on performance. This study showed that such a layer has minimal impact on the performance. With the use of caching and other optimisation techniques, Hibernate compared well against object databases. Versant, a proprietary object database, was faster than Hibernate and the db4o open source object database. Copyright / Dissertation (MSc)--University of Pretoria, 2010. / Computer Science / unrestricted