Best Paper Award iiWAS 2020
Sijin Cheng and Olaf Hartig received the Best Paper Award at the 22nd Int.
Conf. on Information Integration and Web-based Applications & Services (iiWAS)
for their paper "FedQPL: A Language for Logical Query Plans over Heterogeneous
Federations of RDF Data Sources". This is the first research work that looks at
the new problem of querying a federation of RDF-based graph databases that is
heterogeneous in terms of the data access interfaces.
Student Paper Award PRIMA2020
Fredrik Präntare and Fredrik Heintz received the Student Paper Award at The
23nd International Conference on Principles and Practice of Multi-Agent Systems
(PRIMA2020), for their paper "Hybrid Dynamic Programming for Simultaneous
Coalition Structure Generation and Assignment".
Nordic conference on IT security
This year the 25th edition of the Nordic Secure IT Systems conference (NordSec)
is organised in Linköping on 23-24th November. Amid the virtual format the
number of participants is at an all time high, and invited speakers from US and
the European agency ENISA open each day.
Christer Gilén scholarship in Statistics and Machine Learning 2020
Alexander Karlsson has received the Christer Gilén scholarship in Statistics
and Machine Learning 2020 for the master's thesis "Improving predictions of
muscle mass from an impedance device - Cross-calibration of bioelectrical
impedance analysis and dual Xray absorbiometry using a Bayesian approach".
Scalable statistical methods for images and spatial data
The need for statistical analyses of images and spatial data arises in many
areas. The ever-increasing sizes of these datasets pose a great computational
challenge. In his thesis, Per Sidén has developed more scalable and advanced
statistical methods for spatial data, with applications for brain imaging,
satellite images, and robotics.
Outstanding Paper Award at ICNS'20
IDA students Hanna Gustafsson and Sofie Eskilsson were the lead authors of an
article "Demonstrating ADS-B And CPDLC Attacks With Software-Defined Radio"
which received the Outstanding Paper Award at the Integrated Communications,
Navigation and Surveillance (ICNS'20) Conference. The work was supervised by
Prof. Andrei Gurtov within the project "Automation Program II" with
Contributions to Semantic Dependency Parsing
Natural language understanding is a central problem in artificial intelligence
with many applications. For a computer to understand natural language,
representations how words in a sentence relate to one another and how they
build the sentence's meaning are commonly used. With his thesis Robin
contributes to various aspects of semantic dependency parsing, the automatic
analysis of these structures.
IAHSI Announces the 2020 Class of Fellows
IAHSI, The International Academy of Health Sciences Informatics, established in
2017 through the auspice and as a component of IMIA, the International Medical
Informatics Association, has announced 2020 year’s internationally recognized
class of fellows.
We are happy to announce that Professor Emerita Vivian Vimarlund has been elected as one of the 2020 Class of Fellows of IAHSI Members within IMIA EFMI Region.
For more information about IAHSI and/or IMIA - please visit websites:
Making services work – why we need to design for resilience
In today's interconnected world, services are prone to change in the form of
expected and unexpected variations and disruptions. To ensure that services
continue to work smoothly, service systems need to be resilient, and designed
to adapt and transform. In her research, Vanessa explores and identifies key
intervention points for cultivating service systems resilience through service
Services are prone to change in the form of expected and unexpected variations and disruptions, more so given the increasing interconnectedness and complexity of service systems today. These changes require service systems to be resilient and designed to adapt, to ensure that services continue to work smoothly. This thesis problematises the prevailing view and assumptions underpinning the current understanding of resilience in services. Drawing on literature from service management, service design, systems thinking and social-ecological resilience theory, this work investigates how service design can foster resilience in service systems. Supported by empirical input from three research projects in healthcare, the findings show service design can contribute to the adaptability and transformability of service systems through its holistic, human-centred, participatory and experimental approaches. Through the analysis, this research identifies key intervention points for cultivating service systems resilience through service design, including the design of service interactions, processes, enabling structures and multi-level governance. The study makes two important contributions. First, it extends the understanding of service systems resilience as the collective capacity for intentional action in responding to ongoing change, coordinated across scales in order to create value. This is supported by offering alternative assumptions about resilience in service. Second, it positions service design as an enabler of service resilience by explicitly linking design practice(s) to processes that contribute to resilience. By extending the understanding of service systems resilience, this thesis lays the groundwork for future research at the intersection of service design, systemic change and resilience.
Professor Emeritus Jan Maluszynski
It is with heavy hearts that we have to convey the sad news that Jan
Maluszynski has left us after a long battle with cancer. Jan spent his last
time at home with his next of kin and passed away in the evening of June 27th,
2020, aged 79. Jan came to Sweden and IDA almost 40 years ago in connection
with the martial laws in Poland. He formed the Logic Programming Laboratory
(LOGPRO) and devoted his professional life to research and education in
declarative languages such as logic and constraint programming, grammatical
formalisms and the semantic web. He retired more than 10 years ago but upheld
contacts with IDA for several years as Professor Emeritus. Apart from being an
internationally renowned researcher he was also a close friend and mentor of
colleagues as well as graduates. Jan is sadly missed but his memory and
contributions will be with us for years to come.
Wlodek Drabent / Henrik Eriksson / Mariam Kamkar / Ulf Nilsson
Best Master Thesis Prize
For the 21st time the prize for the best Master thesis was awarded by the
Computer Society (East) in cooperation with IDA. Carl Folkesson was awarded the
prize for a thesis defended in 2019 with the title "Anonymization of
directory-structured sensitive data".
There were six Master theses defended by eight students during 2019 that were nominated for this year's prize. The other nominees were Sofia Thunberg, Per Lindström, Carl Nykvist, Martin Larsson, Tobias Sund CLaes Lööf, Christoffer Johansson. This year's Promotor in the Master category was Nahid Shahmehri and the links for all the nominated theses are found on the IDA prize page.
Best Bachelor Thesis Award
The best Bachelor Thesis Prize for the year 2019 was awarded Fredrik Josefsson
Ågren and Niklas Larsson for a thesis with the title "A study of slow denial of
service mitigation tools and solutions deployed in the cloud". The prize was
awarded by the Computer Society (East).
In addition to Fredrik Josefsson Ågren and Niklas Larsson four other students (three theses in total) were nominated for the best Bachelor thesis in 2019. The runner ups were Martin Lindblom, Oscar Järpehult, Madeleine Bäckström and Linn Hallonqvist. Ola Leifler acted as this year's Promotor in the Bachelor thesis prize ceremony. Links to all nominated theses can be found at the IDA pages for best thesis.
Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems
If one is asked to multiply two large numbers or add the same numbers without a
calculator, chances are high that he/she will do the later operation faster
than the former one. Hence, in some sense, multiplication is more difficult
than addition, and the aim of complexity theory is to investigate properties
that make problems easy or hard, and group problems together according to their
perceived difficulty. In this thesis, Biman Roy studies how the complexity of a
particular class of problems, known as constraint satisfaction problems (CSPs),
can be studied on a very fine-grained level using methods from universal
Page responsible: Webmaster