Simulations explain your thoughts
This thesis is concerned with explanations of embodied cognition as internal
simulation. The hypothesis is that several cognitive processes can be explained
in terms of predictive chains of simulated perceptions and actions.
In other words, perceptions and actions are reactivated internally by the nervous system to be used in cognitive phenomena such as mental imagery.
This thesis contributes by advancing the theoretical foundations of simulations and the empirical grounds on which they are based, including a review of the empirical evidence for the existence of simulated perceptions and actions in cognition, a clarification of the representational function of simulations in cognition, as well as identifying implicit, bodily and environmental anticipation as key mechanisms underlying such simulations. The thesis also develops the "inception of simulation" hypothesis, which suggests that dreaming has a function in the development of simulations by forming associations between experienced, non-experienced but realistic, and even unrealistic perceptions during early childhood. The thesis further investigates some aspects of simulations and the ³inception of simulation² hypothesis by using simulated robot models based on echo state networks. These experiments suggest that it is possible for a simple robot to develop internal simulations by associating simulated perceptions and actions, and that dream-like experiences can be beneficial for the development of such simulations.
Saab award to Patrick Doherty
The Åke Svensson research stipend this year goes to Patrick Doherty, professor
of Computer Science at Linköping University. Patrick Doherty receives the award
for his outstanding contributions to the development of autonomous unmanned
Best paper award at ACM conference
The paper "Empowering the Creative User: Personalized HTTP-based Adaptive
Streaming of Multi-path Nonlinear Video" was given the "Best Paper Award" in
the ACM SIGCOMM 2013 workshop on Future Human-Centric Multimedia Networking
(FhMN) and will appear in a special issue of ACM Computer Communications
Review. It is based on collaborative work with University of Saskatchewan,
Canada, and NICTA, Australia.
MIT ranks PhD from IDA one of the most innovative
Per Ola Kristensson, cognitive scientist from Linköping that received a PhD at
IDA (Human Centered Systems) 2007 has by MIT Technology Review been listed as
one of the 35 most innovative under 35 year of age in the world.
Best student paper award
ECSQARU 2013 Best Student Paper Award was awarded to the article "Chain Graph
Interpretations and their Relations" written by Dag Sonntag and Jose M. Peña.
The article covers when chain graphs of different interpretations can represent
the same model and give a theoretical base for what probability distributions
of systems that can be perfectly represented by chain graphs.
The prize was awarded (ex-aequo) and the article is published in the Lecture Notes in Computer Science, Springer (Volume 7958, 2013).
Prize for final year project theses 2012
One Bachelor and one Master level thesis were awarded by Swedish Computer
Society (East) for best IT thesis in 2012. Bernhard Hahn did his thesis at IDA
on analysis of algorithms for smart recipe suggestions on social platforms.
Simon Tegelid and Johan Kihlberg were awarded the prize for map-assisted indoor
Software: security requirements and secure programming
In his PhD thesis, John Wilander studied how security requirements are captured
before public procurement contracts, and treated aspects of code development,
including static analysis, and run-time intrusion prevention.
Ben Livshits from Microsoft Research, a well-known profile within the area of secure software, acted as opponent at the PhD defence. The seminar was attended by a large audience from industry including several LiU alumni.
Exploiting Structure in CSP-related Problems
By relating complexity issues in constraint satisfaction problems to properties
of graphs and their structure Tommy Färnqvist has in a recent PhD shown that a
large class of applications e.g. in database search or AI do not have efficient
solutions, thus not polynomially solvable. He has thereafter found a metric to
relate problems that are approximation friendly.
Page responsible: Webmaster