ICIS Research Publications


2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1986 1985 1984 1983 1982 1981 1980 1979 1978 1977 1976 1975 1974 1973 1972 1971 1970 1969 1968 1967 1966 1965 1964 1963 1962 1960 1959 1958 1957 1956 1955 1953 1952 1951 1950 1949 1948 1947 1946 1945 1941 1938 1923 1911

Unclassified

Software engineering - Product quality - Part 1: Quality model. 2001, ISO/IEC 9126-1:2001.

[ External URL ] [ Bibtex ]

ACM Digital Library. 2001.

[ External URL ] [ Bibtex ]

ACM Symposium on Document Engineering 2001, call for papers. 2001.

[ External URL ] [ Bibtex ]

AECMA - The European Association of Aerospace Industries. AECMA Simplified English - A guide for the preparation of aircraft maintenance documentation in the international maintenance language. January, 2001, Issue 1, Revision 2.

[ External URL ] [ Bibtex ]

Lora Aroyo. Task-oriented approach to information handling support within web-based education. Twente University, Enschede, The Netherlands, EU, 2001.

[ Missing PDF ] [ Bibtex ]

J. Asundi, R. Kazman, and M. Klein. Using Economic Considerations to Choose Among Architecture Design Alternatives. Technical report: CMU/SEI-2001-TR-035, December, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, 2001.

[ Missing PDF ] [ Bibtex ]

D.B. Baarda, and M.P.M. de Goede. Basisboek Methoden en Technieken - Handleiding voor het opzetten en uitvoeren van onderzoek. 3rd edition, Stenfert Kroese, Leiden, The Netherlands, EU, 2001, In Dutch, ISBN 9020730304.

[ Missing PDF ] [ Bibtex ]

F. Bachmann, L. Bas, P.C. Clements, D. Garlan, J. Ivers, R. Little, R. Nord, and J. Stafford. Software Architecture Documentationi: Organization of Documentation Package. Technical report: CMU/SEI-2001-TN-010, August, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, 2001.

[ Missing PDF ] [ Bibtex ]

B.Z. Baida. Stakeholders and Their Concerns in Software Architectures. In: Proceedings of the Third National Architecture Congres, November, 2001.

An architect who writes an architecture document is not the only one involved in the process of building the architecture. And many more people are involved in the process of information systems development, which can be seen as a chain of activities, one of which is building the architecture. All these people are influenced by the decisions the architect makes when writing his architecture document. As a result, all these people must be taken into consideration when writing the architecture document. This paper is about identifying these people and the type of their involvement in the process.

[ External URL ] [ Bibtex ]

Handbook of Process Algebra. Edited by: J.A. Bergstra, A. Ponse, and S.A. Smolka. Elsevier Science Publishers, North Holland, 2001.

[ Missing PDF ] [ Bibtex ]

T. Berners-Lee, James Hendler, and Ora Lassila. The Semantic Web, A new form of Web content that is meaningful to computers will unleash a revolution of new possibilities. In: Scientific American, Nr: 5, Vol: 284, Pages: 34-43, May, 2001.

[ Missing PDF ] [ Bibtex ]

L. von Bertalanffy. General Systems Theory - Foundations, Development, Applications. revised edition, George Braziller, New York, New York, USA, 2001, ISBN 0807604534.

[ Missing PDF ] [ Bibtex ]

B. Boehm, P. Grunbacher, and R.O. Briggs. Developing Groupware for Requirements Negotiation: Lessons Learned. In: IEEE Software, Pages: 46-55, 2001, May/June.

[ Missing PDF ] [ Bibtex ]

Business Process Project Team. ebXML Business Process Specification Schema Version 1.01. 2001.

The ebXML Specification Schema provides a standard framework by which business systems may be configured to support execution of business collaborations consisting of business transactions. It is based upon prior UN/CEFACT work, specifically the metamodel behind the UN/CEFACT Modeling Methodology (UMM) defined in the N090R9.1 specification.

The Specification Schema supports the specification of Business Transactions and the choreography of Business Transactions into Business Collaborations. Each Business Transaction can be implemented using one of many available standard patterns. These patterns determine the actual exchange of Business Documents and business signals between the partners to achieve the required electronic commerce transaction. The current version of the specification schema addresses collaborations between two parties (Binary Collaborations).

It is anticipated that a subsequent version will address additional features such as the semantics of economic exchanges and contracts, more complex multi-party choreography, and context based content.

