Scalable Dynamic Analysis Of Binary Code

DOWNLOAD

Download Scalable Dynamic Analysis Of Binary Code PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Scalable Dynamic Analysis Of Binary Code book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page

Scalable Dynamic Analysis Of Binary Code

DOWNLOAD
Author : Ulf Kargén
language : en
Publisher: Linköping University Electronic Press
Release Date : 2019-08-22

Scalable Dynamic Analysis Of Binary Code written by Ulf Kargén and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2019-08-22 with categories.

In recent years, binary code analysis, i.e., applying program analysis directly at the machine code level, has become an increasingly important topic of study. This is driven to a large extent by the information security community, where security auditing of closed-source software and analysis of malware are important applications. Since most of the high-level semantics of the original source code are lost upon compilation to executable code, static analysis is intractable for, e.g., fine-grained information flow analysis of binary code. Dynamic analysis, however, does not suffer in the same way from reduced accuracy in the absence of high-level semantics, and is therefore also more readily applicable to binary code. Since fine-grained dynamic analysis often requires recording detailed information about every instruction execution, scalability can become a significant challenge. In this thesis, we address the scalability challenges of two powerful dynamic analysis methods whose widespread use has, so far, been impeded by their lack of scalability: dynamic slicing and instruction trace alignment. Dynamic slicing provides fine-grained information about dependencies between individual instructions, and can be used both as a powerful debugging aid and as a foundation for other dynamic analysis techniques. Instruction trace alignment provides a means for comparing executions of two similar programs and has important applications in, e.g., malware analysis, security auditing, and plagiarism detection. We also apply our work on scalable dynamic analysis in two novel approaches to improve fuzzing — a popular random testing technique that is widely used in industry to discover security vulnerabilities. To use dynamic slicing, detailed information about a program execution must first be recorded. Since the amount of information is often too large to fit in main memory, existing dynamic slicing methods apply various time-versus-space trade-offs to reduce memory requirements. However, these trade-offs result in very high time overheads, limiting the usefulness of dynamic slicing in practice. In this thesis, we show that the speed of dynamic slicing can be greatly improved by carefully designing data structures and algorithms to exploit temporal locality of programs. This allows avoidance of the expensive trade-offs used in earlier methods by accessing recorded runtime information directly from secondary storage without significant random-access overhead. In addition to being a standalone contribution, scalable dynamic slicing also forms integral parts of our contributions to fuzzing. Our first contribution uses dynamic slicing and binary code mutation to automatically turn an existing executable into a test generator. In our experiments, this new approach to fuzzing achieved about an order of magnitude better code coverage than traditional mutational fuzzing and found several bugs in popular Linux software. The second work on fuzzing presented in this thesis uses dynamic slicing to accelerate the state-of-the-art fuzzer AFL by focusing the fuzzing effort on previously unexplored parts of the input space. For the second dynamic analysis technique whose scalability we sought to improve — instruction trace alignment — we employed techniques used in speech recognition and information retrieval to design what is, to the best of our knowledge, the first general approach to aligning realistically long program traces. We show in our experiments that this method is capable of producing meaningful alignments even in the presence of significant syntactic differences stemming from, for example, the use of different compilers or optimization levels.

Parameterized Verification Of Synchronized Concurrent Programs

DOWNLOAD
Author : Zeinab Ganjei
language : en
Publisher: Linköping University Electronic Press
Release Date : 2021-03-19

Parameterized Verification Of Synchronized Concurrent Programs written by Zeinab Ganjei and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2021-03-19 with categories.

