@misc{BohdanNiemiecKobzaretal.2019, author = {Bohdan, Artem and Niemiec, Jacek and Kobzar, Oleh and Pohl, Martin}, title = {Erratum: Electron Pre-acceleration at Nonrelativistic High-Mach-number Perpendicular Shocks (The astrophysical journal : an international review of spectroscopy and astronomical physics. - Vol 847, 2017, 71)}, series = {The astrophysical journal : an international review of spectroscopy and astronomical physics}, volume = {880}, journal = {The astrophysical journal : an international review of spectroscopy and astronomical physics}, number = {1}, publisher = {IOP Publ. Ltd.}, address = {Bristol}, issn = {0004-637X}, doi = {10.3847/1538-4357/ab2f89}, pages = {1}, year = {2019}, language = {en} } @misc{BockMatysikKrentzetal.2019, author = {Bock, Benedikt and Matysik, Jan-Tobias and Krentz, Konrad-Felix and Meinel, Christoph}, title = {Link Layer Key Revocation and Rekeying for the Adaptive Key Establishment Scheme}, series = {2019 IEEE 5TH World Forum on internet of things (WF-IOT)}, journal = {2019 IEEE 5TH World Forum on internet of things (WF-IOT)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5386-4980-0}, doi = {10.1109/WF-IoT.2019.8767211}, pages = {374 -- 379}, year = {2019}, abstract = {While the IEEE 802.15.4 radio standard has many features that meet the requirements of Internet of things applications, IEEE 802.15.4 leaves the whole issue of key management unstandardized. To address this gap, Krentz et al. proposed the Adaptive Key Establishment Scheme (AKES), which establishes session keys for use in IEEE 802.15.4 security. Yet, AKES does not cover all aspects of key management. In particular, AKES comprises no means for key revocation and rekeying. Moreover, existing protocols for key revocation and rekeying seem limited in various ways. In this paper, we hence propose a key revocation and rekeying protocol, which is designed to overcome various limitations of current protocols for key revocation and rekeying. For example, our protocol seems unique in that it routes around IEEE 802.15.4 nodes whose keys are being revoked. We successfully implemented and evaluated our protocol using the Contiki-NG operating system and aiocoap.}, language = {en} } @misc{BobosGoncalvesLimaetal.2019, author = {Bobos, Iuliu and Goncalves, Ana and Lima, Luis and Noronha, Fernando and Sudo, Masafumi}, title = {Micas Ar-40/Ar-39 dating of hydrothermal events related with the post-orogenic W (+/- Sn), (Cu, Mo) mineralization from Borralha, Northern Portugal}, series = {Life with Ore Deposits on Earth - 15th SGA Biennial Meeting 2019,}, journal = {Life with Ore Deposits on Earth - 15th SGA Biennial Meeting 2019,}, number = {1}, publisher = {SGA Soc Geology Applied mineral depositis}, address = {Geneva}, pages = {353 -- 356}, year = {2019}, abstract = {Secondary mica minerals collected from the Santa Helena (W- (Cu) mineralization) and Venise (W-Mo mineralization) endogenic breccia structures were Ar-40/Ar-39 dated. The muscovite Ar-40/Ar-39 data yielded 286.8 +/- 1.2 (+/- 1 sigma) Ma (samples 6Ha and 11Ha) which reflect the age of secondary muscovite formation probably from magmatic biotite or feldspar alteration. Sericite Ar-40/Ar-39 data yielded 280.9 +/- 1.2 (+/- 1 sigma) Ma to 279.0 +/- 1.1 (+/- 1 sigma) Ma (samples 6Hb and 11Hb) reflecting the age of greisen alteration (T similar to 300 degrees C) where the W- disseminated mineralization occurs. The muscovite 40Ar/39Ar data of 277.3 +/- 1.3 (+/- 1 sigma) Ma and 281.3 +/- 1.2 (+/- 1 sigma) Ma (samples 5 and 6) also reflect the age of muscovite (selvage) crystallized adjacent to molybdenite veins within the Venise breccia. Geochronological data obtained confirmed that the W mineralization at Santa Helena breccia is older than Mo-mineralization at Venise breccia. Also, the timing of hydrothermal circulation and the cooling history for the W-stage deposition was no longer than 7 Ma and 4 Ma for Mo-deposition.}, language = {en} } @misc{BjoerkHoelze2019, author = {Bj{\"o}rk, Jennie and H{\"o}lze, Katharina}, title = {Editorial}, series = {Creativity and innovation management}, volume = {28}, journal = {Creativity and innovation management}, number = {3}, publisher = {Wiley}, address = {Hoboken}, issn = {0963-1690}, doi = {10.1111/caim.12336}, pages = {289 -- 290}, year = {2019}, language = {en} } @misc{BinTareafBergerHennigetal.2019, author = {Bin Tareaf, Raad and Berger, Philipp and Hennig, Patrick and Meinel, Christoph}, title = {Personality exploration system for online social networks}, series = {2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)}, journal = {2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5386-7325-6}, doi = {10.1109/WI.2018.00-76}, pages = {301 -- 309}, year = {2019}, abstract = {User-generated content on social media platforms is a rich source of latent information about individual variables. Crawling and analyzing this content provides a new approach for enterprises to personalize services and put forward product recommendations. In the past few years, brands made a gradual appearance on social media platforms for advertisement, customers support and public relation purposes and by now it became a necessity throughout all branches. This online identity can be represented as a brand personality that reflects how a brand is perceived by its customers. We exploited recent research in text analysis and personality detection to build an automatic brand personality prediction model on top of the (Five-Factor Model) and (Linguistic Inquiry and Word Count) features extracted from publicly available benchmarks. The proposed model reported significant accuracy in predicting specific personality traits form brands. For evaluating our prediction results on actual brands, we crawled the Facebook API for 100k posts from the most valuable brands' pages in the USA and we visualize exemplars of comparison results and present suggestions for future directions.}, language = {en} } @misc{BiloFriedrichLenzneretal.2019, author = {Bilo, Davide and Friedrich, Tobias and Lenzner, Pascal and Melnichenko, Anna}, title = {Geometric Network Creation Games}, series = {SPAA '19: The 31st ACM Symposium on Parallelism in Algorithms and Architectures}, journal = {SPAA '19: The 31st ACM Symposium on Parallelism in Algorithms and Architectures}, publisher = {Association for Computing Machinery}, address = {New York}, isbn = {978-1-4503-6184-2}, doi = {10.1145/3323165.3323199}, pages = {323 -- 332}, year = {2019}, abstract = {Network Creation Games are a well-known approach for explaining and analyzing the structure, quality and dynamics of real-world networks like the Internet and other infrastructure networks which evolved via the interaction of selfish agents without a central authority. In these games selfish agents which correspond to nodes in a network strategically buy incident edges to improve their centrality. However, past research on these games has only considered the creation of networks with unit-weight edges. In practice, e.g. when constructing a fiber-optic network, the choice of which nodes to connect and also the induced price for a link crucially depends on the distance between the involved nodes and such settings can be modeled via edge-weighted graphs. We incorporate arbitrary edge weights by generalizing the well-known model by Fabrikant et al. [PODC'03] to edge-weighted host graphs and focus on the geometric setting where the weights are induced by the distances in some metric space. In stark contrast to the state-of-the-art for the unit-weight version, where the Price of Anarchy is conjectured to be constant and where resolving this is a major open problem, we prove a tight non-constant bound on the Price of Anarchy for the metric version and a slightly weaker upper bound for the non-metric case. Moreover, we analyze the existence of equilibria, the computational hardness and the game dynamics for several natural metrics. The model we propose can be seen as the game-theoretic analogue of a variant of the classical Network Design Problem. Thus, low-cost equilibria of our game correspond to decentralized and stable approximations of the optimum network design.}, language = {en} } @misc{BenderGrumGronauetal.2019, author = {Bender, Benedict and Grum, Marcus and Gronau, Norbert and Alfa, Attahiru and Maharaj, B. T.}, title = {Design of a worldwide simulation system for distributed cyber-physical production networks}, series = {2019 IEEE International Conference on Engineering, Technology and Innovation (ICE/ITMC)}, journal = {2019 IEEE International Conference on Engineering, Technology and Innovation (ICE/ITMC)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-7281-3401-7}, issn = {2334-315X}, doi = {10.1109/ICE.2019.8792609}, pages = {7}, year = {2019}, abstract = {Modern production infrastructures of globally operating companies usually consist of multiple distributed production sites. While the organization of individual sites consisting of Industry 4.0 components itself is demanding, new questions regarding the organization and allocation of resources emerge considering the total production network. In an attempt to face the challenge of efficient distribution and processing both within and across sites, we aim to provide a hybrid simulation approach as a first step towards optimization. Using hybrid simulation allows us to include real and simulated concepts and thereby benchmark different approaches with reasonable effort. A simulation concept is conceptualized and demonstrated qualitatively using a global multi-site example.}, language = {en} } @misc{BeierleBerndtGronauetal.2019, author = {Beierle, Christoph and Berndt, Jan Ole and Gronau, Norbert and Timm, Ingo J.}, title = {Intentional Forgetting: A Huge Potential for Organizations}, series = {K{\"u}nstliche Intelligenz}, volume = {33}, journal = {K{\"u}nstliche Intelligenz}, number = {1}, publisher = {Springer}, address = {Heidelberg}, issn = {0933-1875}, doi = {10.1007/s13218-018-00573-y}, pages = {85 -- 87}, year = {2019}, language = {en} } @misc{BeckusBellissardDeNittis2019, author = {Beckus, Siegfried and Bellissard, Jean and De Nittis, Giuseppe}, title = {Corrigendum to: Spectral continuity for aperiodic quantum systems I. General theory. - [Journal of functional analysis. - 275 (2018), 11, S. 2917 - 2977]}, series = {Journal of functional analysis}, volume = {277}, journal = {Journal of functional analysis}, number = {9}, publisher = {Elsevier}, address = {San Diego}, issn = {0022-1236}, doi = {10.1016/j.jfa.2019.06.001}, pages = {3351 -- 3353}, year = {2019}, abstract = {A correct statement of Theorem 4 in [1] is provided. The change does not affect the main results.}, language = {en} } @misc{BartzYangBethgeetal.2019, author = {Bartz, Christian and Yang, Haojin and Bethge, Joseph and Meinel, Christoph}, title = {LoANs}, series = {Computer Vision - ACCV 2018 Workshops}, volume = {11367}, journal = {Computer Vision - ACCV 2018 Workshops}, publisher = {Springer}, address = {Cham}, isbn = {978-3-030-21074-8}, issn = {0302-9743}, doi = {10.1007/978-3-030-21074-8_29}, pages = {341 -- 356}, year = {2019}, abstract = {Recently, deep neural networks have achieved remarkable performance on the task of object detection and recognition. The reason for this success is mainly grounded in the availability of large scale, fully annotated datasets, but the creation of such a dataset is a complicated and costly task. In this paper, we propose a novel method for weakly supervised object detection that simplifies the process of gathering data for training an object detector. We train an ensemble of two models that work together in a student-teacher fashion. Our student (localizer) is a model that learns to localize an object, the teacher (assessor) assesses the quality of the localization and provides feedback to the student. The student uses this feedback to learn how to localize objects and is thus entirely supervised by the teacher, as we are using no labels for training the localizer. In our experiments, we show that our model is very robust to noise and reaches competitive performance compared to a state-of-the-art fully supervised approach. We also show the simplicity of creating a new dataset, based on a few videos (e.g. downloaded from YouTube) and artificially generated data.}, language = {en} }