Refine
H-BRS Bibliography
- yes (2495) (remove)
Departments, institutes and facilities
- Fachbereich Informatik (979)
- Fachbereich Angewandte Naturwissenschaften (630)
- Institut für Technik, Ressourcenschonung und Energieeffizienz (TREE) (388)
- Fachbereich Ingenieurwissenschaften und Kommunikation (386)
- Fachbereich Wirtschaftswissenschaften (317)
- Institute of Visual Computing (IVC) (286)
- Institut für funktionale Gen-Analytik (IFGA) (231)
- Internationales Zentrum für Nachhaltige Entwicklung (IZNE) (126)
- Institut für Cyber Security & Privacy (ICSP) (107)
- Institut für Verbraucherinformatik (IVI) (104)
Document Type
- Article (1021)
- Conference Object (918)
- Part of a Book (189)
- Preprint (86)
- Doctoral Thesis (52)
- Report (51)
- Book (monograph, edited volume) (43)
- Master's Thesis (29)
- Working Paper (28)
- Research Data (22)
- Conference Proceedings (21)
- Part of Periodical (13)
- Contribution to a Periodical (6)
- Bachelor Thesis (5)
- Book review (4)
- Study Thesis (3)
- Lecture (2)
- Other (1)
- Patent (1)
Year of publication
Language
- English (2495) (remove)
Keywords
- Virtual Reality (15)
- FPGA (14)
- Machine Learning (14)
- GC/MS (13)
- Robotics (13)
- Sustainability (11)
- virtual reality (11)
- Augmented Reality (9)
- Lignin (9)
- Social Protection (9)
WiFi-based Long Distance (WiLD) networks have emerged as a promising alternative approach for Internet in rural areas. The main hardware components of these networks are commercial off-the-shelf WiFi radios and directional antennas. During our experiences with real-world WiLD networks, we encountered that interference among long-distance links is a major issue even with high gain directional antennas. In this work, we are providing an in-depth analysis of these interference effects by conducting simulations in ns-3. To closely match the real-world interference effects, we implemented a module to load radiation pattern of commonly used antennas. We analyze two different interference scenarios typically present as a part of larger networks. The results show that side-lobes of directional antennas significantly influence the throughput of long-distance WiFi links depending on the orientation. This work emphasizes that the usage of simple directional antenna models needs to be considered carefully.
This study contributes to the growing body of research concerning management consultancies by linking two previously disparate fields of study: (1) the examination of the effectiveness of consulting interventions and (2) the examination of the social processes that aim to create and legitimize the insights, knowledge and capabilities of management consultancies. We propose that consulting firms accumulate social authority in the course of pre-intervention discourse processes that is reflected in their reputation and celebrity. With respect to intervention, this social authority affects change recipients’ commitment to and compliance with the requirements of change implementation. We test the proposed relationships by conducting a measured variable path analysis of 117 change initiatives in German companies that were set up and implemented with the assistance of external consultancies. Our findings indicate that a consulting firm’s levels of both celebrity and reputation affect the change recipients’ commitment to proposed change strategies and thus, indirectly affect their behavioral compliance with the explicit requirements of change implementation.
Evolutionary illumination is a recent technique that allows producing many diverse, optimal solutions in a map of manually defined features. To support the large amount of objective function evaluations, surrogate model assistance was recently introduced. Illumination models need to represent many more, diverse optimal regions than classical surrogate models. In this PhD thesis, we propose to decompose the sample set, decreasing model complexity, by hierarchically segmenting the training set according to their coordinates in feature space. An ensemble of diverse models can then be trained to serve as a surrogate to illumination.
Neuroevolution methods evolve the weights of a neural network, and in some cases the topology, but little work has been done to analyze the effect of evolving the activation functions of individual nodes on network size, an important factor when training networks with a small number of samples. In this work we extend the neuroevolution algorithm NEAT to evolve the activation function of neurons in addition to the topology and weights of the network. The size and performance of networks produced using NEAT with uniform activation in all nodes, or homogenous networks, is compared to networks which contain a mixture of activation functions, or heterogenous networks. For a number of regression and classification benchmarks it is shown that, (1) qualitatively different activation functions lead to different results in homogeneous networks, (2) the heterogeneous version of NEAT is able to select well performing activation functions, (3) the produced heterogeneous networks are significantly smaller than homogeneous networks.
While executing actions, service robots may experience external faults because of insufficient knowledge about the actions' preconditions. The possibility of encountering such faults can be minimised if symbolic and geometric precondition models are combined into a representation that specifies how and where actions should be executed. This work investigates the problem of learning such action execution models and the manner in which those models can be generalised. In particular, we develop a template-based representation of execution models, which we call delta models, and describe how symbolic template representations and geometric success probability distributions can be combined for generalising the templates beyond the problem instances on which they are created. Our experimental analysis, which is performed with two physical robot platforms, shows that delta models can describe execution-specific knowledge reliably, thus serving as a viable model for avoiding the occurrence of external faults.
From video games to mobile augmented reality, 3D interaction is everywhere. But simply choosing to use 3D input or 3D displays isn't enough: 3D user interfaces (3D UIs) must be carefully designed for optimal user experience. 3D User Interfaces: Theory and Practice, Second Edition is today's most comprehensive primary reference to building outstanding 3D UIs. Four pioneers in 3D user interface research and practice have extensively expanded and updated this book, making it today's definitive source for all things related to state-of-the-art 3D interaction.
This paper describes the security mechanisms of several wireless building automation technologies, namely ZigBee, EnOcean, ZWave, KNX, FS20, and Home-Matic. It is shown that none of the technologies provides the necessary measure ofsecurity that should be expected in building automation systems. One of the conclusions drawn is that software embedded in systems that are build for a lifetime of twenty years or more needs to be updatable.
The knowledge of Software Features (SFs) is vital for software developers and requirements specialists during all software engineering phases: to understand and derive software requirements, to plan and prioritize implementation tasks, to update documentation, or to test whether the final product correctly implements the requested SF. In most software projects, SFs are managed in conjunction with other information such as bug reports, programming tasks, or refactoring tasks with the aid of Issue Tracking Systems (ITSs). Hence ITSs contains a variety of information that is only partly related to SFs. In practice, however, the usage of ITSs to store SFs comes with two major problems: (1) ITSs are neither designed nor used as documentation systems. Therefore, the data inside an ITS is often uncategorized and SF descriptions are concealed in rather lengthy. (2) Although an SF is often requested in a single sentence, related information can be scattered among many issues. E.g. implementation tasks related to an SF are often reported in additional issues. Hence, the detection of SFs in ITSs is complicated: a manual search for the SFs implies reading, understanding and exploiting the Natural Language (NL) in many issues in detail. This is cumbersome and labor intensive, especially if related information is spread over more than one issue. This thesis investigates whether SF detection can be supported automatically. First the problem is analyzed: (i) An empirical study shows that requests for important SFs reside in ITSs, making ITSs a good tar- get for SF detection. (ii) A second study identifies characteristics of the information and related NL in issues. These characteristics repre- sent opportunities as well as challenges for the automatic detection of SFs. Based on these problem studies, the Issue Tracking Software Feature Detection Method (ITSoFD), is proposed. The method has two main components and includes an approach to preprocess issues. Both components address one of the problems associated with storing SFs in ITSs. ITSoFD is validated in three solution studies: (I) An empirical study researches how NL that describes SFs can be detected with techniques from Natural Language Processing (NLP) and Machine Learning. Issues are parsed and different characteristics of the issue and its NL are extracted. These characteristics are used to clas- sify the issue’s content and identify SF description candidates, thereby approaching problem (1). (II) An empirical study researches how issues that carry information potentially related to an SF can be detected with techniques from NLP and Information Retrieval. Characteristics of the issue’s NL are utilized to create a traceability network vii of related issues, thereby approaching problem (2). (III) An empirical study researches how NL data in issues can be preprocessed using heuristics and hierarchical clustering. Code, stack traces, and other technical information is separated from NL. Heuristics are used to identify candidates for technical information and clustering improves the heuristic’s results. The technique can be applied to support components, I. and II.
p53 is a crucial regulator of cell response to DNA damage. MDM4 and MDM2 are the two main negative regulators of p53 activity. Upon DNA damage, their constraint is released and p53 becomes activated and exerts its safeguard function by arresting cell growth or by killing excessively damaged cells. Under these conditions, increasing data suggest that MDM4 and MDM2 play novel roles. In this respect, we recently published that MDM4 exerts a positive activity towards p53 mitochondrial apoptosis. We observed that a fraction of MDM4 stably localizes at the mitochondria where upon lethal stress conditions, promotes the mitochondrial localization of p53 phosphorylated at Ser46 (p53Ser46(P)) and facilitates its binding to BCL2, cytochrome C release and apoptosis. Most importantly, we observed a correlation of MDM4 expression with cisplatin-resistance in a group of human ovarian cancers suggesting that MDM4 proapoptotic activity may have in vivo relevance. Here, we discuss about these and some new findings and compare them with previous data trying to settle some apparent contradictions. In addition, this review discusses the potential relevance of our data to the field of human cancer.
Exploring Gridmap-based Interfaces for the Remote Control of UAVs under Bandwidth Limitations
(2017)
SpMV Runtime Improvements with Program Optimization Techniques on Different Abstraction Levels
(2016)
The multiplication of a sparse matrix with a dense vector is a performance critical computational kernel in many applications, especially in natural and engineering sciences. To speed up this operation, many optimization techniques have been developed in the past, mainly focusing on the data layout for the sparse matrix. Strongly related to the data layout is the program code for the multiplication. But even for a fixed data layout with an accommodated kernel, there are several alternatives for program optimizations. This paper discusses a spectrum of program optimization techniques on different abstraction layers for six different sparse matrix data format and kernels. At the one end of the spectrum, compiler options can be used that hide from the programmer all optimizations done by the compiler internally. On the other end of the spectrum, a multiplication kernel can be programmed that use highly sophisticated intrinsics on an assembler level that ask for a programmer with a deep understanding of processor architectures. These special instructions can be used to efficiently utilize hardware features in processors like vector units that have the potential to speed up sparse matrix computations. The paper compares the programming effort and required knowledge level for certain program optimizations in relation to the gained runtime improvements.
With the rising interest in vehicular communication systems many proposals for secure vehicle-to-vehicle commu- nication were made in recent years. Also, several standard- ization activities concerning the security and privacy measures in these communication systems were initiated in Europe and in US. Here, we discuss some limitations for secure vehicle- to-infrastructure communication in the existing standards of the European Telecommunications Standards Institute. Next, a vulnerability analysis for roadside stations on one side and security and privacy requirements for roadside stations on the other side are given. Afterwards, a proposal for a multi-domain public key architecture for intelligent transport systems, which considers the necessities of road infrastructure authorities and vehicle manufacturers, is introduced. The domains of the public key infrastructure are cryptographically linked based on local trust lists. In addition, a crypto agility concept is suggested, which takes adaptation of key length and cryptographic algorithms during PKI operation into account.
A deployment of the Vehicle-to-Vehicle communication technology according to ETSI is in preparation in Europe. Currently, a Public Key Infrastructure policy for Intelligent Transport Systems in Europe is in discussion to enable V2V communication. This policy set aside two classes of keys and certificates for ITS vehicle stations: long term authentication keys and pseudonymous keys and certificates. We show that from our point of view the periodic sent Cooperative Awareness Messages with extensive data have technical limitations and together with the pseudonym concept cause privacy problems.
The latest advances in the field of smart card technologies allow modern cards to be more than just simple security tokens. Recent developments facilitate the use of interactive components like buttons, displays or even touch-sensors within the card's body thus conquering whole new areas of application. With interactive functionalities the usability aspect becomes the most important one for designing secure and popularly accepted products. Unfortunately, the usability can only be tested fully with completely integrated hence expensive smart card prototypes. This restricts severely application specific research, case studies of new smart card user interfaces and the optimization of design aspects, as well as hardware requirements by making usability and acceptance tests in smart card development very costly and time-consuming. Rapid development and simulation of smart card interfaces and applications can help to avoid this restriction. This paper presents a rapid development process for new smart card interfaces and applications based on common smartphone technology using a tool called SCUID^Sim. We will demonstrate the variety of usability aspects that can be analyzed with such a simulator by discussing some selected example projects.