[ PDF ] [ Bibtex ] [ External URL ]

E.A. Brewer. When everything is searchable. In: Communications of the ACM, Nr: 3, Vol: 44, Pages: 53-55, March, 2001.

[ Missing PDF ] [ Bibtex ]

Erik Christensen, Francisco Curbera, Greg Meredith, and Sanjiva Weerawarana. Web Services Description Language (WSDL) 1.1. Technical report, March, World Wide Web Consortium, 2001.

[ External URL ] [ Bibtex ]

S. Cochran. The rising cost of software complexity. In: Dr. Dobb`s Journal, April, 2001.

What’s the most important problem in computer science? Languages, tools, programmers? Well, according to a growing number of researchers and computer users, it’s software complexity. "We’ve known about this problem for 40 years," says Alfred Spector, vice-president at IBM Research. "This is probably the number one problem...It can’t go on."

[ PDF ] [ Bibtex ]

J. Conklin. Wicked Problems and Fragmentation. Technical report, CogNexus Institute, Edgewater, Maryland, USA, 2001.

[ PDF ] [ Bibtex ] [ External URL ]

Copernic meta-search engine. 2001.

[ External URL ] [ Bibtex ]

The DARPA Agent Mark-up Language. 2001.

[ External URL ] [ Bibtex ]

The Open Directory Project. 2001.

[ External URL ] [ Bibtex ]

F. Fabbrini, M. Fusani, S. Gnesi, and G. Lami. An Automatic Quality Evaluation for Natural Language Requirements. In: Seventh International Workshop on Requirements Engineering: Foundation for Software Quality, Interlaken, Switzerland (before CAiSE*2001), 2001.

[ External URL ] [ Bibtex ]

L. Feng, M.A. Jeusfeld, and J.J.A.C. Hoppenbrouwers. Beyond Information Searching and Browsing: Acquiring Knowledge from Digital Librafies. Technical report, Infolab, Tilburg University, 2001.

[ PDF ] [ Bibtex ]

L. Feng, J.J.A.C. Hoppenbrouwers, and M.A. Jeusfeld. Towards Knowledge-based Digital Libraries. In: SIGMOD Record 30, Vol: 1, Pages: 41-46, 2001.

[ PDF ] [ Bibtex ]

Google search engine. 2001.

[ External URL ] [ Bibtex ]

GuideBeam search engine. 2001.

[ External URL ] [ Bibtex ]

T.A. Halpin. Information Modeling and Relational Databases, From Conceptual Analysis to Logical Design. Morgan Kaufmann, San Mateo, California, USA, 2001, ISBN 1558606726.

[ Missing PDF ] [ Bibtex ]

Djoerd Hiemstra. Using Language Models for Information Retrieval. University of Twente, Centre for Telematics and Information Technology (CTIT), 2001, ISBN 9075296053.

[ Missing PDF ] [ Bibtex ]

G. Hirst, and Alexander Budanitsky. Lexical Chains and Semantic Distance. August, Presentation on Eurolan-2001, 2001.

[ PDF ] [ Bibtex ]

Wilfrid Hodges. Model Theory. In: The Stanford Encyclopedia of Philosophy, Edited by: Edward N. Zalta. Stanford University, 2001.

[ External URL ] [ Bibtex ]

G.A. Lewis, S. Comella-Dorda, D.P. Gluch, J. Hudak, and C. Weinstock. Model-Based Verification: Analysis Guidelines. Technical report: CMU/SEI-2001-TN-028, December, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, 2001.

[ Missing PDF ] [ Bibtex ]

R. Malan, and D. Bredemeyer. Defining Non Functional Requirements. Technical report, Bredemeyer Consulting, 2001.

A system has properties that emerge from the combination of its parts. These emergent properties will surely be a matter of accident, not design, if the non-functional requirements, or system qualities, are not specified in advance. This white paper lays out important concepts and discusses capturing non-functional requirements in such a way that they can drive architectural decisions and be used to validate the architecture.

[ PDF ] [ Bibtex ]

Alexa T. McCray, and Marie E. Gallagher. Principles for Digital Library Development. In: Communications of the ACM, Nr: 5, Vol: 55, Pages: 49-54, May, 2001.

[ PDF ] [ Bibtex ]

P. Louter. Ruimte voor de digitale economie - Verkenning van de relaties tussen ICT en ruimtelijk-economische ontwikkeling. Technical report: 01 5R 024 51211, April, Ministerie van Economische Zaken, 2001, In Dutch, ISBN 9067437999.

[ PDF ] [ Bibtex ]

Henrik Nottelmann, and Norbert Fuh. MIND: An architecture for multimedia information retrieval in federated digital libraries. In: DELOS Workshop on Interoperability in Digital Libraries, September, 2001, Darmstadt, Germany.

[ PDF ] [ Bibtex ]

J.F. Nunamaker, R.O. Briggs, and G.J. de. Vreede. From Information Technology To Value Creation Technology. In: Information Technology and the Future Enterprise, Edited by: G.W. Dickson, and G. DeSanctis. IEEE Computer Society Press, Washington, DC, USA, 2001.

[ Missing PDF ] [ Bibtex ]

Common Warehouse Metamodel (CWM) metamodel. version 1.0 edition, Februari, Object Management Group (OMG), 2001.

[ External URL ] [ Bibtex ]

Ontology Inference Layer. 2001.

[ External URL ] [ Bibtex ]

Pica Library Database. 2001.

[ External URL ] [ Bibtex ]

Johanna Wenny Rahayu, Elizabeth Chang, Tharam S. Dillon, and David Taniar. Performance evaluation of the object-relational transformation methodology. In: Data & Knowledge Engineering, Nr: 3, Vol: 38, Pages: 265-300, September, 2001.

[ Missing PDF ] [ Bibtex ]

J. Ben Schafer, Joseph A. Konstan, and John Riedl. E-Commerce Recommendation Applications. In: Data Mining and Knowledge Discovery, Nr: 1/2, Vol: 5, Pages: 115-153, 2001.

[ PDF ] [ Bibtex ]

M. Shaw. When System Boundaries Dissolve: Research Opportunities in Software Architectures for Ubiquitous Computing and Communication. In: Presented at the IEEE/IFIP Working Conference on Software Architecture, August, 2001.

[ Missing PDF ] [ Bibtex ]

M. Shaw. Coming-of-Age of Software Architecture Research. In: Presented at the 23rd International Conference on Software Engineering, May, 2001.

[ Missing PDF ] [ Bibtex ]

Breng Sleeper. The Stencil Scope: An analysis memo from the stencil group. The Stencil Group, 2001.

[ PDF ] [ Bibtex ] [ External URL ]

I. Sommerville. Software Engineering. 6th edition, Pearson Education, Harlow, United Kingdom, EU, 2001, ISBN 020139815X.

[ Missing PDF ] [ Bibtex ]

The Standish Group International. Extreme CHAOS. Technical report, 2001.

[ PDF ] [ Bibtex ] [ External URL ]

Knowledge Query and Manipulation Language. 2001.

[ External URL ] [ Bibtex ]

Norman Walsh, and Leonard Muellner. DocBook: The Definitive Guide. O`Reilly, Sebastopol, California, USA, 2001.