There is currently an increasing demand for concurrent programs. Checking the correctness of concurrent programs is a complex task due to the interleavings of processes. Sometimes, violation of the correctness properties in such systems causes human or resource losses; therefore, it is crucial to check the correctness of such systems. Two main approaches to software analysis are testing and formal verification. Testing can help discover many bugs at a low cost. However, it cannot prove the correctness of a program. Formal verification, on the other hand, is the approach for proving program correctness. Model checking is a formal verification technique that is suitable for concurrent programs. It aims to automatically establish the correctness (expressed in terms of temporal properties) of a program through an exhaustive search of the behavior of the system. Model checking was initially introduced for the purpose of verifying finite‐state concurrent programs, and extending it to infinite‐state systems is an active research area. In this thesis, we focus on the formal verification of parameterized systems. That is, systems in which the number of executing processes is not bounded a priori. We provide fully-automatic and parameterized model checking techniques for establishing the correctness of safety properties for certain classes of concurrent programs. We provide an open‐source prototype for every technique and present our experimental results on several benchmarks. First, we address the problem of automatically checking safety properties for bounded as well as parameterized phaser programs. Phaser programs are concurrent programs that make use of the complex synchronization construct of Habanero Java phasers. For the bounded case, we establish the decidability of checking the violation of program assertions and the undecidability of checking deadlock‐freedom. For the parameterized case, we study different formulations of the verification problem and propose an exact procedure that is guaranteed to terminate for some reachability problems even in the presence of unbounded phases and arbitrarily many spawned processes. Second, we propose an approach for automatic verification of parameterized concurrent programs in which shared variables are manipulated by atomic transitions to count and synchronize the spawned processes. For this purpose, we introduce counting predicates that related counters that refer to the number of processes satisfying some given properties to the variables that are directly manipulated by the concurrent processes. We then combine existing works on the counter, predicate, and constrained monotonic abstraction and build a nested counterexample‐based refinement scheme to establish correctness. Third, we introduce Lazy Constrained Monotonic Abstraction for more efficient exploration of well‐structured abstractions of infinite‐state non‐monotonic systems. We propose several heuristics and assess the efficiency of the proposed technique by extensive experiments using our open‐source prototype. Lastly, we propose a sound but (in general) incomplete procedure for automatic verification of safety properties for a class of fault‐tolerant distributed protocols described in the Heard‐Of (HO for short) model. The HO model is a popular model for describing distributed protocols. We propose a verification procedure that is guaranteed to terminate even for unbounded number of the processes that execute the distributed protocol.

Designing Human Swarm Interaction Systems

DOWNLOAD
Author : Oscar Bjurling
language : en
Publisher: Linköping University Electronic Press
Release Date : 2025-02-20

Designing Human Swarm Interaction Systems written by Oscar Bjurling and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2025-02-20 with categories.

