|
The group runs a weekly seminar series, covering papers,
projects, and events related with our research. These seminars
are open to anyone on Chalmers or GU who wishes to attend.
Seminars 2006
Current seminar series coordinator: Daniel Cederman.
| Date | Time | Location | Speaker | Refreshment Organizer | Title + Abstract |
| må, dec 11 | 10.00 | Sammantr. rum | Niklas Elmqvist | Philippas | Rehearsal presentation
Niklas will be giving a rehearsal presentation of his PhD thesis. |
| må, dec 4 | 10.00 | 5128 | Aleksandar Despotoski and Marco Paserini | Andreas | Application Layer Avoidance of Denial of Service Attacks
Brief talk about Application Layer Avoidance of Denial of Service Attacks. We introduce the existing solutions and of their effectiveness in mitigating attacks against the availability of the system. |
| må, nov 27 | 10.00 | Sammantr. rum | Daniel Cederman | Daniel | Elimination as a backoff scheme
Daniel will talk about using elimination as a backoff scheme for lockfree datastructures. |
| må, nov 6 | 10.00 | 5453 | Philippas Tsigas | Elad | From Security to dependability
Philippas will talk about his participation at the Dagstuhl seminar "From Security to dependability" |
| må, okt 30 | 10.00 | Sammantr. rum | Niklas Elmqvist | Daniel | Evaluating the Effectiveness of Occlusion Reduction Techniques for 3D Virtual Environments
By Niklas Elmqvist (Chalmers) and M. Eduard Tudoreanu (UALR)
We present an empirical usability experiment studying the relative strengths and weaknesses of three different occlusion reduction techniques for discovering and accessing objects in information-rich 3D virtual environments. More specifically, the study compares standard 3D navigation, generalized fisheye techniques using object scaling and transparency, and the BalloonProbe interactive 3D space distortion technique. Subjects are asked to complete a number of different tasks, including counting, pattern recognition, and object relation, in different kinds of environments with various properties. The environments include a free-space abstract 3D environment and a virtual 3D walkthrough application for a simple building floor. The study involved 16 subjects and was conducted in a three-sided CAVE environment. Our results confirm the general guideline that each task calls for a specialized interaction\x{2013}no single technique performed best across all tasks and worlds. The results also indicate a clear trade-off between speed and accuracy; simple navigation was the fastest but also most error-prone technique, whereas spherical BalloonProbe proved the most accurate but required longer completion time, making it suitable for applications where mistakes incur a high cost.
|
| må, okt 23 | 10.00 | Sammantr. rum | Andreas Larsson | Phuong | Sensor network simulators
Andreas will present some interesting sensor network simulators. |
| må, okt 16 | 10.00 | Sammantr. rum | Elad Schiller | Marina | A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
Maleq Khan and Gopal Pandurangan
Department of Computer Science
Purdue University
Abstract
We give a distributed algorithm that constructs a O(log n)-approximate minimum spanning tree (MST) in arbitrary networks. Our algorithm runs in time ~O (D(G) + L(G;w)) where L(G;w) is a parameter called the local shortest path diameter and D(G) is the (unweighted) diameter of the graph. Our algorithm is existentially optimal (up to polylogarithmic factors), i.e., there exists graphs which need ¡(D(G) + L(G;w)) time to compute an H-approximation to the MST for any H 2 [1;ú(log n)]. Our result also shows that there can be a significant time gap between exact and approximate MST computation: there exists graphs in which the running time of our approximation algorithm is exponentially faster than the time-optimal distributed algorithm that computes the MST. Finally, we show that our algorithm can be used to find an approximate MST in wireless networks and in random weighted networks in almost optimal ~O (D(G)) time.
In this presentation I will talk about the work of Khan and Pandurangan that was presented in DISC 06. Together we will not into this work and see what future direction are there for us in this topic.
I will also prepare a 5 min overview of some of the talks that I liked in DISC06.
|
| må, okt 9 | 10.00 | Sammantr. rum | Daniel Cederman | Niklas Elmqvist | Wait-Free Queues in RTSJ
Daniel will give a presentation of his Master's Thesis about wait-free queues in real-time Java. |
| ti, jun 20 | 10.30 | Sammantr. rum | Niklas Elmqvist | Elad | DataMeadow and DataRose[Georgia Tech]
Niklas will talk about some of his experiences at Georgia Tech as well as present his recent work on the DataMeadow and the DataRose, an interactive visualization technique for huge (100,000+ records) multidimensional datasets. |
| ti, mar 21 | 10.30 | Sammantr. rum | Elad Schiller | Phuong | Classic results in self-stabilizing clock synchronization.
Classic results in self-stabilizing clock synchronization. |
| ti, mar 14 | 10.30 | Sammantr. rum | Anders Gidenstam | Marina | 5th IEEE International Conference on Peer-to-Peer Computing travel report
Travel report from the 5th IEEE International Conference on Peer-to-Peer Computing, Konstanz, Germany, 31 August - 2 September, 2005. |
| ti, mar 7 | 10.30 | Sammantr. rum | Elad Michael Schiller | Andreas | Autonomous Virtual Mobile Nodes[Paper,Slides]
This work presents a new abstraction for virtual infrastructure in mobile ad hoc networks. An Autonomous Virtual Mobile Node (AVMN) is a robust and reliable entity that is designed to cope with the inherent difficulties caused by processors arriving, leaving, and moving according to their own agendas, as well as with failures and energy limitations. There are many types of applications that may make use of the AVMN infrastructure: tracking, supporting mobile users, or searching for energy sources. The AVMN extends the focal point abstraction in [Dolev et al DISC┤03] and the virtual mobile node abstraction in [Dolev et al DISC┤04]. The new abstraction is that of a virtual general-purpose computing entity, an automaton that can make autonomous on-line decisions concerning its own movement. We describe a self-stabilizing implementation of this new abstraction that is resilient to the chaotic behavior of the physical processors and provides automatic recovery from any corrupted state of the system. The paper and the slides.
|
| ti, feb 21 | 10.30 | Sammantr. rum | Andreas Larsson | Anders Gidenstam | MiNEMA travel report
Andreas will give a travel report from his visit at the MiNEMA workshop. |
| ti, jan 31 | 10.30 | Sammantr. rum | Niklas Elmqvist | Marina/Philippas | ACM VRST 2005 travel report
Niklas will give a travel report about his visit at ACM VRST 2005. |
 Top of Page
Archived Seminars
Use the following links to get access to the seminar schedules
of previous years:
2008,
2007,
2006,
2005,
2004,
2003,
2002,
2001,
2000.
Top of Page
|
