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

N. Denos, C. Berrut, and M. Mechkour. An image system based on the visualization of system relevance via documents. In: (DEXA 97), Pages: 379-395, 1997.

[ Missing PDF ] [ Bibtex ]

P.D. Bruza, and B. van Linder. Preferential Models of Refinement Paths. In: Proceedings of the IJCAI-97 Workshop on AI and Digital Libraries, 1997.

[ Missing PDF ] [ Bibtex ]

J. Mylopoulos. Information Modeling in a Time of Revolution. In: Proceedings of the Ninth International Conference CAiSE`97 on Advanced Information Systems Engineering, Barcelona, Spain, EU, Edited by: A. Olivé, and J.A. Pastor. Lecture Notes in Computer Science, Vol: 1250, June, Springer, 1997, (Keynote Address).

[ Missing PDF ] [ Bibtex ]

W.M.P. van der Aalst. Verification of Workflow Nets. In: Application and Theory of Petri Nets 1997, Berlin, Germany, EU, Edited by: P. Azema, and G. Balbo. Lecture Notes in Computer Science, Vol: 1248, Pages: 407-426, Springer, 1997.

[ Missing PDF ] [ Bibtex ]

Serge Abiteboul. Querying Semi-Structured Data. In: ICDT, Pages: 1-18, 1997.

[ External URL ] [ Bibtex ]

Irina Akoulchina, and Jean-Gabriel Ganascia. SATELIT-Agent: An Adaptive Interface Based on Learning Interface Agents Technology. In: User Modeling: Proceedings of the Sixth International Conference, UM97, Edited by: Anthony Jameson, C`ecile Paris, and Carlo Tasso. Pages: 21-32, Springer Wien New York, Vienna, New York, 1997, Available by WWW from: http://um.org.

[ Missing PDF ] [ Bibtex ]

Joshua Alspector, Aleksander Koicz, and N. Karunanithi. Feature-based and Clique-based User Models for Movie Selection: A Comparative Study. , Vol: 7, Pages: 279-304, 1997.

[ Missing PDF ] [ Bibtex ]

Leonardo Ambrosini, Vincenzo Cirillo, and Alessandro Micarelli. A Hybrid Architecture for User-Adapted Information Filtering on the World Wide Web. In: User Modeling: Proceedings of the Sixth International Conference, UM97, Edited by: Anthony Jameson, C`ecile Paris, and Carlo Tasso. Pages: 59-61, Springer Wien New York, Vienna, New York, 1997, Available by WWW from: http://um.org.

[ Missing PDF ] [ Bibtex ]

P.G. Anick, and S. Vaithyanathan. Exploiting Clustering and Phrases for Context-Based Information Retrieval. In: Proceedings of the 20th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Edited by: N.J. Belkin, A.D. Narasimhalu, and P Willett. Pages: 314-323, 1997.

[ Missing PDF ] [ Bibtex ]

William Y. Arms, Christophe Blachi, and Edward A. Overly. An Architecture for Information in Digital Libraries. Technical report, February, Corporation for National Research Initiatives, 1997, D-Lib Magazine, ISSN 10829873.

[ Missing PDF ] [ Bibtex ]

P. Atzeni, G. Mecca, and P. Merialdo. To Weave the Web. In: Proceedings of the Twenty-third International Conference on Very Large Data Bases, September, 1997.

[ Missing PDF ] [ Bibtex ]

M.N.F. Babeliowsky. Designing inter-organizational logistics networks. Delft University of Technology, Delft, The Netherlands, EU, 1997.

[ Missing PDF ] [ Bibtex ]

B. van Bakel, R.T. Boon, N.J.I. Mars, J. Nijhuis, E. Oltmans, and P.E. van der Vet. Condorcet Annual Report. Technical report, Knowledge Based System Group, University of Twente, The Netherlands, 1997.

[ Missing PDF ] [ Bibtex ]

J.Y. Bakos. Reducing buyer search costs: implications for electronic marketplaces. In: Management Science, Nr: 12, Vol: 43, Pages: 1676-1692, 1997.

Informations systems can serve as intermediaries between the buyers and the sellers in a market, creating an "electronic marketplace" that lowers the buyers' cost to acquire information about seller prices and product offerings. As a result, electronic marketplaces reduce the inefficiencies caused by buyer search costs, in the process reducing the ability of sellers to extract monopolistic profits while increasing the ability of markets to optimally allocate productive resources. This article models the role of buyer search costs in markets with differentiated product offerings. The impact of reducing these search costs is analyzed in the context of an electronic marketplace, and the allocational eficienciessuch a reduction can bring to a differentiated maret are formalized. The resulting implications for the incentives of buyers, sellers and independent intermediaries to invest in electronic marketplaces are explored. Finally, the possibility to separate price information from product attribute information is introduced, and the implications of designing markets promoting competition along each of these dimensions are discussed.

[ PDF ] [ Bibtex ]

A.P. Barros, and A.H.M. ter Hofstede. Formal Semantics of Coordinative Workflow Specifications. Technical report, December, Department of Computer Science & Electrical Engineering, University of Queensland, Brisbane, Australia, 1997.

[ Missing PDF ] [ Bibtex ]

R. Barzilay, and M. Elhadad. Using lexical chains for text summarization. In: Proceedings of the Intelligent Scalable Text Summarization Workshop (ISTS`97), 1997.

[ PDF ] [ Bibtex ]

R.J. Bayardo, M. Nodine, M. Rashid, M. Rusinkiewicz, R. Shea, C. Unnikrishnan, A. Unruh, D. Woelk, W. Bohrer, R. Brice, A. Cichocki, J. Fowler, A. Helal, V. Kashyap, T. Ksiezyk, and G. Martin. InfoSleuth: Agent-Based Semantic Integration of Information in Open and Dynamic Environments. In: Readings in Agents, Edited by: Huhns M.N., and M. Singh. Pages: 205-216, Morgan Kaufmann Publishers, San Francisco, California, 1997.

[ Missing PDF ] [ Bibtex ]

Frank van den Beuken. A Functional Approach to Syntax and Typing. University of Nijmegen, 1997, ISBN 9090108548.

[ Missing PDF ] [ Bibtex ]

P.D. Bruza, and B. van Linder. Preferential Models of Query by Navigation. In: Information Retrieval and Logic, Edited by: F. Crestani, M. Lalmas, and C.J. van Rijsbergen. 1997, Forthcoming book chapter..

[ Missing PDF ] [ Bibtex ]

P.D. Bruza, and B. van Linder. Preferential Models of Refinement Paths in Query by Navigation. IJCAI-97 Workshop on AI and Digital Libraries, 1997.

[ Missing PDF ] [ Bibtex ]

P.D. Bruza, and S. Dennis. Query ReFormulation on the Internet: Empirical Data and the Hyperindex Search Engine. In: Proceedings of RIAO`97 Computer-Assisted Information Searching on the Internet, Pages: 488-499, June, 1997.

[ Missing PDF ] [ Bibtex ]

Licia Calvi, and Paul De Bra. Proficiency-Adapted Information Browsing and Filtering in Hypermedia Educational Systems. In: User Modeling and User-Adapted Interaction, Vol: 7, Pages: 257-277, 1997.

[ Missing PDF ] [ Bibtex ]

J.G. Carbonell, Y. Geng, and J. Goldstein. Automated Query-Relevant Summarization and Diversity-Based Reranking. In: Proceedings of the IJCAI-97 Workshop on AI and Digital Libraries, Edited by: I. Ferguson. Pages: 9-14, August, 1997.

[ Missing PDF ] [ Bibtex ]

S. Castano, and V. De Antonellis. Semantic Dictionary Design for Database Interoperability. In: Thirteenth International Conference on Data Engineering, Pages: 43-54, April, 1997.

[ Missing PDF ] [ Bibtex ]

E. de Bono. Leer Uzelf Denken. Tweede edition, Element Uitgevers, Naarden, The Netherlands, EU, 1997, ISBN 9056890271.

[ Missing PDF ] [ Bibtex ]

K. Decker, and K. Sycara. Intelligent Adaptive Information Agents. In: Journal of Intelligent Information Systems, Vol: 9, Pages: 239-260, 1997.

[ Missing PDF ] [ Bibtex ]

K. Decker, K. Sycara, and M. Williamson. Middle-Agents for the Internet. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), Pages: 578-584, August, 1997.

[ Missing PDF ] [ Bibtex ]

B.C. Desai. Supporting Discovery in Virtual Libraries. In: Journal of the American Society for Information Science, Nr: 3, Vol: 48, Pages: 190-204, 1997.

[ Missing PDF ] [ Bibtex ]

M. Dreger, N. Fuhr, K. Grossjohan, and S. Lohrum. Provider Selection - Design and Implementation of the Medoc Broker. In: Proceedings of the Dagstuhl workshop, July, 1997.

[ Missing PDF ] [ Bibtex ]

H. Dresner, and B. Lett. Using a Comprehensive BI Architecture Process to Eliminate Fact Gaps. Technical report: R-BI-137, August, GartnerGroup - IEW, 1997.

[ PDF ] [ Bibtex ] [ External URL ]

Thorsten Fiebig, J. Weiss, and Guido Moerkotte. Raw: A Relational Algebra for the Web. In: ACM SIGMOD Workshop on Management of Semistructured Data, 1997.

[ PDF ] [ Bibtex ]

L. Fitzpatrick, and M. Dent. Automatic Feedback Using Past Queries: Social Searching?. In: Proceedings of the 20th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Edited by: N.J. Belkin, A.D. Narasimhalu, and P Willett. Pages: 306 - 313, 1997.

[ Missing PDF ] [ Bibtex ]

B. Foote, and J. Yoder. Big Ball of Mud. In: Fourth Conference on Pattern Languages of Programs (PLoP `97/ EuroPLoP `97), 1997.

[ PDF ] [ Bibtex ]

Armando Fox, Steven D. Gribble, Yatin Chawathe, E.A. Brewer, and Paul Gauthier. Cluster-Based Scalable Network Services. In: Symposium on Operating Systems Principles, Pages: 78-91, 1997.

[ PDF ] [ Bibtex ]

P.J.M. Frederiks. Object-Oriented Modeling based on Information Grammars. University of Nijmegen, 1997, ISBN 9090103384.

[ Missing PDF ] [ Bibtex ]

R. Gaizauskas, and Alexander M. Robertson. Coupling Information Retrieval and Information Extraction: A Nex Text Technology for Gathering Information from the Web. In: Proceedings of RIAO 97: Computer-Assisted Information Searching on the Internet, Pages: 356-370, 1997.

[ PDF ] [ Bibtex ]

D. Garlan, R.T. Monroe, and D. Wile. ACME: An Architecture Description Interchange Language. In: Proceedings of CASCON `97, Pages: 169-183, 1997.

