Händelser: Data- och informationsteknikhttp://www.chalmers.se/sv/om-chalmers/kalendariumAktuella händelser på Chalmers tekniska högskolaThu, 12 Oct 2017 14:15:05 +0200http://www.chalmers.se/sv/om-chalmers/kalendariumhttp://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Things-That-Keep-us-Busy-Erik-Stolterman.aspxhttp://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Things-That-Keep-us-Busy-Erik-Stolterman.aspxThings That Keep us Busy – The Elements of Interaction<p>Torg Grön, 4 våningen, hus Patricia, Lindholmen</p><p>​Erik Stolterman, hedersdoktor 2017 vid IT-fakulteten, Göteborgs universitet.</p>Erik Stolterman is professor and Senior Executive Associate Dean at School of Informatics, Computing and Engineering, Indiana University, where he has been engaged since 2005. He has a Phd from Umeå University 1991, and has since contributed to research within interaction design, design theory and design philosophy, as well as to research on information technology and society more generally. With the digitalization of society, we are increasingly exposed to interaction with digital artefacts surrounding us. In this context Erik Stolterman is an important voice pointing the importance of design thinking for anyone involved in the development of technology, organizations and society.http://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Disputation-Per-Hallgren.aspxhttp://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Disputation-Per-Hallgren.aspxPer Hallgren, Data- och informationsteknik<p>EC, lecture hall, EDIT trappa C, D och H, EDIT</p><p>​Robust location privacy</p>The Internet is in many ways both fascinating and yet also scary. For most people, a single commercial entity owns the power to disclose all their personal emails. Most commonly your emails are only disclosed to you and your correspondent, but the power to choose who sees these emails is in fact not yours. The power to control the release of data about ones person is what most people refer to as privacy.<p></p> <br /> In spite of this, almost nothing that the Internet is used for gives the originator of a message control over it. When you use a social media platform, you are given the intuition that you choose which friends who can see any posts and photos that you publish, and of course the connection is encrypted to thwart eavesdropping. However, the service provider may still share this data to anyone they like. From a technological standpoint, a user almost never has the power of their data; in other words, there’s normally no privacy on the Internet.<p></p> <br /> This thesis is describes di erent ways of giving end-users more control over some parts of their own personal data using cryptography for the speci c case of location data, enhancing their privacy. The majority of the thesis explores how to make use of location proximity, to check whether to users are close to each other, as a basic primitive while maintaining privacy through additively homomorphic encryption. The thesis further explores the application scenario of ridesharing, or car pooling, using both additively homomorphic encryption and private set intersection. All of the solutions presented sport proven privacy-preserving capabilities, and have been implemented to measure their performance. This thesis shows in what contexts there’s still a ways to go, but also highlights some settings in which it might already be time to move theory into practice.<p></p>http://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/IWSM-Mensura-2017.aspxhttp://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/IWSM-Mensura-2017.aspxIWSM Mensura 2017<p>Lindholmen Science Park and Ericsson Lindholmen</p><p>Where academic ideas meet industry practice on Software Measurement topics.</p>The IWSM Mensura conference is the result of the joining of forces of the International Workshop on Software Measurement and the International Conference on Software Process and Product Measurement (Mensura). Together they form the conference where new ideas from the world of academic research meet practical improvements from industry on topics of measuring software. Each year practitioners and researchers from all over the world gather together to learn about new developments, test new ideas and exchange possible new solutions and applications.http://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Docent-Krasimir-Angelov.aspxhttp://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Docent-Krasimir-Angelov.aspxChallenges in Reliable Language Technology<p>EB, lecture hall, EDIT trappa C, D och H, EDIT</p><p>Docentföreläsning av Krasimir Angelov, Data- och informationsteknik.</p>Natural languages are inherently difficult for computers to understand and interpret. Despite the recent AI boom, reliable and scalable Natural Language Processing (NLP) remains elusive. The state of the art is that to have anything done we still sacrifice either reliability or scalability. Most of the contemporary research starts from a method which is scalable by design and tries to improve its reliability. In this lecture I will give an example of an opposite direction where we start from GF (a reliable by design NLP framework) and we try to improve its scalability. This is an exciting project which intertwines ideas from functional programming, type theory and machine learning.http://www.chalmers.se/sv/styrkeomraden/ikt/kalendarium/Sidor/BigData-Chalmers-seminarium_27okt2017.aspxhttp://www.chalmers.se/sv/styrkeomraden/ikt/kalendarium/Sidor/BigData-Chalmers-seminarium_27okt2017.aspxPrivacy in the hands of the data analyzer<p>Scaniasalen, lecture room, Kårhuset, Campus Johanneberg</p><p>​Speaker: Kobbi Nissim, Georgetown University</p>​ <br />​<a href="https://www.anpdm.com/public/event/RegistrationForm/414559427142465E437140">Please register for this seminar</a> so that we can adjust the room booking to the number of participants<br />The seminar is free of charge.<br /><br /><br /><strong>Abstract: </strong>Differential privacy is a robust concept of privacy. It brings mathematical rigor to the decades-old problem of privacy-preserving analysis of collections of sensitive personal information. Informally, differential privacy requires that the outcome of an analysis would remain stable under any possible change to an individual's information, and hence protects individuals from attackers that try to learn the information particular to them.<br /><br />The rich research of differential privacy has uncovered deep connections to many research areas, including learning theory, cryptography, complexity theory, algorithmic game theory, and statistics. After a brief introduction to differential privacy, we will look intro some of these connections, focusing on how differential privacy can serve as a tool for data analysis, even in cases where privacy is not a goal.<br /><br /><strong>Short Bio:</strong> Prof. Kobbi Nissim is McDevitt Chair in Computer Science, Georgetown University. Nissim’s work is focused on the mathematical formulation and understanding of privacy. His work from 2003 and 2004 with Dinur and Dwork initiated rigorous foundational research of privacy and presented a precursor of Differential Privacy - a definition of privacy in computation that he introduced in 2006 with Dwork, McSherry and Smith. His research studies privacy in various contexts, including statistics, computational learning, mechanism design, social networks, and more recently law and policy. Since 2011, Nissim has been involved with the Privacy Tools for Sharing Research Data project at Harvard, developing privacy-preserving tools for the sharing of social-science data. Nissim was awarded the Godel Prize In 2017, the IACR TCC Test of Time Award in 2016, and the ACM PODS Alberto O. Mendelzon Test-of-Time Award in 2013.<br />http://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Licentiatseminarium-Aristide-Tossou.aspxhttp://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Licentiatseminarium-Aristide-Tossou.aspxAristide Tossou, Data- och informationsteknik<p>EL41, lecture room, Linsen, EDIT</p><p>​Privacy in the Age of Artificial Intelligence</p>An increasing number of people are using the Internet in their daily life. Indeed, more than 40% of the world population have access to the Internet, while Facebook (one of the top social network on the web) is actively used by more than 1.3 billion users each day (Statista 2017). This huge amount of customers creates an abundance of user data containing personal information. These data are becoming valuable to companies and used in various way to enrich user experience or increase revenue. <br /><br />This has led many citizens and politicians to be concerned about their privacy on the Internet to such an extent that the European Union issued a &quot;Right to be Forgotten&quot; ruling, reflecting the desire of many individuals to restrict the use of their information. As a result, many online companies pledged to collect or share user data anonymously. However, anonymisation is not enough and makes no sense in many cases. For example, an MIT graduate was able to easily re-identify the private medical data of Governor William Weld of Massachusetts from supposedly anonymous records released by the Group Insurance Commission. All she did was to link the insurance data with the publicly available voter registration list and some background knowledge (Ohm 2009). <br /><br />Those shortcomings have led to the development of a more rigorous mathematical framework for privacy: Differential privacy. Its main characteristic is to bound the information one can gain from released data, no matter what side information they have available. <br /><br />In this thesis, we present differentially private algorithms for the multi-armed bandit problem. This is a well known multi round game, that originally stemmed from clinical trials applications and is now one promising solution to enrich user experience in the booming online advertising and recommendation systems. However, as recommendation systems are inherently based on user data, there is always some private information leakage. In our work, we show how to minimise this privacy loss, while maintaining the effectiveness of such algorithms. In addition, we show how one can take advantage of the correlation structure inherent in a user graph such as the one arising from a social network.http://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Disputation-John-Camilleri.aspxhttp://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Disputation-John-Camilleri.aspxJohn Camilleri, Data- och informationsteknik<p>HC3, lecture hall, Hörsalar HC, Campus Johanneberg</p><p>​Contracts and Computation – Formal modelling and analysis for normative natural language</p><br /><br />​<img src="/SiteCollectionImages/Institutioner/DoIT/Profile%20pictures/ST/John-Camilleri.jpg" class="chalmersPosition-FloatRight" alt="" style="margin:5px" />Whether we are aware of it or not, our digital lives are governed by contracts of various kinds, such as privacy policies, software licenses, service agreements, and regulations. At their essence, normative documents like these dictate the permissions, obligations, and prohibitions of two or more parties entering into an agreement, including the penalties which must be paid when someone breaks the rules. Such documents are often lengthy and hard to understand, and most people tend to agree to these legally binding contracts without ever reading them. <br /><br />Our goal is to create tools which can take a natural language document as input and allow an end user to easily ask questions about its implications, getting back meaningful answers in natural language within a reasonable amount of time. We do this by bringing formal methods to the analysis of normative texts, investigating how they can be effectively modelled and the kinds of automatic processing that these models enable. This thesis includes six research papers by the author which cover the various aspects of this approach: entity recognition and modality extraction from natural language, controlled natural languages and visual diagrams as interfaces for modelling, logical formalisms which can be used for contract representation, and analysis via syntactic filtering, trace evaluation, random testing, and model checking. These components are then combined into a prototype tool for end users, allowing for end-to-end analysis of normative texts in natural language.http://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Thesis-Defence-Vard-Antinyan.aspxhttp://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/Thesis-Defence-Vard-Antinyan.aspxVard Antinyan, Data- och informationsteknik<p>Omega, lecture room, Jupiter, Campus Lindholmen</p><p>Proactive Software Complexity Assessment</p><span><span style="display:inline-block"></span></span><img src="/SiteCollectionImages/Institutioner/DoIT/Profile%20pictures/SE/Vard-disp.jpg" class="chalmersPosition-FloatRight" alt="" style="margin:5px" />Software is omnipresent in today’s life. Sophisticated appliances, once being completely mechanical or electrical, now contain software. A mo-dern premium car carries about 100 computers to manage functionalities such as climate control, speed control, and automated parking. Similarly, air-traffic control system manages a vast net of trajectories, altitudes, and signals. Thousands of appliances are pervaded by software.<br /><br /><p></p> On the surface this provides a fascinating perspective to the future. But beyond the surface it is the challenge of software development. Software companies are receiving thousands of requirements for delivering new functionalities. These requirements turn into millions of lines of machine code by the hands of software developers. And all of these are carried on continuously. Continuous software development has become the prere-quisite of tomorrow’s smarter products. But it has also become the source of prodigious complexity that emerges overwhelmingly in developing software.<br /><br /><p></p> So many software projects have been fallen because of the overly complex implementations, and so many have run out of budgets because of inconceivable complexity. This thesis is an endeavor to understand this complexity, to measure and analyze its effects, importantly, to apply measurements proactively in practice, so that complexity is controlled before it escalates into inconceivable scales.http://www.chalmers.se/sv/styrkeomraden/ikt/kalendarium/Sidor/ACM-VRST-2017.aspxhttp://www.chalmers.se/sv/styrkeomraden/ikt/kalendarium/Sidor/ACM-VRST-2017.aspxThe ACM Symposium on Virtual Reality Software and Technology<p>Chalmers conference centre Lindholmen, Gothenburg</p><p>​VRST will provide an opportunity for VR researchers to interact, share new results, show live demonstrations of their work, and discuss emerging directions for the field.</p>​ <span class="text-normal page-content"><br />The ACM Symposium on Virtual Reality Software and Technology (VRST) is an international forum for the exchange of experience and knowledge among researchers and developers concerned with virtual reality software and technology. <br /><br /><a href="https://vrst.acm.org/vrst2017/index.html">To conference website: http://vrst.acm.org/vrst2017/</a><br /><br /></span>http://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/sweDS2017.aspxhttp://www.chalmers.se/sv/institutioner/cse/kalendarium/Sidor/sweDS2017.aspxSweDS2017<p>Wallenberg Conference Center, Medicinaregatan 20A</p><p>​5th Swedish Workshop on Data Science</p> The Swedish Workshops on Data Science allow members of a community with common interests to meet in the context of a focused and interactive discussion. SweDS 2017, the fifth Swedish Workshop on Data Science, brings together researchers, practitioners, and opinion leaders with interest in data science. The goal is to further establish this important area of research and application in Sweden, foster the exchange of ideas, and to promote collaboration. As a followup to the very successful previous editions, held at the University of Borås, Stockholm University, Blekinge Institute of Technology and Skövde we plan two days of inspiring talks, discussion sessions, and time for networking. We invite stakeholders from academia, industry, and society to share their thoughts, experiences and needs related to data science. <p></p> <br />Confirmed Keynote Speakers: <br /><ul><li>Josephine Sullivan, School of Computer Science and Communication, KTH </li> <li>Seif Haridi, Chief Scientist, Swedish Institute of Computer Science </li> <li>Sven Nelander, Department of Immunology, Genetics and Pathology, Uppsala University </li> <li>Erik Elmroth, Computing Science, Umeå University</li></ul>http://www.chalmers.se/sv/styrkeomraden/ikt/kalendarium/Sidor/Initiative-Seminar-2018-Digitalisation.aspxhttp://www.chalmers.se/sv/styrkeomraden/ikt/kalendarium/Sidor/Initiative-Seminar-2018-Digitalisation.aspxInitiative seminar on Digitalisation Security & privacy | Machine Intelligence<p>RunAn, conference hall, Kårhuset, Campus Johanneberg</p><p>​Save the date: 15 March 2018</p>​ <br /><span class="text-normal page-content">Next year’s initiative seminar on Digitalisation we focus on the two themes Security/Privacy and Machine Intelligence. More information will follow. </span>