209449
Conceptual design of www-based information systems
Today, companies and their information systems are facing a very dynamic and fast changing environment. Fast changing demands require varying information in varying places. Users must find relevant information in a fast and perspicuous way. Thus, information systems both have to be flexible and clearly structured to fulfill these requirements and be able to handle the increasing amount of information efficiently. WWW-based information systems provide flexibility as they separate content, layout and navigation. However, several conceptual shortcomings prevent the Web from being a more productive and efficient resource of information today. Several technical enhancements (e.g. the semantic web) have been made in order to solve these problems. However, a theoretically proved and easy to use modeling method for WWW-based information systems is still missing. Our modeling method allows modeling these information systems on a conceptual level by abstracting from technical details. By this, meaningful navigation structures can be achieved with great clarity. In this paper we will develop this method using a meta-model based approach.
1863714
Modelling And Implementing Macro Web Navigation Structures
From the three existing dimensions - content objects, navigation and presentation - of web pages, the navigation dimension is analysed. It consists of macro, meso and micro navigation. A conceptual approach to model and implement the macro navigation structure of web sites is presented. We start by enhancing a function decomposition diagram to model the macro navigation structure. The resulting graph is analysed and transformed to find its crucial components. In order to store these components in a database table, an appropriate entity-relationship model is developed. Afterwards we identify three navigation styles that can be produced from the underlying database and give the PHP source code for one of them. Finally, an example web page using our navigation styles is depicted. It is concluded that using our ideas may lead to reduced development time and avoids link errors in the process of creating the site navigation.
13870539
An algorithm for source location in directed graphs
A polynomial time solution algorithm is described to find a smallest subset R of nodes of a directed graph D=(V,A) such that, for every node [email protected]?V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R.