Swarms of Unmanned Aerial Vehicles (UAVs, or drones) are envisioned to transform various fields, from emergency response to law enforcement and military operations. Drone swarms provide scalable, adaptable, and decentralized solutions for dynamic work environments. However, the successful integration of these multi-agent systems into real-world settings presents significant challenges, particularly in terms of how humans can safely and effectively interact with and control these systems. Human-Swarm Interaction (HSI) aims to address these challenges by exploring how human operators can manage multiple drones in a cohesive manner, even under highly complex, uncertain conditions. This thesis studies the problem of designing effective interaction mechanisms and interfaces for human operators to command drone swarms, specifically addressing challenges such as managing a large number of drones, supporting operators’ situational awareness, and balancing between centralized and decentralized control. The research highlights the necessity of rethinking conventional approaches by introducing alternative conceptual models, such as the "choir" metaphor, which re-imagines drone swarms as coordinated, semi-centralized ensembles rather than purely emergent, decentralized collectives. This metaphor aims to balance the collective, often unpredictable behavior of drone swarms with the predictable, directed actions needed in operational environments. By demonstrating how this metaphor can be operationalized in an HSI system architecture, the thesis provides new avenues for conceptualizing human interaction with autonomous systems. Using a design research approach incorporating multiple-case study and scenario-based design activities to envision future swarm application in dialogue with prospective end users, the thesis develops and evaluates prototypes that embody these nuanced HSI concepts. The interface prototypes draw design inspiration from Real-Time Strategy (RTS) games. These elements include group commands, high-level mission planning, and resource pooling to create a hybrid interaction model that allows operators to maintain both a broad overview and precise control of multiple autonomous and collaborating drones. Domain expert evaluations of these prototypes in contexts such as firefighting and airport management validate the practical utility of these concepts. The findings emphasize the value of adopting a Human-Technology-Organization (HTO) perspective in the design of HSI systems. Rather than focusing solely on the interaction between humans and technology, this systems-thinking approach acknowledges that drone swarms must be integrated into larger organizational frameworks, such as emergency response command structures or airport ground operations teams. It demonstrates that successful deployment requires accounting for the broader organizational context, including roles, workflows, and coordination needs. This holistic approach to HSI system design ensures that drone swarms not only meet technical performance criteria, such as reliability, responsiveness, and scalability, but also align with human and organizational needs, facilitating their adoption and effective use in a wide range of real-world scenarios. Ultimately, these contributions are intended to bridge the gap between theoretical models of swarm control and practical deployment, advancing both the field of HSI and the broader adoption of drone swarm technologies. Svärmar av obemannade luftfarkoster (UAV, eller drönare) förväntas omvandla flera områden, exempelvis räddningsinsatser, brottsbekämpning, och militäroperationer. Drönarsvärmar innebar skalbara, anpassningsbara, och decentraliserade lösningar for dynamiska arbetsuppgifter. Den lyckade integreringen av dessa multi-agent-system i verkliga miljöer innebar dock betydande utmaningar, särskilt med avseende på hur människor säkert och effektivt interagerar med och kontrollerar dessa system. Forskningsfältet Människa-Svärm Interaktion (MSI) syftar till att möta dessa utmaningar genom att undersöka hur mänskliga operatorer kan hantera flera drönare på ett sammanhängande vis, även under komplexa och osäkra förhållanden. Denna avhandling utreder problemet att utforma effektiva och säkra interaktionsmekanismer och gränssnitt for mänskliga operatorer att leda drönarsvärmar, specifikt genom att adressera utmaningar som att hantera ett stort antal drönare, stödja operatorers situationsmedvetenhet, och balansera mellan centraliserad och decentraliserad kontroll. Avhandlingen betonar vikten av att ifrågasatta konventionella tillvägagångssätt genom att introducera alternativa konceptuella modeller, såsom "kör"-metaforen, som omtolkar drönarsvärmar som koordinerade, semicentraliserade ensembler snarare än rent decentraliserade kollektiv. Denna metafor syftar till att balansera det kollektiva, ofta oförutsägbara beteendet hos drönarsvärmar med de förutsägbara, riktade handlingar som behövs i operativa miljöer. Genom att visa hur denna metafor kan operationaliseras i en MSI-systemarkitektur, erbjuder avhandlingen nya sätt att konceptualisera mänsklig interaktion med autonoma system. Genom att tillämpa en designforskningsmetod som innefattar fallstudier och scenariobaserade designaktiviteter för att föreställa sig framtida svärmtillämpningar i dialog med potentiella slutanvändare, utvecklar och utvärderar avhandlingen prototyper som manifesterar dessa nyanserade MSI-koncept. Gränssnittens prototyper drar designinspiration från realtidsstrategispel (RTS). Dessa element inkluderar enhetshantering och kommandon på gruppnivå, strategisk uppdragsplanering, och resursdelning för att skapa en hybrid interaktionsmodell som gör det möjligt för operatörer att både bibehålla en bred lägesbild och utöva precis kontroll över flera autonoma och samverkande drönare. Domänexperters utvärderingar av dessa prototyper i arbetskontexter som brandbekämpning och flygplatsledning påvisar den praktiska användbarheten av dessa koncept. Resultaten betonar värdet av att anta ett Människa-Teknik-Organisation (MTO)-perspektiv vid utformningen av MSI-system. Snarare än att enbart fokusera på interaktionen mellan människor och teknik, erkänner detta systemtänkande tillvägagångssätt att drönarsvärmar måste integreras i större organisatoriska ramar, såsom ledningsstrukturer for räddningsinsatser eller markoperativa team på flygplatser. Det visar att framgångsrik implementering av drönarsvärmar kräver att systemutvecklare tar hänsyn till det bredare organisatoriska sammanhanget, inklusive roller, arbetsflöden, och samverkansbehov. Detta holistiska tillvägagångssatt för utformningen av MSI-system säkerställer att drönarsvärmar inte bara uppfyller tekniska prestandakriterier, såsom tillförlitlighet, responsivitet, och skalbarhet, utan också överensstämmer med mänskliga och organisatoriska behov, vilket underlättar deras införande och effektiv användning i en mängd olika tillämpningsscenarier. Över lag är dessa forskningsbidrag avsedda att överbrygga gapet mellan teoretiska modeller för svärmstyrning och praktisk implementering, och därmed avancera och främja både MSI-området och den bredare användningen av svärmteknologier.

