Refine
Departments, institutes and facilities
Document Type
- Conference Object (16) (remove)
Year of publication
- 2001 (16) (remove)
Has Fulltext
- no (16)
Keywords
In this paper we present a new storytelling approach, called Hypermedia Novel (HYMN), that extends the classical narration concept of a story. We develop an underlying modular concept – the narration module – that facilitates a new manner of reception as well as creation of a story. The HYMN focuses on the recipient and his role of consuming a story and a heterogeneous group of creative authors by providing narration modules and their interfaces without defining the granularity of the modules. Using several kinds ofmultimedia elements and a hyperlink structure, we present a first demonstrator that implements this new concept. We also discuss improvements, e.g. MPEG-4/7, that support both reception by the audience, and the process of creating the story by a dispersed team of authors.
This paper presents the current stage of an IP-based architecture for heterogeneous environments, covering UMTS-like W-CDMA wireless access technology, wireless and wired LANs, that is being developed under the aegis of the IST Moby Dick project. This architecture treats all transmission capabilities as basic physical and data-link layers, and attempts to replace all higher-level tasks by IP-based strategies.
3rd Generation networks as proposed by 3GPP claim to follow the path towards fixed-mobile convergence and full support of Internet services. Although the providers have obviously recognised the dynamics of the Internet, their attempt to provide IP-services over the system has led to a circuit switched architecture. This forthcoming infrastructure will be a sophisticated, complicated, and quite expensive network, with some IP-equipment in the middle (core-network). From an IETF-biased engineers view, some parts of this network and protocols could be dropped, except that they are probably needed for backward compatibility. But since backward compatibility and saving of investment is a major concern of the standardising bodies, the evolving architectures carry a big burden.
We present a model checking algorithm for ∀CTL (and full CTL) which uses an iterative abstraction refinement strategy.
It terminates at least for all transition systems M that have a finite simulation or bisimulation quotient. In contrast to other abstraction refinement algorithms, we always work with abstract models whose sizes depend only on the length of the formula θ (but not on the size of the system, which might be infinite).
GMD-Robots
(2001)