48333
2019
2019
eng
1353
1368
16
8-9
108
article
Springer
Dordrecht
1
--
2019-02-25
--
Joint detection of malicious domains and infected clients
Detection of malware-infected computers and detection of malicious web domains based on their encrypted HTTPS traffic are challenging problems, because only addresses, timestamps, and data volumes are observable. The detection problems are coupled, because infected clients tend to interact with malicious domains. Traffic data can be collected at a large scale, and antivirus tools can be used to identify infected clients in retrospect. Domains, by contrast, have to be labeled individually after forensic analysis. We explore transfer learning based on sluice networks; this allows the detection models to bootstrap each other. In a large-scale experimental study, we find that the model outperforms known reference models and detects previously unknown malware, previously unknown malware families, and previously unknown malicious domains.
Machine learning
10.1007/s10994-019-05789-z
0885-6125
1573-0565
wos:2019
WOS:000478619200008
Prasse, P (reprint author), Univ Potsdam, Dept Comp Sci, Potsdam, Germany., prasse@cs.uni-potsdam.de; knaebel@cs.uni-potsdam.de; lumachli@cisco.com; tpevny@cisco.com; scheffer@cs.uni-potsdam.de
Cisco RD
importub
2020-11-18T15:23:03+00:00
filename=package.tar
13e4f3588c29df1e5a6166fe4466d6f7
false
true
Paul Prasse
Rene Knaebel
Lukas Machlica
Tomas Pevny
Tobias Scheffer
eng
uncontrolled
Machine learning
eng
uncontrolled
Neural networks
eng
uncontrolled
Computer security
eng
uncontrolled
Traffic data
eng
uncontrolled
Https traffic
Informatik, Wissen, Systeme
Institut für Informatik und Computational Science
Import
48337
2019
2019
eng
26
43
18
274
article
Elsevier
Amsterdam
1
2019-02-15
--
--
Gelfond-Zhang aggregates as propositional formulas
Answer Set Programming (ASP) has become a popular and widespread paradigm for practical Knowledge Representation thanks to its expressiveness and the available enhancements of its input language. One of such enhancements is the use of aggregates, for which different semantic proposals have been made. In this paper, we show that any ASP aggregate interpreted under Gelfond and Zhang's (GZ) semantics can be replaced (under strong equivalence) by a propositional formula. Restricted to the original GZ syntax, the resulting formula is reducible to a disjunction of conjunctions of literals but the formulation is still applicable even when the syntax is extended to allow for arbitrary formulas (including nested aggregates) in the condition. Once GZ-aggregates are represented as formulas, we establish a formal comparison (in terms of the logic of Here-and-There) to Ferraris' (F) aggregates, which are defined by a different formula translation involving nested implications. In particular, we prove that if we replace an F-aggregate by a GZ-aggregate in a rule head, we do not lose answer sets (although more can be gained). This extends the previously known result that the opposite happens in rule bodies, i.e., replacing a GZ-aggregate by an F-aggregate in the body may yield more answer sets. Finally, we characterize a class of aggregates for which GZ- and F-semantics coincide.
Artificial intelligence
10.1016/j.artint.2018.10.007
0004-3702
1872-7921
wos:2019
WOS:000472702500002
Cabalar, P (reprint author), Univ A Coruna, La Coruna, Spain.; Schaub, T (reprint author), Univ Potsdam, Potsdam, Germany.; Schaub, T (reprint author), INRIA, Rennes, France.; Schaub, T (reprint author), Simon Fraser Univ, Sch Comp Sci, Burnaby, BC, Canada.; Schaub, T (reprint author), Griffith Univ, Inst Integrated & Intelligent Syst, Nathan, Qld, Australia., cabalar@udc.es; jorge.fandino@udc.es; torsten@cs.uni-potsdam.de; seschell@cs.uni-potsdam.de
Xunta de Galicia, SpainXunta de Galicia [GPC-ED431B 2016/035, 2016-2019 ED431G/01]; MINECO, Spain [TIN 2013-42149-P, TIN 2017-84453-P]; Centre International de Mathernatiques et Informatique de Toulouse [ANR-11-LABEX-0040-CIMI, ANR-11-IDEX-0002-02]; DFGGerman Research Foundation (DFG) [SCHA 550/9]
importub
2020-11-19T08:34:34+00:00
filename=package.tar
3dea177e936414134df450ccdcc20d71
false
true
Pedro Cabalar
Jorge Fandinno
Torsten H. Schaub
Sebastian Schellhorn
eng
uncontrolled
Aggregates
eng
uncontrolled
Answer Set Programming
Informatik, Informationswissenschaft, allgemeine Werke
Institut für Informatik und Computational Science
Referiert
Open Access
Import
Green Open-Access
48254
2020
2020
2020
eng
XIX, 103
doctoralthesis
1
--
--
2020-07-31
TrainTrap
a hybrid technique for vulnerability analysis in JAVA
Potsdam, Univ., Diss., 2020
Mohammadreza Ashouri
Informatik, Wissen, Systeme
Institut für Informatik und Computational Science
Universität Potsdam
Universität Potsdam
48259
2019
2019
eng
908
924
17
5-6
19
article
Cambridge Univ. Press
New York
1
--
--
--
Revisiting Explicit Negation in Answer Set Programming
Theory and practice of logic programming
10.1017/S1471068419000267
1471-0684
1475-3081
wos:2019
35th International Conference on Logic Programming (ICLP)
SEP 20-25, 2019
WOS:000487090500018
Las Cruces, NM
Aguado, F (reprint author), Univ A Coruna, CITIC, Informat Retrieval Lab, La Coruna, Spain., aguado@udc.es; cabalar@udc.es; jorge.fandinno@irit.fr; david.pearce@upm.es; gperez@udc.es; eicovima@udc.es
MINECO, Spain [TIC2017-84453-P]; Xunta de Galicia, SpainXunta de Galicia [GPC ED431B 2019/03, 2016-2019 ED431G/01]; Centre International de [ANR-11-LABEX-0040-CIMI, ANR-11-IDEX-0002-02]; Alexander von Humboldt FoundationAlexander von Humboldt Foundation
importub
2020-11-14T13:38:39+00:00
filename=package.tar
8482d258bf885552d0db255d456033b9
<a href="https://doi.org/10.25932/publishup-46969">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 1104</a>
Felicidad Aguado
Pedro Cabalar
Jorge Fandiño
David Pearce
Gilberto Perez
Concepcion Vidal-Peracho
eng
uncontrolled
Answer set programming
eng
uncontrolled
Non-monotonic reasoning
eng
uncontrolled
Equilibrium logic
eng
uncontrolled
Explicit negation
Informatik, Informationswissenschaft, allgemeine Werke
Institut für Informatik und Computational Science
Referiert
Open Access
Import
Hybrid Open-Access
47028
2006
2006
eng
1909
1936
28
7
article
MIT Press
Cambridge, Mass.
1
--
2006-09-07
--
Incremental support vector learning: analysis, implementation and applications
Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM learning, with the aim of providing a fast, numerically stable and robust implementation. A detailed analysis of convergence and of algorithmic complexity of incremental SVM learning is carried out. Based on this analysis, a new design of storage and numerical operations is proposed, which speeds up the training of an incremental SVM by a factor of 5 to 20. The performance of the new algorithm is demonstrated in two scenarios: learning with limited resources and active learning. Various applications of the algorithm, such as in drug discovery, online monitoring of industrial devices and and surveillance of network traffic, can be foreseen.
Journal of machine learning research
1532-4435
wos:2006
WOS:000245389400005
Laskov, P (reprint author), Fraunhofer First Ida, Kekulestr 7, D-12489 Berlin, Germany., LASKOV@FIRST.FHG.DE; CGEHL@FIRST.FHG.DE; KRUEGERS@FIRST.FHG.DE; KLAUS@FIRST.FHG.DE
importub
2020-06-02T10:12:11+00:00
filename=package.tar
b6cfaacd34b314e32ece81d3fbfb102b
false
true
Pavel Laskov
Christian Gehl
Stefan Krüger
Klaus-Robert Müller
eng
uncontrolled
incremental SVM
eng
uncontrolled
online learning
eng
uncontrolled
drug discovery
eng
uncontrolled
intrusion detection
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
Import
47038
2006
2006
eng
12
380
7
article
BioMed Central
London
1
--
--
--
Validation and functional annotation of expression-based clusters based on gene ontology
Background: The biological interpretation of large-scale gene expression data is one of the paramount challenges in current bioinformatics. In particular, placing the results in the context of other available functional genomics data, such as existing bio-ontologies, has already provided substantial improvement for detecting and categorizing genes of interest. One common approach is to look for functional annotations that are significantly enriched within a group or cluster of genes, as compared to a reference group. Results: In this work, we suggest the information-theoretic concept of mutual information to investigate the relationship between groups of genes, as given by data-driven clustering, and their respective functional categories. Drawing upon related approaches (Gibbons and Roth, Genome Research 12: 1574-1581, 2002), we seek to quantify to what extent individual attributes are sufficient to characterize a given group or cluster of genes. Conclusion: We show that the mutual information provides a systematic framework to assess the relationship between groups or clusters of genes and their functional annotations in a quantitative way. Within this framework, the mutual information allows us to address and incorporate several important issues, such as the interdependence of functional annotations and combinatorial combinations of attributes. It thus supplements and extends the conventional search for overrepresented attributes within a group or cluster of genes. In particular taking combinations of attributes into account, the mutual information opens the way to uncover specific functional descriptions of a group of genes or clustering result. All datasets and functional annotations used in this study are publicly available. All scripts used in the analysis are provided as additional files.
BMC bioinformatics
10.1186/1471-2105-7-380
16911788
1471-2105
wos:2006
380
WOS:000240941600001
Steuer, R (reprint author), Univ Potsdam, Inst Biochem & Biol, Karl Liebknecht Str 24-25,Haus 20, D-14476 Potsdam, Germany., steuer@agnld.uni-potsdam.de; humburg@mpimp-golm.mpg.de; selbig@mpimp-golm.mpg.de
importub
2020-06-02T13:29:31+00:00
filename=package.tar
1e5b5d5edb6aea3b75c7ce59688c9a18
false
true
Ralf Steuer
Peter Humburg
Joachim Selbig
Informatik, Informationswissenschaft, allgemeine Werke
Institut für Informatik und Computational Science
Import
41700
2016
2016
deu
285
287
P-262
bookpart
Gesellschaft für Informatik
Bonn
1
--
--
--
Digitale Teilnehmerzertifikate und Open Badges verbinden
Während Qualifikationen und Kompetenzen, die auf informellem Wege erworben werden, immer mehr Beachtung finden, stellt sowohl deren Darstellung als auch die Anerkennung ein meist unüberwindbares Hindernis für Ausstellende und Erwerbende dar. Vermehrt wird unterdessen von klassisch papiergebundenen auf digitale Teilnahmezertifikate umgestellt, um den Nachweis von Kompetenz- und Qualifikationserwerb zu vereinfachen. In diesem Zusammenhang kann die Verbindung von digitalen Teilnahmezertifikaten und Open Badges einen Mehrwert für die öffentliche Darstellung und Verifikation bieten.
DeLFI 2016 - Die 14. E-Learning Fachtagung Informatik 11.-14. September 2016 Potsdam
Der E-Teaching-Badge
978-3-88579-656-5
http://subs.emis.de/LNI/Proceedings/Proceedings262/article21.html
online registration
Alexander Kiy
Jörg Hafer
Marlen Schumann
Uta Enke
deu
uncontrolled
Teilnehmerzertifikate
deu
uncontrolled
Peer-Review
deu
uncontrolled
Open Badges
deu
uncontrolled
Open Badge Infrastructure
deu
uncontrolled
OBI
Informatik, Informationswissenschaft, allgemeine Werke
Institut für Informatik und Computational Science
Universität Potsdam
13985
2004
2004
eng
article
1
--
--
--
A compiler for nested logic programming
3-540- 20721-x
allegro:1991-2014
10096232
Logic programming and nonmonotonic reasoning : 7th international conference, LPNMR 2004, Fort Lauderale, Fl, USA, Januar 6 -8, 2004 ; proceedings / LPNMR 2004. Hrsg.: Vladimir Lifschitz ; Ilka Niemelä. - Berlin [u.a.] : Springer, 2004. - (Lecture notes in computer science ; 2923 : Lecture notes in artificial intelligence). - ISBN 3-540- 20721-x. - S. 361 - 364
Vladimir Sarsakov
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
14297
2004
2004
eng
article
1
--
--
--
On Acyclic and head-cycle free nested logic programs
3-540-22671-01
allegro:1991-2014
10096934
Logic programming : 20th international conference, ICLP 2004, Saint-Malo, France, September 6 - 10, 2004 ; proceedings / Hrsg.: Bart Demoen ; Vladimir Lifschitz. - Berlin : Springer, 2004. - ISBN: 3-540-22671-01. - (Lecture notes in computer science ; 3132). - S. 225 - 239
Thomas Linke
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Nicht ermittelbar
Institut für Informatik
14299
2004
2004
eng
article
1
--
--
--
On acyclic and head-cycle free nested logic programs
allegro:1991-2014
10096936
Non-monotonic reasoning : proceedings / 10th international workshop on Non-monotonic reasoning, Whistler, Canada, Juni 6 - 8, 2004. - Berlin : Springer, 2004. - S. 267 - 275
Thomas Linke
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Nicht ermittelbar
Institut für Informatik