Human Centred Design Of Socially Interactive Virtual Agents

DOWNLOAD
Author : Emma Mainza Chilufya
language : en
Publisher: Linköping University Electronic Press
Release Date : 2025-02-24

Human Centred Design Of Socially Interactive Virtual Agents written by Emma Mainza Chilufya and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2025-02-24 with categories.

The thesis is within the field of cognitive science, set within the domains of situated cognition and mediated action with a focus on mediation in Human- Computer Interaction (HCI). It discusses cognition in relation to users, Intelligent Virtual Agents (IVAs), and the interaction environment. The perspectives and actions of users (humans) significantly influence the course of the interaction. IVAs as mediators facilitate interactions between users and their environments. As agents, they actively engage with users, influencing their decisions and behaviours. User involvement in the design process is important for the design of interactive systems. When properly implemented, using the correct methods, principles, and techniques can lead to the development of systems that are effective, efficient, and satisfying to use. IVA research has shown a lack of user participation methodologies in the design process. The design of IVAs often focuses on individual elements and not the IVA as an integrated whole. As a result, these design insights do not easily convert into actionable guidelines. User involvement is primarily seen during the evaluation phase. This leads to the purpose of looking at the design of interactive interfaces of embodied agents (virtual and physical) set in social interactive spaces by involving the users in the conceptual generation and prototyping phase. The research questions are: How can we design interactive virtual agents for social interactive spaces? and How can we apply human-centred design methods to develop interactive virtual agents for social interactive spaces? Two case studies: a virtual receptionist for a university department and a reading robot (BookBot) for fourth-grade pupils are conducted. Each case study involved a concept generation and prototyping phase with the users using human-centred design (HCD) methods and tools. Prototypes were developed based on the conceptual phase findings and evaluated with the users. One key contribution is the application of HCD methodologies in the design of IVAs within social interactive spaces. This includes considerations of the context of interaction: mediation patterns, and the spaces of interaction. Another contribution is the introduction of novel design approaches/ solution features and competencies that designers should have when designing IVAs in social interactive spaces. The thesis presents exemplars of IVAs in these spaces. Avhandlingen ligger inom området kognitiv vetenskap, med fokus på situerad kognition och medierad handling inom Human-Computer Interaction (HCI). Den diskuterar kognition i relation till användare, intelligenta virtuella agenter (IVAs) och interaktionsmiljön. Användarnas (människors) perspektiv och handlingar påverkar i hög grad interaktionens förlopp. IVAs som medlare underlättar interaktioner mellan användare och deras miljöer. Som agenter engagerar de sig aktivt med användare och påverkar deras beslut och beteenden. Användarinvolvering i designprocessen är viktig for utformningen av interaktiva system. När den genomförs korrekt, med rätt metoder, principer och tekniker, kan den leda till utveckling av system som är effektiva, ändamålsenliga och tillfredsställande att använda. Forskning om IVAs har visat en brist på användarmetoder i designprocessen. Designen av IVAs fokuserar ofta på individuella element och inte på IVA som en integrerad helhet. Som ett resultat är dessa designinsikter svara att omvandla till handlingsbara riktlinjer. Användardeltagande ses främst under utvärderingsfasen. Detta leder till syftet att undersöka designen av interaktiva gränssnitt för forkroppsligade agenter (virtuella och fysiska) i sociala interaktiva utrymmen genom att involvera användarna i den konceptuella genereringen och prototypfasen. Forskningsfrågorna är: Hur kan vi designa interaktiva virtuella agenter for sociala interaktiva utrymmen? och Hur kan vi tillämpa användarcentrerade designmetoder för att utveckla interaktiva virtuella agenter för sociala interaktiva utrymmen? Två fallstudier: en virtuell receptionist för en universitetsavdelning och en läsrobot (BookBot) för fjärdeklassare utförs. Varje fallstudie involverade en konceptgenererings- och prototypfas med användarna med hjälp av användarcentrerade designmetoder och verktyg. Prototyper utvecklades baserat på resultaten från den konceptuella fasen och utvärderades med användarna. Ett viktigt bidrag är tillämpningen av användarcentrerade designmetoder i designen av IVAs inom sociala interaktiva utrymmen. Detta inkluderar överväganden av interaktionskontexten: medlingsmönster och interaktionsutrymmen. Ett annat bidrag är introduktionen av nya designmetoder/lösningsfunktioner och kompetenser som designers bör ha när de designar IVAs i sociala interaktiva utrymmen. Avhandlingen presenterar exempel på IVAs i dessa utrymmen.

