Speaker: Paul Irofti (University of Bucharest)
Abstract: We continue our investigation on the task of detecting outliers in networks when dealing with big-data and investigate existing online and distributed solutions.
Required reading:
Miao, Xuedan, et al. “Distributed online one-class support vector machine for anomaly detection over networks.” IEEE transactions on cybernetics 49.4 (2018): 1475-1488.
Liu, Zhaoting, Ying Liu, and Chunguang Li. “Distributed sparse recursive least-squares over networks.” IEEE Transactions on Signal Processing 62.6 (2014): 1386-1395.
Speaker: Andra Băltoiu (University of Bucharest)
Abstract: We continue our investigation on the task of detecting outliers in networks, by looking at the concept of signal variation on a graph.
Required reading:
A. Sandryhaila and J. M. F. Moura, “Classification via regularization on graphs,” 2013 IEEE Global Conference on Signal and Information Processing, Austin, TX, 2013, pp. 495-498.
S. Chen, A. Sandryhaila, J. M. F. Moura and J. Kovačević, “Signal Recovery on Graphs: Variation Minimization,” in IEEE Transactions on Signal Processing, vol. 63, no. 17, pp. 4609-4624, Sept.1, 2015.
Speaker: Andrei Pătrașcu (University of Bucharest)
Abstract: We continue our adventure by investigating existing results with Robust Principal Component Analysis (RPCA) and its adaptation to existing deep neural networks.
Required reading:
ZHOU, Chong; PAFFENROTH, Randy C. Anomaly detection with robust deep autoencoders. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2017. p. 665-674.
CANDÈS, Emmanuel J., et al. Robust principal component analysis?. Journal of the ACM (JACM), 2011, 58.3: 11.
Speaker: Andrei Pătrașcu (University of Bucharest)
Abstract: Recent empirical results confirm that one-class (OC) classification methods remain among the most important learning strategies for anomaly detection. In this seminar, we will technically describe in detail multiple basic OC schemes such as OC-SVM and SVDD and their deep variants, in order to identify room of improvements or generalization directions towards the graph anomaly detection context.
Firma Secureworks a propus un curs optional pentru anul II, semestrul I. Puteti consulta fisa cursului aici. Recomandam studentilor SLA care finalizeaza anul I sa aleaga acest curs atunci cand vor opta pentru cursurile optionale din anul II. Pentru detalii privind alegerea cursurilor optionale, urmariti anunturile FMI sau intrebati la secretariat.
Miercuri 5.06, ora 9.00, sala 201.
Miercuri 5.06, ora 9.00, sali: 201, 204. Repartitia pe comisii este afisata pe moodle.
Speaker: Alexandru Dragomir (University of Bucharest)
Abstract: Dynamic epistemic logics are useful in reasoning about knowledge and certain acts of learning (epistemic actions). However, not all epistemic actions are allowed to be executed in an initial epistemic model, and this is where the concept of a protocol comes in: a protocol stipulates what epistemic actions are allowed to be performed in a model. The aim of my presentation is to introduce the audience to two accounts of protocols in DEL: one based on [1], and the second on [2].
References:
[1] T. Hoshi, Epistemic dynamics and protocol information, PhD thesis, Stanford University, 2009.
[2] Y. Wang, Y. Epistemic Modelling and Protocol Dynamics, PhD thesis, University of Amsterdam, 2010.
Speaker: Radu Velea (BitDefender)
Abstract: Static code analysis methods have the advantage of providing deterministic and reliable results. Malware has evolved beyond the point where simple pattern matching algorithms or signatures can provide adequate levels of protection. To respond to new threats we have to look at other hidden aspects such as execution behavior and fight evasive techniques by performing dynamic code analysis. This presentation discusses how to do this using runtime emulation and describes the existing challenges for the most popular architectures and executable file formats.
Colocviul de practica va avea loc Miercuri, 5.06, ora 9.00. Repartitia pe comisii va fi anuntata ulterior. Studentii au obligatia sa incarce prezentarea (fisier pdf) pana la data de 1.06.2019 (ora 24.00), folosind linkul urmator: https://tinyurl.com/y6f2mvp4
De asemenea, studentii trebuie sa depuna la secretariat adeverinta de practica pana luni, 3.06.2019 (ora 14.00).