[ Missing PDF ] [ Bibtex ]

T. Wettengel, and A. van de Weyer. Terminology in Technical Writing. In: Handbook of Terminology Management, Edited by: S.E. Wright, and G. Budin. Vol: 2, 2001.

[ Missing PDF ] [ Bibtex ]

Kam-Fai Wong, Dawei Song, P.D. Bruza, and Chun-Hung Cheng. Application of aboutness to functional benchmarking in information retrieval. In: ACM Transactions on Information Systems (TOIS), Nr: 4, Vol: 19, Pages: 337-370, ACM, New York, New York, USA, 2001, ISSN 10468188.

[ PDF ] [ Bibtex ]

Handbook of Terminology Management - Volume 2: Application-Oriented Terminology Management. Edited by: S.E. Wright, and G. Budin. John Benjamins, Amsterdam, The Netherlands, EU, 2001, ISBN 9027221553.

[ Missing PDF ] [ Bibtex ]

S.E. Wright. Terminology and Total Quality Management. In: Handbook of Terminology Management - Volume 2: Application-Oriented Terminology Management, Edited by: S.E. Wright, and G. Budin. John Benjamins, Amsterdam, The Netherlands, EU, 2001, ISBN 9027221553.

[ Missing PDF ] [ Bibtex ]

Robert Clarke. Information Wants to be Free .... Xamax Consultancy Pty Ltd, 2001, Last checked: 23-Aug-2005.

