@article{20474,
author = {Asaeda, M and Nakamae, A and Hirata, K and Kono, Y and Uenishi, H and Adachi, N},
issn = {2214-6873},
journal = {Asia Pac J Sports Med Arthrosc Rehabil Technol},
pages = {56--61},
title = {{Factors associated with dynamic knee valgus angle during single-leg forward landing in patients after anterior cruciate ligament reconstruction.}},
doi = {10.1016/j.asmart.2020.07.002},
volume = {22},
year = {2020},
}
@misc{19439,
author = {Löer, Christin},
title = {{Fanden Sie diese Bewertung nützlich? Ein Ansatz zur Vorhersage der Nützlichkeit von Online-Bewertungen}},
year = {2020},
}
@inproceedings{20755,
abstract = {We consider the problem of computing shortest paths in \emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \emph{local} and a \emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.
We demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \emph{sparse graphs}. Specifically, we present exact $O(\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.
Beyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.
},
author = {Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian},
booktitle = {Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}},
year = {2020},
}
@inproceedings{20381,
author = {Çavdar, Serkan and Meschut, Gerson and Wulf, A. and Hesebeck, O. and Brede, M. and Mayer, B.},
booktitle = {Joining in Car Body Engineering 2020},
location = {Webmeeting},
title = {{Fatigue life prediction of adhesively bonded FRP-aluminium-joints with hyperelastic behavior under cyclic multiaxial stress state}},
year = {2020},
}
@inbook{16289,
abstract = {In the development of model predictive controllers for PDE-constrained problems, the use of reduced order models is essential to enable real-time applicability. Besides local linearization approaches, proper orthogonal decomposition (POD) has been most widely used in the past in order to derive such models. Due to the huge advances concerning both theory as well as the numerical approximation, a very promising alternative based on the Koopman operator has recently emerged. In this chapter, we present two control strategies for model predictive control of nonlinear PDEs using data-efficient approximations of the Koopman operator. In the first one, the dynamic control system is replaced by a small number of autonomous systems with different yet constant inputs. The control problem is consequently transformed into a switching problem. In the second approach, a bilinear surrogate model is obtained via a convex combination of these autonomous systems. Using a recent convergence result for extended dynamic mode decomposition (EDMD), convergence of the reduced objective function can be shown. We study the properties of these two strategies with respect to solution quality, data requirements, and complexity of the resulting optimization problem using the 1-dimensional Burgers equation and the 2-dimensional Navier–Stokes equations as examples. Finally, an extension for online adaptivity is presented.},
author = {Peitz, Sebastian and Klus, Stefan},
booktitle = {Lecture Notes in Control and Information Sciences},
isbn = {9783030357122},
issn = {0170-8643},
pages = {257--282},
publisher = {Springer},
title = {{Feedback Control of Nonlinear PDEs Using Data-Efficient Reduced Order Models Based on the Koopman Operator}},
doi = {10.1007/978-3-030-35713-9_10},
volume = {484},
year = {2020},
}
@article{13114,
abstract = {Many basic properties in Tutte's flow theory for unsigned graphs do not have
their counterparts for signed graphs. However, signed graphs without long
barbells in many ways behave like unsigned graphs from the point view of flows.
In this paper, we study whether some basic properties in Tutte's flow theory
remain valid for this family of signed graphs. Specifically let $(G,\sigma)$ be
a flow-admissible signed graph without long barbells. We show that it admits a
nowhere-zero $6$-flow and that it admits a nowhere-zero modulo $k$-flow if and
only if it admits a nowhere-zero integer $k$-flow for each integer $k\geq 3$
and $k \not = 4$. We also show that each nowhere-zero positive integer $k$-flow
of $(G,\sigma)$ can be expressed as the sum of some $2$-flows. For general
graphs, we show that every nowhere-zero $\frac{p}{q}$-flow can be normalized in
such a way, that each flow value is a multiple of $\frac{1}{2q}$. As a
consequence we prove the equality of the integer flow number and the ceiling of
the circular flow number for flow-admissible signed graphs without long
barbells.},
author = {Lu, You and Luo, Rong and Schubert, Michael and Steffen, Eckhard and Zhang, Cun-Quan},
journal = {SIAM J. Discrete Math},
pages = {2166--2187},
title = {{Flows on signed graphs without long barbells}},
doi = {10.1137/18M1222818},
volume = {34 (4)},
year = {2020},
}
@inproceedings{17398,
author = {Turcanu, Ion and Engel, Thomas and Sommer, Christoph},
booktitle = {2019 IEEE Vehicular Networking Conference (VNC)},
isbn = {9781728145716},
title = {{Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks}},
doi = {10.1109/vnc48660.2019.9062816},
year = {2020},
}
@article{13175,
abstract = {Today, organizations must deal with a plethora of IT security threats and to ensure smooth and
uninterrupted business operations, firms are challenged to predict the volume of IT security vulnerabilities
and allocate resources for fixing them. This challenge requires decision makers to assess
which system or software packages are prone to vulnerabilities, how many post-release vulnerabilities
can be expected to occur during a certain period of time, and what impact exploits might have.
Substantial research has been dedicated to techniques that analyze source code and detect security
vulnerabilities. However, only limited research has focused on forecasting security vulnerabilities
that are detected and reported after the release of software. To address this shortcoming, we apply
established methodologies which are capable of forecasting events exhibiting specific time series
characteristics of security vulnerabilities, i.e., rareness of occurrence, volatility, non-stationarity,
and seasonality. Based on a dataset taken from the National Vulnerability Database (NVD), we use
the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) to measure the forecasting
accuracy of single, double, and triple exponential smoothing methodologies, Croston's methodology,
ARIMA, and a neural network-based approach. We analyze the impact of the applied forecasting
methodology on the prediction accuracy with regard to its robustness along the dimensions of the
examined system and software package "operating systems", "browsers" and "office solutions" and
the applied metrics. To the best of our knowledge, this study is the first to analyze the effect
of forecasting methodologies and to apply metrics that are suitable in this context. Our results
show that the optimal forecasting methodology depends on the software or system package, as some
methodologies perform poorly in the context of IT security vulnerabilities, that absolute metrics
can cover the actual prediction error precisely, and that the prediction accuracy is robust within the
two applied forecasting-error metrics.},
author = {Yasasin, Emrah and Prester, Julian and Wagner, Gerit and Schryen, Guido},
issn = {0167-4048},
journal = {Computers & Security},
number = {January},
title = {{Forecasting IT Security Vulnerabilities - An Empirical Analysis}},
volume = {88},
year = {2020},
}
@book{20318,
author = {Göddecke, Johannes and Meschut, Gerson and Gude, Maik and Lieberwirth, Holger and Tekkaya, Erman and Zaeh, Michael and Stegelmann, Michael and Müller, Michael and Böhme, Kurt and Krampitz, Thomas and Zöllner, Mareen and Hahn, Marlon and Schmitz, Fabian and Hofer, Andreas and Grohmann, Sandra},
isbn = {978-3867806435},
pages = {82},
publisher = {Plattform FOREL},
title = {{FOREL-Wegweiser: Handlungsempfehlungen für den ressourceneffizienten Leichtbau }},
year = {2020},
}
@article{17808,
author = {Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian and Strothmann, Thim},
journal = {Nat. Comput.},
number = {2},
pages = {375--390},
title = {{Forming tile shapes with simple robots}},
doi = {10.1007/s11047-019-09774-2},
volume = {19},
year = {2020},
}