Robust Stream Reasoning Under Uncertainty

DOWNLOAD
Author : Daniel de Leng
language : en
Publisher: Linköping University Electronic Press
Release Date : 2019-11-08

Robust Stream Reasoning Under Uncertainty written by Daniel de Leng and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2019-11-08 with categories.

Vast amounts of data are continually being generated by a wide variety of data producers. This data ranges from quantitative sensor observations produced by robot systems to complex unstructured human-generated texts on social media. With data being so abundant, the ability to make sense of these streams of data through reasoning is of great importance. Reasoning over streams is particularly relevant for autonomous robotic systems that operate in physical environments. They commonly observe this environment through incremental observations, gradually refining information about their surroundings. This makes robust management of streaming data and their refinement an important problem. Many contemporary approaches to stream reasoning focus on the issue of querying data streams in order to generate higher-level information by relying on well-known database approaches. Other approaches apply logic-based reasoning techniques, which rarely consider the provenance of their symbolic interpretations. In this work, we integrate techniques for logic-based stream reasoning with the adaptive generation of the state streams needed to do the reasoning over. This combination deals with both the challenge of reasoning over uncertain streaming data and the problem of robustly managing streaming data and their refinement. The main contributions of this work are (1) a logic-based temporal reasoning technique based on path checking under uncertainty that combines temporal reasoning with qualitative spatial reasoning; (2) an adaptive reconfiguration procedure for generating and maintaining a data stream required to perform spatio-temporal stream reasoning over; and (3) integration of these two techniques into a stream reasoning framework. The proposed spatio-temporal stream reasoning technique is able to reason with intertemporal spatial relations by leveraging landmarks. Adaptive state stream generation allows the framework to adapt to situations in which the set of available streaming resources changes. Management of streaming resources is formalised in the DyKnow model, which introduces a configuration life-cycle to adaptively generate state streams. The DyKnow-ROS stream reasoning framework is a concrete realisation of this model that extends the Robot Operating System (ROS). DyKnow-ROS has been deployed on the SoftBank Robotics NAO platform to demonstrate the system's capabilities in a case study on run-time adaptive reconfiguration. The results show that the proposed system - by combining reasoning over and reasoning about streams - can robustly perform stream reasoning, even when the availability of streaming resources changes.

Applications Of Partial Polymorphisms In Fine Grained Complexity Of Constraint Satisfaction Problems

DOWNLOAD
Author : Biman Roy
language : en
Publisher: Linköping University Electronic Press
Release Date : 2020-03-23

Applications Of Partial Polymorphisms In Fine Grained Complexity Of Constraint Satisfaction Problems written by Biman Roy and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2020-03-23 with categories.