[ External URL ] [ Bibtex ]

Yan Zhu, C. Bornhövd, and Alejandro P. Buchmann. Data Transformation for Warehousing Web Data. In: Third International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS `01), Pages: 74-81, June, 2001.

[ PDF ] [ Bibtex ]

Dan Connolly, Frank van Harmelen, Ian Horrocks, D.L. McGuiness, Lynn Andrea Stein, and Inc. Lucent Technologies. DAML + OIL Reference Description. December, W3C, 2001.

[ External URL ] [ Bibtex ]

Christian Cormier, Jean-Yves Fortier, Gilles Kasel, and Catherine Barry. Representation of metaknowledge for the development of Organizational Semantic Webs. 2001, submitted to: Knowledge Management and Semantic Webs.

[ PDF ] [ Bibtex ]

Project Management Body of Knowledge. Technical report, November, The Project Management Institute, 2001.

The Project Management Body of Knowledge (PMBOK) is an inclusive term that describes the sum of knowledge within the profession of project management. This full body of knowledge includes knowledge of proven, traditional practices, which are widely applied, as well as knowledge of innovative and advanced practices, which may have seen more limited use. The full body of knowledge concerning project management is that which resides with the practitioners and academics that apply and advance it.

[ PDF ] [ Bibtex ] [ External URL ]

Software Engineering Body of Knowledge. November, Endorsed by ACM and IEEE2001.

In spite of the millions of software professionals worldwide and the ubiquitous presence of software in our society, software engineering has not reached the status of a legitimate engineering discipline and a recognized profession. Since 1993, the IEEE Computer Society and the ACM have been actively promoting software engineering as a profession, notably through their involvement in the IEEE Computer Society and ACM Software Engineering Coordinating Committee.

In other engineering disciplines, the accreditation of university curricula and the licensing and certification of practicing professionals are taken very seriously. These activities are seen as critical to the constant upgrading of professionals and, hence, the improvement of the level of professional practice. Recognizing a core body of knowledge is pivotal to the development and accreditation of university curricula and the licensing and certification of professionals.

[ PDF ] [ Bibtex ] [ External URL ]

Journal

M.P. Papazoglou, H.A. (Erik) Proper, and J. Yang. Landscaping the information space of large multi-database networks. In: Data & Knowledge Engineering, Nr: 3, Vol: 36, Pages: 251-281, 2001.

The promises of network-accessible information are increasingly difficult to achieve. These difficulties are due to a variety of causes, such as, the rapid growth in the volume of network-available information and the increasing complexity, diversity and terminological fluctuations of the different information sources available.

This paper presents a conceptual architecture for the organisation information space across collections of component systems in multi-databases that provides serendipity, exploration and contextualisation support so that users can achieve logical connections between concepts they are familiar with and schema terms employed in multi-database systems. Large-scale searching for multi-database schema information is guided by a combination of lexical, structural and semantic aspects of schema terms in order to reveal more meaning both about the contents of a requested information term and about its placement within the distributed information space.

[ PDF ] [ Bibtex ]

J.J. Sarbo, S.J.B.A. (Stijn) Hoppenbrouwers, and J.I. Farkas. Towards thought as a logical picture of signs. In: International Journal of Computing Anticipatory Systems, Vol: 8, Pages: 1-16, 2001.

We are concerned with the problem of summarising the content of a coherent text. In this paper we argue that complex units of symbols like sentences, for example, are signs and the meaning of a text arises via their interaction. We introduce a model for the generation of summaries and illustrate its potential by a realistic example.

[ PDF ] [ Bibtex ]

B.C.M. Wondergem, P. van Bommel, and Th.P. van der Weide. Combining Boolean Logic and Linguistic Structure. In: Information & Software Technology, Nr: 43, Pages: 53-59, 2001.

Keywords still seem to form the basis for document content and query representation. Approaches to use more advanced linguistic structures, such as noun phrases, still are in an experimental phase. In addition, Boolean descriptor languages have often been applied for Information Retrieval. However, the synthesis of logic and linguistics in one descriptor language still is an open issue. In this paper, Boolean index expressions, combining Boolean logic and linguistic structure, are proposed as a good balance between expresiveness and practical issues. Boolean index expressions are obtained by augmenting regular index expressions with logical operators for disjunction, conjunction, and negation. Boolean index expressions are more expressive than both index expressions and the Boolean query language based on keywords. They allow a compact representation of logical combinations of index expressions. In addition, Boolean index expressions are still efficiently parsible and their meaning can be determined through their structure. It is shown how Boolean index expressions can be brought into normal form, allowing fast numerical matching. Matching strategies for Boolean index expressions are obtained by adapting matching strategies for index expressions by providing a case for negations. Our implementation of Boolean index expressions illustrates mentioned issues.

[ PDF ] [ Bibtex ]

Book

ISP for Large-scale Migrations. Edited by: H.A. (Erik) Proper. Information Services Procurement Library, ten Hagen & Stam, Den Haag, The Netherlands, EU, 2001, ISBN 9076304882.

This book aims to provide insight into the procurement of projects dealing with large-scale migrations. Chapter 1 defines the scope of this book more precisely, by defining what is meant by a 'large-scale migration'.

An overview of the acquisition process for large-scale migrations is provided in chapter 2. The ensuing four chapters home in on specific aspects of the acquisition process. In chapter 3 we focus on the description of the initial and final states of projects. Chapter 4 is concerned with risk analysis in a migration context. It bases itself on an analysis of the factors that characterise the current situation, potential risks associated to this situation and factors, as well as their probability and impact. Mitigation of these risks in terms of actions and project strategies is discussed in chapter 5. Finally, chapter 6 is concerned with the identification of decision points to re-evaluate the progress of migration projects, the status of risks, and their mitigation.

[ PDF ] [ Bibtex ]

A.T. Arampatzis. Adaptive and temporally-dependent document filtering. University of Nijmegen, 2001, ISBN 9090148914.

[ PDF ] [ Bibtex ]

Conference

A.T. Arampatzis, and Th.P. van der Weide. Document Filtering as an Adaptive and Temporally-dependent Process. In: Proceedings of BCS-IRSG European Colloquium on IR Research (ECIR01), April, 2001.

The filtering task has traditionally been defined as a special case of the information retrieval task, and undeniably, it can be performed by applying retrieval techniques. This theoretical study summarizes our experiences in viewing filtering as an adaptive and temporally-dependent task. A task that, in contrast to traditional retrieval, takes into account the dynamic nature of the availability of information and its temporal location. We investigate the nature of information streams and user requests, and formulate some useful types of adaptivity. We discuss the effectiveness of different types of adaptivity in filtering environments where responsiveness is more important than convergence. To deal with this, we introduce the notion of the half-life of information. Moreoever, we pay special attention to the implementational and efficiency aspect of incrementality.

[ PDF ] [ Bibtex ]

A.T. Arampatzis, and A. van Hameren. The Score-Distributional Threshold Optimization for Adaptive Binary Classification Tasks. In: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, September, 2001.

The thresholding of document scores or probabilities of relevance has proved critical for the effectiveness of classification tasks. We review the most important approaches to thresholding, and introduce the score-distributional (S-D) threshold optimization method. The method is based on score distributions and is capable of optimizing any effectiveness measure defined in terms of the traditional contingency table.

As a by-product, we provide a model for score distributions, and demonstrate its high accuracy in describing empirical data. The estimation method can be performed incrementally, a highly desirable feature for adaptive environments. Our work in modeling score distributions is useful beyond threshold optimization problems. It directly applies to other retrieval environments that make use of score distributions, e.g., distributed retrieval, or topic detection and tracking.

The most accurate version of S-D thresholding -- although incremental -- can be computationally heavy. Therefore, we also investigate more practical solutions. We suggest practical approximations and discuss adaptivity, threshold initialization, and incrementality issues. The practical version of S-D thresholding has been tested in the context of the TREC-9 Filtering Track and found to be very effective.

[ PDF ] [ Bibtex ]

F.A. Grootjen. Indexing using a grammerless parser. In: 2001 IEEE International Conference on Systems, Man & Cybernetics (SMC2001), 2001, ISBN 0780370899.

This article proposes an alternate view on natural language parsing. Instead of looking for some predefined (phrase) structure it takes inter-word relations as startingpoint. The reason for this is twofold: firstly it circumvents traditional parsing and linguistic problems and secondly it offers possibility to extract information specifically needed by IR applications. The close relationship with index expressions opens the door to feedback mechanisms like 'Query By Navigation' and conceptual knowledge extraction. The presented ideas are accompanied by an implementation and a small scale experiment.

[ Missing PDF ] [ Bibtex ]

H.A. (Erik) Proper, and Th.P. van der Weide. Information coverage - Incrementally satisfying a searcher`s information need. In: Universal Acces in HCI: Towards an Information Society for All, Edited by: C. Stephanidis. Pages: 719-722, August, Lawrence Erlbaum, Hillsdale, New Jersey, USA, 2001, ISBN 0805836098.

