- Email: [email protected]
The role of context in creating names, RC 7596(32874)
246
Reports and Theses
both phases of the third algorithm do maintain linear running time for the worst case. These algorithms combine the ideas of the Aho-Corasick and the Boyer-Moore algorithm. Author’s Abstract
Isamu Kobayashi: Cartographic Databases, Techn. Rep. TRCS-1, SANNO Institute of Business Administration Kamikasuya, Japan, Aug. 199. A logical view of the cartographic information based on the Polygonal Subdivision is studied. A multi-purpose map is represented by a collection of several database relations related to each other. Some of them are entity relations expressing geographic entities, and others are relationship relations expressing various types of incidences among entities. Elementary data manipulation operations on the cartographic databases are studied, and implementation of geographic information systems is discussed.
a human partner in colloquial German about limited, but interchangeable scenes. The objective of this report is to give a detailed, complete and self-contained description of the system in its present state of implementation. After a discussion of the goals and methodological principles which guide our research and a short introduction to the implementation language an overview of the system’s architecture, of its knowledge base and of the domains of discourse is given. Then each processing phase from the analysis of natural-language input to the generation of a natural-language utterance is described in detail. The examples used during these descriptions are supplemented by transcripts of complete dialogue sessions. Finally HAM-RPM’s programming environment is described. Author’ Abstract
Mike Blasgen, Jim Gray, Mike Mitoma and Tom Price: The Convoy Phenomenon, RJ2516(32946) IBM Research Laboratory, San Jose, U.S.A., April 1979.
Author’s Abstract
A congestion phenomenon on high-trathc locks is described and a non-FIFO strategy to eliminate such congestion is presented.
L. Schwaiger: Die Stochastische Kostenkalkutation-ein Beitrag zur Kalkulation von Gesetzeskosten, Dissertation (in German), Technische Universitat Berlin, Germany, June 1979.
Authors’ Abstract
The paper develops a new methodology for application to the calculation of legislation costs. The basic principle of the method is that all the quantities considered in calculating the costs are treated as stochastic quantities. To demonstrate the new methodology, a model with a twodimensional normal distribution is chosen, and the density function of the sum, the product andthe quotient of the two random variables is determined. The density function of the quotient is used to examine certain questions of economy and cost behaviour. To avoid having to restrict the new methodology to the highly idealized model of a twodimensional normal distribution, two arithmetical algorithms, MULA and DIVA, were developed. MULA and DIVA can be used to calculate the density and frequency function of the product and the quotient respectively of two random variables with any kind of distribution. Author’s Abstract
R. A. Lorie, R. Casajuana and J. L. Becern’l: CSYSR: A Relational Database Interface for Graphics, RJ2511(32%1), IBM Research Laboratory, San Jose, U.S.A., April 1979. PBS (a general purpose Picture Building System) is presently supported by a relational database (XRM), through an interface called GXRAM. A new interface (GSYSR) has been developed on top of System R, in order to allow PBS to use ordered relations, not directly supported by System R. The GSYSR interface is used to create or delete ordered relations and to manipulate them when explicit reference to the ordering is made. Otherwise the usual data language interface of System R can be used on both ordered and unordered relations. This paper describes the main features of the interface and discusses some essential features of a relational database system to be used for supporting a PBS-like system. Authors’ Abstract
W. v. Hahn, W. Hoeppner, A. Jameson and W. Wahlster: The Anatomy of the Natural Language Dialogue System, Bericht Nr. 12, UniversitiitHamburg, Germany, Mai 1579.
John M. Carroll: The Role of Context in Creating Names, RC 75%(32874), IBM Watson Research Center, New York, U.S.A., April 1979.
HAM-RPM is a dialogue system which converses with
A study of how people name novel referents was
Reportsand Theses
241
presented. Subjects created names for individuals characterized by role descriptions. The role descriptions were either embedded in context scenarios or not. The Context Embedded condition elicited names that were less directly and literally based on the actual content of the role descriptions than did the Context Free condition. Context scenarios that involved the individual denoted by the role description elicited names less literally based on the actual role description than did less involving scenarios. Less literal names appeared to directly ‘incorporate’ context material. The importance and potential influences of contextual variables on naming were discussed.
The paper also presents a conceptual design of an automated system to handle office procedures.
Authors’ Abstract
Fagin [ IO] demonstrated an equivalence between functional dependencies in a relational database, and a certain subclass of propositiona logic. We extend this equivalence to include both functional and multivalued dependencies. Thus, for each dependence there is a corresponding statement in propositional logic. We then show that a dependency (functional or multivalued) is a consequence of a set of dependencies if and only if the corresponding propositional statement is a consequence of the corresponding set of propositional statements. We give examples to show that our techniques are valuable in providing much shorter proofs of theorems about dependencies than have been obtained by more traditional means.
Wolfgang Bick, and Paul J Miillec Information Systems and Information Behaviour Sociological Bases of Information Policies, BMFT FB ID 79-01, Institute for Applied Social Research, University of Cologne, Germany, Aug. 1978. The use of process-produced data is confronted with problems that have their origin in the very nature of administrative data. Administrative data are highly selective. Only specific aspects of reality are relevant for routine processing of cases. For administrative purposes everyday life has to be translated into administrative categories and cases. This process is difficult, problematic in principle, and error prone. The representational quality of process-produced data is therefore often questionable. Only through documentation of the contexts of data production it can be assured that these data do not lead to wrong conclusions. The report analyses the amount and character of existing knowledge necessary to interpreting such data. It provides for a social science source criticism to improve the usefulness of process-produced data. Authors’ Abstract
Prakash G. Hebalkar: Contour-Forming, A Mechanism for Procedure Automation in the G@e of the Future, RJ 2495 (32745), IBM Research Laboratory, San Jose, U.S.A., March 1979. This paper presents a mechanism for automating common office procedures. The mechanism is based on a recognition of the fact that the essence of an office procedure is usually embodied in a form and proposes as an essential step the identification of sub-forms of these forms. The sub-forms identify portions of interest to each principal whom a form encounters in its processing. Serendipitously, these same contours, by their relationships to each other, also automatically identify the routing of a filled-in form in an automated version. This discovery is at the heart of the proposal.
Author’s Abstract
Yehoshua Sagiv and Ronald Fagin: An Equivalence Between Relational Database Dependencies and a Subclass of Proportional Logic, RJ 2500(32750), Department of Computer Science, University of Illinois at UrbanaChampaign, Urbana, Ill. U.S.A. and IBM Research Laboratory, San Jose, U.S.A., March 1979,
Author’ Abstract David Harel: Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic, RC 7557 (Nr. 32673), IBM Thomas J. Watson Research Center, New York, U.S.A., March 1979. The simple set WL of deterministic while programs is defined and a number of known methods for proving the correctness of these programs are surveyed. Emphasis is placed on the tradeoff existing between data-directed and syntax-directed methods, and on providing, especially for the latter, a uniform description enabling comparison and assessment. Among the works considered are the Floyd/Hoare invariant assertion method for partial correctness, Floyd’s well-founded sets method for termination, Dijkstra’s notion of weakest precondition, the Burstall/Manna and Waldinger intermittent assertion method and more. Also, a brief comparison is carried out between three logics of programs: dynamic logic, algorithmic logic and programming logic. Author’s Abstract
Arnold L. Rosenberg: On Embedding Graphs in Grids, RC 7559 (32668), Mathematical Sciences Department, IBM Watson Research Center, New York, U.S.A., March 1979. This note is a free translation of Sections 1 and 2 of M. A. Sheidvasser’s “0 dline i shirine razmeshchenii grafov
Reports and Theses
both phases of the third algorithm do maintain linear running time for the worst case. These algorithms combine the ideas of the Aho-Corasick and the Boyer-Moore algorithm. Author’s Abstract
Isamu Kobayashi: Cartographic Databases, Techn. Rep. TRCS-1, SANNO Institute of Business Administration Kamikasuya, Japan, Aug. 199. A logical view of the cartographic information based on the Polygonal Subdivision is studied. A multi-purpose map is represented by a collection of several database relations related to each other. Some of them are entity relations expressing geographic entities, and others are relationship relations expressing various types of incidences among entities. Elementary data manipulation operations on the cartographic databases are studied, and implementation of geographic information systems is discussed.
a human partner in colloquial German about limited, but interchangeable scenes. The objective of this report is to give a detailed, complete and self-contained description of the system in its present state of implementation. After a discussion of the goals and methodological principles which guide our research and a short introduction to the implementation language an overview of the system’s architecture, of its knowledge base and of the domains of discourse is given. Then each processing phase from the analysis of natural-language input to the generation of a natural-language utterance is described in detail. The examples used during these descriptions are supplemented by transcripts of complete dialogue sessions. Finally HAM-RPM’s programming environment is described. Author’ Abstract
Mike Blasgen, Jim Gray, Mike Mitoma and Tom Price: The Convoy Phenomenon, RJ2516(32946) IBM Research Laboratory, San Jose, U.S.A., April 1979.
Author’s Abstract
A congestion phenomenon on high-trathc locks is described and a non-FIFO strategy to eliminate such congestion is presented.
L. Schwaiger: Die Stochastische Kostenkalkutation-ein Beitrag zur Kalkulation von Gesetzeskosten, Dissertation (in German), Technische Universitat Berlin, Germany, June 1979.
Authors’ Abstract
The paper develops a new methodology for application to the calculation of legislation costs. The basic principle of the method is that all the quantities considered in calculating the costs are treated as stochastic quantities. To demonstrate the new methodology, a model with a twodimensional normal distribution is chosen, and the density function of the sum, the product andthe quotient of the two random variables is determined. The density function of the quotient is used to examine certain questions of economy and cost behaviour. To avoid having to restrict the new methodology to the highly idealized model of a twodimensional normal distribution, two arithmetical algorithms, MULA and DIVA, were developed. MULA and DIVA can be used to calculate the density and frequency function of the product and the quotient respectively of two random variables with any kind of distribution. Author’s Abstract
R. A. Lorie, R. Casajuana and J. L. Becern’l: CSYSR: A Relational Database Interface for Graphics, RJ2511(32%1), IBM Research Laboratory, San Jose, U.S.A., April 1979. PBS (a general purpose Picture Building System) is presently supported by a relational database (XRM), through an interface called GXRAM. A new interface (GSYSR) has been developed on top of System R, in order to allow PBS to use ordered relations, not directly supported by System R. The GSYSR interface is used to create or delete ordered relations and to manipulate them when explicit reference to the ordering is made. Otherwise the usual data language interface of System R can be used on both ordered and unordered relations. This paper describes the main features of the interface and discusses some essential features of a relational database system to be used for supporting a PBS-like system. Authors’ Abstract
W. v. Hahn, W. Hoeppner, A. Jameson and W. Wahlster: The Anatomy of the Natural Language Dialogue System, Bericht Nr. 12, UniversitiitHamburg, Germany, Mai 1579.
John M. Carroll: The Role of Context in Creating Names, RC 75%(32874), IBM Watson Research Center, New York, U.S.A., April 1979.
HAM-RPM is a dialogue system which converses with
A study of how people name novel referents was
Reportsand Theses
241
presented. Subjects created names for individuals characterized by role descriptions. The role descriptions were either embedded in context scenarios or not. The Context Embedded condition elicited names that were less directly and literally based on the actual content of the role descriptions than did the Context Free condition. Context scenarios that involved the individual denoted by the role description elicited names less literally based on the actual role description than did less involving scenarios. Less literal names appeared to directly ‘incorporate’ context material. The importance and potential influences of contextual variables on naming were discussed.
The paper also presents a conceptual design of an automated system to handle office procedures.
Authors’ Abstract
Fagin [ IO] demonstrated an equivalence between functional dependencies in a relational database, and a certain subclass of propositiona logic. We extend this equivalence to include both functional and multivalued dependencies. Thus, for each dependence there is a corresponding statement in propositional logic. We then show that a dependency (functional or multivalued) is a consequence of a set of dependencies if and only if the corresponding propositional statement is a consequence of the corresponding set of propositional statements. We give examples to show that our techniques are valuable in providing much shorter proofs of theorems about dependencies than have been obtained by more traditional means.
Wolfgang Bick, and Paul J Miillec Information Systems and Information Behaviour Sociological Bases of Information Policies, BMFT FB ID 79-01, Institute for Applied Social Research, University of Cologne, Germany, Aug. 1978. The use of process-produced data is confronted with problems that have their origin in the very nature of administrative data. Administrative data are highly selective. Only specific aspects of reality are relevant for routine processing of cases. For administrative purposes everyday life has to be translated into administrative categories and cases. This process is difficult, problematic in principle, and error prone. The representational quality of process-produced data is therefore often questionable. Only through documentation of the contexts of data production it can be assured that these data do not lead to wrong conclusions. The report analyses the amount and character of existing knowledge necessary to interpreting such data. It provides for a social science source criticism to improve the usefulness of process-produced data. Authors’ Abstract
Prakash G. Hebalkar: Contour-Forming, A Mechanism for Procedure Automation in the G@e of the Future, RJ 2495 (32745), IBM Research Laboratory, San Jose, U.S.A., March 1979. This paper presents a mechanism for automating common office procedures. The mechanism is based on a recognition of the fact that the essence of an office procedure is usually embodied in a form and proposes as an essential step the identification of sub-forms of these forms. The sub-forms identify portions of interest to each principal whom a form encounters in its processing. Serendipitously, these same contours, by their relationships to each other, also automatically identify the routing of a filled-in form in an automated version. This discovery is at the heart of the proposal.
Author’s Abstract
Yehoshua Sagiv and Ronald Fagin: An Equivalence Between Relational Database Dependencies and a Subclass of Proportional Logic, RJ 2500(32750), Department of Computer Science, University of Illinois at UrbanaChampaign, Urbana, Ill. U.S.A. and IBM Research Laboratory, San Jose, U.S.A., March 1979,
Author’ Abstract David Harel: Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic, RC 7557 (Nr. 32673), IBM Thomas J. Watson Research Center, New York, U.S.A., March 1979. The simple set WL of deterministic while programs is defined and a number of known methods for proving the correctness of these programs are surveyed. Emphasis is placed on the tradeoff existing between data-directed and syntax-directed methods, and on providing, especially for the latter, a uniform description enabling comparison and assessment. Among the works considered are the Floyd/Hoare invariant assertion method for partial correctness, Floyd’s well-founded sets method for termination, Dijkstra’s notion of weakest precondition, the Burstall/Manna and Waldinger intermittent assertion method and more. Also, a brief comparison is carried out between three logics of programs: dynamic logic, algorithmic logic and programming logic. Author’s Abstract
Arnold L. Rosenberg: On Embedding Graphs in Grids, RC 7559 (32668), Mathematical Sciences Department, IBM Watson Research Center, New York, U.S.A., March 1979. This note is a free translation of Sections 1 and 2 of M. A. Sheidvasser’s “0 dline i shirine razmeshchenii grafov