[ Missing PDF ] [ Bibtex ]

R. Grishman. Information extraction: techniques and challenges. In: Information Extraction: A Multidisciplinary Approach to an Emerging Information Technology, International summer school, SCIE-97, Frascati, Italy, EU, Lecture notes in computer science edition, Edited by: M.T. Pazienza. Vol: 1299, Pages: 10-27, Springer, 1997, ISBN 354063438X.

[ Missing PDF ] [ Bibtex ]

J. Hagel III, and A.G. Armstrong. Net Gain - Expanding markets through virtual communities. Harvard Business School Press, Boston, Massachusetts, USA, 1997.

[ Missing PDF ] [ Bibtex ]

A.F. Harmsen. Situational Method Engineering. Twente University, Enschede, The Netherlands, EU, 1997.

[ Missing PDF ] [ Bibtex ]

W. Hayes, and J.W. Over. The Personal Software Process (PSP): An emperical study of the impact of PSP on individual engineers. Technical report: ESC-TR-97-001, December, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, 1997.

[ Missing PDF ] [ Bibtex ]

G. Hirst, and D. St-Onge. Lexical Chains as representation of context for the detection and correction of malapropisms. In: WordNet: An electronic lexical database and some of its applications, Edited by: C. Fellbaum. The MIT Press, Cambridge, Massachusetts, USA, 1997.

[ PDF ] [ Bibtex ]

J.J.A.C. Hoppenbrouwers. Conceptual Modeling and the Lexicon. Tilburg University, Tilburg, The Netherlands, EU, 1997, ISBN 9056680277.

[ Missing PDF ] [ Bibtex ]

M.N. Huhns, and M.P. Singh. Readings in Agents. Morgan Kaufman, San Francisco, California, USA, 1997.

[ Missing PDF ] [ Bibtex ]

IS`97 - Model Curriculum and Guidelines for Undergraduate Degree Programs in Information Systems. Edited by: G.B. Davis, J.T. Gorgone, J.D. Couger, D.L. Feinstein, and Jr. Longenecker. ACM, AIS and AITP, 1997.

[ Missing PDF ] [ Bibtex ]

H. Jeon. JATLite. WWWhttp://java.stanford.edu/java_agent/, 1997.

[ Missing PDF ] [ Bibtex ]

Readings in Information Retrieval. Edited by: Karen Sparck Jones, and Peter Willett. Academic Press/Morgan Kaufmann, 1997.

[ Missing PDF ] [ Bibtex ]

J. Kahng, and D. McLeod. Dynamic Classificational Ontologies: Mediation of Information Sharing in Cooperative Federated Database Systems. In: Cooperative Information Systems: Trends and Directions, Edited by: M.P. Papazoglou, and G. Schlageter. Pages: 179-203, Academic Press, New York, New York, USA, 1997.

[ Missing PDF ] [ Bibtex ]

V. Kashyap, and A.P. Sheth. Semantic Heterogeneity in Global Information Systems: the Role of Metadata, Context and Ontologies. In: Cooperative Information Systems: Trends and Directions, Edited by: M.P. Papazoglou, and G. Schlageter. Pages: 139-178, Academic Press, New York, New York, USA, 1997.

[ Missing PDF ] [ Bibtex ]

R. Kazman, and S. Jeromy Carrière. Playing Detective: Reconstructing Software Architecture from Available Evidence. Technical report: CMU/SEI-97-TR-010, October, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, 1997.

[ Missing PDF ] [ Bibtex ]

Soung-Hie Kim, and Byeong-Seok Ahn. Group decision making procedure considering preference strenght under incomplete information. In: Computers & Operations Research, Nr: 12, Vol: 24, Pages: 1101-1112, Pergamon, 1997.

This article deals with the multiple criteria decision making problem with incomplete information when multiple decision makers (Multiple Criteria Group Decision Making: MCGDM) are involved. Usually decision makers (DMs) are willing or able to provide only incomplete information, because of time pressure, lack of knowledge or data, and their limited expertise related to the problem domain. "]'here have only been a few studies considering incomplete information in group settings. We also consider the case where importance weights are given incompletely. This article suggests the possibility that individually optimized results can be used to build group consensus. Individual optimization results by pairwise dominance, contain useful information in forming consensus, such as, ordinal rankings or preference intensity of an alternative over the others. Rather than using ordinal rankings for aggregation which do not consider preference strength, we suggest a procedure that takes account of individual DMs' preference strength. © 1997 Elsevier Science Ltd

[ PDF ] [ Bibtex ]

N. Klinkenberg. Business manager automatiseert mee In Dutch. In: Network News, Nr: 6, 7 and 8, April, 1997.

[ Missing PDF ] [ Bibtex ]

James G. Kobielus. Workflow Strategies. IDG Books Worldwide, Foster City, California, USA, 1997.

[ Missing PDF ] [ Bibtex ]

Daphne Koller, and Mehran Sahami. Hierarchically classifying documents using very few words. In: Proceedings of ICML-97, 14th International Conference on Machine Learning, Edited by: Douglas H. Fisher. Pages: 170-178, Morgan Kaufmann, San Mateo, California, USA, 1997.

[ PDF ] [ Bibtex ]

G. Kowalski. Information Retrieval Systems: Theory and Implementation. Kluwer, Deventer, The Netherlands, EU, 1997.

[ Missing PDF ] [ Bibtex ]

D. Kuokka, and L. Harrada. Matchmaking for Information Agents. In: Readings in Agents, Edited by: Huhns M.N., and M. Singh. Pages: 91-97, Morgan Kaufmann Publishers, San Francisco, California, 1997.

[ Missing PDF ] [ Bibtex ]

Y. Labrou, and T. Finin. Semantics and conversations for an agent communication language. In: Proceedings of the Fifteenth International Conference on Artificial Intelligence, Pages: 584-591, 1997.

[ Missing PDF ] [ Bibtex ]

Y. Lashkari, M. Metral, and P. Maes. Collaborative Interface Agents. In: Readings in Agents, Edited by: Huhns M.N., and M. Singh. Pages: 111-116, Morgan Kaufmann Publishers, San Francisco, California, 1997.

[ Missing PDF ] [ Bibtex ]

C. Lin, and E. Hovy. Identifying topics by position. In: Proceedings of the Fifth Conference on Applied Natural Language Processing (ANLP-97), Pages: 283-290, 1997.

[ PDF ] [ Bibtex ]

R. Lipshitz, and O Strauss. Coping with uncertainty: a naturalistic decision-making analysis. In: Organizational Behaviour and Human Decision Processes, Nr: 69, Vol: 2, Pages: 152-154, 1997.

[ Missing PDF ] [ Bibtex ]

R.M. Losee. A Discipline Independent Definition of Information. In: Journal of the American Society for Information Science, Nr: 3, Vol: 48, Pages: 254-269, 1997.

[ Missing PDF ] [ Bibtex ]

P.J.F. Lucas. Symbolic diagnosis and its formalisation. In: The Knowledge Engineering Review, Nr: 2, Vol: 12, Pages: 109-146, 1997.

[ External URL ] [ Bibtex ]

R. Mack, and K. Dec. Building a Strategic Plan for an Information Technology Transition. Technical report: R-MGT-105, April, GartnerGroup - TS, 1997.

[ PDF ] [ Bibtex ] [ External URL ]

M. Magennis, and C.J. van Rijsbergen. The potential and actual effectiveness of interactive query expansion. In: Proceedings of the 20th Annual International ACM SIGIR Confe rence on Research and Development in Information Retrieval, Edited by: N.J. Belkin, A.D. Narasimhalu, and P Willett. Pages: 324-332, 1997.

[ Missing PDF ] [ Bibtex ]

S. Marsh. A Community of Autonomous Agents for the Search and Distribution of Information in Networks. In: Proceedings of the 19th BCS-IRSG Colloquium on IR Research, Edited by: J. Furner, and D.J. Harper. Pages: 108 - 124, April, 1997.

[ Missing PDF ] [ Bibtex ]

A.O. Mendelzon, and Tova Milo. Formal models of Web queries. In: Proceedings of 16th Symp. on Principles of Database Systems - PODS 97, Pages: 134-143, 1997.

[ PDF ] [ Bibtex ]

A.O. Mendelzon, George A. Mihaila, and Tova Milo. Querying the World Wide Web. In: Int. J. on Digital Libraries, Nr: 1, Vol: 1, Pages: 54-67, 1997.

[ PDF ] [ Bibtex ]

N. Mfourga. Extracting Entity-Relationship Schemas from Relational Databases: A Form-Driven Approach. In: Proceedings of the 4th Working Conference on Reverse Engineering, Edited by: C. Verhoef I. Baxter. Pages: 184-193, October, 1997.

[ Missing PDF ] [ Bibtex ]

Mandar Mitra, Chris Buckley, Amit Singhal, and Claire Cardie. An Analysis of Statistical and Syntactic Phrases. In: Proceedings of RIAO`97 Computer-Assisted Information Searching on Internet, Pages: 200-214, 1997.