The Internet has become the virtual reality of mankind - a world that we shape without many of the imperfections of reality. We can jump to literally every place in no time and reach every resource anywhere anytime. In particular this last promise of information at your fingertips is under siege. The growing complexity of information space overwhelms the wired consumer and the vast increase in information is outpacing the improvement of retrieval tools.

[ PDF ] [ Bibtex ]

D.B.B. Rijsenbrij, J. Schekkerman, H. Hendrickx, H. Goedvolk, and J. van `t Wout. De Architect. In: Proceedings of the Third National Architecture Congres, November, 2001, In Dutch.

[ External URL ] [ Bibtex ]

J.J. Sarbo, and J.I. Farkas. A Peircean Ontology of Language. In: ICCS`2001, Stanford, California, USA, Edited by: H. Delugasch, and G. Stumme. Lecture Notes in AI, Vol: 2120, Pages: 1-14, Springer, 2001.

Formal models of natural language often suffer from excessive complexity. A reason for this, we think, may be due to the underlying approach itself. In this paper we introduce a novel, semiotic based model of language which provides us with a simple algorithm for language processing.

[ PDF ] [ Bibtex ]

Badrul M. Sarwar, G. Karypis, H. Koning, and J. Riedl. Item-based collaborative filtering recommendation algorithms. In: Proceedings of World Wide Web conference, Pages: 285-295, 2001.

