Seminars

See all upcoming seminars in LäsIT and seminar web pages at the homepage for the PhD studentseminars, TDB, Vi2, Theory and Applications Seminars (TAS) @ UpMARC., Department of Mathematics and The Stockholm Logic Seminar.

InfoLab - Weekly Meeting
Today
Matteo Magnani: How to Visualize Interconnected Graphs
Location: ITC 19 120, Time: 10:15-11:00

Every Thursday we meet in room 120, House 19 to discuss various topics related to the analysis of online human-generated information.

On Thursday 23/3, Matteo Magnani is leading a discussion on how to visualize interconnected graphs.

Each meeting starts at 10:15 (please have coffee/tea ready: they can be made in the local kitchen) and ends at 11:00.

The meetings are informal, open and no registration is needed, but if you tell us in advance there are higher chances to get some cookies or cakes.

A list of topics is maintained at http://www.it.uu.se/research/group/infolab/fika.

Disputation / Dissertation
Tomorrow (24 Mar)
Fredrik Wahlberg: Interpreting the Script: Image Analysis and Machine Learning for Quantitative Studies of Pre-modern Manuscripts
Location: Tidskriftläsesalen, Carolina rediviva, Dag Hammarskjölds väg 1, Uppsala, Time: 10:15

Fredrik will present and defend his PhD thesis.

The opponent will be Apostolos Antonacopoulos, Professor with the University of Salford in Manchester, UK.

Anders Brun, Ewert Bengtsson (Uppsala University), and Lasse Mårtensson (University of Gävle) are supervisors.

DiVA include abstract and full text

DoCS Seminar
Tomorrow (24 Mar)
Parosh Abdulla: Dual Semantics for Total Store Order
Location: ITC 1145, Time: 14:15

Abstract
Modelling the behaviors of concurrent programs has traditionally relied on a fundamental assumption, namely that of Sequential Consistency (SC). Under the SC semantics, an instruction performed by a process will become immediately visible to all the other processes in the system. However, recent developments in system design imply that the SC semantics is no longer valid. For instance, modern computer architectures such as TSO, POWER, and ARM, allow the re-ordering of program instructions in order to gain efficiency and limit power consumption. Geo-replicated systems allow application programs on different nodes to execute autonomously so that the system can survive data-center failures, and so that services move closer to end users. The emergence of such *weakly consistent* systems calls for a new generation of methods and tools for the modelling, analysis, and verification of programs.

The study of weakly consistent systems is one of the main research challenges currently addressed by the algorithmic verification group. In this lecture, I will illustrate some of the problems that arise in this context, and give examples of potential solutions through our recent work on the verification of concurrent programs running under the classical TSO (Total Store Order) memory model. The model allows "write to read" relaxation corresponding to the addition of an unbounded store buffer (that contains pending store operations) between each processor and the main memory. In this work, we introduce a novel semantics which we call the *dual TSO semantics* that replaces each store buffer by a *load buffer* that contains pending load operations. The flow of information is also reversed, i.e., store operations are performed by the processes atomically on the main memory, while values of variables are propagated from the memory to the load buffers of the processes. We show that the two semantics are equivalent in the sense that a program will reach identical sets of states when run under the two semantics. Furthermore, we present a simple and effective reachability algorithm for checking safety properties of programs running under the dual semantics.

Finally, I will describe a few directions for future work, including the verification of TSO-coherence (e.g., for cache protocols), and the challenges we face when considering more general forms of weak consistence than the one induced TSO.

(joint work with Faouzi Atig, Ahmed Bouajjani, and Tuan Phong Ngo)

Pedagogic Lunch Seminar
Tuesday 28 Mar
Mats Daniels: Engaging in Undergraduate Teaching: A Community Issue
Location: ITC 4308, Time: 12:15

Time to sign up for a new pedagogic lunch seminar. This time it Mats Daniels who has the opportunity to speak.

Title: Engaging in Undergraduate Teaching: A Community Issue