[ Missing PDF ] [ Bibtex ]

S. Mizzaro. Relevance: The whole history. In: Journal of the American Society for Information Science, Nr: 9, Vol: 48, Pages: 810-832, September, 1997.

[ Missing PDF ] [ Bibtex ]

A.M. Moreno, and R.P. van der Riet. Justification of the Equivalence between Linguistic and Conceptual Patterns for the Object Model. In: Proceedings of the Third International Workshop on Applications of Natural Language to Informations Systems, Edited by: P. McFetridge. Pages: 57-74, Simon Fraser University, 1997.

[ Missing PDF ] [ Bibtex ]

H.J. Mueller. Towards agent system engineering. In: Data and Knowledge Engineering, Vol: 23, Pages: 217-245, 1997.

[ Missing PDF ] [ Bibtex ]

Y. Natis. Object Transaction Monitors: The Foundation for a Component-Based Enterprise. Technical report: R-400-105, August, GartnerGroup - SSA, 1997.

[ PDF ] [ Bibtex ] [ External URL ]

ResearchIndex Citeseer. NEC Research Institute1997, Last checked: 19-may-2003.

[ External URL ] [ Bibtex ]

J.F. Nunamaker, R.O. Briggs, D. Mittleman, D. Vogel, and P. Balthazard. Lessons from a dozen years of group support systems research. In: Journal of MIS, Nr: 3, Vol: 13, Pages: 163-207, 1997.

[ Missing PDF ] [ Bibtex ]

Y. Osawa, and M. Yachida. An index navigator for understanding and expressing user`s coherent interest. In: Proceedings of 15th International Joint Conference on AI - IJCAI-97, Pages: 722-728, 1997.

[ Missing PDF ] [ Bibtex ]

A Discussion of the Object Management Architecture. Technical report, January, Open Management Group, 1997.

[ Missing PDF ] [ Bibtex ]

I. Ounis, and T.W.C. Huibers. A logical Relational Approach for Information Retrieval Indexing. In: Information Retrieval Research, Proceedings of the 19th Annual BCS-IRSG Colloquium on IR Research, Edited by: C.J. Rijsbergen. April, 1997.

[ Missing PDF ] [ Bibtex ]

I. Ounis, and T.W.C. Huibers. A Logical Relational Appraoch for Information Retrieval Indexing. In: Proceedings of the 19th Annual BCS-IRSG Colloquium on IR Research, Edited by: J. Furner, and D.J. Harper. Pages: 160-177, April, 1997.

[ Missing PDF ] [ Bibtex ]

Michael J. Pazzani, and Daniel Billsus. Learning and Revising User Profiles: The Identification of Interesting Web Sites. In: Machine Learning, Nr: 3, Vol: 27, Pages: 313-331, 1997.

[ PDF ] [ Bibtex ]

R. Prins, A. Blokdijk, and N.E. van Oosterom. Family traits in business objects and their applications. In: IBM Systems Journal, Nr: 1, Vol: 36, Pages: 12-31, 1997.

[ PDF ] [ Bibtex ]

Jan Prins. De informatiemarkt, de zakelijke mogelijkheden van Internet. Samson BedrijfsInformatie, Alphen aan de Rijn, The Netherlands, EU, 1997, ISBN 9014055579.

[ Missing PDF ] [ Bibtex ]

G. Raphaelian. Trends in IT Work Roles and Compensation. Technical report: R-350-106, April, GartnerGroup - MSD, 1997.

[ PDF ] [ Bibtex ] [ External URL ]

J.C. Reynar, and A. Ratnaparkhi. A Maximum Entropy Approach to Identifying Sentence Boundaries. In: Proceedings of the Fifth Conference on Applied Natural Language Processing, Pages: 16-19, 1997.

[ PDF ] [ Bibtex ]

C. Rich, and C.L. Sidner. COLLAGEN: When Agents Collaborate with People. In: Readings in Agents, Edited by: Huhns M.N., and M. Singh. Pages: 117-124, Morgan Kaufmann Publishers, San Francisco, California, 1997.

[ Missing PDF ] [ Bibtex ]

S.P. Robbins, R. Bergman, and I. Stagg. Management. Prentice Hall Australia Pty Ltd., Prentice-Hall, Sydney, USA, 1997.

[ Missing PDF ] [ Bibtex ]

Manuel De Buenaga Rodr`iguez, Jos`e Mar`ia G`omez-Hidalgo, and Bel`en D`iaz Agudo. Using WordNet to Complement Training Information in Text Categorization. In: Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP-97), March 25-2, 1997.

[ Missing PDF ] [ Bibtex ]

T. R`olleke, and N. Fuhr. Retrieving Complex Objects with HySpirit. In: Proceedings of the 19th BCS-IRSG Colloquium on IR Research, Edited by: J. Furner, and D.J. Harper. April, 1997.

[ Missing PDF ] [ Bibtex ]

T. R`olleke, and N. Fuhr. Probabilistic Reasoning for Large Scale Databases. In: Proceedings of the BTW Conference, 1997.

[ Missing PDF ] [ Bibtex ]

D. Rus, R. Gray, and D. Kotz. Transportable Information Agents. In: Readings in Agents, Edited by: Huhns M.N., and M. Singh. Pages: 283-291, Morgan Kaufmann Publishers, San Francisco, California, 1997.

[ Missing PDF ] [ Bibtex ]

S.J. Russel. Rationality and Intelligence. In: Artificial Intelligence, Vol: 94, Pages: 57-77, 1997.

[ Missing PDF ] [ Bibtex ]

Stuart J. Russell. Rationality and intelligence. In: Artificial Intelligence, Nr: 1-2, Vol: 94, July, 1997.

The long-term goal of our field is the creation and understanding of intelligence. Productive research in AI, both practical and theoretical, benefits from a notion of intelligence that is precise enough to allow the cumulative development of robust systems and general results. The concept of rational agency has long been considered a leading candidate to fulfill this role. This paper outlines a gradual evolution in the formal conception of rationality that brings it closer to our informal conception of intelligence and simultaneously reduces the gap between theory and practice. Some directions for future research are indicated.

[ PDF ] [ Bibtex ]

T. Sandholm, and Lesser V.. Coalitions among Computationally Bounded Agents. In: Artificial Intelligence, Nr: 1, Vol: 94, Pages: 99-137, 1997, Special issue on Economic Principles of Multiagent Systems.

[ Missing PDF ] [ Bibtex ]

B.R. Schatz. Information Retrieval in Digital Libraries: Bringing Search to the Net. In: Science, Vol: 275, Pages: 327-334, 1997.

[ PDF ] [ Bibtex ]

I. Schmitt, and G. Saake. Merging Inheritance Hierarchies for Schema Integration based on Concept Lattices. Technical report, Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany, EU, 1997.

[ Missing PDF ] [ Bibtex ]

A.L. Schneider, and H. Ingram. Policy Design for Democracy. University Press of Kansas, Lawrence, Kansas, USA, 1997.

[ Missing PDF ] [ Bibtex ]

R. Schulte. Architecture and Planning for Modern Application Styles. Technical report: R-ARCH-104, GartnerGroup - SSA, 1997.

[ PDF ] [ Bibtex ] [ External URL ]

E. Selberg, and O. Etzioni. The MetaCrawler Architecture for Resource Aggregation on the Web. In: IEEE Expert, Nr: January-Fe, Pages: 11-14, 1997.

[ PDF ] [ Bibtex ]

B. Shneiderman, D. Byrd, and W. Bruce Croft. Clarifying search, a user-interface framework for text searches. In: D-Lib Magazine, January, 1997, ISSN 10829873.

[ Missing PDF ] [ Bibtex ]

J. Simons. Using a Semantic User Model to Filter the World Wide Web Proactively. In: Proceedings of the sixth international Conference UM97, Edited by: Anthony Jameson, C`ecile Paris, and Carlo Tasso. SpringerWienNewYork, 1997.

[ Missing PDF ] [ Bibtex ]

Amit Singhal, Chris Buckley, and Mandar Mitra. Learning Routing Queries in a Query Zone. In: Proceedings of the 20st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Edited by: Nick Belkin, Desai Narasimhalu, and Peter Willett. Pages: 25-32, July, ACM Press, New York, 1997.

[ Missing PDF ] [ Bibtex ]