[ PDF ] [ Bibtex ]

Proceedings of World Wide Web conference. 2001.

[ Missing PDF ] [ Bibtex ]

Reports

A.T. Arampatzis, J. Beney, C.H.A. Koster, and Th.P. van der Weide. KUN on the TREC-9 Filtering Track: Incrementality, Decay, and Threshold Optimization for Adaptive Filtering Systems. Technical report: CSI-R0104, January, Radboud University Nijmegen, 2001.

[ Missing PDF ] [ Bibtex ]

G. Behrmann, A. Fehnker, T.S. Hune, K.G. Larsen, P. Pettersson, J.M.T. Romijn, and F.W. Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. Technical report: CSI-R0109, March, Radboud University Nijmegen, 2001.

This paper introduces the model of linearly priced timed au-tomata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques and a new notion of pricedregions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them.

[ PDF ] [ Bibtex ]

G. Behrmann, A. Fehnker, T.S. Hune, K.G. Larsen, P. Pettersson, and J.M.T. Romijn. Efficient Guiding Towards Cost-Optimality in UPPAAL. Technical report: CSI-R0110, March, Radboud University Nijmegen, 2001.

In this paper we present an algorithm for efficiently computing the minimum cost of reaching a goal state in the model of Uniformly Priced Timed Automata (UPTA). This model can be seen as a submodel of the recently suggested model of linearly priced timed automata, whichextends timed automata with prices on both locations and transitions. The presented algorithm is based on a symbolic semantics of UTPA, and an efficient representation and operations based on difference bound matrices. In analogy with Dijkstra's shortest path algorithm, we show that the search order of the algorithm can be chosen such that the number of symbolic states explored by the algorithm is optimal, in the sense that the number of explored states can not be reduced by any other search order based on the cost of states. We also present a number of techniquesinspired by branch-and-bound algorithms which can be used for limiting the search space and for quickly finding near-optimal solutions.The algorithm has been implemented in the verification tool Uppaal. When applied on a number of experiments the presented techniques reduced the explored state-space with up to 90%.

[ Missing PDF ] [ Bibtex ]

J.I. Farkas, and J.J. Sarbo. A Peircean Ontology of Semantics. Technical report: CSI-R0120, Nijmegen Institute for Information and Computing Sciences, University of Nijmegen, Nijmegen, The Netherlands, EU, 2001.

Peirce's semiotics can be effectively used for modeling different types of signs. In this paper it is argued that semantic signs, which are signs from the semantic point of view, are no exception. It turns out, however, that a proper modeling of semantic signs needs a better understanding of the concept of qualisigns, as well as, of the relation between Peirce's categories and his theory of signs.

