| 1. |
- Falkman, Göran, 1968-, et al.
(author)
-
SOMWeb - Towards an Infrastructure for Knowledge Sharing in Oral Medicine
- 2005
-
In: Connecting Medical Informatics and Bio-Informatics: Proceedings of MIE2005 - The XIXth International Congress of the European Federation for Medical Informatics. - Amsterdam : IOS Press. - 1586035495 ; 116, s. 527-32, s. 527-532
-
Conference paper (peer-reviewed)abstract
- In a net-based society, clinicians can come together for cooperative work and distance learning around a common medical material. This requires suitable techniques for cooperative knowledge management and user interfaces that are adapted to both the group as a whole and to individuals. To support distributed management and sharing of clinical knowledge, we propose the development of an intelligent web community for clinicians within oral medicine. This virtual meeting place will support the ongoing work on developing a digital knowledge base, providing a foundation for a more evidence-based oral medicine. The presented system is founded on the use and development of web services and standards for knowledge modelling and knowledge-based systems. The work is conducted within the frame of a well-established cooperation between oral medicine and computer science.
|
|
| 2. |
- Elmqvist, Niklas, 1977, et al.
(author)
-
Employing Dynamic Transparency for 3D Occlusion Management: Design Issues and Evaluation
- 2007
-
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - 1611-3349 .- 0302-9743. - 9783540747949 ; 4662, s. 532 - 545
-
Conference paper (peer-reviewed)abstract
- Recent developments in occlusion management for 3D environments often involve the use of dynamic transparency, or virtual “X-ray vision”, to promote target discovery and access in complex 3D worlds. However, there are many different approaches to achieving this effect and their actual utility for the user has yet to be evaluated. Furthermore, the introduction of semi-transparent surfaces adds additional visual complexity that may actually have a negative impact on task performance. In this paper, we report on an empirical user study comparing dynamic transparency to standard viewpoint controls. Our implementation of the technique is an image-space algorithm built using modern programmable shaders to achieve real-time performance and visually pleasing results. Results from the user study indicate that dynamic transparency is superior for perceptual tasks in terms of both efficiency and correctness.
|
|
| 3. |
- Håkansson, Maria, et al.
(author)
-
Facilitating Mobile Music Sharing and Social Interaction with Push!Music
- 2007
-
In: Proceedings of the 40th Hawaii International Conference on System Sciences. - Los Alamitos, Calif. : IEEE Computer Society Washington. - 1530-1605. - 0769527558 ; , s. 87-
-
Conference paper (peer-reviewed)abstract
- Push!Music is a novel mobile music listening and sharing system, where users automatically receive songs that have autonomously recommended themselves from nearby players depending on similar listening behaviour and music history. Push!Music also enables users to wirelessly send songs between each other as personal recommendations. We conducted a two-week preliminary user study of Push!Music, where a group of five friends used the application in their everyday life. We learned for example that the shared music in Push!Music became a start for social interaction and that received songs in general were highly appreciated and could be looked upon as 'treats'.
|
|
| 4. |
- Casado, Lander, 1985, et al.
(author)
-
ContikiSec: A Secure Network Layer for Wireless Sensor Networks under the Contiki Operating System
- 2009
-
In: Proceedings of the 14th Nordic Conference on Secure IT Systems (NordSec 2009), Lecture Notes in Computer Science. - 1611-3349. - 9783642047657 ; 5838, s. 133 - 147
-
Conference paper (peer-reviewed)abstract
- In this paper we introduce ContikiSec, a secure network layer forwireless sensor networks, designed for the Contiki Operating System. ContikiSechas a configurable design, providing three security modes starting fromconfidentiality and integrity, and expanding to confidentiality, authentication,and integrity. ContikiSec has been designed to balance low energy consumptionand security while conforming to a small memory footprint. Our design wasbased on performance evaluation of existing security primitives and is part ofthe contribution of this paper. Our evaluation was performed in the ModularSensor Board hardware platform for wireless sensor networks, running Contiki.Contiki is an open source, highly portable operating system for wireless sensornetworks (WSN) that is widely used in WSNs.
|
|
| 5. |
- Ha, Phuong, 1976, et al.
(author)
-
The Synchronization Power of Coalesced Memory Accesses
- 2008
-
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783540877783 ; 5218, s. 320-334
-
Conference paper (peer-reviewed)abstract
- Multicore processor architectures have established themselves as the new generation of processor architectures. As part of the one core to many cores evolution, memory access mechanisms have advanced rapidly. Several new memory access mechanisms have been implemented in many modern commodity multicore processors. Memory access mechanisms, by devising how processing cores access the shared memory, directly influence the synchronization capabilities of the multicore processors. Therefore, it is crucial to investigate the synchronization power of these new memory access mechanisms.This paper investigates the synchronization power of coalesced memory accesses, a family of memory access mechanisms introduced in recent large multicore architectures like the CUDA graphics processors. We first design three memory access models to capture the fundamental features of the new memory access mechanisms. Subsequently, we prove the exact synchronization power of these models in terms of their consensus numbers. These tight results show that the coalesced memory access mechanisms can facilitate strong synchronization between the threads of multicore processors, without the need of synchronization primitives other than reads and writes. In the case of the contemporary CUDA processors, our results imply that the coalesced memory access mechanisms have consensus numbers up to sixteen.
|
|
| 6. |
- Ha, Phuong, 1976, et al.
(author)
-
Wait-free Programming for General Purpose Computations on Graphics Processors
- 2008
-
In: the Proceedings of the 22th International Parallel and Distributed Symposium (IPDPS 2008). - 1530-2075. - 9781424416936 ; , s. 1-12
-
Conference paper (peer-reviewed)abstract
- The fact that graphics processors (GPUs) are today’s most powerful computational hardware for the dollar has motivated researchers to utilize the ubiquitous and powerful GPUs for general-purpose computing. Recent GPUs feature the single-program multiple-data (SPMD) multicore architecture instead of the single-instruction multiple-data (SIMD). However, unlike CPUs, GPUs devote their transistors mainly to data processing rather than data caching and flow control, and consequently most of the powerful GPUs with many cores do not support any synchronization mechanisms between their cores. This prevents GPUs from being deployed more widely for general-purpose computing. This paper aims at bridging the gap between the lack of synchronization mechanisms in recent GPU architectures and the need of synchronization mechanisms in parallel applications. Based on the intrinsic features of recent GPU architectures, we construct strong synchronization objects like wait-free and t-resilient read-modify-write objects for a general model of recent GPU architectures without strong hardware synchronization primitives like test-and-set and compare-and-swap. Accesses to the wait-free objects have time complexity O(N), whether N is the number of processes. Our result demonstrates that it is possible to construct wait-free synchronization mechanisms for GPUs without the need of strong synchronization primitives in hardware and that wait-free programming is possible for GPUs.
|
|
| 7. |
- Kavathatzopoulos, Iordanis
(author)
-
New technologies in the education of native language
- 2004
-
In: Greek language education in Scandinavia. ; , s. 73-76
-
Conference paper (peer-reviewed)abstract
- Education in mother tongue as well as any education, demands the use of adequate methods and tools to be effective. New technology offers many possibilities for this purpose. In the present paper different IT solutions are discussed and their contribution to the goal of learning the mother tongue are examined. Necessary conditions for successful learning are supposed to be the careful choice and the continuous adaptation of used IT tools to the psychological learning process of the child.
|
|
| 8. |
|
|
| 9. |
- Neiberg, Daniel, et al.
(author)
-
Emotion Recognition in Spontaneous Speech Using GMMs
- 2006
-
In: INTERSPEECH 2006 AND 9TH INTERNATIONAL CONFERENCE ON SPOKEN LANGUAGE PROCESSING. - BAIXAS : ISCA-INST SPEECH COMMUNICATION ASSOC. ; , s. 809-812, s. 101-104
-
Conference paper (peer-reviewed)abstract
- Automatic detection of emotions has been evaluated using standard Mel-frequency Cepstral Coefficients, MFCCs, and a variant, MFCC-low, calculated between 20 and 300 Hz, in order to model pitch. Also plain pitch features have been used. These acoustic features have all been modeled by Gaussian mixture models, GMMs, on the frame level. The method has been tested on two different corpora and languages; Swedish voice controlled telephone services and English meetings. The results indicate that using GMMs on the frame level is a feasible technique for emotion classification. The two MFCC methods have similar performance, and MFCC-low outperforms the pitch features. Combining the three classifiers significantly improves performance.
|
|
| 10. |
- Sundell, Håkan, 1968, et al.
(author)
-
Brushing the Locks out of the Fur: A Lock-Free Work Stealing Library
- 2009
-
In: econd Swedish Workshop on Multi-Core Computing, (MCC '09).
-
Conference paper (peer-reviewed)abstract
- We present a lock-free version of the light-weight userleveltask management library called Wool, in an aim toshow that even extremely well tuned, in terms of synchronization,applications can benefit from lock-free programming.Explicit multi-threading is an efficient way to exploitthe offered parallelism of multi-core and multi-processorbased systems. However, it can sometimes be hard to expressthe inherited parallelism in programs using a limitednumber of long lived threads. Often it can be more straightforwardto dynamically create a large number of small tasksthat in turn automatically execute on the available threads.Wool is a promising and efficient library and frameworkthat allows the programmer to create user tasks in C witha very low overhead. The library automatically executestasks and balances the load evenly on a given number ofthreads by utilizing work stealing techniques. However, thesynchronization for stealing tasks is based on mutual exclusionwhich is known to limit parallelism and efficiency. Wehave designed and implemented a new lock-free algorithmfor synchronization of stealing tasks in Wool. Experimentsshow similar or significantly improved performance on a setof benchmarks executed on a multi-core platform.
|
|
