BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Faculty of Science and Technology | University of Macau - ECPv6.14.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.fst.um.edu.mo
X-WR-CALDESC:Events for Faculty of Science and Technology | University of Macau
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Macau
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:CST
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Macau:20181213T150000
DTEND;TZID=Asia/Macau:20181213T160000
DTSTAMP:20260614T034303
CREATED:20181213T042747Z
LAST-MODIFIED:20181213T042747Z
UID:6529-1544713200-1544716800@www.fst.um.edu.mo
SUMMARY:Improving Information Security in Ranking Systems and Control Systems
DESCRIPTION:Instructors/Speakers\nDr. Guilherme RAMOS\nPh.D. (2018)\nInformation Security at Instituto Superior Técnico\nLisbon\, Portugal \nAbstract\nIn this work\, we propose to advance in the field of information security in the areas of ranking systems (RS) and control systems\, using ideas from the area of information theory. First\, we propose a RS that groups users based on their preferences\, introducing similarity measures. The system presents possibly distinct rankings for the same product in different user groups. Besides presenting more personalized rankings to users\, it is a system more resistant to attacks than the state-of-the-art. We then explore the effect of bribing in reputation-based RS\, in the usual scenario (a ranking for each product) and in the scenario we proposed. We find the optimal bribing strategies\, and we evaluate our methodology with real data\, being the devised ranking system more robust to bribery. Finally\, in control systems\, we present methods to find the placement of the minimum number of inputs in LTI systems and switched LTI systems\, in the eventual scenario where a set of controllers may fail\, e.g.\, due to a cyberattack. In the first case\, we prove that the problem is NP-complete. We design algorithms to solve the problems explicitly\, and also to approximate the solution in polynomial time. \nKeywords: Ranking Systems\, Control Systems\, Information Security\, Bribing. \nBiography\nDr. Guilherme RAMOS has a Ph.D. (2018) in Information Security at Instituto Superior Técnico\, Lisbon\, Portugal\, through the doctoral programme in Physics and Mathematics of Information. He received the B.Sc. (2011) and M.Sc. (2013) degrees in Applied Mathematics from the Instituto Superior Técnico\, Lisbon\, Portugal. His areas of interest are: Structural Systems; Control Theory; Cryptography; Information Theory; Ranking Systems; Recommender Systems; Consensus Algorithms. \n 
URL:https://www.fst.um.edu.mo/event/improving-information-security-in-ranking-systems-and-control-systems/
LOCATION:E11-1006
CATEGORIES:ece_events
END:VEVENT
END:VCALENDAR