Industrielle Informatik
Refine
Document Type
- Conference Proceeding (10)
- Article (4)
Language
- English (14)
Has Fulltext
- no (14)
Keywords
- Cloud computing (2)
- In-network processing (2)
- Network components (2)
- Network design principles (2)
- Network protocols (2)
- Scenario Mining (2)
- Agile teaching (1)
- Almost perfect nonlinear (1)
- Automated Driving (1)
- Automated Driving Functions (1)
Institute
- Fachbereich Technik (14)
Modern distributed computing frameworks and domain-specific languages provide a convenient and robust way to structure large distributed applications and deploy them on either data center or edge computing environments. The current systems suffer however from the need for a complex underlay of services to allow them to run effectively on existing Internet protocols. These services include centralized schedulers, DNS-based name translation, stateful load balancers, and heavy-weight transport protocols. In contrast, ICN-oriented remote invocation methodologies provide an attractive match for current distributed programming languages by supporting both functional programming and stateful objects such as Actors. In this paper we design a computation graph representation for distributed programs, realize it using Conflict-free Replicated Data Types (CRDTs) as the underlying data structures, and employ RICE (Remote Method Invocation for ICN) as the execution environment. We show using NDNSim simulations that it provides attractive benefits in simplicity, performance, and failure resilience.
We present some results on integrating computing with networking so as to optimize the placement of workloads within a distributed network. We describe INCA, an In-Network Computing Architecture that allows clients to request functions that are then instantiated at a place within the network that attempts to meet both the QoE constraints of the application and the incentives of the operator of the network. We have implemented INCA, including network monitoring capability as well as a function placement optimization capability. In our evaluation, INCA demonstrates the benefit of a joint optimization of the networking and computing aspects.
In this poster, we discuss design options for a LoRaWAN and LoRa transmission system to employing Information-Centric Networking (ICN). ICN has been successfully applied to LoWPAN scenarios and can provide many benefits with respect to object-based security, performance, disruption tolerance and usability. Our findings indicate that the current LoRaWAN MAC layer is impractical for an ICN request-response with caching. We present ideas for a new MAC layer that harmonizes the long-range LoRa radios with ICN.
EyeMRTK: A Toolkit for Developing Eye Gaze Interactive Applications in Virtual and Augmented Reality
(2019)
For head mounted displays, like they are used in mixed reality applications, eye gaze seems to be a natural interaction modality. EyeMRTK provides building blocks for eye gaze interaction in virtual and augmented reality. Based on a hardware abstraction layer, it allows interaction researchers and developers to focus on their interaction concepts, while enabling them to evaluate their ideas on all supported systems. In addition to that, the toolkit provides a simulation layer for debugging purposes, which speeds up prototyping during development on the desktop.
For the introduction of new automated driving functions, the systems need to be verified extensively. A scenario-driven approach has become an accepted method for this task. But to verify the functionality of an automated vehicle in the simulation in a certain scenario such as a lane change, relevant characteristics of scenarios need to be identified. This, however, requires to extract these scenarios from real-world drivings accurately. For that purpose, this work proposes a novel framework based on a set of unsupervised learning methods to identify lane-changes on motorways. To represent various types of lane changes, the maneuver is split up into primitive driving actions with an Hidden Markov Model and Divisive Hierarchical Clustering. Based on this, lane change maneuvers are identified using Dynamic-Time-Warping. The presented framework is evaluated with a real-world test drive and compared to other baseline methods. With a f1 score of 98.01\% in lane-change identification, the presented approach shows promising results.
Applying Task-centric Holistic Teaching Approach in Education of Industrial Cyber Physical Systems
(2020)
In order to meet the increasing demand for industrial cyber physical systems, highly qualified professionals are required who possess both excellent professional knowledge and skills as well as soft skills. The interdisciplinarity of industrial cyber physical systems makes teaching the necessary skill challenging. The approach known from the education of software engineering, in which students form a team to develop a software product, is not sufficient. There is also a lack of soft skills, which are often seen as key success factors for engineering projects. To close the existing gaps in education of industrial cyber-physical systems engineering, the task-centric holistic agile teaching approach (T-CHAT) is proposed. This approach will be implemented in a newly developed curriculum for industrial cyber physical systems at the ITMO University St. Petersburg, Russia. It focuses on teaching of both technical and soft skills.
EFLASH is a multivariate public-key encryption scheme proposed by Cartor and Smith-Tone at SAC 2018. In this paper we investigate the hardness of solving the particular equation systems arising from EFLASH, and show that the solving degree for these types of systems is much lower than estimated by the authors. We show that a Gröbner basis algorithm will produce degree fall polynomials at a low degree for EFLASH systems. In particular we are able to accurately predict the number of these polynomials occurring at step degrees 3 and 4 in our attacks. We performed several experiments using the computer algebra system MAGMA, which indicate that the solving degree is at most one higher than the one where degree fall polynomials occur; moreover, our experiments show that whenever the predicted number of degree fall polynomials is positive, it is exact. Our conclusion is that EFLASH does not offer the level of security claimed by the designers. In particular, we estimate that the EFLASH version with 80-bit security parameters offers at most 69 bits of security.
Let f (x) = x d be a power mapping over Fn and Ud the maximum number of solutions
x ∈ Fn of f,c (x) := f (x + c) − f (x) = a, where c, a ∈ Fn and c = 0. f is said to
be differentially k-uniform if Ud = k. The investigation of power functions with low dif-
ferential uniformity over finite fields Fn of odd characteristic has attracted a lot of research
interest since Helleseth, Rong and Sandberg started to conduct extensive computer search
to identify such functions. These numerical results are well-known as the Helleseth-Rong-
Sandberg tables and are the basis of many infinite families of power mappings x dn , n ∈ N,
of low uniformity (see e.g. Dobbertin et al. Discret. Math. 267, 95–112 2003; Helleseth
et al. IEEE Trans. Inform Theory, 45, 475–485 1999; Helleseth and Sandberg AAECC, 8,
363–370 1997; Leducq Amer. J. Math. 1(3) 115–123 1878; Zha and Wang Sci. China Math.
53(8) 1931–1940 2010). Recently the crypto currency IOTA and Cybercrypt started to build
computer chips around base-3 logic to employ their new ternary hash function Troika, which
currently increases the cryptogrpahic interest in such families. Especially bijective power
mappings are of interest, as they can also be employed in block- and stream ciphers. In this
paper we contribute to this development and give a family of power mappings x dn with low
uniformity over Fn, which is bijective for p ≡ 3 mod 4. For p = 3 this yields a family
x dn with 3 ≤ Udn ≤ 4, where the family of inverses has a very simple description. These
results explain “open entries” in the Helleseth-Rong-Sandberg tables. We apply the multi-
variate method to compute the uniformity and thereby give a self-contained introduction to
this method. Moreover we will prove for a related family of low uniformity introduced in
Helleseth and Sandberg (AAECC, 8 363–370 1997) that it yields permutations.
In recent years, the investigations on cyber-physical systems (CPS) have become increasingly popular in both academia and industry. A primary obstruction against the booming deployment of CPS applications lies in how to process and manage large amounts of generated data for decision making. To tackle this predicament, researchers advocate the idea of coupling edge computing, or edge-cloud computing into the design of CPS. However, this coupling process raises a diversity of challenges to the quality-of-services (QoS) of CPS applications. In this article, we present a survey on edge computing or edge-cloud computing assisted CPS designs from the QoS optimization perspective. We first discuss critical challenges in service latency, energy consumption, security, privacy, and reliability during the integration of CPS with edge computing or edge-cloud computing. Afterwards, we give an overview on the state-of-the-art works tackling different challenges for QoS optimization, and present a systematic classification during outlining literature for highlighting their similarities and differences. We finally summarize the experiences learned from surveyed works and envision future research directions on edge computing or edge-cloud computing assisted CPS optimization.