004 Datenverarbeitung; Informatik
Refine
Year of publication
- 2016 (39) (remove)
Document Type
- Article (13)
- Doctoral Thesis (13)
- Monograph/Edited Volume (8)
- Conference Proceeding (2)
- Postprint (2)
- Preprint (1)
Keywords
- Electronic and spintronic devices (2)
- Semiconductors (2)
- cloud computing (2)
- computer security (2)
- machine learning (2)
- virtual machines (2)
- virtuelle Maschinen (2)
- 3D Drucken (1)
- 3D Semiotik (1)
- 3D Visualisierung (1)
- 3D point clouds (1)
- 3D printing (1)
- 3D semiotics (1)
- 3D visualization (1)
- Abbrecherquote (1)
- Anleitung (1)
- Bachelorstudierende der Informatik (1)
- Bildverarbeitung (1)
- Cloud Computing (1)
- Cloud-Sicherheit (1)
- Cloud-Speicher (1)
- Computer Science (1)
- Computersicherheit (1)
- DDoS (1)
- Deurema Modellierungssprache (1)
- Didaktik der Informatik (1)
- Discrimination Networks (1)
- FRP (1)
- Feedback Loop Modellierung (1)
- Fehlerinjektion (1)
- Fehlertoleranz (1)
- Fitness-distance correlation (1)
- Forschungskolleg (1)
- Forschungsprojekte (1)
- Functional Lenses (1)
- Future SOC Lab (1)
- GPU (1)
- Geodaten (1)
- Graph-basierte Suche (1)
- Hasso Plattner Institute (1)
- Hasso-Plattner-Institut (1)
- Hochschulsystem (1)
- In-Memory Technologie (1)
- In-Memory technology (1)
- In-Memory-Datenbank (1)
- Informatik (1)
- Informatik-Studiengänge (1)
- Informatikvoraussetzungen (1)
- Inkrementelle Graphmustersuche (1)
- Interaktionsmodel (1)
- Internet Security (1)
- Internet-Sicherheit (1)
- Kartografisches Design (1)
- Klassifikation (1)
- Klausurtagung (1)
- Kollaborationen (1)
- LIDAR (1)
- Laser Cutten (1)
- Laufzeitmodelle (1)
- Lehrer (1)
- Live-Programmierung (1)
- Machine Learning (1)
- Malware (1)
- Maschinelles Lernen (1)
- Morphic (1)
- Multicore Architekturen (1)
- Nested Graph Conditions (1)
- Newspeak (1)
- Nichtfotorealistische Bildsynthese (1)
- Ph.D. retreat (1)
- Point-based rendering (1)
- Probleme in der Studie (1)
- Professoren (1)
- Programmierung (1)
- Ressourcenoptimierung (1)
- Runtime analysis (1)
- Sammlungsdatentypen (1)
- Satisfiability (1)
- Service-oriented Systems Engineering (1)
- Software-Testen (1)
- Sozialen Medien (1)
- Spam (1)
- Spam-Erkennung (1)
- Spam-Filtering (1)
- Speicheroptimierungen (1)
- Stilisierung (1)
- Studentenerwartungen (1)
- Studentenhaltungen (1)
- Synchronisation (1)
- Systeme von Systemen (1)
- Theoretischen Vorlesungen (1)
- Universität Bagdad (1)
- Universität Potsdam (1)
- Universitätseinstellungen (1)
- Unveränderlichkeit (1)
- Verlässlichkeit (1)
- Verteilungsalgorithmus (1)
- Virtualisierung (1)
- Visualization (1)
- Vorhersage (1)
- Wirtschaftsinformatik (1)
- Zugriffskontrolle (1)
- access control (1)
- adaptive Systeme (1)
- adaptive systems (1)
- artifical intelligence (1)
- big data services (1)
- business informatics (1)
- cartographic design (1)
- changing the study field (1)
- changing the university (1)
- collaborations (1)
- collection types (1)
- combined task and motion planning (1)
- computer science education (1)
- data center management (1)
- dependability (1)
- deurema modeling language (1)
- direct manipulation (1)
- direkte Manipulation (1)
- discrimination networks (1)
- dropout (1)
- dynamic typing (1)
- dynamic programming languages (1)
- dynamische Programmiersprachen (1)
- dynamische Sprachen (1)
- email spam detection (1)
- fault injection (1)
- fault tolerance (1)
- feedback loop modeling (1)
- functional lenses (1)
- functional programming (1)
- funktionale Programmierung (1)
- geospatial data (1)
- graph queries (1)
- higher education (1)
- human computer interaction (1)
- image processing (1)
- immutable values (1)
- incremental graph pattern matching (1)
- künstliche Intelligenz (1)
- live programming (1)
- malware detection (1)
- manipulation planning (1)
- maschinelles Lernen (1)
- maschninelles Lernen (1)
- memory optimization (1)
- morphic (1)
- multicore architectures (1)
- nested graph conditions (1)
- non-photorealistic rendering (1)
- pattern recognition (1)
- professors (1)
- reactive (1)
- reaktive Programmierung (1)
- research projects (1)
- research school (1)
- runtime models (1)
- service-oriented systems engineering (1)
- software testing (1)
- structured output prediction (1)
- strukturierte Vorhersage (1)
- study problems (1)
- stylization (1)
- synchronization (1)
- systems of systems (1)
- teachers (1)
- tutorial section (1)
- zuverlässigen Datenverarbeitung (1)
E-Learning-Anwendungen bieten Chancen für die gesetzlich vorgeschriebene Inklusion von Lernenden mit Beeinträchtigungen. Die gleichberechtigte Teilhabe von blinden Lernenden an Veranstaltungen in virtuellen Klassenzimmern ist jedoch durch den synchronen, multimedialen Charakter und den hohen Informationsumfang dieser Lösungen kaum möglich.
Die vorliegende Arbeit untersucht die Zugänglichkeit virtueller Klassenzimmer für blinde Nutzende, um eine möglichst gleichberechtigte Teilhabe an synchronen, kollaborativen Lernszenarien zu ermöglichen. Im Rahmen einer Produktanalyse werden dazu virtuelle Klassenzimmer auf ihre Zugänglichkeit und bestehende Barrieren untersucht und Richtlinien für die zugängliche Gestaltung von virtuellen Klassenzimmern definiert. Anschließend wird ein alternatives Benutzungskonzept zur Darstellung und Bedienung virtueller Klassenzimmer auf einem zweidimensionalen taktilen Braille-Display entwickelt, um eine möglichst gleichberechtigte Teilhabe blinder Lernender an synchronen Lehrveranstaltungen zu ermöglichen. Nach einer ersten Evaluation mit blinden Probanden erfolgt die prototypische Umsetzung des Benutzungskonzepts für ein Open-Source-Klassenzimmer. Die abschließende Evaluation der prototypischen Umsetzung zeigt die Verbesserung der Zugänglichkeit von virtuellen Klassenzimmern für blinde Lernende unter Verwendung eines taktilen Flächendisplays und bestätigt die Wirksamkeit der im Rahmen dieser Arbeit entwickelten Konzepte.
Der Unterricht großer Studierendengruppen im wissenschaftlichen Schreiben birgt vielfältige organisatorische Herausforderungen und eine zeitintensive Betreuung durch die Dozenten. Diese Arbeit stellt ein Lehrkonzept mit Peer-Reviews vor, in dem das Feedback der Peers durch eine automatisierte Analyse ergänzt wird. Die Software Confopy liefert metrik- und strukturbasierte Hinweise für die Verbesserung des wissenschaftlichen Schreibstils. Der Nutzen von Confopy wird an 47 studentischen Arbeiten in Draft- und Final-Version illustriert.
Transmorphic
(2016)
Defining Graphical User Interfaces (GUIs) through functional abstractions can reduce the complexity that arises from mutable abstractions. Recent examples, such as Facebook's React GUI framework have shown, how modelling the view as a functional projection from the application state to a visual representation can reduce the number of interacting objects and thus help to improve the reliabiliy of the system. This however comes at the price of a more rigid, functional framework where programmers are forced to express visual entities with functional abstractions, detached from the way one intuitively thinks about the physical world.
In contrast to that, the GUI Framework Morphic allows interactions in the graphical domain, such as grabbing, dragging or resizing of elements to evolve an application at runtime, providing liveness and directness in the development workflow. Modelling each visual entity through mutable abstractions however makes it difficult to ensure correctness when GUIs start to grow more complex. Furthermore, by evolving morphs at runtime through direct manipulation we diverge more and more from the symbolic description that corresponds to the morph. Given that both of these approaches have their merits and problems, is there a way to combine them in a meaningful way that preserves their respective benefits?
As a solution for this problem, we propose to lift Morphic's concept of direct manipulation from the mutation of state to the transformation of source code. In particular, we will explore the design, implementation and integration of a bidirectional mapping between the graphical representation and a functional and declarative symbolic description of a graphical user interface within a self hosted development environment. We will present Transmorphic, a functional take on the Morphic GUI Framework, where the visual and structural properties of morphs are defined in a purely functional, declarative fashion. In Transmorphic, the developer is able to assemble different morphs at runtime through direct manipulation which is automatically translated into changes in the code of the application. In this way, the comprehensiveness and predictability of direct manipulation can be used in the context of a purely functional GUI, while the effects of the manipulation are reflected in a medium that is always in reach for the programmer and can even be used to incorporate the source transformations into the source files of the application.
When realizing a programming language as VM, implementing behavior as part of the VM, as primitive, usually results in reduced execution times. But supporting and developing primitive functions requires more effort than maintaining and using code in the hosted language since debugging is harder, and the turn-around times for VM parts are higher. Furthermore, source artifacts of primitive functions are seldom reused in new implementations of the same language. And if they are reused, the existing API usually is emulated, reducing the performance gains. Because of recent results in tracing dynamic compilation, the trade-off between performance and ease of implementation, reuse, and changeability might now be decided adversely.
In this work, we investigate the trade-offs when creating primitives, and in particular how large a difference remains between primitive and hosted function run times in VMs with tracing just-in-time compiler. To that end, we implemented the algorithmic primitive BitBlt three times for RSqueak/VM. RSqueak/VM is a Smalltalk VM utilizing the PyPy RPython toolchain. We compare primitive implementations in C, RPython, and Smalltalk, showing that due to the tracing just-in-time compiler, the performance gap has lessened by one magnitude to one magnitude.
We contribute to the theoretical understanding of randomized search heuristics by investigating their optimization behavior on satisfiable random k-satisfiability instances both in the planted solution model and the uniform model conditional on satisfiability. Denoting the number of variables by n, our main technical result is that the simple () evolutionary algorithm with high probability finds a satisfying assignment in time when the clause-variable density is at least logarithmic. For low density instances, evolutionary algorithms seem to be less effective, and all we can show is a subexponential upper bound on the runtime for densities below . We complement these mathematical results with numerical experiments on a broader density spectrum. They indicate that, indeed, the () EA is less efficient on lower densities. Our experiments also suggest that the implicit constants hidden in our main runtime guarantee are low. Our main result extends and considerably improves the result obtained by Sutton and Neumann (Lect Notes Comput Sci 8672:942-951, 2014) in terms of runtime, minimum density, and clause length. These improvements are made possible by establishing a close fitness-distance correlation in certain parts of the search space. This approach might be of independent interest and could be useful for other average-case analyses of randomized search heuristics. While the notion of a fitness-distance correlation has been around for a long time, to the best of our knowledge, this is the first time that fitness-distance correlation is explicitly used to rigorously prove a performance statement for an evolutionary algorithm.
Dieser Beitrag diskutiert die Konzeption eines Software-Projektpraktikums im Bereich E-Learning, welches Lehramts- und Fachstudierenden der Informatik ermöglicht, voneinander zu profitieren und praxisrelevante Ergebnisse generiert. Vorbereitungen, Organisation und Durchführung werden vorgestellt und diskutiert. Den Abschluss bildet ein Ausblick auf die Fortführung des Konzepts und den Ausbau des Forschungsgebietes.
Software-Fehlerinjektion
(2016)
Fehlerinjektion ist ein essentielles Werkzeug, um die Fehlertoleranz komplexer Softwaresysteme experimentell zu evaluieren.
Wir berichten über das Seminar zum Thema Software-Fehlerinjektion, das am Fachgebiet für Betriebssysteme und Middleware am Hasso-Plattner-Institut der Universität Potsdam im Sommersemester 2015 stattfand.
In dem Seminar ging es darum, verschiedene Fehlerinjektionsansätze und -werkzeuge anzuwenden und hinsichtlich ihrer Anwendbarkeit in verschiedenen Szenarien zu bewerten.
In diesem Bericht werden die studierten Ansätze vorgestellt und verglichen.
Software-as-a-Service (SaaS) offers several advantages to both service providers and users. Service providers can benefit from the reduction of Total Cost of Ownership (TCO), better scalability, and better resource utilization. On the other hand, users can use the service anywhere and anytime, and minimize upfront investment by following the pay-as-you-go model. Despite the benefits of SaaS, users still have concerns about the security and privacy of their data. Due to the nature of SaaS and the Cloud in general, the data and the computation are beyond the users' control, and hence data security becomes a vital factor in this new paradigm. Furthermore, in multi-tenant SaaS applications, the tenants become more concerned about the confidentiality of their data since several tenants are co-located onto a shared infrastructure.
To address those concerns, we start protecting the data from the provisioning process by controlling how tenants are being placed in the infrastructure. We present a resource allocation algorithm designed to minimize the risk of co-resident tenants called SecPlace. It enables the SaaS provider to control the resource (i.e., database instance) allocation process while taking into account the security of tenants as a requirement.
Due to the design principles of the multi-tenancy model, tenants follow some degree of sharing on both application and infrastructure levels. Thus, strong security-isolation should be present. Therefore, we develop SignedQuery, a technique that prevents one tenant from accessing others' data. We use the Signing Concept to create a signature that is used to sign the tenant's request, then the server can verifies the signature and recognizes the requesting tenant, and hence ensures that the data to be accessed is belonging to the legitimate tenant.
Finally, Data confidentiality remains a critical concern due to the fact that data in the Cloud is out of users' premises, and hence beyond their control. Cryptography is increasingly proposed as a potential approach to address such a challenge. Therefore, we present SecureDB, a system designed to run SQL-based applications over an encrypted database. SecureDB captures the schema design and analyzes it to understand the internal structure of the data (i.e., relationships between the tables and their attributes). Moreover, we determine the appropriate partialhomomorphic encryption scheme for each attribute where computation is possible even when the data is encrypted.
To evaluate our work, we conduct extensive experiments with di↵erent settings. The main use case in our work is a popular open source HRM application, called OrangeHRM. The results show that our multi-layered approach is practical, provides enhanced security and isolation among tenants, and have a moderate complexity in terms of processing encrypted data.
Every year, the Hasso Plattner Institute (HPI) invites guests from industry and academia to a collaborative scientific workshop on the topic “Operating the Cloud”. Our goal is to provide a forum for the exchange of knowledge and experience between industry and academia. Hence, HPI’s Future SOC Lab is the adequate environment to host this event which is also supported by BITKOM.
On the occasion of this workshop we called for submissions of research papers and practitioner’s reports. ”Operating the Cloud” aims to be a platform for productive discussions of innovative ideas, visions, and upcoming technologies in the field of cloud operation and administration.
In this workshop proceedings the results of the third HPI cloud symposium ”Operating the Cloud” 2015 are published. We thank the authors for exciting presentations and insights into their current work and research. Moreover, we look forward to more interesting submissions for the upcoming symposium in 2016.