Abstract: Mats will a few words about being part of the ACM computer science education community since he just received their Lifetime service to computer science education community award, and also the IEEE community as well as other international communities. He will then expand on finding communities for educational research and especially the aspect of graduating students being prepared for their profession.

Please sign up in this doodle before 1pm on Monday, March 27, if you want a sandwich.

There will be cake at 10 am on Tuesday, March 28, in the staff lounge in building 4, floor 3, to celebrate Mats Daniels receiving the ACM award.

CSD Seminar
Wednesday 29 Mar
Georgios Fakas: Diverse and Proportional Size-l Object Summaries for Keyword Search
Location: ITC 2344, Time: 11:15

Abstract: The abundance and ubiquity of graphs (e.g., online social networks such as Google+ and Facebook; bibliographic graphs such as DBLP) necessitates the effective and efficient search over them. Given a set of keywords that can identify a data subject (DS), a recently proposed keyword search paradigm produces a set of object summaries (OSs) as results. An OS is a tree structure rooted at the DS node (i.e., a node containing the keywords) with surrounding nodes that summarize all data held on the graph about the DS.

OS snippets, denoted as size-l OSs, have also been investigated. A size-l OS is a partial OS containing l nodes such that the summation of their importance scores results in the maximum possible total score. However, the set of nodes that maximize the total importance score may result in an uninformative size-l OSs, as very important nodes may be repeated in it, dominating other representative information. In view of this limitation, in this paper, we investigate the effective and efficient generation of two novel types of OS snippets, i.e., diverse and proportional size-l OSs, denoted as DSize-l and PSize-l OSs. Namely, besides the importance of each node, we also consider its pairwise relevance (similarity) to the other nodes in the OS and the snippet.

We conduct an extensive evaluation on two real graphs (DBLP and Google+). We verify effectiveness by collecting user feedback, e.g., by asking DBLP authors (i.e., the DSs themselves) to evaluate our results. In addition, we verify the efficiency of our algorithms and evaluate the quality of the snippets that they produce.

Biography: Dr. Georgios Fakas is a Senior Lecturer at Uppsala University, Sweden since March 2017. Prior to that, he also worked as a Research Fellow at Hong Kong University of Science and Technology (Hong Kong), EPFL (Lausanne, Switzerland) and as a Senior Lecturer at Manchester Metropolitan University (UK). He holds a PhD from UMIST (Manchester, UK) since 1999. He has published papers in influential conferences and journals of data management, including SIGMOD, PVLDB, VLDB Journal, IEEE TKDE, DKE, etc

Biomed-IT lunch seminar
Wednesday 29 Mar
Manfred Grabherr & Neda Zamani, IMBIM, UU: Computational challenges in the era of modern genomics: the problems… and the solutions
Location: ITC 2446, Time: 12:00-13:00

Abstract: Listen to an overview and a more hands-on talk on current IT-related challenges and opportunities when developing new algorithmic approaches for handling the vast volumes of genomics data generated in different fields of biology.

Everyone is welcome to the talk, and a free sandwich is provided for participants who register in advance. REGISTER at http://www.it.uu.se/research/arenas/biomedIT.

Machine Learning Journal Club
Wednesday 29 Mar
: Probabilistic Programming
Location: ITC 4308, Time: 13:00

Machine Learning Journal Club – Seminar #2: Probabilistic Programming

During the Spring of 2017, the Machine Learning Arena is organizing a journal club that focuses on broad topics in machine learning. The goal is to disseminate knowledge as well as help identify research collaborations.

The next topic is probabilistic programming, which is an approach to formulate probabilistic models in the language of computer code and harness computational power to perform inference.

For more information, please see: http://www.it.uu.se/research/arenas/machine_learning/journal

Gender Equality Group - Monthly Meeting
Wednesday 29 Mar
Location: ITC 1345, Time: 13:30-15:30

ON THE AGENDA:
APPLICATIONS and Gender Equality Aware Education that Creates a Better Learning Environment for All (section 4.2 in the action plan)

