@article{SchaubWang2001, author = {Schaub, Torsten H. and Wang, Kewen}, title = {A comparative study of logic programs with preference}, year = {2001}, language = {en} } @article{Wang2001, author = {Wang, Kewen}, title = {Disjunctive well-founded semantics revisited}, year = {2001}, language = {en} } @article{Wang2001, author = {Wang, Kewen}, title = {A top-down procedure for disjucntive well-founded semantics}, year = {2001}, language = {en} } @article{WangZhou2001, author = {Wang, Kewen and Zhou, Lizhu}, title = {An extension to GCWA and query evaluation for disjunctive deductive databases}, year = {2001}, language = {en} } @article{AngerKonczakLinke2001, author = {Anger, Christian and Konczak, Kathrin and Linke, Thomas}, title = {A system for non-monotonic reasoning under answer set semantics}, isbn = {3-540-42593-4}, year = {2001}, language = {en} } @article{BesnardHunter2001, author = {Besnard, Philippe and Hunter, Anthony}, title = {A logic-based theory of deductive arguments}, issn = {0004-3702}, year = {2001}, language = {en} } @article{DelgrandeSchaub2001, author = {Delgrande, James Patrick and Schaub, Torsten H.}, title = {How to reason credulously and skeptically within a single extension.}, isbn = {3-540- 42464-4}, year = {2001}, language = {en} } @article{DelgrandeSchaubTompits2001, author = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans}, title = {A generic compiler for ordered logic programs}, isbn = {3-540-42593-4}, year = {2001}, language = {en} } @article{Linke2001, author = {Linke, Thomas}, title = {Graph theoretical characterization and computation of answer sets}, isbn = {1-558-60777-3}, issn = {1045-0823}, year = {2001}, language = {en} } @article{SchaubWang2001, author = {Schaub, Torsten H. and Wang, Kewen}, title = {A comparative study of logic programs with preference}, isbn = {1-558-60777-3}, issn = {1045-0823}, year = {2001}, language = {en} } @article{DelgrandeSchaub2001, author = {Delgrande, James Patrick and Schaub, Torsten H.}, title = {How to reason credulously and skeptically within a single extension}, year = {2001}, language = {en} } @article{Wang2001, author = {Wang, Kewen}, title = {A top-down procedure for disjucntive well-founded semantics}, isbn = {3-540-42254-4}, year = {2001}, language = {en} } @article{Linke2001, author = {Linke, Thomas}, title = {Graph theoretical characterization and computation of answer sets}, year = {2001}, language = {en} } @book{OPUS4-18498, title = {Proceedings of the Fifth Dutch German Workshop on Nonmonotonic Reasoning Techniques and their Applications, DGNMR'2001, Potsdam, 4. - 6. April 2001}, editor = {Brewka, Gerhard and Witteveen, Cees and Schaub, Torsten H.}, address = {Potsdam}, year = {2001}, language = {en} } @article{KoseWeckwerthLinkeetal.2001, author = {Kose, F. and Weckwerth, Wolfram and Linke, Thomas and Fiehn, Oliver}, title = {Visualizing plant metabolomic correlation networks using clique-metabolite matrices}, year = {2001}, language = {en} } @phdthesis{Huong2001, author = {Huong, Dinh Thi Thanh}, title = {Correctness proofs and probabilistic tests for constructive specifications and functional programs}, pages = {154 S.}, year = {2001}, language = {en} } @article{Reinke2000, author = {Reinke, Thomas}, title = {Architecture-based construction of multiagent systems}, isbn = {1-58603-013-2}, year = {2000}, language = {en} } @article{ZienRaetschMikaetal.2000, author = {Zien, Alexander and R{\"a}tsch, Gunnar and Mika, Sebastian and Sch{\"o}lkopf, Bernhard and Lengauer, Thomas and M{\"u}ller, Klaus-Robert}, title = {Engineering support vector machine kernels that recognize translation initiation sites}, issn = {1367-4803}, year = {2000}, language = {en} } @article{WuebbelerZieheMackertetal.2000, author = {W{\"u}bbeler, G. and Ziehe, Andreas and Mackert, B.-M. and M{\"u}ller, Klaus-Robert and Trahms, L. and Curio, Gabriel}, title = {Independent component analysis of noninvasively recorded cortical magnetic DC-fields in humans}, year = {2000}, language = {en} } @book{Tepoyan2000, author = {Tepoyan, Liparit}, title = {Degenerated operator equations og higher order}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, publisher = {Univ.}, address = {Potsdam}, issn = {1437-739X}, pages = {13 S.}, year = {2000}, language = {en} } @article{ZieheMuellerNolteetal.2000, author = {Ziehe, Andreas and M{\"u}ller, Klaus-Robert and Nolte, G. and Mackert, B.-M. and Curio, Gabriel}, title = {Artifact reduction in magnetoneurography based on time-delayed second-order correlations}, year = {2000}, language = {en} } @book{CoriascoPanarese2000, author = {Coriasco, S. and Panarese, P.}, title = {Fourier integral operators defined by classical symbols with exit behaviour}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, publisher = {Univ.}, address = {Potsdam}, issn = {1437-739X}, pages = {17 S.}, year = {2000}, language = {en} } @article{RaetschSchoelkopfSmolaetal.2000, author = {R{\"a}tsch, Gunnar and Sch{\"o}lkopf, B. and Smola, Alexander J. and Mika, Sebastian and Onoda, T. and M{\"u}ller, Klaus-Robert}, title = {Robust ensemble learning}, isbn = {0-262-19448-1}, year = {2000}, language = {en} } @book{OPUS4-19402, title = {Advances in neural information processing systems 12 : proceedings of the 1999 conference}, editor = {Solla, Sara A. and M{\"u}ller, Klaus-Robert}, publisher = {MIT Press}, address = {Cambridge, Mass.}, isbn = {0-262-19450-3}, year = {2000}, language = {en} } @book{RaetschSchoelkopfMikaetal.2000, author = {R{\"a}tsch, Gunnar and Sch{\"o}lkopf, B. and Mika, Sebastian and M{\"u}ller, Klaus-Robert}, title = {SVM and boosting : one class}, series = {GMD-Report}, volume = {119}, journal = {GMD-Report}, publisher = {GMD-Forschungszentrum Informationstechnik}, address = {Sankt Augustin}, pages = {36 S.}, year = {2000}, language = {en} } @book{TsudaSugiyamaMueller2000, author = {Tsuda, Koji and Sugiyama, Masashi and M{\"u}ller, Klaus-Robert}, title = {Subspace information criterion for non-quadratice regularizers : model selection for sparse regressors}, series = {GMD-Report}, volume = {120}, journal = {GMD-Report}, publisher = {GMD-Forschungszentrum Informationstechnik}, address = {Sankt Augustin}, pages = {36 S.}, year = {2000}, language = {en} } @article{RaetschSchoelkopfSmolaetal.2000, author = {R{\"a}tsch, Gunnar and Sch{\"o}lkopf, B. and Smola, Alexander J. and M{\"u}ller, Klaus-Robert and Mika, Sebastian}, title = {V-Arc : ensemble learning in the preence of outliers}, year = {2000}, language = {en} } @article{ParraSpenceSajdaetal.2000, author = {Parra, L. and Spence, C. and Sajda, P. and Ziehe, Andreas and M{\"u}ller, Klaus-Robert}, title = {Unmixing hyperspectral data}, year = {2000}, language = {en} } @article{KohlmorgenMuellerRittwegeretal.2000, author = {Kohlmorgen, J. and M{\"u}ller, Klaus-Robert and Rittweger, J. and Pawelzik, K.}, title = {Identification of nonstationary dynamics in physiological recordings}, year = {2000}, language = {en} } @article{MikaRaetschWestonetal.2000, author = {Mika, Sebastian and R{\"a}tsch, Gunnar and Weston, J. and Sch{\"o}lkopf, B. and Smola, Alexander J. and M{\"u}ller, Klaus-Robert}, title = {Invariant feature extraction and classification in kernel spaces}, year = {2000}, language = {en} } @article{OnodaRaetschMueller2000, author = {Onoda, T. and R{\"a}tsch, Gunnar and M{\"u}ller, Klaus-Robert}, title = {An asymptotic analysis and improvement of AdaBoost in the binary classification case (in Japanese)}, year = {2000}, language = {en} } @article{BesnardSchaub2000, author = {Besnard, Philippe and Schaub, Torsten H.}, title = {Significant inferences}, isbn = {1-55860-690-4}, year = {2000}, language = {en} } @article{LinkeSchaub2000, author = {Linke, Thomas and Schaub, Torsten H.}, title = {Alternative foundations for Reiter's default logic.}, issn = {0004-3702}, year = {2000}, language = {en} } @book{Linke2000, author = {Linke, Thomas}, title = {New foundations for automation of default reasoning}, volume = {237}, publisher = {Akad. Verl.-Ges. Aka}, address = {Berlin}, isbn = {3-89838-237-0}, pages = {VII, 182 S.}, year = {2000}, language = {en} } @article{BesnardSchaub2000, author = {Besnard, Philippe and Schaub, Torsten H.}, title = {What is a (non-constructive) non-monotone logical system?}, issn = {0304-3975}, year = {2000}, language = {en} } @article{BesnardLang2000, author = {Besnard, Philippe and Lang, Jerome}, title = {Graded paraconsistency}, isbn = {0-86380-253-2}, year = {2000}, language = {en} } @article{DelgrandeSchaub2000, author = {Delgrande, James Patrick and Schaub, Torsten H.}, title = {The role of default logic in knowledge representation}, isbn = {0-7923-7224-7}, year = {2000}, language = {en} } @article{DelgrandeSchaub2000, author = {Delgrande, James Patrick and Schaub, Torsten H.}, title = {Expressing preferences in default logic}, issn = {0004-3702}, year = {2000}, language = {en} } @article{WongBesnard2000, author = {Wong, P. and Besnard, Philippe}, title = {Paraconsistent reasoning as an analytical tool}, issn = {1367-0751}, year = {2000}, language = {en} } @article{Wang2000, author = {Wang, Kewen}, title = {Argumentation-based abduction in disjunctive logic programming}, year = {2000}, language = {en} } @article{BesnardHunter2000, author = {Besnard, Philippe and Hunter, Anthony}, title = {Towards a logic-based theory of argumentation}, isbn = {0-262-51112-6}, year = {2000}, language = {en} } @article{DelgrandeSchaubTompits2000, author = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans}, title = {A compilation of Brewka and Eiter's approach to prioritizationtion}, isbn = {3-540-41131-3}, year = {2000}, language = {en} } @article{DelgrandeSchaub2000, author = {Delgrande, James Patrick and Schaub, Torsten H.}, title = {A consistency-based model for belief change: preliminary report}, isbn = {0-262-51112-6}, year = {2000}, language = {en} } @article{WangZhouLin2000, author = {Wang, Kewen and Zhou, Lizhu and Lin, Fangzhen}, title = {Alternating fixpoint theory for logic programs with priority}, isbn = {3-540-67797-6}, year = {2000}, language = {en} } @article{DelgrandeSchaubTompits2000, author = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans}, title = {Logic programs with compiled preferences}, isbn = {1-58603-013-2}, year = {2000}, language = {en} } @article{DelgrandeSchaubTompits2000, author = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans}, title = {Logic programs with compiled preferences}, year = {2000}, language = {en} } @article{DelgrandeSchaub2000, author = {Delgrande, James Patrick and Schaub, Torsten H.}, title = {A consistency-based model for belief change: preliminary report}, year = {2000}, language = {en} } @article{DelgrandeSchaubTompits2000, author = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans}, title = {A compiler for ordered logic programs}, year = {2000}, language = {en} } @article{BrueningSchaub2000, author = {Br{\"u}ning, Stefan and Schaub, Torsten H.}, title = {A connection calculus for handling incomplete information}, year = {2000}, language = {en} } @article{HornKupriesReinke1999, author = {Horn, Erika and Kupries, Mario and Reinke, Thomas}, title = {Properties and models of software agents and prefabrication for agent application systems}, isbn = {0-7695-0001-3 , 0-7695-0002-1 , 0-7695-0003-X}, year = {1999}, language = {en} } @article{ReinkeGloedeLauertetal.1999, author = {Reinke, Thomas and Gl{\"o}de, Dirk and Lauert, Alexander and Kupries, Mario and Horn, Erika}, title = {An architecture type-based development environment for agent application systems}, isbn = {3-9501023-0-2}, year = {1999}, language = {en} } @article{Kupries1999, author = {Kupries, Mario}, title = {ADE : An architecture type-based development environment for agent application systems}, year = {1999}, language = {en} } @article{KupriesNoseleit1999, author = {Kupries, Mario and Noseleit, Christof}, title = {Software architecture type-based interagent connections}, isbn = {158113066X}, year = {1999}, language = {en} } @article{BrueningSchaub1999, author = {Br{\"u}ning, Stefan and Schaub, Torsten H.}, title = {Avoiding non-ground variables}, isbn = {3-540-66131-x}, year = {1999}, language = {en} } @article{BenhammadiNicolasSchaub1999, author = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten H.}, title = {Query-answering in prioritized default logic}, isbn = {3-540-66131-X}, year = {1999}, language = {en} } @book{Schaub1999, author = {Schaub, Torsten H.}, title = {The automation of reasoning with incomplete information : from semantic foundations to efficient computation}, series = {Lecture notes in computer science}, volume = {1409}, journal = {Lecture notes in computer science}, publisher = {Springer}, address = {Berlin}, isbn = {3-540-64515-2}, doi = {10.1007/BFb0054963}, pages = {XI, 159 S.}, year = {1999}, language = {en} } @book{JuergensenStaiger1999, author = {J{\"u}rgensen, Helmut and Staiger, Ludwig}, title = {Finite automata : encoding geometric figures}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {1999, 07}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {8 S. : graph. Darst.}, year = {1999}, language = {en} } @book{JuergensenKariThierrin1999, author = {J{\"u}rgensen, Helmut and Kari, L. and Thierrin, G.}, title = {Morphisms preserving densities}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {1999, 09}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {21 Bl.}, year = {1999}, language = {en} } @book{JuergensenKatsuraKonstantinidis1999, author = {J{\"u}rgensen, Helmut and Katsura, M. and Konstantinidis, Stavros}, title = {Maximal solid codes}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {1999, 03}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {23 Bl.}, year = {1999}, language = {en} } @book{BrzozowskiJuergensen1999, author = {Brzozowski, J. A. and J{\"u}rgensen, Helmut}, title = {Semilattices of fault semiautomata}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {1999, 02}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {13 Bl.}, year = {1999}, language = {en} } @article{BenhammadiNicolasSchaub1999, author = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten H.}, title = {Query-answering in prioritized default logic}, isbn = {3-540-66131-X}, year = {1999}, language = {en} } @article{BrueningSchaub1999, author = {Br{\"u}ning, Stefan and Schaub, Torsten H.}, title = {A voiding non-ground variables}, year = {1999}, language = {en} } @article{LinkeSchaub1999, author = {Linke, Thomas and Schaub, Torsten H.}, title = {On bottom-up pre-processing techniques for automated default reasoning}, isbn = {3-540-66131-x}, year = {1999}, language = {en} } @article{Seuring1999, author = {Seuring, Markus}, title = {Built-in self test mit multi-mode scannable memory elementen}, year = {1999}, language = {en} } @article{NeumannStoffelHartjeetal.1999, author = {Neumann, I. and Stoffel, Dominik and Hartje, Hendrik and Kunz, Wolfgang}, title = {Cell replication and redundancy elimination during placement for cycle time optimization}, year = {1999}, language = {en} } @article{Kupries1999, author = {Kupries, Mario}, title = {Connector-aided coordination in agent systems}, year = {1999}, language = {en} } @book{OPUS4-22017, title = {Workshop on Implementing Automata : WIA99 - pre-proceedings ; Potsdam, Germany, 17 - 19. July 1999}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {1999, 4}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, editor = {Boldt, Oliver and J{\"u}rgensen, Helmut and Robbins, L. E.}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {getr. Z{\"a}hl.}, year = {1999}, language = {en} } @phdthesis{Tiwari2019, author = {Tiwari, Abhishek}, title = {Enhancing Users' Privacy: Static Resolution of the Dynamic Properties of Android}, school = {Universit{\"a}t Potsdam}, pages = {xiii, 111}, year = {2019}, abstract = {The usage of mobile devices is rapidly growing with Android being the most prevalent mobile operating system. Thanks to the vast variety of mobile applications, users are preferring smartphones over desktops for day to day tasks like Internet surfing. Consequently, smartphones store a plenitude of sensitive data. This data together with the high values of smartphones make them an attractive target for device/data theft (thieves/malicious applications). Unfortunately, state-of-the-art anti-theft solutions do not work if they do not have an active network connection, e.g., if the SIM card was removed from the device. In the majority of these cases, device owners permanently lose their smartphone together with their personal data, which is even worse. Apart from that malevolent applications perform malicious activities to steal sensitive information from smartphones. Recent research considered static program analysis to detect dangerous data leaks. These analyses work well for data leaks due to inter-component communication, but suffer from shortcomings for inter-app communication with respect to precision, soundness, and scalability. This thesis focuses on enhancing users' privacy on Android against physical device loss/theft and (un)intentional data leaks. It presents three novel frameworks: (1) ThiefTrap, an anti-theft framework for Android, (2) IIFA, a modular inter-app intent information flow analysis of Android applications, and (3) PIAnalyzer, a precise approach for PendingIntent vulnerability analysis. ThiefTrap is based on a novel concept of an anti-theft honeypot account that protects the owner's data while preventing a thief from resetting the device. We implemented the proposed scheme and evaluated it through an empirical user study with 35 participants. In this study, the owner's data could be protected, recovered, and anti-theft functionality could be performed unnoticed from the thief in all cases. IIFA proposes a novel approach for Android's inter-component/inter-app communication (ICC/IAC) analysis. Our main contribution is the first fully automatic, sound, and precise ICC/IAC information flow analysis that is scalable for realistic apps due to modularity, avoiding combinatorial explosion: Our approach determines communicating apps using short summaries rather than inlining intent calls between components and apps, which requires simultaneously analyzing all apps installed on a device. We evaluate IIFA in terms of precision, recall, and demonstrate its scalability to a large corpus of real-world apps. IIFA reports 62 problematic ICC-/IAC-related information flows via two or more apps/components. PIAnalyzer proposes a novel approach to analyze PendingIntent related vulnerabilities. PendingIntents are a powerful and universal feature of Android for inter-component communication. We empirically evaluate PIAnalyzer on a set of 1000 randomly selected applications and find 1358 insecure usages of PendingIntents, including 70 severe vulnerabilities.}, language = {en} } @incollection{KiyGessnerLuckeetal.2015, author = {Kiy, Alexander and Geßner, Hendrik and Lucke, Ulrike and Gr{\"u}newald, Franka}, title = {A Hybrid and Modular Framework for Mobile Campus Applications}, series = {i-com}, volume = {2015}, booktitle = {i-com}, number = {14}, publisher = {de Gruyter}, address = {Berlin}, issn = {2196-6826}, doi = {10.1515/icom-2015-0016}, publisher = {Universit{\"a}t Potsdam}, pages = {63 -- 73}, year = {2015}, abstract = {Mobile devices and associated applications (apps) are an indispensable part of daily life and provide access to important information anytime and anywhere. However, the availability of university-wide services in the mobile sector is still poor. If they exist they usually result from individual activities of students and teachers. Mobile applications can have an essential impact on the improvement of students' self-organization as well as on the design and enhancement of specific learning scenarios, though. This article introduces a mobile campus app framework, which integrates central campus services and decentralized learning applications. An analysis of strengths and weaknesses of different approaches is presented to summarize and evaluate them in terms of requirements, development, maintenance and operation. The article discusses the underlying service-oriented architecture that allows transferring the campus app to other universities or institutions at reasonable cost. It concludes with a presentation of the results as well as ongoing discussions and future work}, language = {en} } @incollection{KiyLuckeZoerner2014, author = {Kiy, Alexander and Lucke, Ulrike and Zoerner, Dietmar}, title = {An adaptive personal learning environment architecture}, series = {Architecture of Computing Systems - ARCS 2014 Lecture Notes in Computer Science}, volume = {2014}, booktitle = {Architecture of Computing Systems - ARCS 2014 Lecture Notes in Computer Science}, number = {8350}, publisher = {Springer}, isbn = {978-3-319-04890-1}, publisher = {Universit{\"a}t Potsdam}, pages = {60 -- 71}, year = {2014}, abstract = {Institutions are facing the challenge to integrate legacy systems with steadily growing new ones, using different technologies and interaction patterns. With the demand of offering the best potential of all systems, several not matching systems including their functions have to be aggregated and offered in a useable way. This paper presents an adaptive, generalizable and self-organized Personal Learning Environment (PLE) framework with the potential to integrate several heterogeneous services using a service-oriented architecture. First, a general overview over the field is given, followed by the description of the core components of the PLE framework. A prototypical implementation is presented. Finally, it's shown how the PLE framework can be dynamically adapted to a changing system environment, reflecting experiences from first user studies.}, language = {en} } @article{DornhegeBlankertzKrauledatetal.2006, author = {Dornhege, Guido and Blankertz, Benjamin and Krauledat, Matthias and Losch, Florian and Curio, Gabriel and M{\"u}ller, Klaus-Robert}, title = {Combined optimization of spatial and temporal filters for improving brain-computer interfacing}, series = {IEEE transactions on bio-medical electronics}, volume = {53}, journal = {IEEE transactions on bio-medical electronics}, number = {11}, publisher = {IEEE}, address = {New York}, issn = {0018-9294}, doi = {10.1109/TBME.2006.883649}, pages = {2274 -- 2281}, year = {2006}, abstract = {Brain-computer interface (BCI) systems create a novel communication channel from the brain to an output de ice by bypassing conventional motor output pathways of nerves and muscles. Therefore they could provide a new communication and control option for paralyzed patients. Modern BCI technology is essentially based on techniques for the classification of single-trial brain signals. Here we present a novel technique that allows the simultaneous optimization of a spatial and a spectral filter enhancing discriminability rates of multichannel EEG single-trials. The evaluation of 60 experiments involving 22 different subjects demonstrates the significant superiority of the proposed algorithm over to its classical counterpart: the median classification error rate was decreased by 11\%. Apart from the enhanced classification, the spatial and/or the spectral filter that are determined by the algorithm can also be used for further analysis of the data, e.g., for source localization of the respective brain rhythms.}, language = {en} } @article{BordihnHolzer2006, author = {Bordihn, Henning and Holzer, Markus}, title = {Programmed grammars and their relation to the LBA problem}, series = {Acta informatica}, volume = {43}, journal = {Acta informatica}, publisher = {Elsevier}, address = {New York}, issn = {0001-5903}, doi = {10.1007/s00236-006-0017-9}, pages = {223 -- 242}, year = {2006}, abstract = {We consider generating and accepting programmed grammars with bounded degree of non-regulation, that is, the maximum number of elements in success or in failure fields of the underlying grammar. In particular, it is shown that this measure can be restricted to two without loss of descriptional capacity, regardless of whether arbitrary derivations or left-most derivations are considered. Moreover, in some cases, precise characterizations of the linear bounded automaton problem in terms of programmed grammars are obtained. Thus, the results presented in this paper shed new light on some longstanding open problem in the theory of computational complexity.}, language = {en} } @article{PrasseIversenLienhardetal.2022, author = {Prasse, Paul and Iversen, Pascal and Lienhard, Matthias and Thedinga, Kristina and Bauer, Christopher and Herwig, Ralf and Scheffer, Tobias}, title = {Matching anticancer compounds and tumor cell lines by neural networks with ranking loss}, series = {NAR: genomics and bioinformatics}, volume = {4}, journal = {NAR: genomics and bioinformatics}, number = {1}, publisher = {Oxford Univ. Press}, address = {Oxford}, issn = {2631-9268}, doi = {10.1093/nargab/lqab128}, pages = {10}, year = {2022}, abstract = {Computational drug sensitivity models have the potential to improve therapeutic outcomes by identifying targeted drug components that are likely to achieve the highest efficacy for a cancer cell line at hand at a therapeutic dose. State of the art drug sensitivity models use regression techniques to predict the inhibitory concentration of a drug for a tumor cell line. This regression objective is not directly aligned with either of these principal goals of drug sensitivity models: We argue that drug sensitivity modeling should be seen as a ranking problem with an optimization criterion that quantifies a drug's inhibitory capacity for the cancer cell line at hand relative to its toxicity for healthy cells. We derive an extension to the well-established drug sensitivity regression model PaccMann that employs a ranking loss and focuses on the ratio of inhibitory concentration and therapeutic dosage range. We find that the ranking extension significantly enhances the model's capability to identify the most effective anticancer drugs for unseen tumor cell profiles based in on in-vitro data.}, language = {en} } @article{SteinertStabernack2022, author = {Steinert, Fritjof and Stabernack, Benno}, title = {Architecture of a low latency H.264/AVC video codec for robust ML based image classification how region of interests can minimize the impact of coding artifacts}, series = {Journal of Signal Processing Systems for Signal, Image, and Video Technology}, volume = {94}, journal = {Journal of Signal Processing Systems for Signal, Image, and Video Technology}, number = {7}, publisher = {Springer}, address = {New York}, issn = {1939-8018}, doi = {10.1007/s11265-021-01727-2}, pages = {693 -- 708}, year = {2022}, abstract = {The use of neural networks is considered as the state of the art in the field of image classification. A large number of different networks are available for this purpose, which, appropriately trained, permit a high level of classification accuracy. Typically, these networks are applied to uncompressed image data, since a corresponding training was also carried out using image data of similar high quality. However, if image data contains image errors, the classification accuracy deteriorates drastically. This applies in particular to coding artifacts which occur due to image and video compression. Typical application scenarios for video compression are narrowband transmission channels for which video coding is required but a subsequent classification is to be carried out on the receiver side. In this paper we present a special H.264/Advanced Video Codec (AVC) based video codec that allows certain regions of a picture to be coded with near constant picture quality in order to allow a reliable classification using neural networks, whereas the remaining image will be coded using constant bit rate. We have combined this feature with the ability to run with lowest latency properties, which is usually also required in remote control applications scenarios. The codec has been implemented as a fully hardwired High Definition video capable hardware architecture which is suitable for Field Programmable Gate Arrays.}, language = {en} } @article{BauerHerwigLienhardetal.2021, author = {Bauer, Chris and Herwig, Ralf and Lienhard, Matthias and Prasse, Paul and Scheffer, Tobias and Schuchhardt, Johannes}, title = {Large-scale literature mining to assess the relation between anti-cancer drugs and cancer types}, series = {Journal of translational medicine}, volume = {19}, journal = {Journal of translational medicine}, number = {1}, publisher = {BioMed Central}, address = {London}, issn = {1479-5876}, doi = {10.1186/s12967-021-02941-z}, pages = {13}, year = {2021}, abstract = {Background: There is a huge body of scientific literature describing the relation between tumor types and anti-cancer drugs. The vast amount of scientific literature makes it impossible for researchers and physicians to extract all relevant information manually. Methods: In order to cope with the large amount of literature we applied an automated text mining approach to assess the relations between 30 most frequent cancer types and 270 anti-cancer drugs. We applied two different approaches, a classical text mining based on named entity recognition and an AI-based approach employing word embeddings. The consistency of literature mining results was validated with 3 independent methods: first, using data from FDA approvals, second, using experimentally measured IC-50 cell line data and third, using clinical patient survival data. Results: We demonstrated that the automated text mining was able to successfully assess the relation between cancer types and anti-cancer drugs. All validation methods showed a good correspondence between the results from literature mining and independent confirmatory approaches. The relation between most frequent cancer types and drugs employed for their treatment were visualized in a large heatmap. All results are accessible in an interactive web-based knowledge base using the following link: . Conclusions: Our approach is able to assess the relations between compounds and cancer types in an automated manner. Both, cancer types and compounds could be grouped into different clusters. Researchers can use the interactive knowledge base to inspect the presented results and follow their own research questions, for example the identification of novel indication areas for known drugs.}, language = {en} } @misc{MarweckiBaudisch2018, author = {Marwecki, Sebastian and Baudisch, Patrick}, title = {Scenograph}, series = {UIST '18: Proceedings of the 31st Annual ACM Symposium on User Interface Software and Technology}, journal = {UIST '18: Proceedings of the 31st Annual ACM Symposium on User Interface Software and Technology}, publisher = {Association for Computing Machinery}, address = {New York}, isbn = {978-1-4503-5948-1}, doi = {10.1145/3242587.3242648}, pages = {511 -- 520}, year = {2018}, abstract = {When developing a real-walking virtual reality experience, designers generally create virtual locations to fit a specific tracking volume. Unfortunately, this prevents the resulting experience from running on a smaller or differently shaped tracking volume. To address this, we present a software system called Scenograph. The core of Scenograph is a tracking volume-independent representation of real-walking experiences. Scenograph instantiates the experience to a tracking volume of given size and shape by splitting the locations into smaller ones while maintaining narrative structure. In our user study, participants' ratings of realism decreased significantly when existing techniques were used to map a 25m2 experience to 9m2 and an L-shaped 8m2 tracking volume. In contrast, ratings did not differ when Scenograph was used to instantiate the experience.}, language = {en} } @article{BailisDillahuntMuelleretal.2017, author = {Bailis, Peter and Dillahunt, Tawanna and M{\"u}ller, Stefanie and Baudisch, Patrick}, title = {Research for Practice: Technology for Underserved Communities; Personal Fabrication}, series = {Communications of the ACM / Association for Computing Machinery}, volume = {60}, journal = {Communications of the ACM / Association for Computing Machinery}, publisher = {Association for Computing Machinery}, address = {New York}, issn = {0001-0782}, doi = {10.1145/3080188}, pages = {46 -- 49}, year = {2017}, abstract = {THIS INSTALLMENT OF Research for Practice provides curated reading guides to technology for underserved communities and to new developments in personal fabrication. First, Tawanna Dillahunt describes design considerations and technology for underserved and impoverished communities. Designing for the more than 1.6 billion impoverished individuals worldwide requires special consideration of community needs, constraints, and context. Her selections span protocols for poor-quality communication networks, community-driven content generation, and resource and public service discovery. Second, Stefanie Mueller and Patrick Baudisch provide an overview of recent advances in personal fabrication (for example, 3D printers).}, language = {en} } @article{HuangRichterKleickmannetal.2021, author = {Huang, Yizhen and Richter, Eric and Kleickmann, Thilo and Wiepke, Axel and Richter, Dirk}, title = {Classroom complexity affects student teachers' behavior in a VR classroom}, series = {Computers \& education : an international journal}, volume = {163}, journal = {Computers \& education : an international journal}, publisher = {Elsevier}, address = {Oxford}, issn = {0360-1315}, doi = {10.1016/j.compedu.2020.104100}, pages = {15}, year = {2021}, abstract = {Student teachers often struggle to keep track of everything that is happening in the classroom, and particularly to notice and respond when students cause disruptions. The complexity of the classroom environment is a potential contributing factor that has not been empirically tested. In this experimental study, we utilized a virtual reality (VR) classroom to examine whether classroom complexity affects the likelihood of student teachers noticing disruptions and how they react after noticing. Classroom complexity was operationalized as the number of disruptions and the existence of overlapping disruptions (multidimensionality) as well as the existence of parallel teaching tasks (simultaneity). Results showed that student teachers (n = 50) were less likely to notice the scripted disruptions, and also less likely to respond to the disruptions in a comprehensive and effortful manner when facing greater complexity. These results may have implications for both teacher training and the design of VR for training or research purpose. This study contributes to the field from two aspects: 1) it revealed how features of the classroom environment can affect student teachers' noticing of and reaction to disruptions; and 2) it extends the functionality of the VR environment-from a teacher training tool to a testbed of fundamental classroom processes that are difficult to manipulate in real-life.}, language = {en} } @article{BrewkaEllmauthalerKernIsberneretal.2018, author = {Brewka, Gerhard and Ellmauthaler, Stefan and Kern-Isberner, Gabriele and Obermeier, Philipp and Ostrowski, Max and Romero, Javier and Schaub, Torsten H. and Schieweck, Steffen}, title = {Advanced solving technology for dynamic and reactive applications}, series = {K{\"u}nstliche Intelligenz}, volume = {32}, journal = {K{\"u}nstliche Intelligenz}, number = {2-3}, publisher = {Springer}, address = {Heidelberg}, issn = {0933-1875}, doi = {10.1007/s13218-018-0538-8}, pages = {199 -- 200}, year = {2018}, language = {en} } @article{HawroPrzybylowiczSpindleretal.2021, author = {Hawro, Tomasz and Przybylowicz, Katarzyna and Spindler, Max and Hawro, Marlena and Steć, Michał and Altrichter, Sabine and Weller, Karsten and Magerl, Markus and Reidel, Ulrich and Alarbeed, Ezzat and Alraboni, Ola and Maurer, Marcus and Metz, Martin}, title = {The characteristics and impact of pruritus in adult dermatology patients}, series = {Journal of the American Academy of Dermatology}, volume = {84}, journal = {Journal of the American Academy of Dermatology}, number = {3}, publisher = {Elsevier}, address = {Amsterdam [u.a.]}, issn = {0190-9622}, doi = {10.1016/J.JAAD.2020.08.035}, pages = {691 -- 700}, year = {2021}, abstract = {Background: Pruritus often accompanies chronic skin diseases, exerting considerable burden on many areas of patient functioning; this burden and the features of pruritus remain insufficiently characterized. Objective: To investigate characteristics, including localization patterns, and burden of pruritus in patients with chronic dermatoses. Methods: We recruited 800 patients with active chronic skin diseases. We assessed pruritus intensity, localization, and further characteristics. We used validated questionnaires to assess quality of life, work productivity and activity impairment, anxiety, depression, and sleep quality. Results: Nine out of every 10 patients had experienced pruritus throughout their disease and 73\% in the last 7 days. Pruritus often affected the entire body and was not restricted to skin lesions. Patients with moderate to severe pruritus reported significantly more impairment to their sleep quality and work productivity, and they were more depressed and anxious than control individuals and patients with mild or no pruritus. Suicidal ideations were highly prevalent in patients with chronic pruritus (18.5\%) and atopic dermatitis (11.8\%). Conclusions: Pruritus prevalence and intensity are very high across all dermatoses studied; intensity is linked to impairment in many areas of daily functioning. Effective treatment strategies are urgently required to treat pruritus and the underlying skin disease. ( J Am Acad Dermatol 2021;84:691-700.)}, language = {en} } @article{LutherTiberiusBrem2020, author = {Luther, Laura and Tiberius, Victor and Brem, Alexander}, title = {User experience (UX) in business, management, and psychology}, series = {Multimodal technologies and interaction : open access journal}, volume = {4}, journal = {Multimodal technologies and interaction : open access journal}, number = {2}, publisher = {MDPI}, address = {Basel}, issn = {2414-4088}, doi = {10.3390/mti4020018}, pages = {19}, year = {2020}, abstract = {User Experience (UX) describes the holistic experience of a user before, during, and after interaction with a platform, product, or service. UX adds value and attraction to their sole functionality and is therefore highly relevant for firms. The increased interest in UX has produced a vast amount of scholarly research since 1983. The research field is, therefore, complex and scattered. Conducting a bibliometric analysis, we aim at structuring the field quantitatively and rather abstractly. We employed citation analyses, co-citation analyses, and content analyses to evaluate productivity and impact of extant research. We suggest that future research should focus more on business and management related topics.}, language = {en} } @article{BanbaraSohTamuraetal.2013, author = {Banbara, Mutsunori and Soh, Takehide and Tamura, Naoyuki and Inoue, Katsumi and Schaub, Torsten H.}, title = {Answer set programming as a modeling language for course timetabling}, series = {Theory and practice of logic programming}, volume = {13}, journal = {Theory and practice of logic programming}, number = {2}, publisher = {Cambridge Univ. Press}, address = {New York}, issn = {1471-0684}, doi = {10.1017/S1471068413000495}, pages = {783 -- 798}, year = {2013}, abstract = {The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds.}, language = {en} } @article{LamprechtMargariaSteffen2014, author = {Lamprecht, Anna-Lena and Margaria, Tiziana and Steffen, Bernhard}, title = {Modeling and Execution of Scientific Workflows with the jABC Framework}, series = {Process Design for Natural Scientists: an agile model-driven approach}, journal = {Process Design for Natural Scientists: an agile model-driven approach}, number = {500}, editor = {Lambrecht, Anna-Lena and Margaria, Tiziana}, publisher = {Springer Verlag}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {14 -- 29}, year = {2014}, abstract = {We summarize here the main characteristics and features of the jABC framework, used in the case studies as a graphical tool for modeling scientific processes and workflows. As a comprehensive environment for service-oriented modeling and design according to the XMDD (eXtreme Model-Driven Design) paradigm, the jABC offers much more than the pure modeling capability. Associated technologies and plugins provide in fact means for a rich variety of supporting functionality, such as remote service integration, taxonomical service classification, model execution, model verification, model synthesis, and model compilation. We describe here in short both the essential jABC features and the service integration philosophy followed in the environment. In our work over the last years we have seen that this kind of service definition and provisioning platform has the potential to become a core technology in interdisciplinary service orchestration and technology transfer: Domain experts, like scientists not specially trained in computer science, directly define complex service orchestrations as process models and use efficient and complex domain-specific tools in a simple and intuitive way.}, language = {en} } @article{LamprechtMargaria2014, author = {Lamprecht, Anna-Lena and Margaria, Tiziana}, title = {Scientific Workflows and XMDD}, series = {Process Design for Natural Scientists: an agile model-driven approach}, journal = {Process Design for Natural Scientists: an agile model-driven approach}, number = {500}, editor = {Lambrecht, Anna-Lena and Margaria, Tiziana}, publisher = {Springer Verlag}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {1 -- 13}, year = {2014}, abstract = {A major part of the scientific experiments that are carried out today requires thorough computational support. While database and algorithm providers face the problem of bundling resources to create and sustain powerful computation nodes, the users have to deal with combining sets of (remote) services into specific data analysis and transformation processes. Today's attention to "big data" amplifies the issues of size, heterogeneity, and process-level diversity/integration. In the last decade, especially workflow-based approaches to deal with these processes have enjoyed great popularity. This book concerns a particularly agile and model-driven approach to manage scientific workflows that is based on the XMDD paradigm. In this chapter we explain the scope and purpose of the book, briefly describe the concepts and technologies of the XMDD paradigm, explain the principal differences to related approaches, and outline the structure of the book.}, language = {en} } @article{LamprechtWickertMargaria2014, author = {Lamprecht, Anna-Lena and Wickert, Alexander and Margaria, Tiziana}, title = {Lessons Learned}, series = {Process Design for Natural Scientists: an agile model-driven approach}, journal = {Process Design for Natural Scientists: an agile model-driven approach}, number = {500}, editor = {Lambrecht, Anna-Lena and Margaria, Tiziana}, publisher = {Springer Verlag}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {45 -- 64}, year = {2014}, abstract = {This chapter summarizes the experience and the lessons we learned concerning the application of the jABC as a framework for design and execution of scientific workflows. It reports experiences from the domain modeling (especially service integration) and workflow design phases and evaluates the resulting models statistically with respect to the SIB library and hierarchy levels.}, language = {en} } @article{LamprechtWickert2014, author = {Lamprecht, Anna-Lena and Wickert, Alexander}, title = {The Course's SIB Libraries}, series = {Process Design for Natural Scientists: an agile model-driven approach}, journal = {Process Design for Natural Scientists: an agile model-driven approach}, number = {500}, editor = {Lambrecht, Anna-Lena and Margaria, Tiziana}, publisher = {Springer Verlag}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {30 -- 44}, year = {2014}, abstract = {This chapter gives a detailed description of the service framework underlying all the example projects that form the foundation of this book. It describes the different SIB libraries that we made available for the course "Process modeling in the natural sciences" to provide the functionality that was required for the envisaged applications. The students used these SIB libraries to realize their projects.}, language = {en} } @article{LamprechtMargaria2015, author = {Lamprecht, Anna-Lena and Margaria, Tiziana}, title = {Scientific workflows and XMDD}, series = {Process design for natural scientists}, journal = {Process design for natural scientists}, editor = {Lamprecht, Anna-Lena and Margaria, Tiziana}, publisher = {Springer}, address = {Berlin}, isbn = {978-3-662-45006-2}, pages = {1 -- 13}, year = {2015}, language = {en} } @article{NaujokatNeubauerLamprechtetal.2014, author = {Naujokat, Stefan and Neubauer, Johannes and Lamprecht, Anna-Lena and Steffen, Bernhard and Joerges, Sven and Margaria, Tiziana}, title = {Simplicity-first model-based plug-in development}, series = {Software : practice \& experience}, volume = {44}, journal = {Software : practice \& experience}, number = {3}, publisher = {Wiley-Blackwell}, address = {Hoboken}, issn = {0038-0644}, doi = {10.1002/spe.2243}, pages = {277 -- 297}, year = {2014}, abstract = {In this article, we present our experience with over a decade of strict simplicity orientation in the development and evolution of plug-ins. The point of our approach is to enable our graphical modeling framework jABC to capture plug-in development in a domain-specific setting. The typically quite tedious and technical plug-in development is shifted this way from a programming task to the modeling level, where it can be mastered also by application experts without programming expertise. We show how the classical plug-in development profits from a systematic domain-specific API design and how the level of abstraction achieved this way can be further enhanced by defining adequate building blocks for high-level plug-in modeling. As the resulting plug-in models can be compiled and deployed automatically, our approach decomposes plug-in development into three phases where only the realization phase requires plug-in-specific effort. By using our modeling framework jABC, this effort boils down to graphical, tool-supported process modeling. Furthermore, we support the automatic completion of process sketches for executability. All this will be illustrated along the most recent plug-in-based evolution of the jABC framework, which witnessed quite some bootstrapping effects.}, language = {en} } @book{LamprechtMagariaSteffenetal.2007, author = {Lamprecht, Anna-Lena and Magaria, Tiziana and Steffen, Bernhard and Sczyrba, Alexander and Hartmeier, Sven and Giegerich, Robert}, title = {GeneFisher-P}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2007, 3}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {17 S.}, year = {2007}, language = {en} } @article{MarcoFigueraRiedelRossietal.2022, author = {Marco Figuera, Ramiro and Riedel, Christian and Rossi, Angelo Pio and Unnithan, Vikram}, title = {Depth to diameter analysis on small simple craters at the lunar south pole - possible implications for ice harboring}, series = {Remote sensing}, volume = {14}, journal = {Remote sensing}, number = {3}, publisher = {MDPI}, address = {Basel}, issn = {2072-4292}, doi = {10.3390/rs14030450}, pages = {13}, year = {2022}, abstract = {In this paper, we present a study comparing the depth to diameter (d/D) ratio of small simple craters (200-1000 m) of an area between -88.5 degrees to -90 degrees latitude at the lunar south pole containing Permanent Shadowed Regions (PSRs) versus craters without PSRs. As PSRs can reach temperatures of 110 K and are capable of harboring volatiles, especially water ice, we analyzed the relationship of depth versus diameter ratios and its possible implications for harboring water ice. Variations in the d/D ratios can also be caused by other processes such as degradation, isostatic adjustment, or differences in surface properties. The conducted d/D ratio analysis suggests that a differentiation between craters containing PSRs versus craters without PSRs occurs. Thus, a possible direct relation between d/D ratio, PSRs, and water ice harboring might exist. Our results suggest that differences in the target's surface properties may explain the obtained results. The resulting d/D ratios of craters with PSRs can help to select target areas for future In-Situ Resource Utilization (ISRU) missions.}, language = {en} } @misc{KliemeTietzMeinel2018, author = {Klieme, Eric and Tietz, Christian and Meinel, Christoph}, title = {Beware of SMOMBIES}, series = {The 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom 2018)/the 12th IEEE International Conference on Big Data Science and Engineering (IEEE BigDataSE 2018)}, journal = {The 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom 2018)/the 12th IEEE International Conference on Big Data Science and Engineering (IEEE BigDataSE 2018)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5386-4387-7}, issn = {2324-9013}, doi = {10.1109/TrustCom/BigDataSE.2018.00096}, pages = {651 -- 660}, year = {2018}, abstract = {Several research evaluated the user's style of walking for the verification of a claimed identity and showed high authentication accuracies in many settings. In this paper we present a system that successfully verifies a user's identity based on many real world smartphone placements and yet not regarded interactions while walking. Our contribution is the distinction of all considered activities into three distinct subsets and a specific one-class Support Vector Machine per subset. Using sensor data of 30 participants collected in a semi-supervised study approach, we prove that unsupervised verification is possible with very low false-acceptance and false-rejection rates. We furthermore show that these subsets can be distinguished with a high accuracy and demonstrate that this system can be deployed on off-the-shelf smartphones.}, language = {en} } @article{ThienenNoweskiMeineletal.2012, author = {Thienen, Julia von and Noweski, Christine and Meinel, Christoph and Lang, Sabine and Nicolai, Claudia and Bartz, Andreas}, title = {What can design thinking learn from behavior group theraphy?}, isbn = {978-3-642-31990-7}, year = {2012}, language = {en} } @misc{AlhosseiniAlmodarresiYasinBinTareafNajafietal.2019, author = {Alhosseini Almodarresi Yasin, Seyed Ali and Bin Tareaf, Raad and Najafi, Pejman and Meinel, Christoph}, title = {Detect me if you can}, series = {Companion Proceedings of The 2019 World Wide Web Conference}, journal = {Companion Proceedings of The 2019 World Wide Web Conference}, publisher = {Association for Computing Machinery}, address = {New York}, isbn = {978-1-4503-6675-5}, doi = {10.1145/3308560.3316504}, pages = {148 -- 153}, year = {2019}, abstract = {Spam Bots have become a threat to online social networks with their malicious behavior, posting misinformation messages and influencing online platforms to fulfill their motives. As spam bots have become more advanced over time, creating algorithms to identify bots remains an open challenge. Learning low-dimensional embeddings for nodes in graph structured data has proven to be useful in various domains. In this paper, we propose a model based on graph convolutional neural networks (GCNN) for spam bot detection. Our hypothesis is that to better detect spam bots, in addition to defining a features set, the social graph must also be taken into consideration. GCNNs are able to leverage both the features of a node and aggregate the features of a node's neighborhood. We compare our approach, with two methods that work solely on a features set and on the structure of the graph. To our knowledge, this work is the first attempt of using graph convolutional neural networks in spam bot detection.}, language = {en} } @article{LindbergMeinelWagner2011, author = {Lindberg, Tilmann and Meinel, Christoph and Wagner, Ralf}, title = {Design thinking : a fruitful concept for IT development?}, isbn = {978-3-642-13756-3}, year = {2011}, language = {en} } @article{MeinelKlotz2006, author = {Meinel, Christoph and Klotz, Volker}, title = {The first 10 years of the ECCC digital library}, doi = {10.1145/1107458.1107484}, year = {2006}, language = {en} } @article{GruenewaldMeinel2015, author = {Gr{\"u}newald, Franka and Meinel, Christoph}, title = {Implementation and Evaluation of Digital E-Lecture Annotation in Learning Groups to Foster Active Learning}, series = {IEEE transactions on learning technologies}, volume = {8}, journal = {IEEE transactions on learning technologies}, number = {3}, publisher = {Inst. of Electr. and Electronics Engineers}, address = {Los Alamitos}, issn = {1939-1382}, doi = {10.1109/TLT.2015.2396042}, pages = {286 -- 298}, year = {2015}, abstract = {The use of video lectures in distance learning involves the two major problems of searchability and active user participation. In this paper, we promote the implementation and usage of a collaborative educational video annotation functionality to overcome these two challenges. Different use cases and requirements, as well as details of the implementation, are explained. Furthermore, we suggest more improvements to foster a culture of participation and an algorithm for the extraction of semantic data. Finally, evaluations in the form of user tests and questionnaires in a MOOC setting are presented. The results of the evaluation are promising, as they indicate not only that students perceive it as useful, but also that the learning effectiveness increases. The combination of personal lecture video annotations with a semantic topic map was also evaluated positively and will thus be investigated further, as will the implementation in a MOOC context.}, language = {en} } @phdthesis{Saleh2016, author = {Saleh, Eyad}, title = {Securing Multi-tenant SaaS Environments}, school = {Universit{\"a}t Potsdam}, pages = {108}, year = {2016}, abstract = {Software-as-a-Service (SaaS) offers several advantages to both service providers and users. Service providers can benefit from the reduction of Total Cost of Ownership (TCO), better scalability, and better resource utilization. On the other hand, users can use the service anywhere and anytime, and minimize upfront investment by following the pay-as-you-go model. Despite the benefits of SaaS, users still have concerns about the security and privacy of their data. Due to the nature of SaaS and the Cloud in general, the data and the computation are beyond the users' control, and hence data security becomes a vital factor in this new paradigm. Furthermore, in multi-tenant SaaS applications, the tenants become more concerned about the confidentiality of their data since several tenants are co-located onto a shared infrastructure. To address those concerns, we start protecting the data from the provisioning process by controlling how tenants are being placed in the infrastructure. We present a resource allocation algorithm designed to minimize the risk of co-resident tenants called SecPlace. It enables the SaaS provider to control the resource (i.e., database instance) allocation process while taking into account the security of tenants as a requirement. Due to the design principles of the multi-tenancy model, tenants follow some degree of sharing on both application and infrastructure levels. Thus, strong security-isolation should be present. Therefore, we develop SignedQuery, a technique that prevents one tenant from accessing others' data. We use the Signing Concept to create a signature that is used to sign the tenant's request, then the server can verifies the signature and recognizes the requesting tenant, and hence ensures that the data to be accessed is belonging to the legitimate tenant. Finally, Data confidentiality remains a critical concern due to the fact that data in the Cloud is out of users' premises, and hence beyond their control. Cryptography is increasingly proposed as a potential approach to address such a challenge. Therefore, we present SecureDB, a system designed to run SQL-based applications over an encrypted database. SecureDB captures the schema design and analyzes it to understand the internal structure of the data (i.e., relationships between the tables and their attributes). Moreover, we determine the appropriate partialhomomorphic encryption scheme for each attribute where computation is possible even when the data is encrypted. To evaluate our work, we conduct extensive experiments with di↵erent settings. The main use case in our work is a popular open source HRM application, called OrangeHRM. The results show that our multi-layered approach is practical, provides enhanced security and isolation among tenants, and have a moderate complexity in terms of processing encrypted data.}, language = {en} } @article{MeinelWang2006, author = {Meinel, Christoph and Wang, Long}, title = {Building content clusters based on modelling page pairs}, doi = {10.1007/11610113_85}, year = {2006}, abstract = {We give a new view on building content clusters from page pair models. We measure the heuristic importance within every two pages by computing the distance of their accessed positions in usage sessions. We also compare our page pair models with the classical pair models used in information theories and natural language processing, and give different evaluation methods to build the reasonable content communities. And we finally interpret the advantages and disadvantages of our models from detailed experiment results}, language = {en} } @phdthesis{SadrAzodi2015, author = {Sadr-Azodi, Amir Shahab}, title = {Towards Real-time SIEM-based Network monitoring and Intrusion Detection through Advanced Event Normalization}, school = {Universit{\"a}t Potsdam}, pages = {144}, year = {2015}, language = {en} } @phdthesis{Gericke2014, author = {Gericke, Lutz}, title = {Tele-Board - Supporting and analyzing creative collaboration in synchronous and asynchronous scenario}, pages = {186}, year = {2014}, language = {en} }