6,540 research outputs found

    Graduate Catalog of Studies, 2023-2024

    Get PDF

    Approximate Computing Survey, Part I: Terminology and Software & Hardware Approximation Techniques

    Full text link
    The rapid growth of demanding applications in domains applying multimedia processing and machine learning has marked a new era for edge and cloud computing. These applications involve massive data and compute-intensive tasks, and thus, typical computing paradigms in embedded systems and data centers are stressed to meet the worldwide demand for high performance. Concurrently, the landscape of the semiconductor field in the last 15 years has constituted power as a first-class design concern. As a result, the community of computing systems is forced to find alternative design approaches to facilitate high-performance and/or power-efficient computing. Among the examined solutions, Approximate Computing has attracted an ever-increasing interest, with research works applying approximations across the entire traditional computing stack, i.e., at software, hardware, and architectural levels. Over the last decade, there is a plethora of approximation techniques in software (programs, frameworks, compilers, runtimes, languages), hardware (circuits, accelerators), and architectures (processors, memories). The current article is Part I of our comprehensive survey on Approximate Computing, and it reviews its motivation, terminology and principles, as well it classifies and presents the technical details of the state-of-the-art software and hardware approximation techniques.Comment: Under Review at ACM Computing Survey

    Tradition and Innovation in Construction Project Management

    Get PDF
    This book is a reprint of the Special Issue 'Tradition and Innovation in Construction Project Management' that was published in the journal Buildings

    "What It Wants Me To Say": Bridging the Abstraction Gap Between End-User Programmers and Code-Generating Large Language Models

    Full text link
    Code-generating large language models translate natural language into code. However, only a small portion of the infinite space of naturalistic utterances is effective at guiding code generation. For non-expert end-user programmers, learning this is the challenge of abstraction matching. We examine this challenge in the specific context of data analysis in spreadsheets, in a system that maps the users natural language query to Python code using the Codex generator, executes the code, and shows the result. We propose grounded abstraction matching, which bridges the abstraction gap by translating the code back into a systematic and predictable naturalistic utterance. In a between-subjects, think-aloud study (n=24), we compare grounded abstraction matching to an ungrounded alternative based on previously established query framing principles. We find that the grounded approach improves end-users' understanding of the scope and capabilities of the code-generating model, and the kind of language needed to use it effectively

    Memory management techniques for large-scale persistent-main-memory systems

    Get PDF
    Storage Class Memory (SCM) is a novel class of memory technologies that promise to revolutionize database architectures. SCM is byte-addressable and exhibits latencies similar to those of DRAM, while being non-volatile. Hence, SCM could replace both main memory and storage, enabling a novel single-level database architecture without the traditional I/O bottleneck. Fail-safe persistent SCM allocation can be considered conditio sine qua non for enabling this novel architecture paradigm for database management systems. In this paper we present PAllocator, a fail-safe persistent SCM allocator whose design emphasizes high concurrency and capacity scalability. Contrary to previous works, PAllocator thoroughly addresses the important challenge of persistent memory fragmentation by implementing an efficient defragmentation algorithm. We show that PAllocator outperforms state-of-the-art persistent allocators by up to one order of magnitude, both in operation throughput and recovery time, and enables up to 2.39x higher operation throughput on a persistent B-Tree

    Synthesizing Conjunctive Queries for Code Search

    Get PDF
    This paper presents Squid, a new conjunctive query synthesis algorithm for searching code with target patterns. Given positive and negative examples along with a natural language description, Squid analyzes the relations derived from the examples by a Datalog-based program analyzer and synthesizes a conjunctive query expressing the search intent. The synthesized query can be further used to search for desired grammatical constructs in the editor. To achieve high efficiency, we prune the huge search space by removing unnecessary relations and enumerating query candidates via refinement. We also introduce two quantitative metrics for query prioritization to select the queries from multiple candidates, yielding desired queries for code search. We have evaluated Squid on over thirty code search tasks. It is shown that Squid successfully synthesizes the conjunctive queries for all the tasks, taking only 2.56 seconds on average

    IMAGINING, GUIDING, PLAYING INTIMACY: - A Theory of Character Intimacy Games -

    Get PDF
    Within the landscape of Japanese media production, and video game production in particular, there is a niche comprising video games centered around establishing, developing, and fulfilling imagined intimate relationships with anime-manga characters. Such niche, although very significant in production volume and lifespan, is left unexplored or underexplored. When it is not, it is subsumed within the scope of wider anime-manga media. This obscures the nature of such video games, alternatively identified with descriptors including but not limited to ‘visual novel’, ‘dating simulator’ and ‘adult computer game’. As games centered around developing intimacy with characters, they present specific ensembles of narrative content, aesthetics and software mechanics. These ensembles are aimed at eliciting in users what are, by all intents and purposes, parasocial phenomena towards the game’s characters. In other words, these software products encourage players to develop affective and bodily responses towards characters. They are set in a way that is coherent with shared, circulating scripts for sexual and intimate interaction to guide player imaginative action. This study defines games such as the above as ‘character intimacy games’, video game software where traversal is contingent on players knowingly establishing, developing, and fulfilling intimate bonds with fictional characters. To do so, however, player must recognize themselves as playing that type of game, and to be looking to develop that kind of response towards the game’s characters. Character Intimacy Games are contingent upon player developing affective and bodily responses, and thus presume that players are, at the very least, non-hostile towards their development. This study approaches Japanese character intimacy games as its corpus, and operates at the intersection of studies of communication, AMO studies and games studies. The study articulates a research approach based on the double need of approaching single works of significance amidst a general scarcity of scholarly background on the subject. It juxtaposes data-driven approaches derived from fan-curated databases – The Visual Novel Database and Erogescape -Erogē Hyōron Kūkan – with a purpose-created ludo-hermeneutic process. By deploying an observation of character intimacy games through fan-curated data and building ludo-hermeneutics on the resulting ontology, this study argues that character intimacy games are video games where traversal is contingent on players knowingly establishing, developing, and fulfilling intimate bonds with fictional characters and recognizing themselves as doing so. To produce such conditions, the assemblage of software mechanics and narrative content in such games facilitates intimacy between player and characters. This is, ultimately, conductive to the emergence of parasocial phenomena. Parasocial phenomena, in turn, are deployed as an integral assumption regarding player activity within the game’s wider assemblage of narrative content and software mechanics

    Analýza a klasifikace nabíjecích dat pro mikro sítě

    Get PDF
    This thesis aims to develop a classification model for electric vehicles (EVs) based on data from EV charging stations.The study utilizes a dataset of 6 charging sessions from EV charging station and implements two deep learning algorithm including LSTM and Auto-Encoders to classify EVs. The performance of the classification model is evaluated based on accuracy rates & precision.The study also identifies key charging characteristics that are most significant in distinguishing between different types of EVs, including charging time, energy consumption, and charging patterns.The findings of this research have significant implications for the development of EV charging infras- tructure and services. The classification model developed in this thesis can be used to optimize charging station operations, improve charging services, and develop EV adoption strategies. The study also highlights the importance of utilizing data from EV charging stations in understanding the EV market and improving the efficiency of charging infrastructure.Tato práce si klade za cíl vyvinout model klasifikace elektrických vozidel (EV) založený na datech z nabíjecích stanic pro elektromobily. Studie využívá datovou sadu 6 nabíjecích relací z nabíjecí stanice pro elektromobily a implementuje dva algoritmy hlubokého učení, včetně LSTM a Auto- Encoders pro klasifikaci EV. . Výkon klasifikačního modelu je hodnocen na základě míry přesnosti a preciznosti. Studie také identifikuje klíčové charakteristiky nabíjení, které jsou nejvýznamnější při rozlišování mezi různými typy elektromobilů, včetně doby nabíjení, spotřeby energie a vzorců nabí- jení. Zjištění tohoto výzkumu mají významné důsledky pro rozvoj infrastruktury a služeb nabíjení elektromobilů. Klasifikační model vyvinutý v této práci lze použít k optimalizaci provozu nabíjecích stanic, zlepšení nabíjecích služeb a rozvoji strategií přijetí elektromobilů. Studie také zdůrazňuje důležitost využití dat z nabíjecích stanic pro elektromobily pro pochopení trhu s elektromobily a zlepšení efektivity nabíjecí infrastruktury450 - Katedra kybernetiky a biomedicínského inženýrstvívýborn

    20th SC@RUG 2023 proceedings 2022-2023

    Get PDF
    corecore