- Email: [email protected]
Strukturierte inferenz von kontextfreien grammatiken, Tum-Info-7920
240
Reports and Theses
In this Chapter, the author likes to clarify motivations that triggered development of the current database technology, and to describe a correct usage of generalized database management systems. Two different systems design methods, traditional output oriented approach and new fire oriented approach, are explained first in comparison, and the latter method is studied extensively. He likes to show what types of applications the database technology should be applied to, what design procedure the system designer should employ in implementing database systems, and what selection criteria the user should adopt in choosing a database management system for his application. Theoretical discussions on data structure, database operations and other requirements are elaborated in relation to the database design procedure. In this way, the author likes to provide a global view of the database technology for both information systems designers and database researchers. The rest of this Chapter is composed of ten parts. In Section 2, several different motivations for the database technology are described. Database as a new systems design methodology is briefly discussed in Section 3. A theoretical discussion of data structure is given in Section 4. Emphasis is placed on various semantic constraints imposed on database relations. Section 5 describes elementary database operations. A calculus based operation is presented hrst and various algebra based operations are described as its special cases. Also tupleby-tuple operations are introduced. Other requirements regarding integrity, security, concurrent accessing, recovery and so on are discussed in Section 6. Section 7 is devoted to physical database representation. Section 8 deals with basic database management functions, which must be implemented in the database management system. In Section 9, several existing database management systems are described in comparison. Section 10 discussions the end-user languages. Finally, several topics left to future research works are described in Section 11. Author’s Introduction
Zsamu Kobayashi: Evaluation of Queries Based on an Extended Relational Calculus, Tech. Rep. TRCS-2, SANNO Institute of Business Administration Kamikasuya, Japan, Nov. 1979. An efficient database search algorithm to process the Relational Calculus is described. The algorithm can deal with a little more generalized form of search conditions than Codd’s Relational Calculus. Optimization is achieved in two distinct phases, syntactical transformation of the given condition and run-time optimization process. To deal with unit conditions and some special types of compound conditions in the given condition, the selection and join in Relational Algebra are somewhat extended. The union, intersection, projection and division are also extended for processing compound conditions in general. Index provisions in the given
database and efficient sequential collation are fully utilized to improve the performance of these elementary operations. In order to avoid excessive generation of universal quantifications in describing conventional file maintenance operations, a device called the imaginary tuple, when necessary, is introduced. Finally, applications of the algorithm are discussed. Author’s Abstract
Wolfgang Wahlster: Implementing Fuzziness in Dialogue Systems, Bericht Nr. 14, UniversitiitHamburg, Germany. Nov. 1979. Against the background of a general discussion of the roles fuzziness can play in natural language dialogue systems, some specific techniques for dealing with fuzziness are described. First, the components of a natural language dialogue system in which fuzziness can figure importantly are enumerated and the communicative and cognitive functions of vagueness are surveyed. In the second section, some techniques employed within the dialogue system HAM-RPM for handling fuzziness during the analysis and generation phases are illustrated. Finally, a new model of fuzzy reasoning is presented which is based on a many-sorted fuzzy logic and includes a corroboration procedure for multiple derivations. Author’s Abstract
Walther v. Hahn: Z?ber Dialogkohiirenz in naturlichsprachlichen AZ-Systemen, Bericht Nr. 8, Universitiit Hamburg, Germany, O&t.1979. It is pointed out that dialogue coherence involves the intentions of the speakers, not just particular features of the text. Aspects of coherence involving three areas of research are then discussed using the dialogue system HAM-RPM as an example: The cognitive capabilities of the natural language system (in particular linguistic and metalinguistic capabilities, knowledge, and adaptive strategies) the coherence-supporting behaviour of the natural dialogue partner (in particular cooperation, metacommunication, and goal-directed action) and the text indices (in particular anaphora and lexical contingency. The interdependentcies among these three areas can be seen clearly in natural language AI system. Author’s Abstract
Ernst- Wolfgang Dieterich: Strukturierte Znferenz von kontextfreien Grammatiken, Turn-Info-7920, Technische UniversitiitMiinchen, Germany Okt. 1979. We introduce an inference algorithm which generates a
Reportsand Theses context-free grammar from a set of samples with additional information. In contrast to conventional inference algorithms which accepts as input only information on whether or not the sample is in the language, our algorithm processes also information on how samples can be generalized, which minimal constraint on the syntactical structure exist, and how the language is coarsely structured by dilimiters. Author’s Abstract
William C. Mann: Dialogue Games, Rep. M/RR-79-77, USC/Information Sciences Institute, Marina de1 Rey, U.S.A., Oct. 1979.
Natural dialogue does not proceed haphazardly; it has an easily recognized “episodic” structure and coherence that conform to a well developed set of conventions. This report represents these conventions formally in terms related to speech act theory and to a theory of action. The major formal unit, the Dialogue Game, specifies aspects of the communication of both participants in a dialogue. We define the formal notion of Dialogue Games and describe some of the important Games of English. Dialogue Games are conventions of interactive goal pursuit. Using them, each participant pursues his own goals in a way that sometimes serves the goals of the other. The idea of Dialogue Games can thus be seen as a part of a broader theoretical perspective characterizing virtually all communication as goal pursuit activity. We also define and exemplify the property of Motivational Coherence of dialogues. Motivational coherence can be used as an interpretive principle in explaining language comprehension. Actual dialogue games have a kind of causal connectedness that is not a consequence of their formal properties. This is explained in terms of a theory of action, which is also seen to explain a similar attribute of speech acts. Author’s Abstract
Congress AICA ‘79, Bari, Italy, Vol. I: Distributed Informatics Systems Performance Evaluation, IO-13 Oct. 1979. Functionally distributed systems
Research issues in distributed systems P. H. Enslow Jr.
13
Sistemi funzionalmente distribuiti G. Sommi
20
Proposta di un’architettura multiprocessor con capacita di configurazione a pih livelli M. De Blasi, G. Degli Antoni, D. Marino
22
241
Sistemi distribuiti con controllo guidato dal flusso dei dati N. de Francesco, G. Perego, G. Vaglini, M. Vanneschi
29
Sistema distribuito per lo sviluppo di apparecchiature basate sul microprocessor AMD 2900 G. Beltrami, G. Rizza, A. Seregni
39
Problematiche dei sistemi data-flow A. Boccalatte, C. Boccalini, A. L. Frisiani
42
An identification procedure for functionally distributed computer systems S. Muftic
50
Realizzazione di un sistema di programmazione BASIC: architettura, metodi e strumenti di sviluppo M. Citelli, F. Gallo, 0. Murro, L. Petrone
54
Una rete geografica come connessione di reti locali G. Casaglia
59
Sistemi distribuiti: architettura e programmabilita di una rete locale P. Ancillotti, R. Barbuti, M. Fusani, N. Lijtmaer, P. Ravasio
62
Un approccio alla prova di sistemi di processi distribuiti A. Fantechi
71
The Harpy Machine software and hardware issues in developing task-oriented multiprocessor architectures in the context of a small project R. Bisiani
315
Progetto p*. Studio delle strutture di comunicazione per sistemi a multimicroprocessore G. Corte
80
Progetto di Calcolatore fault-tolerant single-processor ad elevato grad0 di emulazione M. De Blasi, G. Delgli Antoni, M. R. Mallano, D. Marino
83
Inserimento de1 Pascal concorrente in un ambiente di sistema operativo preesistente A. Curcelli, M. De Blasi, N. Giannuzzi, D. Marino
90
Un sistema Pascal concorrente microprogrammat0 A. Adomi, S. Gaglio, G. Marino
95
MAIS: proposta per un multimicro architecture indipendent programming system D. Mandrioli, F. Tisato, G. Ghezzi
98
Sviluppo de1 software per un sistema funzionalmente distribuito orientato alla manipolazione industriale G. Gini, M. Gini, E. Pagello
103
A monitor implementation M. Boghetti, S. Mattera, E. Nuovo
109
Reports and Theses
In this Chapter, the author likes to clarify motivations that triggered development of the current database technology, and to describe a correct usage of generalized database management systems. Two different systems design methods, traditional output oriented approach and new fire oriented approach, are explained first in comparison, and the latter method is studied extensively. He likes to show what types of applications the database technology should be applied to, what design procedure the system designer should employ in implementing database systems, and what selection criteria the user should adopt in choosing a database management system for his application. Theoretical discussions on data structure, database operations and other requirements are elaborated in relation to the database design procedure. In this way, the author likes to provide a global view of the database technology for both information systems designers and database researchers. The rest of this Chapter is composed of ten parts. In Section 2, several different motivations for the database technology are described. Database as a new systems design methodology is briefly discussed in Section 3. A theoretical discussion of data structure is given in Section 4. Emphasis is placed on various semantic constraints imposed on database relations. Section 5 describes elementary database operations. A calculus based operation is presented hrst and various algebra based operations are described as its special cases. Also tupleby-tuple operations are introduced. Other requirements regarding integrity, security, concurrent accessing, recovery and so on are discussed in Section 6. Section 7 is devoted to physical database representation. Section 8 deals with basic database management functions, which must be implemented in the database management system. In Section 9, several existing database management systems are described in comparison. Section 10 discussions the end-user languages. Finally, several topics left to future research works are described in Section 11. Author’s Introduction
Zsamu Kobayashi: Evaluation of Queries Based on an Extended Relational Calculus, Tech. Rep. TRCS-2, SANNO Institute of Business Administration Kamikasuya, Japan, Nov. 1979. An efficient database search algorithm to process the Relational Calculus is described. The algorithm can deal with a little more generalized form of search conditions than Codd’s Relational Calculus. Optimization is achieved in two distinct phases, syntactical transformation of the given condition and run-time optimization process. To deal with unit conditions and some special types of compound conditions in the given condition, the selection and join in Relational Algebra are somewhat extended. The union, intersection, projection and division are also extended for processing compound conditions in general. Index provisions in the given
database and efficient sequential collation are fully utilized to improve the performance of these elementary operations. In order to avoid excessive generation of universal quantifications in describing conventional file maintenance operations, a device called the imaginary tuple, when necessary, is introduced. Finally, applications of the algorithm are discussed. Author’s Abstract
Wolfgang Wahlster: Implementing Fuzziness in Dialogue Systems, Bericht Nr. 14, UniversitiitHamburg, Germany. Nov. 1979. Against the background of a general discussion of the roles fuzziness can play in natural language dialogue systems, some specific techniques for dealing with fuzziness are described. First, the components of a natural language dialogue system in which fuzziness can figure importantly are enumerated and the communicative and cognitive functions of vagueness are surveyed. In the second section, some techniques employed within the dialogue system HAM-RPM for handling fuzziness during the analysis and generation phases are illustrated. Finally, a new model of fuzzy reasoning is presented which is based on a many-sorted fuzzy logic and includes a corroboration procedure for multiple derivations. Author’s Abstract
Walther v. Hahn: Z?ber Dialogkohiirenz in naturlichsprachlichen AZ-Systemen, Bericht Nr. 8, Universitiit Hamburg, Germany, O&t.1979. It is pointed out that dialogue coherence involves the intentions of the speakers, not just particular features of the text. Aspects of coherence involving three areas of research are then discussed using the dialogue system HAM-RPM as an example: The cognitive capabilities of the natural language system (in particular linguistic and metalinguistic capabilities, knowledge, and adaptive strategies) the coherence-supporting behaviour of the natural dialogue partner (in particular cooperation, metacommunication, and goal-directed action) and the text indices (in particular anaphora and lexical contingency. The interdependentcies among these three areas can be seen clearly in natural language AI system. Author’s Abstract
Ernst- Wolfgang Dieterich: Strukturierte Znferenz von kontextfreien Grammatiken, Turn-Info-7920, Technische UniversitiitMiinchen, Germany Okt. 1979. We introduce an inference algorithm which generates a
Reportsand Theses context-free grammar from a set of samples with additional information. In contrast to conventional inference algorithms which accepts as input only information on whether or not the sample is in the language, our algorithm processes also information on how samples can be generalized, which minimal constraint on the syntactical structure exist, and how the language is coarsely structured by dilimiters. Author’s Abstract
William C. Mann: Dialogue Games, Rep. M/RR-79-77, USC/Information Sciences Institute, Marina de1 Rey, U.S.A., Oct. 1979.
Natural dialogue does not proceed haphazardly; it has an easily recognized “episodic” structure and coherence that conform to a well developed set of conventions. This report represents these conventions formally in terms related to speech act theory and to a theory of action. The major formal unit, the Dialogue Game, specifies aspects of the communication of both participants in a dialogue. We define the formal notion of Dialogue Games and describe some of the important Games of English. Dialogue Games are conventions of interactive goal pursuit. Using them, each participant pursues his own goals in a way that sometimes serves the goals of the other. The idea of Dialogue Games can thus be seen as a part of a broader theoretical perspective characterizing virtually all communication as goal pursuit activity. We also define and exemplify the property of Motivational Coherence of dialogues. Motivational coherence can be used as an interpretive principle in explaining language comprehension. Actual dialogue games have a kind of causal connectedness that is not a consequence of their formal properties. This is explained in terms of a theory of action, which is also seen to explain a similar attribute of speech acts. Author’s Abstract
Congress AICA ‘79, Bari, Italy, Vol. I: Distributed Informatics Systems Performance Evaluation, IO-13 Oct. 1979. Functionally distributed systems
Research issues in distributed systems P. H. Enslow Jr.
13
Sistemi funzionalmente distribuiti G. Sommi
20
Proposta di un’architettura multiprocessor con capacita di configurazione a pih livelli M. De Blasi, G. Degli Antoni, D. Marino
22
241
Sistemi distribuiti con controllo guidato dal flusso dei dati N. de Francesco, G. Perego, G. Vaglini, M. Vanneschi
29
Sistema distribuito per lo sviluppo di apparecchiature basate sul microprocessor AMD 2900 G. Beltrami, G. Rizza, A. Seregni
39
Problematiche dei sistemi data-flow A. Boccalatte, C. Boccalini, A. L. Frisiani
42
An identification procedure for functionally distributed computer systems S. Muftic
50
Realizzazione di un sistema di programmazione BASIC: architettura, metodi e strumenti di sviluppo M. Citelli, F. Gallo, 0. Murro, L. Petrone
54
Una rete geografica come connessione di reti locali G. Casaglia
59
Sistemi distribuiti: architettura e programmabilita di una rete locale P. Ancillotti, R. Barbuti, M. Fusani, N. Lijtmaer, P. Ravasio
62
Un approccio alla prova di sistemi di processi distribuiti A. Fantechi
71
The Harpy Machine software and hardware issues in developing task-oriented multiprocessor architectures in the context of a small project R. Bisiani
315
Progetto p*. Studio delle strutture di comunicazione per sistemi a multimicroprocessore G. Corte
80
Progetto di Calcolatore fault-tolerant single-processor ad elevato grad0 di emulazione M. De Blasi, G. Delgli Antoni, M. R. Mallano, D. Marino
83
Inserimento de1 Pascal concorrente in un ambiente di sistema operativo preesistente A. Curcelli, M. De Blasi, N. Giannuzzi, D. Marino
90
Un sistema Pascal concorrente microprogrammat0 A. Adomi, S. Gaglio, G. Marino
95
MAIS: proposta per un multimicro architecture indipendent programming system D. Mandrioli, F. Tisato, G. Ghezzi
98
Sviluppo de1 software per un sistema funzionalmente distribuito orientato alla manipolazione industriale G. Gini, M. Gini, E. Pagello
103
A monitor implementation M. Boghetti, S. Mattera, E. Nuovo
109