eSSENCE Seminar
Thursday 30 Mar
Stig Telfer: Cloud infrastructures for large-scale application processing and data management
Location: ITC 2347, Time: 10:15-12:00

Stig Telfer has a background in R&D working for various prominent technology companies, particularly in HPC and software-defined networking. Stig is now CTO for StackHPC, a consultancy specialising in the convergence of cloud, HPC and big data. Stig is also co-chair of the OpenStack Scientific Working Group, a globally-distributed grouping of research institutions using OpenStack for research computing use cases.

In the seminar, Stig will highlight the importance of cloud infrastructures for large-scale application processing and data management. This seminar will be part of our course Large Datasets for Scientific Applications (LDSA).

http://essenceofescience.se

InfoLab - Weekly Meeting
Thursday 30 Mar
Davide Vega: How to Model Text Networks
Location: ITC 19 120, Time: 10:15-11:00

Every Thursday we meet in room 120, House 19 to discuss various topics related to the analysis of online human-generated information.

On Thursday 23/3, Davide Vega is discussing how to model text networks.

Each meeting starts at 10:15 (please have coffee/tea ready: they can be made in the local kitchen) and ends at 11:00. The meetings are informal, open and no registration is needed, but if you tell us in advance there are higher chances to get some cookies or cakes.

A list of topics is maintained at http://www.it.uu.se/research/group/infolab/fika.

Optimization Seminar
5 April
Pierre Flener: Solving Discrete Optimisation Problems Without Knowing How
Location: ITC 1211, Time: 11:00

Abstract:
Unbeknownst to many, it has become possible to model discrete (or: combinatorial) optimisation problems in a language that is interfaced with solvers of multiple optimisation technologies, none of which dominates the others or shares a modelling language with them, such as mixed-integer programming (MIP), Boolean satisfiability (SAT), SAT modulo theories (SMT), constraint programming (CP), stochastic local search (SLS), etc, as well as hybrids thereof. It is now possible to model the constraints and objective function of a problem upon learning a single fully declarative high-level modelling language and, upon experiments with solvers of different technologies, to choose a winning technology and solver, without knowing how the problem is solved.

I present one such language, called MiniZinc, to the toolchain of which my research group is making significant contributions. I show how the high-level MiniZinc abstractions of common combinatorial structures enable highly readable short models of complex problems. These often non-linear abstractions are translated into linear (in)equalities over integer variables, into clauses over Boolean variables, etc, using well-known encodings. This allows modellers to reuse these encodings systematically rather than tediously or erroneously rediscovering them.

For most managers, engineers, and scientists the time to achieve a particular solution speed or quality is drastically reduced by such model-once-solve-everywhere toolchains.

Read more about the Optimization Arena at the Department of Information Technology.

Gender Equality Group - Monthly Meeting
28 April
Location: ITC 1345, Time: 13:30-14:30

ON THE AGENDA:
A Better Understanding of the Gender Situation of Technical and Administrative Personnel (section 4.1 in the action plan)

Gender Equality Group - Monthly Meeting
23 May
Location: ITC 1345, Time: 13:30-15:30

ON THE AGENDA:
APPLICATIONS

Gender Equality Group - Monthly Meeting
2017-08-30
Location: ITC 1345, Time: 13:30-15:30

ON THE AGENDA:
APPLICATIONS and Better PhD Student Education for all (section 4.3 in the action plan)

Gender Equality Group - Monthly Meeting
2017-10-25
Location: ITC 1345, Time: 13:30-15:30

ON THE AGENDA:
APPLICATIONS

Gender Equality Group - Monthly Meeting
2017-11-29
Location: ITC 1345, Time: 13:30-14:30

ON THE AGENDA:
Supporting women in post docs, associate senior lecturers or senior lecturers positions (section 4.4 in the action plan)

See also the list of all upcoming seminars.

Internal seminars. Lecturers may be either internal or external.

RSS