[ Missing PDF ] [ Bibtex ]

R. Gieben. Chain of Trust. Technical report: CSI-R0111, March, Radboud University Nijmegen, 2001.

DNSSEC is the intended successor of DNS (Domain Name System), the well-known system that takes care of the mapping between domain names and IP numbers on the internet. There are however some security problems with DNS, thus the need for DNSSEC (DNS SECure). DNSSEC uses public key cryptography to solve the security issues in the DNS. The goal of DNSSEC is to create a chain of trust in which a top level zone (like com) signs the key of a lower zone (such as child.com) which in turn can sign a even lower zone (a.child.com, for instance). To set up this chain, keys must be exchanged and signatures must be renewed on a regular basis. Furher more, keys can be discoverd, lost or stolen. This master thesis delves into those problems and presents possible solutions and procedures for efficient and (reasonably) safe distribution and renewal of keys and signatures.

[ Missing PDF ] [ Bibtex ]

F.A. Grootjen. Relational indexing using a grammarless parser. Technical report: CSI-R0118, July, Radboud University Nijmegen, 2001.

This article proposes an altenate view on natural language parsing. Instead of looking for some predifined (phrase) structure it takes inter-word relations as startingpoint. The reason for this is twofold: firstly it circumvents traditional parsing and linguistic problems and secondly it offers a possibility to extract information specifically needed by IR applications. The close relationship with index expressions opens the door to feedback mechanisms like 'Query By Navigation"" [Bruza and van der Weide, 1992] and conceptual knowledge extraction [Grootjen, 2000]. The presented ideas are accompanied by an implementation and a small scale experiment.

[ Missing PDF ] [ Bibtex ]

M. Hendriks, and K.G. Larsen. Exact Acceleration of Real-Time Model Checking. Technical report: CSI-R0122, December, Radboud University Nijmegen, 2001.

Different time scales do often occur in real-time systems, e.g., a polling real-time system samples the environment many times per second, whereas the environment may only change a few times per second. When these systems are modeled as (networks of) timed automata, the validation using symbolic model checking techniques can significantly be slowed down by unnecessary fragmentation of the symbolic state space.This paper introduces a syntactical adjustment to a subset of timed automata that addresses this fragmentation problem and can speed-up forward symbolic reachability analysis in a significant way. We prove that this syntactical adjustment does not alter reachability properties and that it indeed is effictive. We illustrate our exact acceleration tehnique with run-time date obtained with the model checkers UPPAAL and KRONOS.

[ Missing PDF ] [ Bibtex ]

M. Hendriks. Translating Uppaal to Not Quite C. Technical report: CSI-R0108, March, Radboud University Nijmegen, 2001.

This project presents a simple translation from Uppaal models of real-time controllers to NQC programs. The modeling of these controllers in Uppaal provides a way to verify the requirements on these controllers. The user directs the translation by defining a type for each variable used in the model and by assigning each automaton in the model to a controller.The translation, that has been implemented in the tool uppaal2nqc, results in a set of NQC programs that, when all NQC programs are run concurrently, approximately realizes a subset of the executions of the model.An Uppaal model of controllers of an experimental LEGO setup has been translated and the resulting NQC programs have been run in this setup to validate the translation.

[ Missing PDF ] [ Bibtex ]

T.S. Hune, J.M.T. Romijn, M.I.A. Stoelinga, and F.W. Vaandrager. Linear Parametric Model Checking of Timed Automata. Technical report: CSI-R0102, January, Radboud University Nijmegen, 2001.

We present an extension of the model checker Uppaal, capable of synthesizing linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of the (parametric) state-space is shown to be correct. A second contribution of this paper is the identification of a subclass of parametric timed automata (L/U automata), for which the emptiness problem isdecidable, contrary to the full class where it is know tobe undecidable. Also, we present a number of lemmas enabling the verification effort to be reduced for L/U automata in some cases. We illustrate our approach by deriving linear parameter constraints for a number of well-known case studies from the literature (exhibiting a flaw in a published paper).

[ PDF ] [ Bibtex ]

R.D.T. Janssen, H.A. (Erik) Proper, H. Bosma, D. Verhoef, and S.J.B.A. (Stijn) Hoppenbrouwers. Developing an Architecture Method Library. Technical report, January, Ordina Institute, Gouda, The Netherlands, EU, 2001.