In this thesis we study the worst-case complexity ofconstraint satisfaction problems and some of its variants. We use methods from universal algebra: in particular, algebras of total functions and partial functions that are respectively known as clones and strong partial clones. The constraint satisfactionproblem parameterized by a set of relations ? (CSP(?)) is the following problem: given a set of variables restricted by a set of constraints based on the relations ?, is there an assignment to thevariables that satisfies all constraints? We refer to the set ? as aconstraint language. The inverse CSPproblem over ? (Inv-CSP(?)) asks the opposite: given a relation R, does there exist a CSP(?) instance with R as its set of models? When ? is a Boolean language, then we use the term SAT(?) instead of CSP(?) and Inv-SAT(?) instead of Inv-CSP(?). Fine-grained complexity is an approach in which we zoom inside a complexity class and classify theproblems in it based on their worst-case time complexities. We start by investigating the fine-grained complexity of NP-complete CSP(?) problems. An NP-complete CSP(?) problem is said to be easier than an NP-complete CSP(?) problem if the worst-case time complexity of CSP(?) is not higher thanthe worst-case time complexity of CSP(?). We first analyze the NP-complete SAT problems that are easier than monotone 1-in-3-SAT (which can be represented by SAT(R) for a certain relation R), and find out that there exists a continuum of such problems. For this, we use the connection between constraint languages and strong partial clones and exploit the fact that CSP(?) is easier than CSP(?) when the strong partial clone corresponding to ? contains the strong partial clone of ?. An NP-complete CSP(?) problem is said to be the easiest with respect to a variable domain D if it is easier than any other NP-complete CSP(?) problem of that domain. We show that for every finite domain there exists an easiest NP-complete problem for the ultraconservative CSP(?) problems. An ultraconservative CSP(?) is a special class of CSP problems where the constraint language containsall unary relations. We additionally show that no NP-complete CSP(?) problem can be solved insub-exponential time (i.e. in2^o(n) time where n is the number of variables) given that theexponentialtime hypothesisis true. Moving to classical complexity, we show that for any Boolean constraint language ?, Inv-SAT(?) is either in P or it is coNP-complete. This is a generalization of an earlier dichotomy result, which was only known to be true for ultraconservative constraint languages. We show that Inv-SAT(?) is coNP-complete if and only if the clone corresponding to ? contains essentially unary functions only. For arbitrary finite domains our results are not conclusive, but we manage to prove that theinversek-coloring problem is coNP-complete for each k>2. We exploit weak bases to prove many of theseresults. A weak base of a clone C is a constraint language that corresponds to the largest strong partia clone that contains C. It is known that for many decision problems X(?) that are parameterized bya constraint language ?(such as Inv-SAT), there are strong connections between the complexity of X(?) and weak bases. This fact can be exploited to achieve general complexity results. The Boolean domain is well-suited for this approach since we have a fairly good understanding of Boolean weak bases. In the final result of this thesis, we investigate the relationships between the weak bases in the Boolean domain based on their strong partial clones and completely classify them according to the setinclusion. To avoid a tedious case analysis, we introduce a technique that allows us to discard a largenumber of cases from further investigation.

Empirical Studies In Machine Psychology

DOWNLOAD
Author : Robert Johansson
language : en
Publisher: Linköping University Electronic Press
Release Date : 2024-10-09

Empirical Studies In Machine Psychology written by Robert Johansson and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2024-10-09 with categories.

