Refine
H-BRS Bibliography
- yes (55)
Departments, institutes and facilities
- Fachbereich Informatik (55) (remove)
Document Type
- Conference Object (32)
- Article (16)
- Report (5)
- Part of a Book (1)
- Conference Proceedings (1)
Year of publication
- 2018 (55) (remove)
Keywords
- Surrogate Modeling (2)
- Virtual Reality (2)
- 3D User Interface (1)
- 3D user interface (1)
- Algorithmische Informationstheorie (1)
- Alternatives (1)
- Available Bandwidth (1)
- B2T (1)
- Bandwidth Estimation (1)
- Bayesian Network (1)
- Bayessches Netz (1)
- Blasendiagramm (1)
- Business Process Intelligence (1)
- Business-to-Thing (1)
- CMMN (1)
- Capacity (1)
- Case Management Model and Notation (1)
- Centrifugation (1)
- Chaitin-Konstante (1)
- Co-located work (1)
- Code similarity analysis (1)
- Codierung (1)
- Computer Automated Design (1)
- Curriculum (1)
- CyberGlove (1)
- Dataflow Programming (1)
- Datenanalyse (1)
- Decision Diagram (1)
- Decision Network (1)
- Decision Support (1)
- Delph Study (1)
- Diagnostic bond graphs (1)
- Difference Visualization (1)
- Disco (1)
- Educational Data Mining (1)
- Educational Process Mining (1)
- Einflussdiagramm (1)
- Eingebettetes System (1)
- Embedded software (1)
- Empfehlung (1)
- Entscheidungsunterstützung (1)
- Eye Tracking (1)
- Fault detection and isolation (1)
- Fixed spatial data (1)
- Free-Space Loss (FSL) (1)
- Future (1)
- Future Studies (1)
- Future of Robotics (1)
- Fuzzy Mining (1)
- Gaze Depth Estimation (1)
- Gaze-contingent depth-of-field (1)
- Generation R (1)
- Generative Design (1)
- Geschäftsprozess (1)
- Goal Programming (1)
- Group behavior (1)
- Hand Guidance (1)
- Handlungsempfehlung (1)
- IEEE 802.11 (1)
- IP protection (1)
- Inductive Visual Mining (1)
- Influence Diagram (1)
- Information interaction (1)
- Innovation (1)
- Interaction Patterns (1)
- Internet of Things (1)
- KiBP (1)
- Knowledge Worker (1)
- Knowledge-intensive Business Process (1)
- Kolmogorov-Komplexität (1)
- Kompression und Zufälligkeit von Zeichenketten (1)
- LAA (1)
- LTE-U (1)
- Linear Optimization (1)
- Linear Programming (1)
- Lineare Optimierung (1)
- LoRa (1)
- LoRa receiver accuracy (1)
- Longley-Rice Irregular Terrain Model (ITM) (1)
- MAP-Elites (1)
- Measurement (1)
- Megatrends (1)
- Mode switching LTI model (1)
- Mode-dependent ARRs (1)
- Model-based failure prognosis (1)
- Molecular rotation (1)
- Multiple Displays (1)
- NEAT (1)
- Navigation (1)
- Neuroevolution (1)
- Organic compounds and Functional groups (1)
- Parameter degradation model (1)
- Path loss model (1)
- Plagiat (1)
- Pose Estimation (1)
- Prescriptive Analytics (1)
- ProM (1)
- Process Mining (1)
- Präskriptive Analytik (1)
- Quality Diversity (1)
- Quality of Service (1)
- Quantum mechanical methods (1)
- Random number generator (1)
- RapidMiner (1)
- Recommendation (1)
- Remaining Useful Life (1)
- Robotic Governance (1)
- Robotic Natives (1)
- Robotic Revolutions (1)
- Side-channel watermarking (1)
- Similarity matrix (1)
- Sociomateriality (1)
- Software (1)
- Software reverse engineering (1)
- Somatogravic Illusion (1)
- Spectrum occupancy (1)
- Studenten (1)
- Studienverlauf (1)
- Swim Stroke Analysis (1)
- System health monitoring (1)
- Tactile Feedback (1)
- Tactile feedback (1)
- Taxonomy (1)
- Throughput (1)
- Tiled displays (1)
- U-NII band (1)
- User Study (1)
- Wissensarbeiter (1)
- Wissensintensiver Geschäftsprozess (1)
- Zielprogrammierung (1)
- client-side component model (1)
- co-located collaboration (1)
- cognitive radio (1)
- control (1)
- convex optimization (1)
- data glove (1)
- database (1)
- dependable robots (1)
- diagnostic bond graphs (1)
- dimensionality reduction (1)
- embedded collaborative learning (1)
- energy saving (1)
- eye-tracking (1)
- fixed causalities generation of analytical redundancy relations (1)
- foveated rendering (1)
- grasp motions (1)
- grasping (1)
- gravito-inertial force (1)
- hand guidance (1)
- heart rate control (1)
- heart rate modeling (1)
- heart rate prediction (1)
- holography (1)
- human factors (1)
- human-robot collaboration (1)
- hybrid dynamics solver (1)
- ideal switches (1)
- ideation (1)
- immersive systems (1)
- interaction (1)
- interface design (1)
- load control (1)
- machine learning (1)
- medical training (1)
- mobile web (1)
- mode-dependent implicit state space model (1)
- mode-switching linear time-invariant models (1)
- modular web (1)
- motion capture (1)
- multi-user VR (1)
- perception of upright (1)
- phenomenological approaches (1)
- prehensile motions (1)
- prototype theory (1)
- pseudo-random number generator (1)
- quality-diversity (1)
- ray tracing (1)
- remote diagnosis (1)
- robot component monitoring (1)
- robot dynamics (1)
- robotic black box (1)
- serious games (1)
- service robots (1)
- spectrum sensing (1)
- speech recognition (1)
- speech understanding (1)
- static friction (1)
- tiled displays (1)
- training monitoring (1)
- true random number generator (1)
- ultrasonic sensor (1)
- user study (1)
- vestibular system (1)
- wearable sensors (1)
- web components (1)
- web technology (1)
- xorshift-generator (1)
This paper introduces a random number generator (RNG) based on the avalanche noise of two diodes. A true random number generator (TRNG) generates true random numbers with the use of the electronic noise produced by two avalanche diodes. The amplified outputs of the diodes are sampled and digitized. The difference between the two concurrently sampled and digitized outputs is calculated and used to select a seed and to drive a pseudo-random number generator (PRNG). The PRNG is an xorshift generator that generates 1024 bits in each cycle. Every sequence of 1024 bits is moderately modified and output. The TRNG delivers the next seed and the next cycle begins. The statistical behavior of the generator is analyzed and presented.
Robot deployment in realistic environments is challenging despite the fact that robots can be quite skilled at a large number of isolated tasks. One reason for this is that robots are rarely equipped with powerful introspection capabilities, which means that they cannot always deal with failures in an acceptable manner; in addition, manual diagnosis is often a tedious task that requires technicians to have a considerable set of robotics skills. In this paper, we discuss our ongoing efforts to address some of these problems. In particular, we (i) present our early efforts at developing a robotic black box and consider some factors that complicate its design, (ii) explain our component and system monitoring concept, and (iii) describe the necessity for remote monitoring and experimentation as well as our initial attempts at performing those. Our preliminary work opens a range of promising directions for making robots more usable and reliable in practice.
Preleukemic clones carrying BCR-ABLp190 oncogenic lesions are found in neonatal cord blood, where the majority of preleukemic carriers do not convert into precursor B-cell acute lymphoblastic leukemia (pB-ALL). However, the critical question of how these preleukemic cells transform into pB-ALL remains undefined. Here we model a BCR-ABLp190 preleukemic state and show that limiting BCR-ABLp190 expression to hematopoietic stem/progenitor cells (HS/PC) in mice (Sca1-BCR-ABLp190) causes pB-ALL at low penetrance, which resembles the human disease. pB-ALL blast cells were BCR-ABL-negative and transcriptionally similar to pro-B/pre-B cells, suggesting disease onset upon reduced Pax5 functionality. Consistent with this, double Sca1-BCR-ABLp190+Pax5+/- mice developed pB-ALL with shorter latencies, 90% incidence, and accumulation of genomic alterations in the remaining wild-type Pax5 allele. Mechanistically, the Pax5-deficient leukemic pro-B cells exhibited a metabolic switch towards increased glucose utilization and energy metabolism. Transcriptome analysis revealed that metabolic genes (IDH1, G6PC3, GAPDH, PGK1, MYC, ENO1, ACO1) were upregulated in Pax5-deficient leukemic cells, and a similar metabolic signature could be observed in human leukemia. Our studies unveil the first in vivo evidence that the combination between Sca1-BCR-ABLp190 and metabolic reprogramming imposed by reduced Pax5 expression is sufficient for pB-ALL development. These findings might help to prevent conversion of BCR-ABLp190 preleukemic cells.
Robot deployment in realistic dynamic environments is a challenging problem despite the fact that robots can be quite skilled at a large number of isolated tasks. One reason for this is that robots are rarely equipped with powerful introspection capabilities, which means that they cannot always deal with failures in a reasonable manner; in addition, manual diagnosis is often a tedious task that requires technicians to have a considerable set of robotics skills.
For many different applications, current information about the bandwidth-related metrics of the utilized connection is very useful as they directly impact the performance of throughput sensitive applications such as streaming servers, IPTV and VoIP applications. In literature, several tools have been proposed to estimate major bandwidth-related metrics such as capacity, available bandwidth and achievable throughput. The vast majority of these tools fall into one of Packet Pair (PP), Variable Packet Size (VPS), Self-Loading of Periodic Streams (SLoPS) or Throughput approaches. In this study, seven popular bandwidth estimation tools including nettimer, pathrate, pathchar, pchar, clink, pathload and iperf belonging to these four well-known estimation techniques are presented and experimentally evaluated in a controlled testbed environment. Differently from the rest of studies in literature, all tools have been uniformly classified and evaluated according to an objective and sophisticated classification and evaluation scheme. The performance comparison of the tools incorporates not only the estimation accuracy but also the probing time and overhead caused.
This work discusses how to use OSM for robotic applications and aims at starting a discussion between the OSM and the robotics community. OSM contains much topological and semantic information that can be directly used in robotics and offers various advantages: 1) Standardized format with existing tooling. 2) The graph structure allows to compose the OSM models with domain-specific semantics by adding custom nodes, relations, and key-value pairs. 3) Information about many places is already available and can be used by robots since it is driven by a community effort.
Friction effects impose a requirement for the supplementary amount of torque to be produced in actuators for a robot to move, which in turn increases energy consumption. We cannot eliminate friction, but we can optimize motions to make them more energy efficient, by considering friction effects in motion computations. Optimizing motions means computing efficient joint torques/accelerations based on different friction torques imposed in each joint. Existing friction forces can be used for supporting certain types of arm motions, e.g standing still.
Reducing energy consumption of robot's arms will provide many benefits, such as longer battery life of mobile robots, reducing heat in motor systems, etc.
The aim of this project is extending an already available constrained hybrid dynamic solver, by including static friction effects in the computations of energy optimal motions. When the algorithm is extended to account for static friction factors, a convex optimization (maximization) problem must be solved.
The author of this hybrid dynamic solver has briefly outlined the approach for including static friction forces in computations of motions, but without providing a detailed derivation of the approach and elaboration that will show its correctness. Additionally, the author has outlined the idea for improving the computational efficiency of the approach, but without providing its derivation.
In this project, the proposed approach for extending the originally formulated algorithm has been completely derived and evaluated in order to show its feasibility. The evaluation is conducted in simulation environment with one DOF robot arm, and it shows correct results from the computation of motions. Furthermore, this project presents the derivation of the outlined method for improving the computational efficiency of the extended solver.