Offentlige arrangementer
Bemærk at IT-Forums arrangementer ikke er offentlige men kun for medlemmer. Aarhus Universitet er medlem af IT-Forum, hvilket betyder at medarbejdere samt de studerende der har specielle interesser i specifikke arrangementer, pg.a. opgaveskrivning inden for emnet, derfor kan komme gratis ind. Andre skal betale for det.
| 26.06.2008 |
End-User Control in Ubiquitous Systems |
| |
Erik Grönvall, PhD, University of Siena, Italy.
Abstract
As more and more devices are embedded into the environment, there is
a risk that the user loses the understanding and control of the
system. In normal use this is not always a problem, but when for
example a breakdown occurs it is crucial that the user understand the
system to be able to handle the situation. The process to aid
heterogeneous users in the sense making and control of distributed
and ubiquitous systems becomes important. My talk will introduce
different typologies of users, and how they interact differently with
technological systems. Examples of these different user categories
can be system developers, expert users and laypeople. Technical and
user requirements to enable end-user control will be discussed,
ranging from a survey of existing middleware infrastructures and what
they offer in terms of end-user control to the state-of-the-art in
end-user programming and other means that allow end-users to control
devices and systems in the ambient.
To support the theoretical discussion, two case studies will be
presented where end-user control has been investigated using a novel
framework for Palpable Computing. Palpable here means graspable and
understandable and is manifested in a conceptual framework and a
reference implementation of a middleware for ambient and ubiquitous
computer systems. The two case studies (Neonatal Intensive Care and
Aquatic therapy for children) address the fields of service and
device composition and inspection of running entities, both from a
technical and user perspective. The two case studies will present two
different approaches to achieve end-user control and will provide the
ground for further discussions related to end-user control.
Finally, end-user control will be viewed from a political and
economical perspective and what impact open systems that allow post-
production configuration and adaptation can have on the everyday life
in different situations and cultures.
About Erik Grönvall
Erik Grönvall has a Ph.D. in Information and Communication
Technologies (University of Florence) and holds a Post-doc position
at the University of Siena. He lectures e.g. Java and Physical
computing and is part of a multi-disciplinary research team that
develops technology for people that usually do not represent target
groups for novel technology. He acquired this interest while working
in the telecom and Smart home industry in Sweden where he developed
and installed IT solutions for example in elderly care centres. As a
consultant, he has been developing exhibitions related to innovative
technology in the home, presented for example at the Science museum
of London and Telecom 99 (Geneva). His current research interests can
be found in the borderline where the technology and the users meet
and include issues like end-user control, pervasive health and
personal fabrication.
Host: Olav W. Bertelsen
|
| Tid/sted |
kl. 11:15 til 12:00 - Ada-018 |
| Info |
http://www.cs.au.dk/ |
|
| 26.06.2008 |
[PL Seminar] Talk: Jan Midtgaard |
| |
Title:
A Calculational Approach to Control-flow Analysis by Abstract Interpretation
Speaker:
Jan Midtgaard
IRISA / INRIA Rennes - Bretagne Atlantique
Abstract:
We present a derivation of a control-flow analysis by abstract
interpretation. Our starting point is a transition system semantics
defined as an abstract machine for a small functional language in
continuation-passing style. We obtain a Galois connection for
abstracting the machine states by composing Galois connections, most
notable an independent-attribute Galois connection on machine states and
a Galois connection induced by a closure operator associated with a
constituent-parts relation on environments. We calculate abstract
transfer functions by applying the state abstraction to the collecting
semantics, resulting in a demand-driven 0-CFA. We thereby provide a
novel characterization of the analysis.
Joint work with Thomas Jensen
Biosketch:
Jan Midtgaard is post-doctoral researcher at IRISA / INRIA Rennes. He
received a PhD in computer science from BRICS, Department of Computer
Science at the University of Aarhus in 2007. His education included
notable visits to Harvard University and Ecole Normale Supérieure in
Paris. Jan's research interests include program analysis and
transformation, programming language implementation and semantics - and
the combinations hereof.
Host: Olivier Danvy |
| Tid/sted |
kl. 13:00 til 14:00 - Turing-014 |
| Info |
http://www.cs.au.dk/ |
|
| 30.06.2008 |
[PL Seminar] Talk: Jens Palsberg |
| |
Speaker: Jens Palsberg, UCLA, University of California, Los Angeles.
Abstract:
We show that register allocation can be viewed
as solving a collection of puzzles.
We model the register file as a puzzle board and
the program variables as puzzle pieces;
pre-coloring and register aliasing fit in naturally.
For architectures such as x86, SPARC V8, and StrongARM,
we can solve the puzzles in polynomial time, and we have augmented
the puzzle solver with a simple heuristic for spilling.
For SPEC CPU2000, the compilation time of our implementation is as
fast as that of the extended version of linear scan used by LLVM,
which is the JIT compiler in the openGL stack of Mac OS 10.5.
Our implementation produces x86 code that is of similar quality to
the code produced by the slower, state-of-the-art iterated
register coalescing of George and Appel with the extensions
proposed by Smith, Ramsey, and Holloway in 2004.
Joint work with Fernando Pereira; presented at PLDI 2008.
Host: Michael I. Schwartzbach
|
| Tid/sted |
kl. 13:00 til 14:00 - Turing-014 |
| Info |
http://www.cs.au.dk/ |
|
| 01.07.2008 |
CAGT/COMA Seminar: Vladimir Gurvich |
| |
Title: Generating Vertices of a Polyhedron is Hard
Speaker: Vladimir Gurvich, University of Aarhus and RUTCOR, Rutgers University.
Abstract:
We show that generating all negative cycles of a weighted graph is hard in both directed and undirected cases. More precisely, all negative cycles cannot be generated in time polynomial in the number of such cycles, unless P=NP.
As a corollary we solve in the negative two well-known generating problems from linear programming:
* Given an infeasble system of linear inequalities, generating all minimal infeasible subsystems (so-called Helly subsystems) is hard. Yet, for generating maximal feasible subsystems the complexity remains open.
* Given a feasible system of linear inequalities, generating all vertices of the corresponding polyhedron is hard. Yet, the problem reamins open in the case of bounded polyhedra.
Joint work with L. Khachiyan, E. Boros, K. Borys, K. Elbassioni and H.R. Tiwary |
| Tid/sted |
kl. 14:15 til 16:00 |
| Info |
http://www.cs.au.dk/ |
|
|