This thesis presents Machine Psychology as an interdisciplinary paradigm that integrates learning psychology principles with an adaptive computer system for the development of Artificial General Intelligence (AGI). By synthesizing behavioral psychology with a formal intelligence model, the Non-Axiomatic Reasoning System (NARS), this work explores the potential of operant conditioning paradigms to advance AGI research. The thesis begins by introducing the conceptual foundations of Machine Psychology, detailing its alignment with the theoretical constructs of learning psychology and the formalism of NARS. It then progresses through a series of empirical studies designed to systematically investigate the emergence of increasingly complex cognitive behaviors as NARS interacts with its environment. Initially, operant conditioning is established as a foundational principle for developing adaptive behavior with NARS. Subsequent chapters explore increasingly sophisticated cognitive capabilities, all studied with NARS using experimental paradigms from operant learning psychology: Generalized identity matching, Functional equivalence, and Arbitrarily Applicable Relational Responding. Throughout this research, Machine Psychology is demonstrated to be a promising framework for guiding AGI research, allowing both the manipulation of environmental contingencies and the system’s intrinsic logical processes. The thesis contributes to AGI research by showing how using operant psychological paradigms with NARS can enable cognitive abilities similar to human cognition. These findings set the stage for AGI systems that learn and adapt more like humans, potentially advancing the creation of more general and flexible AI. Denna avhandling introducerar Maskinpsykologi som ett tvärvetenskapligt område där principer från inlärningspsykologi integreras med ett adaptivt datorsystem. Genom att kombinera forskning från beteendepsykologi med en formell modell för intelligens (Non-Axiomatic Reasoning System; NARS), undersöker avhandlingen hur operant betingning kan användas för att driva utvecklingen av Artificiell General Intelligens (AGI) framåt. Avhandlingen börjar med att förklara grunderna i Maskinpsykologi och hur dessa relaterar till både inlärningspsykologi och NARS. Därefter presenteras en serie experiment som systematiskt undersöker hur allt mer komplexa kognitiva beteenden kan uppstå när NARS interagerar med sin omgivning. Till att börja med etableras operant betingning som en central metod för att utveckla adaptiva beteenden med NARS. I de följande kapitlen utforskas hur NARS, genom experiment inspirerade av operant inlärningspsykologi, kan utveckla mer avancerade kognitiva förmågor som till exempel generaliserad identitetsmatchning, funktionell ekvivalens och så kallade arbiträrt applicerbara relationsresponser. Denna forskning visar att Maskinpsykologi är ett lovande verktyg för att vägleda AGI-forskning, eftersom det möjliggör att både påverka omgivningsfaktorer och styra systemets interna logiska processer. Avhandlingen bidrar till AGI-forskning genom att visa hur operanta psykologiska metoder, tillämpade på NARS, kan möjliggöra kognitiva förmågor som liknar mänskligt tänkande. Dessa insikter öppnar nya möjligheter för att utveckla AI-system som kan lära sig och anpassa sig på ett mer mänskligt sätt, vilket kan leda till skapandet av mer generell och flexibel AI.

Designing For Resilience

DOWNLOAD
Author : Vanessa Rodrigues
language : en
Publisher: Linköping University Electronic Press
Release Date : 2020-05-05

Designing For Resilience written by Vanessa Rodrigues and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2020-05-05 with categories.

Services are prone to change in the form of expected and unexpected variations and disruptions, more so given the increasing interconnectedness and complexity of service systems today. These changes require service systems to be resilient and designed to adapt, to ensure that services continue to work smoothly. This thesis problematises the prevailing view and assumptions underpinning the current understanding of resilience in services. Drawing on literature from service management, service design, systems thinking and social-ecological resilience theory, this work investigates how service design can foster resilience in service systems. Supported by empirical input from three research projects in healthcare, the findings show service design can contribute to the adaptability and transformability of service systems through its holistic, human-centred, participatory and experimental approaches. Through the analysis, this research identifies key intervention points for cultivating service systems resilience through service design, including the design of service interactions, processes, enabling structures and multi-level governance. The study makes two important contributions. First, it extends the understanding of service systems resilience as the collective capacity for intentional action in responding to ongoing change, coordinated across scales in order to create value. This is supported by offering alternative assumptions about resilience in service. Second, it positions service design as an enabler of service resilience by explicitly linking design practice(s) to processes that contribute to resilience. By extending the understanding of service systems resilience, this thesis lays the groundwork for future research at the intersection of service design, systemic change and resilience.

Orchestrating A Resource Aware Edge

DOWNLOAD
Author : Klervie Toczé
language : en
Publisher: Linköping University Electronic Press
Release Date : 2024-09-02

Orchestrating A Resource Aware Edge written by Klervie Toczé and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2024-09-02 with Electronic books categories.

