{"title":"The role of GDSS in scenario development and strategy making","authors":"C. Eden, F. Ackermann","doi":"10.1109/SPIRE.1999.796600","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796600","url":null,"abstract":"The development of alternative futures/scenarios, is an important part of strategy making. Indeed 'scenario planning' has recently become a popular activity in its own right. However, methods for involving directly the power brokers in the process are not well developed, and yet the ownership of the strategic thinking which follows from thinking about alternative futures is crucial for successful strategic change. The paper presents a method for involving the senior management team that succeeds because of its involvement of a group decision support system (GDSS). The method described has been used in a wide variety of organizations-public and private, large and small. After describing the role of thinking about alternative futures in strategy making and its relationship to stakeholder analysis and management, the paper goes on to describe the method and use of the GDSS, and finally considers some of the reasons why the use of a GDSS is helpful.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116214316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. D. Souza, Jacques Wainer, Dalcykelem B. Santos, Klissiomara L. Dias
{"title":"A model and tool for semi-automatic recording of design rationale in software diagrams","authors":"C. D. Souza, Jacques Wainer, Dalcykelem B. Santos, Klissiomara L. Dias","doi":"10.1109/SPIRE.1999.796608","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796608","url":null,"abstract":"The purpose of this work is to present an annotation model for recording design rationale, and to describe ABCDE-DR, a prototype system which implements this model, in particular for the domain of object diagrams in software engineering. It supports: semi-formal representation of DR; recording of design rationale in a semiautomatic manner through the reflection in action theory; and the integration between artifact and design rationale. Our model uses annotations as a means of cooperations among users and also representing design rationale information.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123868439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"X-tract: structure extraction from botanical textual descriptions","authors":"Rocío Abascal-Mena, J. A. Sánchez","doi":"10.1109/SPIRE.1999.796571","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796571","url":null,"abstract":"Most available information today, both from printed books and digital repositories, is in the form of free-format texts. The task of retrieving information from these ever-growing repositories has become a challenge for information retrieval (IR) researchers. In some fields, such as botany and taxonomy, textual descriptions observe a set of rules and use a relatively limited vocabulary. This makes botanical textual descriptions an interesting area to explore IR techniques for finding structure and facilitating semantic analysis. This paper presents X-tract, a solution to the problem of text analysis and structure extraction in a specific application domain, namely floristic morphologic descriptions. The solution demonstrates the potential of using a grammar in the determination of information structure in a botanical digital library. We have developed a prototype based on this approach in which given an HTML or plain text, X-tract analyzes it and presents results to the user so he or she can verify the proposed structure before updating the database. This transformation is useful also in the process of storing morphologic descriptions in a database with a preestablished format. The solution is implemented in the context of the Floristic Digital Library (FDL), a large digital library project comprising a wide variety of botanical documents, formats and services.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126191084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"PAWS: towards a participatory approach to business process reengineering","authors":"M. Borges, J. Pino","doi":"10.1109/SPIRE.1999.796603","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796603","url":null,"abstract":"Companies normally hire external consultants to carry out their business process re-engineering. While this can be simple and efficient in the short term, it may not be convenient in the mid and long term. A low level of workers' involvement with a consequent resistance to changes, and a continuous dependency on external consultancy are the main drawbacks. We propose an alternative approach to BPR in which company workers play an active and important role re-designing the organization's processes in a cooperative style. The method includes stepwise refinement and is expected to generate better results than the traditional approach.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120991125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Near optimal multiple sequence alignments using a traveling salesman problem approach","authors":"C. Korostensky, G. Gonnet","doi":"10.1109/SPIRE.1999.796584","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796584","url":null,"abstract":"We present a new method for the calculation of multiple sequence alignments (MSAs). The input to our problem are n protein sequences. We assume that the sequences are related with each other and that there exists some unknown evolutionary tree that corresponds to the MSA. One advantage of our method is that the scoring can be done with reference to this phylogenetic tree, even though the tree structure itself may remain unknown. Instead of computing an evolutionary tree, we only need to compute a circular tour of the tree which is determined via a traveling salesman problem (TSP) algorithm. Our algorithm can calculate a near optimal MSA and has a performance guarantee of n-1/n.opt (where opt is the optimal score of the MSA). The algorithm runs in O(k/sup 2/n/sup 2/) time, where k is the length of the longest input sequence. From there, we improve the alignment further. Experimental results are shown at the end.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122306374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Decouchant, A. Enríquez, Esther Martínez González
{"title":"AllianceWeb: cooperative authoring on the WWW","authors":"D. Decouchant, A. Enríquez, Esther Martínez González","doi":"10.1109/SPIRE.1999.796606","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796606","url":null,"abstract":"Currently, few applications provide support for collaborative work on the Web. This paper presents the way by which cooperative authoring can be easily and efficiently performed between authors distributed on the Web. The main goal is to provide support for allowing them to create common Web documents in a secure and consistent way. We present the AllianceWeb project whose goal is to extend the Web environment to support cooperative authoring of documents. It provides several features such as user identification, document and resource naming, document sharing and management, document replication and consistency, storage management. Our approach unifies both the hybrid and the fully distributed architectures for document storage and access. Although the architectures seem antagonistic, they are integrated within our system to allow distributed and temporarily disconnected cooperative authoring of Web documents. Our project builds on our previous experience on the design and implementation of Alliance, a cooperative editor of structured documents on the Internet.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114584852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Development of groupware systems with the COPSE infrastructure","authors":"M. Dias, M. Borges","doi":"10.1109/SPIRE.1999.796605","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796605","url":null,"abstract":"For a long time now, infrastructure technologies for the development of groupware applications have been proposed. However, the task of developing groupware is still complex, since it involves not only technical, but also social issues. As a consequence, current technologies represent limited solutions for supporting important aspects of cooperative work. Focused on what we consider essential issues in the development og groupware, we propose an infrastructure to support this development. The infrastructure was developed in the context of the COPSE project, aiming the development of a Collaborative Project Support Environment.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123058442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cross-domain approximate string matching","authors":"D. Lopresti, G. Wilfong","doi":"10.1109/SPIRE.1999.796586","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796586","url":null,"abstract":"Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. We introduce a new formalism for a class of applications that takes two strings as input, each specified in terms of a particular domain, and performs a comparison motivated by constraints derived from a third, possibly different domain. This issue arises, for example, when searching multimedia databases built using imperfect recognition technologies (e.g., speech, optical character, and handwriting recognition). We present a polynomial time algorithm for solving the problem, and describe several variations that can also be solved efficiently.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"887 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123281579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Concurrency and recovery in full-text indexing","authors":"E. Soisalon-Soininen, P. Widmayer","doi":"10.1109/SPIRE.1999.796595","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796595","url":null,"abstract":"An important feature of a document database system is that the documents can be retrieved by searching for words from their contents. In a full-text index, each word of the stored documents can be used as a search key. Inserting a new document into the database automatically triggers a transaction that inserts the words together with their occurrence information into the index. We present solutions to problems that arise when full-text indexing is applied for constantly changing document data, such as WWW pages. We present and analyze an algorithm for full-text indexing with the following properties: concurrent searches are possible and efficient, and the algorithm can be designed such that several indexing processes can be performed concurrently. Moreover, the algorithm allows efficient recovery of the index after failures that can occur while the index is modified. This is important for large indices, because when not prepared for failures, the index may need to be reconstructed from original documents.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126483021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Circular contextual insertions/deletions with applications to biomolecular computation","authors":"Mark Daley, L. Kari, G. Gloor, R. Siromoney","doi":"10.1109/SPIRE.1999.796577","DOIUrl":"https://doi.org/10.1109/SPIRE.1999.796577","url":null,"abstract":"Insertions and deletions of small circular DNA strands into long linear DNA strands are phenomena that happen frequently in nature and thus constitute an attractive paradigm for biomolecular computing. The paper presents a new model for DNA-based computation that involves circular as well as linear molecules, and that uses the operations of insertion and deletion. After introducing the formal model, we investigate its properties and prove in particular that the circular insertion/deletion systems are capable of universal computation. We also give the results of an experimental laboratory implementation of our model. This shows that rewriting systems of the circular insertion/deletion type are viable alternatives in DNA computation.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125521204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}