Alan F. Smeaton. Using NLP or NLP Resources for Information Retrieval Tasks. In: Natural Language Information Retrieval, Edited by: T. Strzalkowski. Kluwer Academic Publishers, 1997.

[ Missing PDF ] [ Bibtex ]

A.F. Smeaton. Using NLP or NLP Resources for Information Retrieval Tasks. In: Natural Language Information Retrieval, Edited by: T. Strzalkowski. Kluwer Academic Publishers, 1997.

[ Missing PDF ] [ Bibtex ]

D. Smith, and M. Lopez. Information Extraction for Semi-structured Documents. In: Proc. Workshop on Management of Semistructured Data, 1997.

[ PDF ] [ Bibtex ]

K. Sparck Jones, and P. Willett. Readings in Information Retrieval. Morgan Kaufman, San Francisco, California, USA, 1997.

[ Missing PDF ] [ Bibtex ]

J. Stapleton. DSDM, Dynamic Systems Development Method: The Method in Practice. Addison Wesley, 1997, ISBN 0201178893.

[ Missing PDF ] [ Bibtex ]

T. Strzalkowski, F. Lin, and J. P. Carballo. Natural Language Information Retrieval: TREC-6 Report. In: The Sixth Text REtrieval Conference (TREC-6), Edited by: E. M. Voorhees, and D. K. Harman. Pages: 347-366, Department of Commerce, National Institute of Standards and Technology (NIST) Special Publication 500-240, Gaithersburg, Maryland, 1997.

[ Missing PDF ] [ Bibtex ]

C. Szyperski. Component Software: Beyond Object-Oriented Programming. Addison Wesley, 1997, ISBN 0201178885.

[ Missing PDF ] [ Bibtex ]

W.A.H. Thissen, R. Bras, Daalen van E. C.W. Herik van, H.C. Speel, D. Tijink, and P. Twaalfhoven. Kwaliteitbepaling van beleidsanalystische studies. Delft University of Technology, Delft, The Netherlands, EU, 1997.

[ Missing PDF ] [ Bibtex ]

M. Treacy, and F. Wiersema. The Discipline of Market Leaders - Choose your customers, narrow your focus, dominate your market. Addison Wesley, 1997, ISBN 0201407191.

[ Missing PDF ] [ Bibtex ]

R.P. van der Riet, and H.F.M. Burg. Modelling Alter-Egos in Cyberspace Using a Work Flow Management Tool - Who takes care of security and privacy?. In: Proceedings of WebNet 1997, Edited by: S. Lobodzinsky, and I. Tomek. Pages: 528-588, Assoiation for the Advancement of Computing in Education (AACE), Charlottesville, North Carolina, USA, 1997.

[ Missing PDF ] [ Bibtex ]

W. van der Sanden, and B. Sturm. Informatie-architectuur - de infrastructurele benadering. Panfox, Rosmalen, The Netherlands, EU, 1997, In Dutch, ISBN 9080127027.

Dit boek biedt methoden en technieken voor het ontwerpen van informatie-architecturen. Het slaat een brug tussen strategische motieven en doelstellingen van de organisatie en haar informatievoorziening. Maar het presenteert ook een visie op het verkrijgen en behouden van een flexibele en duurzame informatievoorziening. Dit boek is gericht op alle mensen, die vanuit de eigen verantwoordelijkheid betrokken zijn bij het schetsen of ontwerpen van de toekomstige informatievoorziening.

[ External URL ] [ Bibtex ]

N. Weiderman, L. Northrop, D. Smith, S. Tilley, and K. Wallnau. Implications of Distributed Object Technology for Reengineering. Technical report: CMU/SEI-97-TR-005, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, 1997.

Distributed object technology is profoundly changing the ways in which software systems evolve over time. To a large extent, the focus of reengineering has been to understand legacy systems and to extract their essential functionality so that they can be rewritten as more robust and more maintainable systems over the long term. However, object technology, wrapping strategies, and the Web may be changing the focus and economics of reengineering. The question posed by this paper is the extent to which reengineering strategies ought to continue to use program understanding technology. The cost/benefit ratio of certain forms of program understanding appears to be staying roughly the same over time, while the cost/benefit ratio of wrapping legacy systems or their subsystems is dropping rapidly. As a result, new reengineering strategies that place less emphasis on deep program understanding, and more emphasis on distributed object technologies, should now be considered.

[ PDF ] [ Bibtex ]

B.C.M. Wondergem, J. Simons, A.T. Arampatzis, J. Mackowiak, D. Tarenskeen, and T.W.C. Huibers. Profile Information Filtering Project - Overall Project Plan. Technical report: CSI-N9707, September, University of Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

P. Wouda. Similarity between Index Expressions. February, University of Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

Handbook of Terminology Management - Volume 1: Basic Aspects of Terminology Management. Edited by: S.E. Wright, and G. Budin. John Benjamins, Amsterdam, The Netherlands, EU, 1997, ISBN 9027221545.

[ Missing PDF ] [ Bibtex ]

Handbook of Terminology Management. Edited by: S.E. Wright, and G. Budin. Vol: 1, John Benjamins, Amsterdam, The Netherlands, EU, 1997.

[ Missing PDF ] [ Bibtex ]

XSoft InConcert. InConcert Technical Product Overview. XSoft Inc, 1997.

[ Missing PDF ] [ Bibtex ]

Y. Yang, and J. Pederson. A Comparative Study on Feature Selection in Text Categorization. In: Proceedings of the Fourteenth International Conference on Machine Learning `97 (ICML 97), Edited by: R. Engels, B. Evans, J. Herrmann, and F. Verdenius. July, 1997.

[ Missing PDF ] [ Bibtex ]

K. Yokota, Y. Banjou, T. Kuroda, and T. Kunisima. Extensions of Query Processing Facilities in Mediator Systems. In: Proceedings of the 4th KRDB Workshop, Edited by: F. Baader, M.A. Jeusfeld, and W. Nutt. August, 1997.

[ Missing PDF ] [ Bibtex ]

H. van der Zee. Transformatie van de IT-organisatie In Dutch. In: Holland/Belgium Management Review, Nr: 53, Pages: 63-74, 1997.

[ Missing PDF ] [ Bibtex ]

C. Zhai. Fast Statistical Parsing of Noun Phrases for Document Indexing. In: Proceedings of the Fifth Conference on Applied Natural Language Processing, 1997, To appear.

[ Missing PDF ] [ Bibtex ]

Journal

P.J.M. Frederiks, A.H.M. ter Hofstede, and E. Lippe. A Unifying Framework for Conceptual Data Modelling Concepts. In: Information and Software Technology, Nr: 1, Vol: 39, Pages: 15-25, January, 1997.

For succesful information systems development, conceptual data modelling is essential. Nowadays many techniques for conceptual data modelling exist, examples are NIAM, FORM, PSM, many (E)ER variants, IFO, and FDM. In-depth comparisons of concepts of these techniques is very difficult as the mathematical formalisations of these techniques, if existing at all, are very different. As such there is a need for a unifying formal framework providing a sufficiently high level of abstraction.

In this paper the use of category theory for this purpose is addressed. Well-known conceptual data modelling concepts are discussed from a category theoretic point of view. Advantages and disadvantages of the approach chosen will be outlined.

[ PDF ] [ Bibtex ]

A.H.M. ter Hofstede, and Th.P. van der Weide. Deriving Identity from Extensionality. In: International Journal of Software Engineering and Knowledge Engineering, Nr: 2, Vol: 8, Pages: 189-221, June, 1997.

In recent years, a number of proposals have been made to extend conventional conceptual data modeling techniques with concepts for modeling complex object structures. Among the most prominent proposed concepts is the concept of collection type. A collection type is an object type of which the instances are sets of instances of an other object type. A drawback of the introduction of such a new concept is that the formal definition of the technique involved becomes considerably more complex. This is a result of the fact that collection types are populatable types and such types tend to complicate updates. In this paper it is shown how a new kind of constraint, the extensional uniqueness constraint, allows for an alternative treatment of collection types avoiding update problems. The formal definition of this constraint type is presented, other advantages of its introduction are discussed, and its consequences for, among others, identification schemes are elaborated.

[ PDF ] [ Bibtex ]

J.W.G.M. Hubbers, and A.H.M. ter Hofstede. Formalization of Communication and Behaviour in Object-Oriented Analysis. In: Data & Knowledge Engineering, Nr: 2, Vol: 23, Pages: 147-184, August, 1997.

[ Missing PDF ] [ Bibtex ]

A.P. Barros, and A.H.M. ter Hofstede. Realizing the Full Potential of Workflow Modeling: A Practical Perspective. In: Journal of Information Technology, Nr: 2, Vol: 3, Pages: 59-86, December, 1997.

[ Missing PDF ] [ Bibtex ]

F.C. Berger, and P. van Bommel. Augmenting a Characterization Network with Semantical Information. In: Information Processing & Management, Nr: 4, Vol: 33, Pages: 453-479, 1997.

[ Missing PDF ] [ Bibtex ]

A.H.M. ter Hofstede, and T.F. Verhoef. On the Feasibility of Situational Method Engineering. In: Information Systems, Nr: 6/7, Vol: 22, Pages: 410-422, September, 1997.

[ Missing PDF ] [ Bibtex ]

A.H.M. ter Hofstede, E. Lippe, and Th.P. van der Weide. Applications of a Categorical Framework for Conceptual Data Modeling. In: Acta Informatica, Nr: 12, Vol: 34, Pages: 927-963, December, 1997.

For successful information systems development, conceptual data modeling is essential. Nowadays a plethora of techniques for conceptual data modeling exist. Many of these techniques lack a formal foundation and a lot of theory, e.g. concerning updates or schema transformations, is highly data model specific. As such there is a need for a unifying formal framework providing a sufficiently high level of abstraction. In this paper the use of category theory for this purpose is addressed. Well-known conceptual data modeling concepts, such as relationship types, generalization, specialization, and collection types are discussed from a categorical point of view. An important advantage of this framework is its ``configurable semantics''. Features such as null values, uncertainty, and temporal behavior can be added by selecting appropriate instance categories. The addition of these features usually requires a complete redesign of the formalization in traditional set-based approaches to semantics. Applications of the framework in the context of schema transformations and improved automated modeling support are discussed."

[ PDF ] [ Bibtex ]

A.H.M. ter Hofstede, H.A. (Erik) Proper, and Th.P. van der Weide. Exploiting Fact Verbalisation in Conceptual Information Modelling. In: Information Systems, Nr: 6/7, Vol: 22, Pages: 349-385, September, 1997.

An increasing number of approaches to conceptual information modelling use verbalisation techniques as an aid to derive a model for a given universe of discourse (the problem domain). The underlying assumption is that by elaborate verbalisation of samples of facts, taken from the universe of discourse, one can elicit a complete overview of the relevant concepts and their inter-relationships. These verbalisations also provide a means to validate the resulting model in terms of expressions familiar to users. This approach can be found in modern ER variations, Object-Role Modelling variations, as well as different Object-Oriented Modelling techniques.

After the modelling process has ended, the fact verbalisations are hardly put to any further use. As we belief this to be unfortunate, this article is concerned with the exploitation of fact verbalisations after finishing the actual information system. The verbalisations are exploited in four directions. We consider their use for a conceptual query language, the verbalisation of instances, the description of the contents of a database, and for the verbalisation of queries in a computer supported query environment. To put everything in perspective, we also provide an example session with an envisioned tool for end-user query formulation that exploits the verbalisations.

[ PDF ] [ Bibtex ]

J.J.A.C. Hoppenbrouwers, B. van der Vos, and S.J.B.A. (Stijn) Hoppenbrouwers. NL Structures and Conceptual Modelling: Grammalizing for KISS. In: Data & Knowledge Engineering, Nr: 1, Vol: 23, Pages: 79-92, 1997.

As conceptual models are both the result of and subject to communication between domain experts and information analysist, it is of the highest importance to explicitly relate conceptual models to the language in which they are communicated. To achieve this, we identify a set of semantic primitives in a suitable conceptual modelling framework and present the prototype of a knowledge extraction tool which helps analysts to find useful primitives in free natural language texts. In addition we suggest possible extensions of the presented approach to other phases of conceptul modelling.

[ PDF ] [ Bibtex ]

H.A. (Erik) Proper. Data Schema Design as a Schema Evolution Process. In: Data & Knowledge Engineering, Nr: 2, Vol: 22, Pages: 159-189, 1997.

In an information system a key role is played by the underlying data schema. This article starts out from the view that the entire modelling process of an information system's data schema can be seen as a schema transformation process. A transformation process that starts out with an initial draft conceptual schema and ends with an internal database schema for some implementation platform. This allows us to describe the transformation process of a database design as an evolution of a schema through a universe of data schemas. Doing so, allows for a better understanding of the actual design process, countering the problem of `software development under the lamppost'. Even when the information system design is finalised, the data schema can evolve further due to changes in the requirements on the system.

