Master's program at the Faculty of Mathematics and Computer Science, University of Bucharest
Bursele Bitdefender de merit (acordate in urma rezultatelor din semestrul I, anul universitar 2019-2020), premiile si bursele de cercetare vor fi anuntate la inceputul lunii martie.
Ultima bursa Bitdefender acordata unui studenti SLA este bursa de merit pentru rezultatele din semestru II in anul universitar 2018-2019, care a fost acordata studentului Constantin Cir.
Prima intalnire de pregatire cu studentii FMI pentru ECSC 2020 va avea loc miercuri, 26 februarie, ora 14:00 in sala 214 (sala Google). Participa: Silviu Sofronie (Bitdefender). Cei care doresc sa participe trebuie sa completeze urmatorul formular: https://forms.gle/RNMK2aPbehE1BGBD6
Mai multe informatii despre ECSC: http://www.cybersecuritychallenge.ro/
Pentru studentii la masterul de SLA, participarea la orele de pregatire poate fi considerata practica (mai multe detalii la cerere, la prima intalnire).
Va asteptam!
Speaker: Horia Velicu (BRD – Groupe Societe Generale)
Abstract: Presentation of topics of interest for 2020, objectives and data available at BRD. Proposals for the themes for the applied research institute that will be sponsored this year. Presentation of the new BRD AI Hub.
Speaker: Marian Calborean (University of Bucharest)
Abstract: The Sorites paradox is usually studied as a propositional paradox. However, the general form of the Sorites is second-order, with three main features. It doesn’t contain any arbitrary parameters. It can be used to generate the propositional Sorites by appropriate replacement of the second-order premise with arbitrary clauses. Finally, it is generally nonfirstorderizable, relying on the notion of transitive closure of a relation. However, it can be expressed in FOL with a finite upper bound on the elements of the relation. This leads to a definition of vagueness in classical FOL, using the interplay between a total preorder and a monadic predicate. A notational extension of FOL will introduce a vague structure formed by the predicate (e.g.tall), the broad predicate (e.g. broadly tall) and the strict predicate (e.g. strictly tall). It allows the failure of a weak non-contradiction (e.g. ‘Some men are both broadly tall and broadly short’), the failure of a weak LEM (e.g. ‘Some men are neither strictly tall nor strictly short`), and the truth of a non-paradoxical tolerance (e.g. ‘If a person of n cm is strictly tall, a person of n-1 cm is broadly tall’).
References:
[1] P. Cobreros, P. Egré, D. Ripley, R, Van Rooij, Tolerant, Classical, Strict, Journal of Philosophical Logic 41 (2019), 347-385.
[2] D. Graff, Shifting Sands: An Interest-Relative Theory of Vagueness, Philosophical Topics 28 (2000), 45-81.
[3] U. Keller, Some remarks on the definability of transitive closure in first-order logic and Datalog, Internal report, Digital Enterprise Research Institute (DERI), University of Innsbruck, 2004.
[4] K.G. Lucey, he ancestral relation without classes, Notre Dame Journal of Formal Logic 20 (1979), 281-284.
Title: Off-the-Record Communication (OTR)
Speaker: Mihail-Iulian Plesa
Abstract: Off-the-Record Communication (OTR) este un protocol care modealeaza o discutie dintre doua entitati, care ar trebui sa satisfaca anumite proprietati de securitate. Vom vorbi despre proprietatile acestui tip de comunicatie si despre cum pot fi acestea implementate in mediul online. Vom discuta apoi despre protocolul OTR integrat in Signal si cum anume difera acesta fata de versiunea originala.
Nota: Prezentarea va fi urmata de o sesiune de joc CryptoGo – joc de carti educational pentru criptografie.
Mai multe informatii aici.
Speaker: Sorin-Gabriel Radu (University of Bucharest)
Abstract: Va fi prezentată o versiune extinsă a lucrări de licență ce va prezenta concepte de Return Orientated Programming, o tehnică de reciclare și combinare a bucăților de cod existent, curat, astfel încât cod nou, nedorit, în general de tip malware, să fie executat.
Speaker: Ioana Leustean (University of Bucharest)
Abstract: We continue our presentation on operational semantics of security protocols, as developed in:
C. Cremers, S. Mauw, Operational Semantics and Verification of Security Protocols, Springer, 2012.
Speaker: Ioana Leustean (University of Bucharest)
Abstract: After a brief overview of the formal methods used for analyzing security protocols, we will focus on the operational semantics developed in:
C. Cremers, S. Mauw, Operational Semantics and Verification of Security Protocols, Springer, 2012.
Speaker: Marius Popescu (University of Bucharest)
Abstract: We continue our adventure by investigating existing natural language processing results that deal with unmasking authorship and their application to anomaly detection.
Required reading: