![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter
Modeling Hypermedia Applications with HyDev
This paper introduces the HyDev approach to a structured and systematic development of hypermedia applications. HyDev focuses on the early phases of the development process, i.e. analysis and design. The requirem...
-
Chapter
The integration of a layout constraint language with an object-oriented user interface management system
In this paper we present the COMPASS constraint language which integrates high-level layout specifications with the DiwA user interface management system. The general concept of the COMPASS system is the autom...
-
Chapter and Conference Paper
User interface development: Problems and experiences
In this paper, we present a software engineer's view of user-interface development. First, we illustrate the main problem areas responsible for difficulties in building high-quality user-interfaces. Among them...
-
Chapter and Conference Paper
Anbindung einer räumlich clusternden Zugriffsstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle
Erweiterungen relationaler Datenbanksysteme um geometrische Frontends haben sich bisher gegenüber spezialisierten Geodatenbanksystemen meist als ineffizient erwiesen. In dieser Arbeit zeigen wir, daß eine gute...
-
Chapter and Conference Paper
DIWA — Ein hierarchisches Entwicklungsmodell für Benutzerdialoge
In dieser Arbeit wird DIWA als ein hierarchisches Modell zur Strukturierung von Benutzerdialogen vorgestellt. Die mit DIWA assoziierte Beschreibungssprache erlaubt die Modellierung der dynamischen Aspekte weit...
-
Chapter and Conference Paper
A framework for data structures
In this paper we outline a framework for data structures in the spirit of the Vienna Definition Language but extended to the most general class of objects, namely arbitrary directed rooted graphs in which the ...
-
Chapter and Conference Paper
The analysis of search trees: A survey
The combinatorial analysis of the behaviour of various classes of data structures is increasingly becoming amenable to investigation as new techniques are developed. In this paper we survey the results availab...
-
Chapter and Conference Paper
Node-visit optimal 1 – 2 brother trees
We characterize node-visit optimal 1–2 brother trees and present a linear time algorithm to construct them.