More and more services are moving to the cloud, attracted by the promise of unlimited resources that are accessible anytime, and are managed by someone else. However, hosting every type of service in large cloud datacenters is not possible or suitable, as some emerging applications have stringent latency or privacy requirements, while also handling huge amounts of data. Therefore, in recent years, a new paradigm has been proposed to address the needs of these applications: the edge computing paradigm. Resources provided at the edge (e.g., for computation and communication) are constrained, hence resource management is of crucial importance. The incoming load to the edge infrastructure varies both in time and space. Managing the edge infrastructure so that the appropriate resources are available at the required time and location is called orchestrating. This is especially challenging in case of sudden load spikes and when the orchestration impact itself has to be limited. This thesis enables edge computing orchestration with increased resource-awareness by contributing with methods, techniques, and concepts for edge resource management. First, it proposes methods to better understand the edge resource demand. Second, it provides solutions on the supply side for orchestrating edge resources with different characteristics in order to serve edge applications with satisfactory quality of service. Finally, the thesis includes a critical perspective on the paradigm, by considering sustainability challenges. To understand the demand patterns, the thesis presents a methodology for categorizing the large variety of use cases that are proposed in the literature as potential applications for edge computing. The thesis also proposes methods for characterizing and modeling applications, as well as for gathering traces from real applications and analyzing them. These different approaches are applied to a prototype from a typical edge application domain: Mixed Reality. The important insight here is that application descriptions or models that are not based on a real application may not be giving an accurate picture of the load. This can drive incorrect decisions about what should be done on the supply side and thus waste resources. Regarding resource supply, the thesis proposes two orchestration frameworks for managing edge resources and successfully dealing with load spikes while avoiding over-provisioning. The first one utilizes mobile edge devices while the second leverages the concept of spare devices. Then, focusing on the request placement part of orchestration, the thesis formalizes it in the case of applications structured as chains of functions (so-called microservices) as an instance of the Traveling Purchaser Problem and solves it using Integer Linear Programming. Two different energy metrics influencing request placement decisions are proposed and evaluated. Finally, the thesis explores further resource awareness. Sustainability challenges that should be highlighted more within edge computing are collected. Among those related to resource use, the strategy of sufficiency is promoted as a way forward. It involves aiming at only using the needed resources (no more, no less) with a goal of reducing resource usage. Different tools to adopt it are proposed and their use demonstrated through a case study.

Beyond Recognition

DOWNLOAD
Author : Le Minh-Ha
language : en
Publisher: Linköping University Electronic Press
Release Date : 2024-05-06

Beyond Recognition written by Le Minh-Ha and has been published by Linköping University Electronic Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2024-05-06 with categories.

This thesis addresses the need to balance the use of facial recognition systems with the need to protect personal privacy in machine learning and biometric identification. As advances in deep learning accelerate their evolution, facial recognition systems enhance security capabilities, but also risk invading personal privacy. Our research identifies and addresses critical vulnerabilities inherent in facial recognition systems, and proposes innovative privacy-enhancing technologies that anonymize facial data while maintaining its utility for legitimate applications. Our investigation centers on the development of methodologies and frameworks that achieve k-anonymity in facial datasets; leverage identity disentanglement to facilitate anonymization; exploit the vulnerabilities of facial recognition systems to underscore their limitations; and implement practical defenses against unauthorized recognition systems. We introduce novel contributions such as AnonFACES, StyleID, IdDecoder, StyleAdv, and DiffPrivate, each designed to protect facial privacy through advanced adversarial machine learning techniques and generative models. These solutions not only demonstrate the feasibility of protecting facial privacy in an increasingly surveilled world, but also highlight the ongoing need for robust countermeasures against the ever-evolving capabilities of facial recognition technology. Continuous innovation in privacy-enhancing technologies is required to safeguard individuals from the pervasive reach of digital surveillance and protect their fundamental right to privacy. By providing open-source, publicly available tools, and frameworks, this thesis contributes to the collective effort to ensure that advancements in facial recognition serve the public good without compromising individual rights. Our multi-disciplinary approach bridges the gap between biometric systems, adversarial machine learning, and generative modeling to pave the way for future research in the domain and support AI innovation where technological advancement and privacy are balanced.