We present a universe of data schemas that allows us to describe the underlying data schemas at all stages of their development. This universe of data schemas is used as a case study on how to describe the complete evolution of a data schema with all its relevant aspects. The theory is general enough to cater for more modelling concepts, or different modelling approaches. To actually model the evolution of a data schema, we present a versioning mechanism that allows us to model the evolutions of the elements of data schemas and their interactions, leading to a better understanding of a schema design process as a whole. Finally, we also discuss the relationship between this simple versioning mechanism and general purpose version management systems.

[ PDF ] [ Bibtex ]

J.J. Sarbo. Building sub-knowledge bases using concept lattices. In: The Computer Journal, Nr: 10, Vol: 39, Pages: 868-875, 1997.

[ Missing PDF ] [ Bibtex ]

L. Terveen, W. Hill, B. Amento, D. McDonald, and J. Creter. PHOAKS: A System for Sharing Recommendations. In: Communication of the ACM, Nr: 3, Vol: 40, Pages: 59-62, 1997.

[ PDF ] [ Bibtex ]

V. Vianu. Rule-Based Languages. In: Annals of Mathematics and Artificial Intelligence, Vol: 19, Pages: 215-259, 1997.

[ PDF ] [ Bibtex ] [ External URL ]

Book

P.J.M. Frederiks. Object-Oriented Modeling based on Information Grammars. University of Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

Conference

B.C.M. Wondergem, P. van Bommel, T.W.C. Huibers, and Th.P. van der Weide. Towards an Agent-Based Retrieval Engine. In: Proceedings of the 19th BCS-IRSG Colloquium on IR Research, Edited by: J. Furner, and D.J. Harper. Pages: 126-144, April, 1997.

This article describes and analyses the retrieval component of the Profile Information Filtering Project of the University of Nijmegen. The overall structure of this project, serving as the context for the retrieval component, is stated. This component is called the Retrieval Engine and will be implemented as an intelligent retrieval agent, using sophisticated techniques from artificial intelligence. A synthesis between information retrieval and information filtering has to be found, coping with challenging problems stemming from the combination of the difficulties of both fields. The Retrieval Engine should be capable of giving an explanation of why a document was found relevant to the information need of the user. The techniques used will rely on sophisticated natural language processing. The techniques to establish relevance degrees for documents will consist of two parts: a symbolic and a numeric one. This allows for a mechanism that is both explainable and exact. Interesting approaches for obtaining this are stated.

[ PDF ] [ Bibtex ]

A.T. Arampatzis, T. Tsoris, and C.H.A. Koster. Irena: Information Retrieval Engine based on Natural language Analysis. In: Proceedings of the RIAO`97 Conference, Pages: 159-175, 1997.

[ Missing PDF ] [ Bibtex ]

A.T. Arampatzis, Th.P. van der Weide, P. van Bommel, and C.H.A. Koster. Linguistic Variation in Information Retrieval and Filtering. In: Informatiewetenschap 1997, Edited by: P.M.E. de Bra. Pages: 7-10, 1997.

n this paper, a natural language approach to Information Retrieval (IR) and Information Filtering (IF) is described. Rather than keywords, noun-phrases are used for both document description and as query language, resulting in a marked improvement of retrieval precision. Recall then can be enhanced by applying normalization to the noun-phrases and some other constructions. This new approach is incorporated in the Information Filtering Project Profile. The overall structure of the Profile project is described, focusing especially on the Parsing Engine involved in the natural language processing. Effectiveness and efficiency issues are elaborated concerning the Parsing Engine. The major contributions of this research include properties of grammars and parsers specialized in IR/IF (properties such as coverage, robustness, efficiency, ambiguity), normalization of noun-phrases, and similarity measures of noun-phrases.

Keywords: Linguistic Variation, Information Retrieval, Information Filtering

[ PDF ] [ Bibtex ]

A.P. Barros, A.H.M. ter Hofstede, and H.A. (Erik) Proper. Towards Real-Scale Business Transaction Workflow Modelling. In: Proceedings of the Ninth International Conference CAiSE`97 on Advanced Information Systems Engineering, Barcelona, Spain, EU, Edited by: A. Olivé, and J.A. Pastor. Lecture Notes in Computer Science, Vol: 1250, Pages: 437-450, June, Springer, 1997, ISBN 3540631070.

While the specification languages of workflow management systems focus on process execution semantics, the successful development of workflows relies on a fuller conceptualisation of business processing, including process semantics. For this, a wellspring of modelling techniques, paradigms and informal-formal method extensions which address the analysis of organisational processing structures (enterprise modelling) and communication (based on speech-act theory), is available. However, the characterisations - indeed the cognition - of workflows still appears coarse.

In this paper, we provide the complementary, empirical insight of a real-scale business transaction workflow. The development of the workflow model follows a set of principles which we believe address workflow modelling suitability. Through the principles, advanced considerations including asynchronous as well as synchronous messaging, temporal constraints and a service-oriented perspective are motivated. By illustrating the suitability principles and with it the inherent complexity of business transaction domains, we offer timely insights into workflow specification extension, and workflow reuse and deployment.

[ PDF ] [ Bibtex ]

