TY - CONF
AB - Datacenter applications have different resource requirements from network and developing flow scheduling heuristics for every workload is practically infeasible. In this paper, we show that deep reinforcement learning (RL) can be used to efficiently learn flow scheduling policies for different workloads without manual feature engineering. Specifically, we present LFS, which learns to optimize a high-level performance objective, e.g., maximize the number of flow admissions while meeting the deadlines. The LFS scheduler is trained through deep RL to learn a scheduling policy on continuous online flow arrivals. The evaluation results show that the trained LFS scheduler admits 1.05x more flows than the greedy flow scheduling heuristics under varying network load.
AU - Hasnain, Asif
AU - Karl, Holger
ID - 20125
KW - Flow scheduling
KW - Deadlines
KW - Reinforcement learning
T2 - 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC)
TI - Learning Flow Scheduling
ER -
TY - CONF
AB - Even though the spectrum of parts is expected to shift over the long term as a result of increasing e-mobility, there is still an extremely high demand for complex components made of high-strength materials which can only be produced by hydroforming technologies. The innovative combination of hydroforming processes with other forming processes, as well as the improvement of the processes themselves, offers considerable potential for improvement.
A number of promising ways of improving the hydroforming process chain are therefore the subject of this contribution. The focus of the article is on possible approaches for combining (incremental) pre- and post-forming operations, which can permit considerable improvements in both quality and features at a reduced cost. Furthermore, a novel combination of quasi-static and high-speed forming processes is presented, leading to an improved overall forming process (with a high application potential) for the production of complex parts.
AU - Wiens, Eugen
AU - Djakow, Eugen
AU - Homberg, Werner
ID - 21447
KW - Hydroforming
KW - Incremental Forming
KW - Internal Flow-turning
KW - High-speed Forming
T2 - Nebu/Nehy 2020
TI - Some ideas for the further development of hydroforming process chains
ER -
TY - CONF
AB - Ein wichtiges Element der Digitalen Transformation ist die Digitalisierung der Prozesse in Unternehmen. Eine Herausforderung besteht hierbei in der systematischen Erkennung von Digitalisierungspotenzialen in Prozessen. Bestehende Ansätze benötigen Experten, welche Potenziale über ihre Erfahrung oder zeitaufwendig mithilfe von Musterkatalogen identifizieren.
In diesem Artikel werden verschiedene Digitalisierungspotenziale klassifiziert und Muster für ein zukünftiges musterbasiertes Analyseverfahren zur automatisierten Identifikation von Digitalisierungspotenzialen in BPMN-Diagrammen beschrieben. Im Vergleich zu bestehenden Ansätzen erlaubt es Experten die Identifizierung von Digitalisierungspotenzialen effizienter und effektiver durchzuführen.
AU - Rittmeier, Florian
AU - Engels, Gregor
AU - Teetz, Alexander
ID - 2332
KW - Digitalisierungspotenziale
KW - BPI
KW - Digitale Transformation
KW - Information Flow-Modellierung
KW - Patterns
KW - Requirements Engineering
T2 - Joint Proceedings of the Workshops at Modellierung 2018 co-located with Modellierung 2018, Braunschweig, Germany, February 21, 2018.
TI - Digitalisierungspotenziale in Geschäftsprozessen effizient und effektiv erkennen (Effective and Efficient Identification of Digitalization Potentials in Business Processes)
VL - 2060
ER -
TY - JOUR
AB - There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for 3-edge-colorable cubic graphs, cubic graphs which are not 3-edge-colorable, often called snarks, play a key role in this context. Here, we survey parameters measuring how far apart a non 3-edge-colorable graph is from being 3-edge-colorable. We study their interrelation and prove some new results. Besides getting new insight into the structure of snarks, we show that such measures give partial results with respect to these important conjectures. The paper closes with a list of open problems and conjectures.
AU - Fiol, M. A.
AU - Mazzuoccolo, Guiseppe
AU - Steffen, Eckhard
ID - 10129
IS - 4
JF - The Electronic Journal of Combinatorics
KW - Cubic graph
KW - Tait coloring
KW - Snark
KW - Boole coloring
KW - Berge's conjecture
KW - Tutte's 5-flow conjecture
TI - Measures of Edge-Uncolorability of Cubic Graphs
VL - 25
ER -
TY - CONF
AB - Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\$}{\$}2 {\backslash}sqrt{\{} 2{\backslash}left| E {\backslash}right| {\}}{\$}{\$}and {\$}{\$}2 {\backslash}sqrt{\{}2 ({\backslash}left| E {\backslash}right| + {\backslash}left| {\backslash}text {\{}undesirable flows{\}} {\backslash}right| ){\}}{\$}{\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming.
AU - Polevoy, Gleb
AU - Trajanovski, Stojan
AU - Grosso, Paola
AU - de Laat, Cees
ED - Kim, Donghyun
ED - Uma, R. N.
ED - Zelikovsky, Alexander
ID - 17651
KW - flow
KW - Red-Blue Set Cover
KW - Positive-Negative Partial Set Cover
KW - approximation
KW - tree
KW - MAX SNP-hard
KW - root
KW - leaf
KW - dynamic programming
KW - FPT
SN - 978-3-030-04651-4
T2 - Combinatorial Optimization and Applications
TI - Removing Undesirable Flows by Edge Deletion
ER -
TY - CONF
AU - Polevoy, Gleb
AU - Trajanovski, Stojan
AU - Grosso, Paola
AU - de Laat, Cees
ID - 17652
KW - flow
KW - filter
KW - MMSA
KW - set cover
KW - approximation
KW - local ratio algorithm
SN - 978-3-319-71150-8
T2 - Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I
TI - Filtering Undesirable Flows in Networks
ER -
TY - JOUR
AB - Banks face a 'behavioralization' of their balance sheets since deposit funding increasingly consists of non-maturing deposits with uncertain cash flows exposing banks to asset liability (ALM) risk. Thus, this study examines the behavior of banks’ retail customers regarding non-maturing deposits. Our unique sample comprises the contract and cash flow data for 2.2 million individual contracts from 1991 to 2010. We find that contractual rewards, i.e., qualified interest payments, and government subsidies, effectively stabilize saving behavior and thus bank funding. The probability of an early deposit withdrawal decreases by approximately 40%, and cash flow volatility drops by about 25%. Our findings provide important insights for banks using pricing incentives to steer desired saving patterns for their non-maturing deposit portfolios. Finally, these results are informative regarding the bank liquidity regulations (Basel III) concerning the stability of deposits and the minimum requirements for risk management (European Commission DIRECTIVE 2006/48/EC).
AU - Schlueter, Tobias
AU - Sievers, Sönke
AU - Hartmann-Wendels, Thomas
ID - 4873
JF - Journal of Banking & Finance (VHB-JOURQUAL 3 Ranking A)
KW - retail saving behavior
KW - non-maturing deposits
KW - deposit funding
KW - contractual rewards
KW - interest rate bonus
KW - saving persistence
KW - cash flow volatility
TI - Bank funding stability, pricing strategies and the guidance of depositors
VL - 51
ER -
TY - JOUR
AB - Standard equity valuation approaches (i.e., DDM, RIM, and DCF model) are derived under the assumption of ideal conditions, such as infinite payoffs and clean surplus accounting. Because these conditions are hardly ever met, we extend the standard approaches, based on the fundamental principle of financial statement articulation. The extended models are then tested empirically by employing two sets of forecasts: (1) analyst forecasts provided by Value Line and (2) forecasts generated by cross-sectional regression models. The main result is that our extended models yield considerably smaller valuation errors. Moreover, by construction, identical value estimates are obtained across the extended models. By reestablishing empirical equivalence under non-ideal conditions, our approach provides a benchmark that enables us to quantify the errors resulting from individual deviations from ideal conditions, and thus, to analyze the robustness of the standard approaches. Finally, by providing a level playing field for the different valuation approaches, our findings have implications for other empirical settings, for example, estimating the implied cost of capital.
AU - Heinrichs, Nicolas
AU - Hess, Dieter
AU - Homburg, Carsten
AU - Lorenz, Michael
AU - Sievers, Sönke
ID - 5113
IS - 1
JF - Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A)
KW - Dividend Discount Model
KW - Residual Income
KW - Discounted Cash Flow
KW - Dirty Surplus
KW - Terminal Value
KW - Valuation Error
TI - Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions
VL - 30
ER -
TY - JOUR
AB - In this paper, we define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the context of large-scale powerful (radar/camera) sensor networks, but we believe it has important applications on the admission of large flows in other networks as well. In order to optimize the selection of flows transmitted to the gateway, D-UFP takes into account possible dependencies between flows. We show that D-UFP is more difficult than NP-hard problems for which no good approximation is known. Then, we address two special cases of this problem: the case where all the sensors have a shared channel and the case where the sensors form a mesh and route to the gateway over a spanning tree.
AU - Cohen, R.
AU - Nudelman, I.
AU - Polevoy, Gleb
ID - 17663
IS - 5
JF - Networking, IEEE/ACM Transactions on
KW - Approximation algorithms
KW - Approximation methods
KW - Bandwidth
KW - Logic gates
KW - Radar
KW - Vectors
KW - Wireless sensor networks
KW - Dependent flow scheduling
KW - sensor networks
SN - 1063-6692
TI - On the Admission of Dependent Flows in Powerful Sensor Networks
VL - 21
ER -
TY - CONF
AU - Anwer, Jahanzeb
AU - Meisner, Sebastian
AU - Platzner, Marco
ID - 10620
KW - fault tolerant computing
KW - field programmable gate arrays
KW - logic design
KW - reliability
KW - BYU-LANL tool
KW - DRM tool flow
KW - FPGA based hardware designs
KW - avionic application
KW - device technologies
KW - dynamic reliability management
KW - fault-tolerant operation
KW - hardware designs
KW - reconfiguring reliability levels
KW - space applications
KW - Field programmable gate arrays
KW - Hardware
KW - Redundancy
KW - Reliability engineering
KW - Runtime
KW - Tunneling magnetoresistance
T2 - Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference on
TI - Dynamic reliability management: Reconfiguring reliability-levels of hardware designs at runtime
ER -
TY - JOUR
AU - Danne, Klaus
AU - Mühlenbernd, Roland
AU - Platzner, Marco
ID - 10646
IS - 4
JF - IET Computers Digital Techniques
KW - reconfigurable architectures
KW - resource allocation
KW - device reconfiguration time
KW - dynamic hardware reconfiguration
KW - dynamically reconfigurable hardware
KW - light-weight runtime system
KW - merge server distribute load
KW - periodic real-time tasks
KW - runtime system overheads
KW - schedulability analysis
KW - scheduling technique
KW - server-based execution
KW - synthesis tool flow
SN - 1751-8601
TI - Server-based execution of periodic tasks on dynamically reconfigurable hardware
VL - 1
ER -