Today, there are millions of professionals worldwide acting as a designer, architect or engineer in the design, realization, and implementation of information systems. At this moment there is no well established and clearly identified body of knowledge that defines their profession in a 'standard' way.

In this article, we This article discusses a conceptual framework for architecture-driven information system development. Rather than defining a completely new framework, the conceptual framework is synthesized out of relevant pre-existing frameworks for system development and architecture.

Before discussing the actual framework, we briefly discuss the necessity for an architecture-driven approach to system development.

[ PDF ] [ Bibtex ]

R.D.T. Janssen, and H.A. (Erik) Proper. A functionality taxonomy for document search engines. Technical report, June, Ordina Institute, Gouda, The Netherlands, EU, 2001.

In this paper a functionality taxonomy for document search engines is proposed. It can be used to assess the features of a search engine, to position search engines relative to each other, or to select which search engine `fits' a certain situation. One is able to identify areas for improvement. During development, we were guided by the viewpoint of the user. We use the word `search engine' in the broadest sense possible, including library and web based (meta) search engines.

The taxonomy distinguishes seven functionality areas: an indexing service, user profiling, query composition, query execution, result presentation, result refinement, and history keeping. Each of these relates and provides services to other functionality areas. It can be extended whenever necessary.

To illustrate the validity of our taxonomy, it has been used for comparing various document search engines existing today (ACM Digital Library, PiCarta, Copernic, AltaVista, Google, and GuideBeam). It appears that the functionality aspects covered by our taxonomy can be used for describing these search engines.

[ PDF ] [ Bibtex ]

A.H. Mader, E. Brinksma, H. Wupper, and N. Bauer. Design of a PLC Control Program for a Batch Plant VHS Case Study 1. Technical report: CSI-R0113, March, Radboud University Nijmegen, 2001.

[ Missing PDF ] [ Bibtex ]

E. Poll, and J. Zwanenburg. From Algebras and Coalgebras to Dialgebras. Technical report: CSI-R0101, January, Radboud University Nijmegen, 2001.

This paper investigates the notion of dialgebra, which generalises the notions of algebra and coalgebra. We show that many (co)algebraic notions and results can be generalised to dialgebras, and investigate the essential differences between (co)algebras and arbitrary dialgebras.

[ Missing PDF ] [ Bibtex ]

J.J. Sarbo, and J.I. Farkas. A linearly complex model for knowledge representation. Technical report: CSI-R0121, Nijmegen Institute for Information and Computing Sciences, University of Nijmegen, Nijmegen, The Netherlands, EU, 2001.

We present two results which complete and extend our Peircean semiotic model of signs introduced earlier. The first result is concerned with the potential of that model for the representation of knowledge in general. The second one formally proves that such a model can be linearly complex.

[ Missing PDF ] [ Bibtex ]

J.J. Sarbo, and J.I. Farkas. On the isomorphism of sign, logic and language. Technical report: CSI-R0117, June, Radboud University Nijmegen, 2001.

Formal models of natural language often suffer from their excessive complexity which, in our opinion, may be due to the underlying approach itself. In this paper we introduce a semiotic model of language which is only linearly complex.The existence of such a model is conform with the experience that language is a real-time complex phenomenon.

[ Missing PDF ] [ Bibtex ]

M.I.A. Stoelinga. Fun with FireWire: Experiences with Verifying the IEEE 1394 Root Contention Protocol. Technical report: CSI-R0107, March, Radboud University Nijmegen, 2001.

The IEEE 1394 Root Contention Protocol is leader election algorithm for two processes and has been analysed in various case studies. This paper compares several formal verification techniques applied to this protocol.

[ Missing PDF ] [ Bibtex ]

U. Hannemann, and J.J.M. Hooman. Top-down Design of a Command-and-Control System with Timing Assumptions . Technical report: CSI-R0116, June, Radboud University Nijmegen, 2001.

We present a formal approach to the top-down design ofreal-time components that communicate using a shared data space. The approach is compositional, that is, only the formal specifications of the components are used toreason about their combined behaviour. Formal reasoning is supported by the interactive theorem prover PVS.Our shared data space model is based on the softwarearchitecture SPLICE, that allows loosely-coupled components. Our formalism is illustrated by the top-down design of a small flight-tracking-and-display system, whichcontains an event-driven and a time-driven component.Formal correctness is established, given suitableassumptions about the environment of the system andrelations between timing parameters.

[ PDF ] [ Bibtex ]