A.P. Barros, A.H.M. ter Hofstede, and H.A. (Erik) Proper. Essential Principles for Workflow Modelling Effectiveness. In: Proceedings of the Third Pacific Asia Conference on Information Systems (PACIS`97), Edited by: G.G. Gable, and R.A.G. Webber. Pages: 137-147, April, 1997.

By incorporating aspects of coordination and collaboration, workflow implementations of information systems require a sound conceptualisation of business processing semantics. Traditionally, the success of conceptual modelling techniques has depended largely on the adequacy of conceptualisation, expressive power, comprehensibility and formal foundation. An equally important requirement, particularly with the increased conceptualisation of business aspects, is business suitability.

In this paper, the focus is on the business suitability of workflow modelling for a commonly encountered class of (operational) business processing, e.g. those of insurance claims, bank loans and land conveyancing. A general assessment is first conducted on some integrated techniques characterising well-known paradigms - structured process modelling, object-oriented modelling, behavioural process modelling and business-oriented modelling. Through this, an insight into business suitability within the broader perspective of technique adequacy, is gained. A specific business suitability diagnosis then follows using a particular characterisation of business processing, i.e. one where the intuitive semantics and inter-relationship of business services and business processes are nuanced. As a result, five business suitability principles are elicited. These are proposed for a more detailed understanding and (synthetic) development of workflow modelling techniques. Accordingly, further insight into workflow specification languages and workflow globalisation in open distributed architectures may also be gained.

[ PDF ] [ Bibtex ]

P. van Bommel, and Th.P. van der Weide. Educational Flow in Computing Science Courses. In: 3rd International Conference on Applied Informatics (ICAI 97), 1997.

In this paper we describe the organization of a Student Research Lab (SRL) and Student Teaching Lab (STL) in the context of a computing science curriculum. The SRL and STL are inspired by the following problems found in many academic computing science curriculums today: (1) the preparation for working as an IT professional is not given sufficient attention, (2) coherence within and between educational components is too weak. Our solution to these problems consists of the SRL and STL, where the flow of educational results is operationalized and formalized.

[ PDF ] [ Bibtex ]

P. van Bommel, and T. van Weert. Modern Universitair Informatica Onderwijs. In: Nationaal Informatica Onderwijs Congres (NIOC 97), March, 1997, In Dutch.

[ Missing PDF ] [ Bibtex ]

J.J. Sarbo, and J.I. Farkas. A data representation for abstract reasoning. In: Proceedings of the Seventh BENELEARN Conference, Edited by: W. Daelemans, P. Flach, and A. van den Bosch. Pages: 99-108, 1997.

[ Missing PDF ] [ Bibtex ]

B.C.M. Wondergem, P. van Bommel, T.W.C. Huibers, and Th.P. van der Weide. An Electronic Commerce Paradigm for Information Discovery. In: Proceedings of the Conferentie Informatiewetenschap (CIW`1997): Let your Browser do the Walking, Edited by: P.M.E. de Bra. Pages: 56-60, November, 1997.

This article investigates the connection between Electronic Commerce (EC) and Information Discovery (ID). ID is the synthesis of distributed Information Retrieval and Information Filtering, filled in with itelligent agents and information brokers. Currently, no link exists between EC and ID. We argue that this link consists of a cost model for ID. We therefore propose several (types of) cost models, which enable application of EC to the whole of ID. This is illustrated with examples.

[ PDF ] [ Bibtex ]

Reports

A.I. Bleeker, P.D. Bruza, and Th.P. van der Weide. A User-centred View on Hypermedia Design. Technical report: CSI-R9707, Computing Science Institute, University of Nijmegen, 1997.

Ever-increasing quantities of information, together with new developments on storage and retrieval methods, are confronting todays users with a huge information supply that they can barely oversee. Hypermedia information retrieval systems try to assist users in finding their way through the supply, but reality this is where many systems fall short. The reason is that most of them do not really communicate with users or find out what they really want. Instead, a bottom-up approach that reasons mainly from an information-oriented view point, has been a major design focus. We argue that the design of hypermedia systems should be based on an integration between both a top-down (user-oriented) and a bottom-up (information-oriented) approach, to develop hypermedia systems that know and understand their users. In this article, we present initial results of a new user-oriented approach.

[ PDF ] [ Bibtex ]

A.T. Arampatzis. Preprocessing documents in Profile. Technical report: CSI-N9706, May, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, 1997.

[ Missing PDF ] [ Bibtex ]

A.T. Arampatzis, Th.P. van der Weide, P. van Bommel, and C.H.A. Koster. Syntactical Analysis for Text Filtering. Technical report: CSI-R9721, November, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, 1997.

[ Missing PDF ] [ Bibtex ]

T.A. Barrett, and F. Zwarteveen. Technical Reference Architecture. Technical report, Origin, Utrecht, The Netherlands, EU, 1997.

[ Missing PDF ] [ Bibtex ]

A. Bleeker. User purposes in user-centred Hypermedia design. Technical report: CSI-N9704, April, Radboud University Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

A. Bleeker. A methodology for user-centred Hypermedia design. Technical report: CSI-N9705, April, Radboud University Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

D.J. Chen, W.C. Chen, C.C. Hwang, C.S. Koong, G.Y. Hsu, and N.W.P. van Diepen. A Visual Software Construction Approach. Technical report: CSI-R9725, December, Radboud University Nijmegen, 1997.

Software reuse is considered one of the effective approaches forimproving software productivity and software quality. ReusableSoftware Components (RSCs) are the basic building components forsoftware program constructed based on thesoftware reuse approach. An object-oriented approach is used forthe design and implementation of our RSCs. So far, we haveimplemented more than 300 reusable software components (includingdesign level frameworks), in various application domains, withabout 200,000 lines of code in our library. These components andframeworks are accumulated from the design and implementation ofstrategy-based game systems, multimedia authoring systems(2-D and 3-D), multimedia play-back systems, and other applicationsystems. The RSCs and frameworks can be visualized through iconsfor a visual programming model. In this way, reuse-in-the-large isrealized practice by use of a visual programming technique basedon these visualized components. In this paper, the design principleand the implementation technique for our RSCs and frameworks arediscussed, and a visual software construction paradigm is proposedbased on the use of RSCs and frameworks. Specifically, both thedesign concept and the implementation of such a visual softwareconstruction approach and potential advantages of the proposedconstruction approach are discussed. From our study, we believethat the visual software construction paradigm will become a newdirection for both academic researchers and software constructorsto search for a better software construction approach.

[ Missing PDF ] [ Bibtex ]

M. Devillers. Mechanized support for I/O automata. Technical report: CSI-N9710, December, Radboud University Nijmegen, 1997.

Formal methods are mathematical techniques used to verifysafety-critical systems. Recent successful verifications have been credited to newly developed computer tools which mechanically support (parts of) the verification process. My research concentrates on the mechanical support of verifications of systems described as I/O automata. I wish to show how the I/O automata model of Lynch and Tuttle can be mechanically supported, and how this support can be used in a teaching environment. The support is to be implemented in a workbench, which serves as a front-end to other tools. A central research question is how to successfully combine existing technology, in particular model checkers and theorem provers, for verification purposes.

[ Missing PDF ] [ Bibtex ]

M. Devillers, D. Griffioen, and O. M�ller. Possibly Infinite Sequences in Theorem Provers: A Comparative Study. Technical report: CSI-R9724, December, Radboud University Nijmegen, 1997.

We compare four different formalizations of possibly infinitesequences in theorem provers based on higher-order logic. The formalizations have been carried out in different proof tools, namely in Gordon's HOL, in Isabelle and in PVS. The comparison considers different logics and proof infrastructures, but emphasizes on the proof principles that are available for each approach. The different formalizations discussed have been used not only to mechanize proofsof different properties of possibly infinite sequences, but also for the verification of some non-trivial theorems of concurrency theory.

[ Missing PDF ] [ Bibtex ]

M.C.A. Devillers, and W.O.D. Griffioen. A Formalization of Finite and Infinite Sequences in PVS. Technical report: CSI-R9702, March, Radboud University Nijmegen, 1997.

Sequences are often used structures in mathematics and computer science.While working on a formalization of IO-automata theory, we found, asothers did before us, that a large portion of the lemmas provenconcerned sequences. The complexity of the definitions and proofs isincreased by having sequences of both finite and infinite length in asingle type.In this paper a formalization of these kinds of sequences is presented,and it is explained how some problems of other formalizations arecircumvented. The formalization is implemented in the PrototypeVerification System (PVS).This paper may be of interest to people in the field of concurrency,mechanical verifications, and to people with an interest in applications of higher order logic.

[ Missing PDF ] [ Bibtex ]

M.C.A. Devillers, W.O.D. Griffioen, J.M.T. Romijn, and F.W. Vaandrager. Verification of a Leader Election Protocol. Technical report: CSI-R9728, December, Radboud University Nijmegen, 1997.

The IEEE 1394 high performance serial multimedia bus protocolallows several components to communicate with each other at high speed.In this paper we present a formal model and verification of a leaderelection algorithm that forms the core of the tree identify phase ofthe physical layer of the 1394 protocol.We describe the algorithm formally in the I/O automata model ofLynch and Tuttle, and verify that for an arbitrary tree topology exactlyone leader is elected. A large part of our verification has been checkedmechanically with PVS, a verification system for higher-order logic.

[ PDF ] [ Bibtex ]

J.I. Farkas, V. Kamphuis, and J.J. Sarbo. Natural Language Concept Analysis: Towards a Theoretical Foundation. Technical report: CSI-R9717, September, Radboud University Nijmegen, 1997.

Can we do text analysis without phrase structure? We think the answercould be positive. In this paper we outline the basics of anunderlying theory which yields hierarchical structure as the result of more abstract principles relating to the combinatorial properties oflinguistic units. We discuss the nature of these propertiesand illustrate our model with examples.

[ Missing PDF ] [ Bibtex ]

