Refine
Year of publication
- 2015 (29) (remove)
Document Type
- Article (12)
- Monograph/Edited Volume (11)
- Doctoral Thesis (3)
- Conference Proceeding (2)
- Preprint (1)
Is part of the Bibliography
- yes (29)
Keywords
- BPMN (2)
- Cloud Computing (2)
- Forschungskolleg (2)
- Geschäftsprozessmanagement (2)
- Hasso Plattner Institute (2)
- Hasso-Plattner-Institut (2)
- JavaScript (2)
- Klausurtagung (2)
- Lively Kernel (2)
- Ph.D. retreat (2)
- Service-oriented Systems Engineering (2)
- service-oriented systems engineering (2)
- "Big Data"-Dienste (1)
- 3D information visualization (1)
- 3D semiotic model (1)
- Abstraktion (1)
- Algorithmen (1)
- Analyse (1)
- BPM (1)
- Batchprozesse (1)
- Behavioral querying (1)
- Biomedicine (1)
- Blockheizkraftwerke (1)
- Business process management (1)
- Business processes (1)
- CEP (1)
- Change Management (1)
- CoExist (1)
- Cyber-Physical Systems (1)
- Data (1)
- Data exchange (1)
- Data integration (1)
- Data modeling (1)
- Daten (1)
- Datenextraktion (1)
- Datenkorrektheit (1)
- Datenobjekte (1)
- Datenzustände (1)
- Deadline-Verbreitung (1)
- Design Thinking (1)
- Duration prediction (1)
- Dynamic pricing and advertising (1)
- Effizienz (1)
- Energiesparen (1)
- Ereignisabstraktion (1)
- Ereignisse (1)
- Event normalization (1)
- Event processing (1)
- Events (1)
- Evolution in MDE (1)
- Experimentation (1)
- Fallstudie (1)
- Feedback Loops (1)
- Feedback heuristics (1)
- Finite horizon (1)
- Forschungsprojekte (1)
- Future SOC Lab (1)
- Geschäftsprozesse (1)
- Graphdatenbanken (1)
- Graphtransformationen (1)
- Image filtering (1)
- In-Memory Technologie (1)
- Innovation (1)
- Innovationsmanagement (1)
- Innovationsmethode (1)
- Interaction (1)
- Inventory holding costs (1)
- Inventory systems (1)
- JIT compilers (1)
- Kollaborationen (1)
- Languages (1)
- Leadership (1)
- Level of abstraction (1)
- MDE Ansatz (1)
- MDE settings (1)
- Management (1)
- Measurement (1)
- Mehrfamilienhäuser (1)
- Modellgetrieben (1)
- Modellierung (1)
- Modelltransformation (1)
- Multi-Instanzen (1)
- Multicore Architekturen (1)
- Natural language processing (1)
- Network graph (1)
- Network monitoring (1)
- Network topology (1)
- Object Versioning (1)
- Objekt-Constraint Programmierung (1)
- Optimal stochastic and deterministic (1)
- Optimierungen (1)
- Organisationsveränderung (1)
- Performance (1)
- Process Mining (1)
- Process Monitoring (1)
- Process choreographies (1)
- Process model repositories (1)
- Process model search (1)
- Process modeling (1)
- Prognosen (1)
- Programming Environments (1)
- Prozess- und Datenintegration (1)
- Prozessarchitektur (1)
- Prozessautomatisierung (1)
- Prozessverfeinerung (1)
- Question answering (1)
- Racket (1)
- Research School (1)
- Risk control (1)
- SQL (1)
- Service detection (1)
- Skript-Entwicklungsumgebungen (1)
- Smalltalk (1)
- Sprachspezifikation (1)
- Squeak (1)
- Stochastic Petri nets (1)
- Studie (1)
- System of Systems (1)
- Texturing (1)
- Trace inclusion (1)
- Verifikation (1)
- Verwaltung von Rechenzentren (1)
- Verzögerungs-Verbreitung (1)
- Virtual 3D scenes (1)
- Visualisierung (1)
- Visualization (1)
- Wartung von Graphdatenbanksichten (1)
- Web browsers (1)
- Werkzeuge (1)
- abstraction (1)
- adaptive Systeme (1)
- adaptive systems (1)
- adoption (1)
- algorithms (1)
- analysis (1)
- ausführbare Semantiken (1)
- batch processing (1)
- big data services (1)
- bpm (1)
- business process architecture (1)
- business process management (1)
- business processes (1)
- cartographic design (1)
- case study (1)
- change management (1)
- cloud computing (1)
- cogeneration units (1)
- collaboration (1)
- conformance analysis (1)
- contracts (1)
- control (1)
- cyber-physical systems (1)
- data (1)
- data center management (1)
- data correctness checking (1)
- data extraction (1)
- data objects (1)
- data states (1)
- deadline propagation (1)
- delay propagation (1)
- design thinking (1)
- diffusion (1)
- efficiency (1)
- energy savings (1)
- event abstraction (1)
- events (1)
- evolution in MDE (1)
- executable semantics (1)
- feedback loops (1)
- forecasts (1)
- formal framework (1)
- formales Framework (1)
- formalism (1)
- functional languages (1)
- graph databases (1)
- graph transformation (1)
- incremental graph pattern matching (1)
- inductive invariant checking (1)
- induktives Invariant Checking (1)
- inkrementelles Graph Pattern Matching (1)
- innovation (1)
- innovation capabilities (1)
- innovation management (1)
- künstliche Intelligenz (1)
- language specification (1)
- leadership (1)
- lively kernel (1)
- location-based (1)
- management (1)
- maschinelles Lernen (1)
- model transformation (1)
- model-driven (1)
- model-driven engineering (1)
- modeling (1)
- modellgetriebene Entwicklung (1)
- monitoring (1)
- multi-instances (1)
- multi-family residential buildings (1)
- object-constraint programming (1)
- optimizations (1)
- organizational change (1)
- orts-basiert (1)
- partial application conditions (1)
- partielle Anwendungsbedingungen (1)
- process and data integration (1)
- process automation (1)
- process mining (1)
- process refinement (1)
- real-time rendering (1)
- research school (1)
- scripting environments (1)
- study (1)
- system of systems (1)
- tools (1)
- tracing (1)
- user interaction (1)
- verification (1)
- view maintenance (1)
- visualization (1)
- Übereinstimmungsanalyse (1)
- Überwachung (1)
Institute
- Hasso-Plattner-Institut für Digital Engineering gGmbH (29) (remove)
Texture mapping is a key technology in computer graphics. For the visual design of 3D scenes, in particular, effective texturing depends significantly on how important contents are expressed, e.g., by preserving global salient structures, and how their depiction is cognitively processed by the user in an application context. Edge-preserving image filtering is one key approach to address these concerns. Much research has focused on applying image filters in a post-process stage to generate artistically stylized depictions. However, these approaches generally do not preserve depth cues, which are important for the perception of 3D visualization (e.g., texture gradient). To this end, filtering is required that processes texture data coherently with respect to linear perspective and spatial relationships. In this work, we present an approach for texturing 3D scenes with perspective coherence by arbitrary image filters. We propose decoupled deferred texturing with (1) caching strategies to interactively perform image filtering prior to texture mapping and (2) for each mipmap level separately to enable a progressive level of abstraction, using (3) direct interaction interfaces to parameterize the visualization according to spatial, semantic, and thematic data. We demonstrate the potentials of our method by several applications using touch or natural language inputs to serve the different interests of users in specific information, including illustrative visualization, focus+context visualization, geometric detail removal, and semantic depth of field. The approach supports frame-to-frame coherence, order-independent transparency, multitexturing, and content-based filtering. In addition, it seamlessly integrates into real-time rendering pipelines and is extensible for custom interaction techniques. (C) 2015 Elsevier Ltd. All rights reserved.
Companies need to efficiently manage their business processes to deliver products and services in time. Therefore, they monitor the progress of individual cases to be able to timely detect undesired deviations and to react accordingly. For example, companies can decide to speed up process execution by raising alerts or by using additional resources, which increases the chance that a certain deadline or service level agreement can be met. Central to such process control is accurate prediction of the remaining time of a case and the estimation of the risk of missing a deadline.
To achieve this goal, we use a specific kind of stochastic Petri nets that can capture arbitrary duration distributions. Thereby, we are able to achieve higher prediction accuracy than related approaches. Further, we evaluate the approach in comparison to state of the art approaches and show the potential of exploiting a so far untapped source of information: the elapsed time since the last observed event. Real-world case studies in the financial and logistics domain serve to illustrate and evaluate the approach presented. (C) 2015 Elsevier Ltd. All rights reserved.
HPI Future SOC Lab
(2015)
Das Future SOC Lab am HPI ist eine Kooperation des Hasso-Plattner-Instituts mit verschiedenen Industriepartnern. Seine Aufgabe ist die Ermöglichung und Förderung des Austausches zwischen Forschungsgemeinschaft und Industrie.
Am Lab wird interessierten Wissenschaftlern eine Infrastruktur von neuester Hard- und Software kostenfrei für Forschungszwecke zur Verfügung gestellt. Dazu zählen teilweise noch nicht am Markt verfügbare Technologien, die im normalen Hochschulbereich in der Regel nicht zu finanzieren wären, bspw. Server mit bis zu 64 Cores und 2 TB Hauptspeicher. Diese Angebote richten sich insbesondere an Wissenschaftler in den Gebieten Informatik und Wirtschaftsinformatik. Einige der Schwerpunkte sind Cloud Computing, Parallelisierung und In-Memory Technologien.
In diesem Technischen Bericht werden die Ergebnisse der Forschungsprojekte des Jahres 2015 vorgestellt. Ausgewählte Projekte stellten ihre Ergebnisse am 15. April 2015 und 4. November 2015 im Rahmen der Future SOC Lab Tag Veranstaltungen vor.
Traditionally, business process management systems only execute and monitor business process instances based on events that originate from the process engine itself or from connected client applications. However, environmental events may also influence business process execution. Recent research shows how the technological improvements in both areas, business process management and complex event processing, can be combined and harmonized. The series of technical reports included in this collection provides insights in that combination with respect to technical feasibility and improvements based on real-world use cases originating from the EU-funded GET Service project – a project targeting transport optimization and green-house gas reduction in the logistics domain. Each report is complemented by a working prototype.
This collection introduces six use cases from the logistics domain. Multiple transports – each being a single process instance – may be affected by the same events at the same point in time because of (partly) using the same transportation route, transportation vehicle or transportation mode (e.g. containers from multiple process instances on the same ship) such that these instances can be (partly) treated as batch. Thus, the first use case shows the influence of events to process instances processed in a batch. The case of sharing the entire route may be, for instance, due to origin from the same business process (e.g. transport three containers, where each is treated as single process instance because of being transported on three trucks) resulting in multi-instance process executions. The second use case shows how to handle monitoring and progress calculation in this context. Crucial to transportation processes are frequent changes of deadlines. The third use case shows how to deal with such frequent process changes in terms of propagating the changes along and beyond the process scope to identify probable deadline violations. While monitoring transport processes, disruptions may be detected which introduce some delay. Use case four shows how to propagate such delay in a non-linear fashion along the process instance to predict the end time of the instance. Non-linearity is crucial in logistics because of buffer times and missed connection on intermodal transports (a one-hour delay may result in a missed ship which is not going every hour). Finally, use cases five and six show the utilization of location-based process monitoring. Use case five enriches transport processes with real-time route and traffic event information to improve monitoring and planning capabilities. Use case six shows the inclusion of spatio-temporal events on the example of unexpected weather events.
Babelsberg/RML
(2015)
New programming language designs are often evaluated on concrete implementations. However, in order to draw conclusions about the language design from the evaluation of concrete programming languages, these implementations need to be verified against the formalism of the design. To that end, we also have to ensure that the design actually meets its stated goals. A useful tool for the latter has been to create an executable semantics from a formalism that can execute a test suite of examples. However, this mechanism so far did not allow to verify an implementation against the design.
Babelsberg is a new design for a family of object-constraint languages. Recently, we have developed a formal semantics to clarify some issues in the design of those languages. Supplementing this work, we report here on how this formalism is turned into an executable operational semantics using the RML system. Furthermore, we show how we extended the executable semantics to create a framework that can generate test suites for the concrete Babelsberg implementations that provide traceability from the design to the language. Finally, we discuss how these test suites helped us find and correct mistakes in the Babelsberg implementation for JavaScript.
Bei der Erstellung von Visualisierungen gibt es im Wesentlichen zwei Ansätze. Zum einen können mit geringem Aufwand schnell Standarddiagramme erstellt werden. Zum anderen gibt es die Möglichkeit, individuelle und interaktive Visualisierungen zu programmieren. Dies ist jedoch mit einem deutlich höheren Aufwand verbunden.
Flower ermöglicht eine schnelle Erstellung individueller und interaktiver Visualisierungen, indem es den Entwicklungssprozess stark vereinfacht und die Nutzer bei den einzelnen Aktivitäten wie dem Import und der Aufbereitung von Daten, deren Abbildung auf visuelle Elemente sowie der Integration von Interaktivität direkt unterstützt.
Design and implementation of service-oriented architectures impose numerous research questions from the fields of software engineering, system analysis and modeling, adaptability, and application integration. Service-oriented Systems Engineering represents a symbiosis of best practices in object orientation, component-based development, distributed computing, and business process management. It provides integration of business and IT concerns. Service-oriented Systems Engineering denotes a current research topic in the field of IT-Systems Engineering with high potential in academic research and industrial application.
The annual Ph.D. Retreat of the Research School provides all members the opportunity to present the current state of their research and to give an outline of prospective Ph.D. projects. Due to the interdisciplinary structure of the Research School, this technical report covers a wide range of research topics. These include but are not limited to: Human Computer Interaction and Computer Vision as Service; Service-oriented Geovisualization Systems; Algorithm Engineering for Service-oriented Systems; Modeling and Verification of Self-adaptive Service-oriented Systems; Tools and Methods for Software Engineering in Service-oriented Systems; Security Engineering of Service-based IT Systems; Service-oriented Information Systems; Evolutionary Transition of Enterprise Applications to Service Orientation; Operating System Abstractions for Service-oriented Computing; and Services Specification, Composition, and Enactment.
Graph transformation systems are a powerful formal model to capture model transformations or systems with infinite state space, among others. However, this expressive power comes at the cost of rather limited automated analysis capabilities. The general case of unbounded many initial graphs or infinite state spaces is only supported by approaches with rather limited scalability or expressiveness. In this report we improve an existing approach for the automated verification of inductive invariants for graph transformation systems. By employing partial negative application conditions to represent and check many alternative conditions in a more compact manner, we can check examples with rules and constraints of substantially higher complexity. We also substantially extend the expressive power by supporting more complex negative application conditions and provide higher accuracy by employing advanced implication checks. The improvements are evaluated and compared with another applicable tool by considering three case studies.
Nowadays, business processes are increasingly supported by IT services that produce massive amounts of event data during process execution. Aiming at a better process understanding and improvement, this event data can be used to analyze processes using process mining techniques. Process models can be automatically discovered and the execution can be checked for conformance to specified behavior. Moreover, existing process models can be enhanced and annotated with valuable information, for example for performance analysis. While the maturity of process mining algorithms is increasing and more tools are entering the market, process mining projects still face the problem of different levels of abstraction when comparing events with modeled business activities. Mapping the recorded events to activities of a given process model is essential for conformance checking, annotation and understanding of process discovery results. Current approaches try to abstract from events in an automated way that does not capture the required domain knowledge to fit business activities. Such techniques can be a good way to quickly reduce complexity in process discovery. Yet, they fail to enable techniques like conformance checking or model annotation, and potentially create misleading process discovery results by not using the known business terminology.
In this thesis, we develop approaches that abstract an event log to the same level that is needed by the business. Typically, this abstraction level is defined by a given process model. Thus, the goal of this thesis is to match events from an event log to activities in a given process model. To accomplish this goal, behavioral and linguistic aspects of process models and event logs as well as domain knowledge captured in existing process documentation are taken into account to build semiautomatic matching approaches. The approaches establish a pre--processing for every available process mining technique that produces or annotates a process model, thereby reducing the manual effort for process analysts. While each of the presented approaches can be used in isolation, we also introduce a general framework for the integration of different matching approaches.
The approaches have been evaluated in case studies with industry and using a large industry process model collection and simulated event logs. The evaluation demonstrates the effectiveness and efficiency of the approaches and their robustness towards nonconforming execution logs.