A. Fehnker. Automotive Control Revisited. Technical report: CSI-R9723, December, Radboud University Nijmegen, 1997.

Reachability analysis of hybrid system imposes restrictions on either the continuous or the discrete behavior. In this paper a method is proposed that approximates the reachable set of linear systems by linear inequalities. It allows to use the full continuous dynamics of hybrid systems for reachability analysis. This method is applied to an automotive control problem, which was presented by Stauner et al. in [SMF97]

[ Missing PDF ] [ Bibtex ]

U. Hensel, M. Huisman, B.P.F. Jacobs, and H. Tews. Reasoning about classes in Object-Oriented Languages: Logical Models and Tools. Technical report: CSI-R9718, October, Radboud University Nijmegen, 1997.

A formal language CCSL is introduced for describing specifications ofclasses in object-oriented languages. We show how class specifications in CCSL can be translated into higher order logic. This allows us to reason about these specifications.In particular, it allows us (1)to describe (various) implementations of a particular class specification,(2)to develop the logical theory of a specific class specification, and (3)to establish refinements between two class specifications.We use the (dependently typed) higher order logic of the proof-assistantPVS, so that we have extensive tool support for reasoning about class specifications. Moreover, we describe our own front-end tool to PVS, which generates fromCCSL class specifications appropriate PVS theoriesand proofs of some elementary results.

[ Missing PDF ] [ Bibtex ]

U. Hensel, and B.P.F. Jacobs. Proof Principles for Datatypes with Iterated Recursion. Technical report: CSI-R9703, March, Radboud University Nijmegen, 1997.

Data types like trees which are finitely branching and of (possibly) infinite depth are described by iterating initial algebras and terminal coalgebras. We study proof principles for suchdata types in the context of categorical logic, following andextending the approach of~\cite{HermidaJ95b,JacobsHermidaIndCoind96}.The technical contribution of this paper involves a description of initial algebras and terminal coalgebras in total categoriesof fibrations for lifted ``datafunctors''. These lifted functors are used to formulate our proof principles. We test these principles by proving some elementaryresults for four kinds of trees (with finite or infinite breadth or depth) using the proof tool PVS.

[ Missing PDF ] [ Bibtex ]

Ulrich Hensel, and B.P.F. Jacobs. Coalgebraic Theories of Sequences in PVS. Technical report: CSI-R9708, June, Radboud University Nijmegen, 1997.

This paper explains the setting of anextensive formalisation of the theory of sequences (finite andinfinite lists of elements of some data type) in the PrototypeVerification System PVS. This formalisation is based on thecharacterisation of sequences as a final coalgebra, which is usedas an axiom. The resulting theories comprise standardoperations on sequences like composition (or concatenation), filtering,flattening, and their properties. They also involve the prefixordering and proofs that sequences form an algebraic complete partial order. The finality axiom gives rise to various reasoning principles, likebisimulation, simulation, invariance, and induction for admissiblepredicates. Most of the proofs of equality statements are based on bisimulations, and most of the proofs of prefix order statements use simulations. Some significant aspects of these theories are described in detail.This coalgebraic formalisation of sequences is presented as a concreteexample that shows the importance and usefulness of coalgebraic modeling andreasoning. Hopefully, it will help to convey the view thatcoalgebraic data types should form an intrinsic part of (future)languages for programming and reasoning. Therefore, somesuggestions for an appropriate syntax for coalgebraic datatypesare included.The use of sequences as a final coalgebra is demonstrated intwo (standard) applications: a refinement result for automatainvolving sequences of actions, and a coalgebraic definition plus correctness proof for an insert operation on ordered sequences.

[ Missing PDF ] [ Bibtex ]

A.H.M. ter Hofstede, and M.E. Orlowska. On the Complexity of Some Verification Problems in Process Control Specifications. Technical report, April, Faculty of Information Technology, Queensland University of Technology, Brisbane, Queensland, Australia, 1997.

[ Missing PDF ] [ Bibtex ]

J.W.G.M. Hubbers, and T.F. Verhoef. A Real-life Application of Software Component Modelling. Technical report: CSI-R9705, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, 1997.

[ Missing PDF ] [ Bibtex ]

J.W.G.M. Hubbers, and A.H.M. ter Hofstede. An Investigation of the Core Concepts of Object-Oriented Conceptual Data Modeling. Technical report: CSI-R9706, Computing Science Institute, University of Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

Marieke Huisman. Binary addition in Lego. Technical report: CSI-R9714, August, Radboud University Nijmegen, 1997.

This paper describes how the implementation of hardwarebinary additioncan be simulated in the interactive proof development system Lego.A general addition function is described that can add two lists ofarbitrary digits.Several properties are proven for this general addition function. It is shownhow this addition function can be used for particular digits such as bits andlists of length k of bits.These properties allow that all the reasoning and calculations are done onthe level of binary numbers, where this can be done much faster.

[ Missing PDF ] [ Bibtex ]

Marieke Huisman. Designing a satellite tracking system with the use of PVS and Maple. Technical report: CSI-R9716, September, Radboud University Nijmegen, 1997.

This paper describes the specification and design of a satellite trackingsystem. Its goal is to show how such a design can be made and verified formally,with the aid of various tools. The design is compositional and in some of the components much mathematics is involved. The specifications of the whole system and its components are described in predicate logic and in the specification language of the theorem prover PVS. Because of the mathematics that is involved it was useful to use also the computer algebra system Maple.Maple simplifies some expressions, so that the results can be used by PVS.This paper shows that formal methods can be used easily on a high levelof design and that the use of different tools is very practical. Further itshows that the design process is easier, when first an idealized version ofthe system is designed, which is then transformed into a more realistic one.

[ Missing PDF ] [ Bibtex ]

B.P.F. Jacobs. Invariants, Bisimulations and the Correctness of Coalgebraic Refinements. Technical report: CSI-R9704, March, Radboud University Nijmegen, 1997.

Coalgebraic specifications are used to formally describe thebehaviour of classes in object-oriented languages. In this paper, ageneral notion of refinement between two such coalgebraicspecifications is defined, capturing the idea that one ``concrete''class specification realises the behaviour of the other, ``abstract''class specification. Two (complete) proof-techniques are given toestablish such refinements: one involving an invariant (a predicatethat is closed under transitions) on the concrete class, and oneinvolving a bisimulation (a relation that is closed undertransitions) between the concrete and the abstract class. The lattercan only be used if the abstract class is what we call totallyspecified. The underlying theory of invariants and bisimulations in acoalgebraic setting is included, involving least and greatestinvariants and connections between invariants and bisimulations.Also, the proof-principles are illustrated in several examples(which are fully formalised and verified in PVS).

[ Missing PDF ] [ Bibtex ]

M.S. klein Gebbinck, and T. E. Area Estimation with Subpixel Accuracy for Industrial ImagingSystems. Technical report: CSI-R9711, July, Radboud University Nijmegen, 1997.

Industrial imaging systems used for product quality control often needto make an accurate estimation of an object's area. Usually the area isestimated by counting the number of pixels classified as belonging tothe object. However, with a technique called decomposition, the numberof pixels can be estimated more accurately at the same resolution, oras accurately at a lower resolution. Another way to reduce the hardwarecosts is to lower the spatial sampling rate. The negative effects onthe area estimation accuracy can be counteracted by reconstructing theoriginal image using interpolation. In this paper, we present theresults of two experiments using HP ScanJet 4c images in which thecapabilities and limitations of decomposition and interpolation wereassessed quantitatively. It appeared that the resolution could belowered with a factor 25 without decreasing the accuracy of theestimation. A reduction of the sampling rate, on the other hand, couldnot be compensated for as well. However, interpolation did seem torestrict the decrease in accuracy somewhat, although the results werenot entirely conclusive due to hardware related reasons.

[ Missing PDF ] [ Bibtex ]

G. Kov�cs, and P. van Bommel. Designing Advanced Databases Using Dependency Graph Conducted Schema Transformation Algorithm. Technical report: CSI-N9703, March, Radboud University Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

A.H. Mader. Verification of Modal Properties Using Infinite Boolean Equation Systems. Technical report: CSI-R9727, December, Radboud University Nijmegen, 1997.

In this paper we show the equivalence of model checking infinite systems and solving infinite Boolean equation systems, andgive a method that solves infinite Boolean equation systems. The method issound and complete, even if the problem itself is undecidable.

[ Missing PDF ] [ Bibtex ]

J. Moonen, J. Romijn, O. Sies, J. Springintveld, L. Feijs, and R. Koymans. A Two-Level Approach to Automated Conformance Testing of VHDL Design. Technical report: CSI-R9709, June, Radboud University Nijmegen, 1997.

For manufacturers of consumer electronics, conformance testing of embedded software is a vital issue. To improve performance, parts of this software are implemented in hardware, often designed in the Hardware Description Language VHDL. Conformance testing is a time consuming and error-prone process. Thus automating (parts of) this process is essential.There are many tools for test generation and for VHDL simulation. However, most test generation tools operate on a high level of abstraction and applying the generated tests to a VHDL design is a complicated task. For each specific case one can build a layer of dedicated circuitry and/or software that performs this task. It appears that the ad-hoc nature of this forms the bottleneck of the testing process. We propose a generic solution for bridging this gap: a generic layer of software dedicated to interface with VHDL implementations. It consists of a number of Von Neumann-like components that can be instantiated for each specific VHDL design.This paper reports on the construction of and some initial experiences with a concrete tool environment based on these principles.

[ Missing PDF ] [ Bibtex ]

Jan Springintveld, F.W. Vaandrager, and P. R. D`Argenio. Testing Timed Automata. Technical report: CSI-R9712, August, Radboud University Nijmegen, 1997.

We present a generalization of the classical theory of testing forMealy machines to a setting of dense real-time systems.A model of timed I/O automata is introduced, inspired by the timedautomaton model of Alur and Dill, together with a notion of test sequencefor this model.Our main contribution is a test generation algorithm for black-box conformancetesting of timed I/O automata.Although it is highly exponential and cannot be claimed to be of practicalvalue, it is the first algorithm that yields a finite and complete setof tests for dense real-time systems.

[ Missing PDF ] [ Bibtex ]

J.A. Moinhos Cordeiro. Research Line on Functional Programming Languages. Technical report: CSI-N9708, September, Radboud University Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

P. van Bommel, and Th.P. van der Weide. SRL Handboek. Technical report: CSI-N9702, Januari, Radboud University Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

P. van Bommel, and Th.P. van der Weide. Conceptual Graphs as a Basis for Verification, Matching, and Similarity in the Context of Information System Development. Technical report: CSI-N9701, January, Radboud University Nijmegen, 1997.

The KISS-method uses graphical structures to represent the models which are constructed during analysis and design. Such graphical structures are referred to as model graphs. Special patterns are used to describe consistency properties of model graphs, and can serve as a basis for transformations between different types of model graphs.In th is paper we show how model graphs are related to conceptual graphs, which have been widely accepted to represent knowledge structures. This relation provides the opportunity to benefit from the vast amount of results and algorithms which have been developed for conceptual graphs. As an example, we discuss similarity between models.Conceptual graphs can also serve as a uniform basis for all models of the KISS-method. This is not furhter elaborated in this paper. Conceptual graphs have a clear relation to first order prdicate calculus. This facilitates the possibility to reason about KISS-models in a formal mathematical style, meanwhile having a direct link to t he original KISS-models.In this paper the concept of patterns and its matching, is further elaborated. An inverse style of matching can be seen as an introduction of regular graph patterns.Finally we discuss graph transformation rules.

[ Missing PDF ] [ Bibtex ]

H. van Thienen. Prospero�s Book. Technical report: CSI-R9726, December, Radboud University Nijmegen, 1997.

Prospero is a programmable calculator, designed to run on palm top computers such as the Psion Series 3a. Prospero can be programmed using a small functional language which is also called Prospero. This report describes the syntax and semantics of the Prospero language.Prospero is designed to expres numerical computations. Therefore, the main basic data objects are (real) numbers. The only data structuring mechanism is the l ist. Prospero contains many constructs and operators to handle numbers and lists. This report only describes the language. Its purpose is to document the language as it is currently implemented. It is not intended as a tutorial, neither is it an apology in which the the rationale behind certain design decisions is explained

[ Missing PDF ] [ Bibtex ]

B.C.M. Wondergem, P. van Bommel, T.W.C. Huibers, and Th.P. van der Weide. How is this document�s relevancy derived?. Technical report: CSI-R9710, June, Radboud University Nijmegen, 1997.

In Information Retrieval, user preferences and domain knowledge play an important role. This article shows how to incorporate domain knowledge in a logical framework and provides a mechanism to exploit user preferences to personalize domain knowledge, based on the inferences made in the matching functions. The matching functions are essentially symbolic logical inferences. The logic used in this article are Preferential Models, which are augmented with domain knowledge by providing an enriched aboutness relation. However, the techniques described in this article are applicable to other logics as well. A way to personalize the domain knowledge is given, which also gives the user insight into the workings of the matching functions. In addition, sound inference rules, which are tailor-made for the domain knowledge, are provided.

[ Missing PDF ] [ Bibtex ]

B.C.M. Wondergem, P. van Bommel, T.W.C. Huibers, and Th.P. van der Weide. How is this document`s relevancy derived? Personalizing Inferences in Preferential Models. Technical report, Computing Science Institute, University of Nijmegen, 1997.

In Information Retrieval, user preferences and domain knowledge play an important role. This article shows how to incorporate domain knowledge in a logical framework and provides a mechanism to exploit user preferences to personalize domain knowledge, based on the inferences made in the matching functions. The matching functions are essentially symbolic logical inferences. The logic used in this article are Preferential Models, which are augmented with domain knowledge by providing an enriched aboutness relation. However, the techniques described in this article are applicable to other logics as well. A way to personalize the domain knowledge is given, which also gives the user insight into the workings of the matching functions. In addition, sound inference rules, which are tailor-made for the domain knowledge, are provided.

[ Missing PDF ] [ Bibtex ]

B.C.M. Wondergem, P. van Bommel, T.W.C. Huibers, and Th.P. van der Weide. Opportunities for Electronic Commerce in Agent-Based Information Discovery. Technical report: CSI-R9722, December, Radboud University Nijmegen, 1997.

This article investigates the connection between Electronic Commerce (EC) and Information Discovery (ID). ID is the synthesis of distributed Information Retrieval and Information Filtering, filled in with intelligent agents and information brokers. Currently, no link exists between EC and ID. We argue that this link consists of a cost model for ID. We therefore propose several (types of) cost models, which enable application of EC to the whole of ID. This is illustrated with examples.

[ Missing PDF ] [ Bibtex ]

B.C.M. Wondergem, J. Simons, A.T. Arampatzis, J. Mackowiak, D. Tarenskeen, and T.W.C. Huibers. Profile Information Filtering Project. Technical report: CSI-N9707, September, Radboud University Nijmegen, 1997.

This article provides the overall position paper of the PROFILE Information Filtering Project. The motivation for and context of the project are stated, as well as the overall organizational and functional project structures. In addition, concepts common the the project as a whole are described. The four main conponents - User Modelling, Parsing, Retrieval, and Interaction - are described in detail. The context in which reseach wil be conducted is described for each component, as well as important research questions and possible approaches to overcome the stated difficulties.

[ Missing PDF ] [ Bibtex ]

H. Wupper. Quantified Modal Algebra:. Technical report: CSI-R9730, December, Radboud University Nijmegen, 1997.

[ Missing PDF ] [ Bibtex ]

Hanno Wupper, and Hans Meijer. A Taxonomy for Computer Science. Technical report: CSI-R9713, August, Radboud University Nijmegen, 1997.

We try to capture the essence of information technology and computerscience, arguing that information technologists have the same principalgoal as all technologists: to create machines with certain properties. Toachieve this, they formalize the problem, i.e. abstract the properties intoa specification and invent or develop a schema, i.e. an abstraction of themachine's structure. Subsequently, it is their principal task to prove thatthe schema satisfies the specification. Computer scientists developmathematical and physical means to support or even enable that task. Fromthis, the principal research questions of computer science may be derived.>From this viewpoint, we try to propose a consistent set of notions togetherwith a consistent terminology, which may clarify the relation ofinformation technology and computer science to other scientific disciplinesand also give rise to new ideas about computer science education.

[ Missing PDF ] [ Bibtex ]

H. Wupper. Design as the Discovery of a Mathematical Theorem:. Technical report: CSI-R9729, December, Radboud University Nijmegen, 1997.

This paper tries to contribute to the understanding of the essence of rational systems design and verification. Information technologists and teachers and students of computer science may find the concepts presented here helpful to disentangle complex achievenments of computer science and re-use their constituents in other contexts, but also to view their own activities in the light of other disciplines.First a consistent set of notions and a diagram and a formula are introduced, with respect to which important aspects of a rational design process can be understood, together with a proposal for a consistent terminology. Subsequently, formal definitions are provided for basic concepts of formal methods and a mathematical foundation for our formula. They shall illustrate that the r�le of mathematics in development and verification is not limited to useful calculations: Ideally, designing is a creative mathematical activity, which comprises finding a theorem, if necessary strengthening its assumptions until it can be proven.Although for good reasons most systems are designed without use of formal methods it may be a source of useful insight to understand all design as an �approximation� of such a mathematical activity. This leads amongst others to a taxonomy of design decisions and of fault tolerance. And it may help to relate paradigms, theories, methods, languages, and tools from different areas of computer science to each other to make optimal use of them.

[ Missing PDF ] [ Bibtex ]

M. Zomer. Mondriaan. Technical report, Origin, Utrecht, The Netherlands, EU, 1997.

[ Missing PDF ] [ Bibtex ]

P.A. Jones, P. van Bommel, C.H.A. Koster, and Th.P. van der Weide. Stratified Recursive Backup for Best First Search. Technical report: CSI-R9720, November, Information Systems Group, Computing Science Institute, University of Nijmegen, The Netherlands, EU, 1997.

In this paper a new abstract machine model, the Stratified Recursive Backup machine model, is described. This machine model can be used to implement best first search algorithms efficiently. Two applications of best first search, a text layouting system and a natural language parser, are analyzed to provide an in­depth understanding of the Stratified Recursive Backup machine model.

[ PDF ] [ Bibtex ]

Professional

J.W.G.M. Hubbers. De hoge hoed van UML (The high hat of UML). In: Software release magazine, Pages: 49-52, July, Array publications, Alphen aan de Rijn, The Netherlands, EU, 1997, In Dutch.

[ Missing PDF ] [ Bibtex ]