IRLIST Digest ISSN 1064-6965 April 11,1994 Volume XI, Number 15 Issue 208 ********************************************************** I. QUERIES A. Requests for Information 1. Seeking a Locator Device II. JOBS 1. Berlin Fellowship III. NOTICES B. Meetings 1. NAFIPS '94 2. ISCIS IX 3. PhysComp '94 IV. PROJECTS A. Abstracts 1. IR-Related Dissertation Abstracts ********************************************************** I. QUERIES I.A.1. Fr: Robert Burns Re: Seeking a locator device Does anyone know of an existing device or current research on a device, that could be applied to the following application? If so, please reply directly to the contact at the end of this note instead of this newsgroup. Thanks in advance for your kind attention to this request for information. WANTED: Portable, wireless, 3-axis locator device ACCURACY: Optimal: 1 centimeter or less; Acceptable: 10 centimeters USER: Quality Assurance inspector on large airplane assembly line APPLICATION DESCRIPTION: A Quality Aassurance (QA) inspector visually determines that a repair must be made at a specific location on an airplane. The location must be recorded with sufficient fidelity that a repair mechanic can subsequently locate the problem easily and precisely. Ideally, the QA inspector would point a wand at the problem location, press a button on the wand or portable belt pack, and the x,y,z coordinates of the wand would be transmitted to a nearby microcomputer. The computer, in turn, would map the x,y,z coordinates to the location terminology recognized by the airplane industry (a very non-trivial task). After transmitting the location to the computer, the inspector would then transmit to the computer information that describes the nature of the problem and the required corrective action. Send any information to: Jim Crozier Email: rcburns@atc.boeing.com Fax: 206-393-7805 Voice: 206-393-7769 ********************************************************** II. JOBS II.1. Fr: Thorsten Re: Fellowship Berlin Humboldt--Universitat zu Berlin Institute for Theoretical Physics Research Fellowships Research fellowships in the field Theory and Application of Evolution Algorithms are available for graduate students seeking Ph.D. degree in Physics. Applicants should have interests in one ore more of the fields: genetic algorithms or genetic programming, parallel programming and numerical methods, evolution of biosequences, topological cellular automata, self-organizing algorithms. The positions are for one year with the possibility of renewal for additional two years. Salary is according to 1/2 BAT--O IIa. Please send your application via e-mail as soon as possible, but no later than May 1, 1994 to thorsten@pmmh.espci.fr or via ordinary mail to Prof. W. Ebeling, Humboldt--Universitat zu Berlin, Institut fur Physik, D--10115 Berlin, Germany. ********************************************************** III. NOTICES III.B.1. Fr: Maria Zemankova Re: NAFIPS'94 NAFIPS/IFIS/NASA '94 December 18-21, 1994 Sheraton Gunther Hotel in San Antonio, Texas International Joint Conference of The North American Fuzzy Information Processing Society Biannual Conference The Industrial Fuzzy Control and Intelligent Systems Conference AND The NASA Joint Technology Workshop on Neural Networks and Fuzzy Logic THEME: Application of Fuzzy Logic in Complex Systems. TOPICS of interest include but are not limited to Fuzzy Control * Fuzzy Databases and Fuzzy Information Retrieval * Fuzzy Decision Making and Optimization * Fuzzy Expert Systems * Fuzzy Logic and AI * Fuzzy Mathematics * Fuzzy Neuro Systems * Fuzzy Modeling and Identification * Fuzzy Pattern Recognition * Adaptive Fuzzy Systems * Evolutionary Computation. PAPERS of interest also include but are not limited to theoretical research and applications in the following areas: Manufacturing * Transportation * Energy * Health Care * Environment * Biomedical Systems * Information Processing. Authors must submit six (6) printed copies of their complete papers (not exceeding 2000 words) to either program chair listed below. Professor Larry Hall Dept. of Computer Science and Engineering, ENB 118 4202 E. Fowler Ave. University of South Florida Tampa, FL 33620 Phone: (813)974-4195/Fax: (813)974-5456 E-mail: hall@csee.usf.edu Professor Hao Ying Dept. of Physiology and Biophysics University of Texas Medical Branch 449 Administration Building, Route A23 Galveston, TX 77555-0123 Phone: (409)772-8415/Fax: (409)772-6424 E-mail: hying@beach.utmb.edu Accepted papers will be allocated six (6) pages in the conference proceedings. The program committee will also select high quality papers submitted for possible publication in special issues of International Journal of Approximate Reasoning (IJAR) and International Journal of Intelligent and Fuzzy Systems (IFS). IMPORTANT DATES: Paper Submission May 15, 1994 Author Notification July 7, 1994 Final Manuscripts Due September 15, 1994 Early Registration October 25, 1994 ********** III.B.2. Fr: Ugur Halici Re: ISCIS IX ISCIS IX (International Symposium on Computer and Information Sciences-9) November 7 - 9, 1994, Antalya, Turkey ORGANIZED BY Bogazici University, Istanbul, Turkey IN COOPERATION WITH IEEE Computer Society IEEE Turkey Chapter Turkey Section CONFERENCE CHAIR: Selahattin Kuru, Bogazici U. TOPICS OF INTEREST: - Theoretical Computer Science - Computer Architecture and Systems - Artificial Intelligence - Neural Networks - Computer Graphics - Image Processing and Pattern Recognition - Real Time Computing - Performance Modeling - Computer Networks - Parallel Processing and Parallel Algorithms - Software Engineering - Databases and Information Retrieval - Programming Languages - Distributed Systems ISCIS IX is the nineth of a series of meetings which have brought together computer scientists and engineers from many countries. This year, the special theme of the conference is "High Performance Computing", highlighting contributions from leading researchers who are working on software and hardware systems to achieve high performance in different fields of computer and information sciences. During the conference, there will be invited speeches and special sessions on different aspects of high performance computing. This year's conference will be held in a resort hotel in the beautiful Mediterranean city of Antalya, in a region rich in natural as well as historical sites. PAPER SUBMISSION: Please submit four copies (one camera ready and three copies) of the full paper (in English) limited to 8 pages by May 31, 1994 to: ISCIS IX - Department of Computer Engineering Bogazici University Bebek 80815, Istanbul, TURKEY E-mail: iscis@trboun.bitnet Tel: +90 (212) 263 1540 ext. 1323 Fax: +90 (212) 265 8488 Paper Format: on A4 or letter size paper with single space, single column, one inch margins on all four sides. The first page should have a two inch margin at the top. Centered at the top of the first page should be the complete title of the paper, author(s), affiliation(s), mailing and e-mail address(es), then the abstract, not exceeding 15 lines, followed by the text. In an accompanying letter, the following should be included: full title of the paper, author name(s), mailing address(es), telephone and fax numbers and e-mail address(es) of the author(s) indicating the presenter and technical session names (1st and 2nd choices) to be selected from the list of topics given above. Authors will be notified of the decisions by August 15, 1994. Accepted papers will be published in the symposium proceedings. INVITED SESSIONS: The symposium welcomes proposals for invited sessions especially on high performance computing issues. The proposals should be sent by May 31, 1994 to the above address. The organizer for each invited session should submit a title, a brief description of the relevance of the session to the conference, and a maximum of four invited full papers for review. Organizers and authors will be notified of decisions by August 15, 1994. ********** III.B.3. Fr: Bhanu Kapoor Re: PhysComp '94 Workshop on Physics and Computation, PhysComp `94, This Decade and Beyond November 17 - 20, 1994, Dallas, Texas Sponsored by Dallas IEEE Computer Society Sponsored by ONR/ARPA Corporate Sponsor: Texas Instruments Incorporated The Workshop on Physics and Computation, PhysComp `94 will seek to explore the intimate relationship emerging between Modern Physics and Computation Theory. One commonly held view is that information laws are dependent on the laws of physics. Another emerging view is that the universe would not work without information primitives underlying physical laws. Both of these views conclude that physics and information/computation are linked together at a very fundamental level. Understanding the convergence of computation and physics will lead to a better understanding of using physical mechanisms as computing engines, and also lead to a better understanding of how the universe is organized. This field will become increasingly important to the computing industry as the post-shrink era approaches and the energy consumption, complexity, and computational horsepower requirements continue to exceed the computing engines we are able to design or build. This workshop will emphasize solutions that are applicable during this decade as well as longer term ideas. PhysComp `94 has been extended an additional day over PhysComp `92 to allow invited panel sessions speakers and submitted papers that discuss architectures for nano-electronic systems. Papers are requested on other physics and computing topics such as limits of computing, practical reversible computers, nano-electronics, energetics of computing, Cellular Automata, analog computing, quantum cryptography, optical computing, molecular computing, quantum logic, etc. Generally we are interested in papers that unify Computation (Algorithms, Architecture, Information Theory, Automatic Learning, Tele/Communication Theory, Simulation, etc) with Physics (Discrete models, Entropy, Complexity, Quantum Theory, Thermodynamics, Energy/mass, Relativity, Gravity, etc). The goal of this workshop is to establish stronger links between participants from various backgrounds as well as to educate professionals interested in these topics. The keynote speaker for PhysComp '94 will be Professor Carver Mead of California Institute of Technology in Pasadena. His current focus and teachings are in the area of VLSI design, ultra-concurrent systems, physics of computation, and the construction of silicon models of neural systems. SUBMISSION: Please surface mail five copies of your preliminary paper (10 pages maximum) or 5 page extended abstract by Monday May 23, 1994 to: Wolfgang Porod PhysComp `94 Program Co-chairman Dept. Electrical Engineering email: porod@graz.ee.nd.edu University of Notre Dame Phone: 219/631-6376 Notre Dame, IN 46556 FAX: 219/631-4393 Notification of acceptance will be mailed by Friday July 1, 1994. The technical committee will group submissions into relevant topics, and select papers and panel members. Papers will be accepted for long talks and short talks. Panel sessions and poster sessions may also be organized based on papers submitted. The proceedings will be prepared thru IEEE Computer Society Press in time to be distributed at the workshop. SCHEDULE: Monday May 23: Preliminary version of papers due at Notre Dame Friday July 1: Notification of acceptance for papers mailed Friday July 8: Author Kits mailed to accepted authors Tuesday Sept 6: Final papers due at IEEE press, registration starts Monday Oct 17: Early registration fee of $180 cutoff date Wednesday Nov 16: Out of town arrival, registration, & reception Thursday Nov 17 thru Sunday Nov 20 (noon): PhysComp `94 ********************************************************** IV. PROJECTS IV.A.1. Fr: Susanne M. Humphrey Re: Selected IR-Related Dissertation Abstracts The following are citations selected by title and abstract as being related to Information Retrieval (IR), resulting from a computer search, using BRS Information Technologies, of the Dissertation Abstracts Online database produced by University Microfilms International (UMI). Included are UMI order number, title, author, degree, year, institution; number of pages, one or more Dissertation Abstracts International (DAI) subject descriptors chosen by the author, and abstract. Unless otherwise specified, paper or microform copies of dissertations may be ordered from University Microfilms International, Dissertation Copies, Post Office Box 1764, Ann Arbor, MI 48106; telephone for U.S. (except Michigan, Hawaii, Alaska): 1-800-521-3042, for Canada: 1-800-268-6090. Price lists and other ordering and shipping information are in the introduction to the published DAI. An alternate source for copies is sometimes provided. Dissertation titles and abstracts contained here are published with permission of University Microfilms International, publishers of Dissertation Abstracts International (copyright by University Microfilms International), and may not be reproduced without their prior permission. matches may be considered similar. Ranking on similarity is done using the database taxonomy, by which similar instances become members of the same class. Relative similarity is determined by depth in the taxonomy. Overall, this thesis has applied machine learning techniques (learning from observation) that are based on psychological principles of category formation to the difficult problems of schema design, evolution and integration, and imprecise querying in database systems. AN University Microfilms Order Number ADG93-06798. AU OLIVER, NEAL CONRAD. TI A SUBLANGUAGE BASED MEDICAL LANGUAGE PROCESSING SYSTEM FOR GERMAN. IN New York University Ph.D. 1992, 281 pages. SO DAI v54(01), SecB, pp333. DE Computer Science. Language, Linguistics. Artificial Intelligence. AB The major accomplishments reported in this thesis are: (1) The development of a computer grammar for a nontrivial sublanguage of German. This grammar, using the LSP (Linguistic String Processor) grammar formalism, solves a number of parsing problems arising in free word order languages such as German. (2) The development of an LSP-based information system that obtains semantic representations of texts in a medical sublanguage of German. (3) The confirmation of the sublanguage hypothesis (explained below). In LSP grammar theory, sentences in a language are derived from a collection of basic sentence types. The basic sentence types are described in terms of the major syntactic classes (e.g., noun, verb, adjective) of the language. Sentences are derived from these basic sentences by the insertion of optional structures called adjuncts, by conjoining, and by substituting words in the major classes. Insertion, conjoining, and substitution are constrained by co-occurrence restrictions between elements in the derived syntactic structures. The restrictions subcategorize the major word classes into subclasses that may co-occur in sentences according to the co-occurrence restrictions. The sublanguage hypothesis elaborates LSP grammar theory in the following way. In a particular domain of discourse, the subcategorization of the major word classes reflects the underlying semantics of the domain. The basic sentence types of the language, represented by sublanguage subclasses instead of major word classes, can function as data structures (called information formats) representing the information of the domain. The LSP Medical Language Processor (LSP/MLP) is an information retrieval/information extraction system based on sublanguage and information formatting. It processes sentences in the English sublanguage of clinical reporting into information formats, which are in turn are converted into database update records for a relational database. The information formats are derived from sublanguage co-occurrence information obtained from a corpus of discharge summaries. The German information formatting system implemented in this work processes German Arztbriefe (doctor letters) of cancer surgery patients into information formats. It confirms the sublanguage hypothesis because it re-uses the sublanguage information (co-occurrence information and formats) of the English LSP/MLP system in an equivalent sublanguage, showing that the sublanguage information reflects the semantics of the domain. AN University Microfilms Order Number ADG93-15708. AU OSTERTAG, EDUARDO JENKINS. TI A CLASSIFICATION SYSTEM FOR SOFTWARE REUSE. IN University of Maryland College Park Ph.D. 1992, 206 pages. SO DAI v54(01), SecB, pp333. DE Computer Science. AB Software reuse has been claimed to be one of the most promising approaches to enhance programmer productivity and software quality. One of the problems to be addressed to achieve high software reuse is organizing databases of software experience, in which information on software products and processes is stored and organized to enhance reuse. This dissertation presents a system to define and construct such databases called the Extensible Description Formalism (EDF). The formalism is a generalization of the faceted index approach to classification in the sense that is provides facilities to define facets, terms, and object descriptions. Unlike the faceted approach, objects in EDF can be described in terms of different sets of facets and in terms of other object descriptions. This allows a software library to contain different classes of objects, to represent various types of relations among these classes, and to refine classification schemes by adding more detail supporting a growing application domain and reducing the impact of initial domain analysis. EDF incorporates a similarity-based retrieval mechanism that helps a reuser locate candidate reuse objects that best match the specifications of a target object. Similarity between two objects is quantified by a non-negative magnitude called similarity distance, which represents the estimated amount of effort required to construct one given the other. Because of this, similarity distances are not necessarily symmetric. EDF was designed to overcome the limitations of software reuse library systems based on controlled vocabularies. In particular, EDF provides a specification language based on concepts of set theory capable of representing a rich variety of software and non-software domains; it provides a retrieval mechanism based on exact matches and similarity metrics which can be customized to specific domains; and it provides a mechanism for defining and ensuring certain semantic relations between attribute values. A prototype application of this system has been implemented in ANSI C. ********************************************************** IRLIST Digest is distributed from the University of California, Division of Library Automation, 300 Lakeside Drive, Oakland, CA. 94612-3550. Send subscription requests to: LISTSERV@UCCVMA.BITNET Send submissions to IRLIST to: IR-L@UCCVMA.BITNET Editorial Staff: Clifford Lynch calur@uccmvsa.ucop.edu or calur@uccmvsa.bitnet Nancy Gusack ncgur@uccmvsa.ucop.edu or nancy.gusack@ucop.edu Mary Engle meeur@uccmvsa.ucop.edu or mary.engle@ucop.edu The IRLIST Archives is now set up for anonymous FTP, as well as via the LISTSERV. Using anonymous FTP via the host dla.ucop.edu, the files will be found in the directory pub/irl, stored in subdirectories by year (e.g., /pub/irl/1993). Using LISTSERV, send the message INDEX IR-L to LISTSERV@UCCVMA.BITNET. To get a specific issue listed in the Index, send the message GET IR-L LOGYYMM, where YY is the year and MM is the numeric month in which the issue was mailed, to LISTSERV@UCCVMA (Bitnet) or LISTSERV@UCCVMA.UCOP.EDU. You will receive the issues for the entire month you have requested. These files are not to be sold or used for commercial purposes. Contact Nancy Gusack or Mary Engle for more information on IRLIST. THE OPINIONS EXPRESSED IN IRLIST DO NOT REPRESENT THOSE OF THE EDITORS OR THE UNIVERSITY OF CALIFORNIA. AUTHORS ASSUME FULL RESPONSIBILITY FOR THE CONTENTS OF THEIR SUBMISSIONS TO IRLIST. From @UCCVMA.UCOP.EDU:NCGUR@UCCMVSA.BITNET Wed Apr 27 10:58:11 1994 Received: by stubbs.ucop.edu (5.57/1.34) id AA04761; Wed, 27 Apr 94 10:58:10 -0700 Message-Id: <9404271758.AA04761@stubbs.ucop.edu> Received: from UCCVMA.UCOP.EDU by uccvma.ucop.edu (IBM VM SMTP V2R2) with BSMTP id 2160; Wed, 27 Apr 94 10:59:49 PDT Received: from UCCMVSA.BITNET (NJE origin NCG$UR@UCCMVSA) by UCCVMA.UCOP.EDU (LMail V1.1d/1.7f) with BSMTP id 1861; Wed, 27 Apr 1994 10:59:48 -0700 Received: by UCCMVSA.BITNET Wed, 27 Apr 94 10:59:36 PDT Date: Wed, 27 Apr 94 10:59:36 PDT From: "Nancy Gusack" To: IRDIGEST@stubbs Status: RO X-Status: IRLIST Digest ISSN 1064-6965 April 25,1994 Volume XI, Number 17 Issue 210 ********************************************************** I. QUERIES 1. Strategies of Experienced Searchers III. NOTICES A. Publications 1. Machine Translation: Special Issue: Call for Submissions 2. TEI Guidelines: P3 Publication C. Miscellaneous 1. Graduate Open House, Drexel University 2. M.SC., Language, Speech, and Auditory Processing, U. Sheffield ********************************************************** I. QUERIES I.A.1. Fr: Yakov Bar Re: Strategies of Experienced Searchers Shalom ! I would appreciate very much your help. I am conducting a research project on the behaviors and habits of experienced searchers. In order to advance a particular aspect of my research I need to investigate the thought processes of the searcher. I want to know the initial search strategy one would compose for the following patent searches, before going online. Include the logical connectors, e.g. AND, OR, NOT. 1. Patents registered worldwide for devices, mechanisms, techniques and/or other solutions to assist a driver of a moving vehicle from falling asleep at the wheel. 2. Patents registered worldwide for devices, mechanisms, techniques and/or other solutions to the problem of children becoming lost or separated from their parents in a public place. Thanks for all your assistance. Menahem Dolinsky Information Service Manager Messer - Center for Innovative Ideas 33 HaHashmal St. Tel Aviv, ISRAEL matimop9@ccsg.tau.ac.il ********************************************************** III. NOTICES III.A.1. Fr: Judith Klavans Re: Machine Translation Special Issue - Call for Submissions THE MACHINE TRANSLATION JOURNAL SPECIAL ISSUE ON BUILDING LEXICONS FOR MACHINE TRANSLATION Editor: Sergei Nirenburg Guest Editors: Bonnie J. Dorr and Judith L. Klavans The Journal of Machine Translation is planning a Special Issue on the Lexicon in Machine Translation (MT). The lexicon plays a central role in any MT system, regardless of the theoretical foundations upon which the system is based. However, it is only recently that MT researchers have begun to focus more specifically on issues that concern the lexicon, e.g., the automatic construction of cross-linguistically valid lexical-semantic and knowledge-based representations for use by multi-lingual systems. The need for large dictionaries is overwhelming in any natural language application, but the problem is especially difficult for MT because of cross-linguistic divergences and mismatches that arise from the perspective of the lexicon. Furthermore, scaling up dictionaries is an essential requirement for MT that can no longer be dismissed; researchers need to move from toy-dictionary MT systems into larger-scale MT systems so that they will be in a better position to demonstrate the validity of the theoretical underpinnings of their systems. The intent of this Issue is to address critical issues concerning the automatic and semi-automatic acquisition of lexical representations for MT dictionaries. Among traditional approaches to constructing dictionaries for natural language applications has been the massaging of on-line dictionaries that are primarily intended for human consumption. Given that many natural language applications have focused primarily on syntactic information that can be extracted from the lexicon, these methods have constituted a reasonable first-pass approach to the problem. However, it is now widely accepted that natural language processing in general, and MT in particular, requires language-independent conceptual information in order to successfully process a wide range of phenomena in more than one language. Thus, the task of lexicon construction has become a much more difficult problem as researchers endeavor to extend the concept base to support more phenomena and additional languages. Added to this is the standard size, coverage, efficiency trade-off, combined with the fundamental question of anticipated vs actual functionality. High-quality original research papers are invited on issues relevant to this topic including, but not limited to: - Lexical levels required by a machine translation (syntactic, lexical semantic, ontological, etc.) and interdependencies between these levels. - Automatic procedures for the construction of lexical representations. - Semi-automatic methods for the acquisition of lexical knowledge. - Use of existing resources and aids for transforming these resources into appropriate representations for MT. - Augmentation of statistically driven corpus analysis with linguistically motivated techniques for extracting lexical knowledge. - Role of bilingual dictionaries, including example sentences and phrases. Extraction of information from pairwise data in dictionaries. - MT mappings (transfer, interlingual, statistically based, memory-based, etc.) and the effect of these mappings on the representation that is used in the lexicon. - Language universals in the lexicon and the construction of an interlingua for MT. - Incorporation of lexical/non-lexical knowledge for selection of suitable candidates for target constructions in MT. - Accommodation of MT divergences and mismatches in the lexicon; implication for automatic construction of lexicons. DEADLINE for submission of articles: July 15, 1994 Articles may be submitted in hard-copy, electronic (either plain text or .ps format) to either guest editor. If submitting hard-copy, please send four copies of the paper. Bonnie J. Dorr Judith L. Klavans Department of Computer Science Department of Computer Science A.V. Williams Building Mudd Building Room 420 University of Maryland 520 W. 120th Street College Park, MD 20742 New York, New York 10027 Email: bonnie@umiacs.umd.edu Email: klavans@cs.columbia.edu Fax: 301-314-9658 Fax: 914-478-1802 ********** III.A.2. Fr: Lou Burnard Re: TEI Guidelines : Publication Date for P3 announced The Editors of the Text Encoding Initiative take great pleasure in announcing that TEI P3, the ACH/ALLC/ACL Guidelines for Text Encoding for Interchange, will be officially published by the three sponsoring organizations on 16 May 1994. Full ordering information is given below. TEI P3 is a completed and much revised version of the P2 draft which we have been publishing in fascicle form since April 1992. It contains 1300 pages of detailed analysis of problem areas, presentation of the TEI tag sets, exhaustive examples and full reference documentation. The TEI Guidelines constitute one of the fullest and most systematic attempts yet undertaken to describe the whole range of texts of interest to scholars in our research communities, using the international standard SGML. With their completion a new chapter opens in the use of computers in research and teaching. Part I of the Guidelines contains introductory chapters on the TEI DTD structure, on SGML and on the TEI itself, together with a full description of the header and core tag sets, and of the default text structure. Part II describes the base tag sets for prose, verse, drama, transcriptions of spoken text, print dictionaries, and terminological databases. In Part III, ten additional tag sets are described (for linkage and alignment; simple analysis; feature structure analysis; certainty and responsibility; transcriptions of primary sources; critical apparatus; names and dates; graphs, networks, and trees; tables, formulae, and graphics; and language corpora). Part IV describes three auxiliary DTDs: for independent headers, writing system declarations, feature system declarations, and tag set documentation. A number of technical topics are addressed in part V, specifically, the notion of conformance, methods of modifying the TEI DTD, rules for interchange of TEI-conforming documents, and ways of handling multiple hierarchies. Part VI comprises a complete alphabetical list of all classes, entities, and elements defined in the TEI DTD, each of which is independently documented. The volume includes reference material on obtaining and using the TEI DTD and WSDs, a formal specification of the TEI interchange format, a bibliography, and an index. On publication, the TEI Guidelines will be available in paper form from each of the addresses below, at the price of $75 (50 pounds or 7500 yen). A discount price is available to members of the three sponsoring organizations ($50, 35 pounds, or 5000 yen). Orders may be placed at any time using the form at the end of this message. The Guidelines will also be made available in electronic form by anonymous FTP by the publication date, if not before: watch this list for further announcements! The editors and steering committee would like to take this opportunity of expressing our thanks to our funders, (the US National Endowment of the Humanities, DG XIII of the European Commission, the Andrew W. Mellon Foundation, and the Social Science and Humanities Research Council of Canada) and also to the many institutions and software houses who have provided support during the long process of bringing these Guidelines to fruition. Our chief thanks however go to all of those volunteers from within the research community who have worked with us over the last five years of drafting, re-drafting, revising, criticizing, discussing, and revising yet again. If there is merit in the results, it belongs to the community which identified the need for this work and encouraged and made it possible for us to carry it out. We would also like to record our personal indebtedness to Don Walker, to whose memory the work is dedicated. We hope that you will find these Guidelines useful and look forward to your comments for their future improvement! C. M. Sperberg-McQueen Lou Burnard Paris, 24 April 1994 FOR COMPLETE INFORMATION, CONTACT: EITHER C. M. Sperberg McQueen University of Illinois at Chicago Academic Computing Center (M/C 135) 1940 W. Taylor, Rm. 124 Chicago IL 60612-7352 U.S.A. fax: +1 (312) 668 6834 OR TEI Orders Oxford University Computing Services 13 Banbury Road Oxford OX2 6NN fax +44 (865) 273275 OR Prof. Syun Tutiya Department of Philosophy Chiba University 1-33 Yayoi-cho Inage Chiba Chiba 263 JAPAN fax: +81 (43) 256-7032 ********** III.C.1. Fr: Maryellen McDonald, Program Manager" Re: Graduate Open House, Drexel University INTERESTED IN THE INFORMATION PROFESSION? The College of Information Studies Drexel University invites you to attend an OPEN HOUSE for graduate students on Saturday, May 7, 1994, 2:00-4:30 P.M. in the Rush Building, Drexel Campus, Philadelphia, Pennsylvania. This is an opportunity to: * Talk informally with faculty, students, and alumni about careers, admission requirements, financial aid, curriculum, etc. * Learn about the M.S. in library and information science, the new M.S. in information systems (M.S.I.S.), and the post-master's and Ph.D. programs * See the facilities and enjoy the refreshments. For reservations, call: (215) 895-2474 or FAX: (215) 895-2494 Maryellen McDonald Program Manager College of Information Studies Drexel University Philadelphia, PA 19104 Office (215) 895-2483 FAX (215) 895-2494 INTERNET: mcdonalm@duvm.ocs.drexel.edu ********** III.C.2. Fr: Paul Mc Kevitt Re: M.SC., Language, Speech, and Auditory Processing, U. Sheffield M.SC. in LANGUAGE, SPEECH AND AUDITORY PROCESSING ONE-YEAR M.SC. COURSE Department of Computer Science in collaboration with Institute for Language, Speech and Hearing (ILASH) Department of Information Studies Department of Psychology Speech Science Unit UNIVERSITY OF SHEFFIELD United Kingdom THE AIMS OF THE COURSE: This advanced M.Sc. programme provides a sound professional education and research training in new areas of information technology concerned with computer perception and processing of human language in all its forms. It is designed to provide an academic and practical grounding in part of what is known in Europe as `The Language Industry'. It aims to provide training for further research in this rapidly growing field in this Department or elsewhere. Language, speech and auditory processing is an inherently interdisciplinary field, involving elements of linguistics, phonetics, computer science, signal processing and artificial intelligence. Graduates generally come into the field with training in a subset of these disciplines, which will vary from person to person. One role of this Master's degree is to fill out the profile of each student in the areas which are appropriate for that person. We therefore aim for a wide choice of modules which can be tailored to individual needs. The course also provides skills in demand in today's world of language and information in electronic publishing, political/economic and scientific information handling, computer aids to translation, speech technology, composition, language learning, and legal retrieval and information handling etc. This course is offered subject to final approval by the University Senate. THE ACADEMIC PROFILE: The Department has a substantial research base in these areas, which has now resulted in University funding for ILASH: the Institute for Language Speech and Hearing, with which the MSc. is associated. ILASH has its own machines and support staff, and academic staff attached to it from nine departments. Sheffield is a node on the EU-funded ELSNET (European Network in Language and Speech) network and participates in many Europe-wide programmes that give opportunities to link to work across the Community. We are coordinating the 11-laboratory Human Capital and Mobility (HCM) EU network SPHERE: `Representations in Speech and Hearing' We also participate in EU ERASMUS programmes in speech and language where students can complete their dissertations abroad. STAFF: The course teaching will draw on staff in the Computer Science Department and other Departments in the University. The following is a list of current Computer Science academic staff working in Language, Speech and Hearing together with their research interests: *Guy Brown: auditory models, sound source separation, audition, speech *Martin Cooke: auditory models, sound source separation, audition, speech *Robert Gaizauskas: logical models of natural language texts, information extraction from corpora *Phil Green: Speech perception, automatic speech recognition. *Mark Hepple: Computational linguistics, grammatical formalisms, parsing, categorial grammar *Mike Holcombe: formal models of NLP, formal models of user modelling visual formal specification languages *Jim McGregor: user modelling, parsing, Prolog, tutoring systems *Paul Mc Kevitt: pragmatics, intentions, natural language dialogue, revision in dialogue, user-computer interfaces, hyper/multimedia, user modelling, integration of speech, language and vision processing *Bob Minors: Modelling arguments in discourse, illogic of argumentation, belief processing *Amanda Sharkey: Connectionist and cognitive models of language: language acquisition, symbol grounding, parsing, translation. *Noel Sharkey: Connectionist Natural Language Processing, Neural Network models of Cognition, Neural Representations underlying language and thought, Sensory and Action grounding of concepts. *Tony Simons: machine translation, syntactic, chart, and object-oriented parsing *Yorick Wilks: artificial intelligence, natural language understanding, belief pragmatics, lexical computation, parsing, information extraction. ENTRANCE REQUIREMENTS: Applicants will normally be expected to have, or be expected to obtain before joining the programme, a 2-2 or better in any subject, but those with degrees in computing, mathematics, psychology, physics, electrical engineering, linguistics, phonetics and cognitive science will be preferred. Work in an information service, computer department, advanced publishing environment or anything similar is considered advantageous, but candidates without such experience will be given equal consideration. International student applicants whose first language is not English will be required to provide evidence of English language competence. STRUCTURE AND CONTENT: The course consists of a taught part for two University Semesters, followed by examinations and then a project examined by dissertation and oral examination. The taught part of the course will consist of twelve modules. (A module occupies 1 semester and typically breaks down into 20 lecture hours and 10 practical/tutorial hours). Since? we aim to cater for students coming from multidisciplinary backgrounds, we endeavour to make the course as flexible as possible. Students choose six core modules and six electives. The advice and approval of tutors must be sought before deciding on the choice of elective. The six core modules are 'Natural Language Processing (I and II),' `Speech and Hearing (I and II),' and `Research topics in speech and language' (I and II). `The latter consists of a series of guest lectures and local seminars which students must attend, discuss, analyse and write essays on. Such modules are valuable both for technical content and for research skills, since understanding the research of others is a valuable asset which requires practise. The Elective modules offered from year to year depend upon the availability of staff and the trends in research and professional practice. Among possible electives modules are (with other departments noted where the courses are theirs): `(Psych/CS) Language and Logic', `Knowledge Engineering (I and II)'. `Data Structures', `Connectionism', `Graphics and HCI', `Machine Reasoning ', `Functional Programming', `Logic Programming', `(Speech Science) Phonetics', `(IS) Information Resources I', `(IS) Information Storage and Retrieval I', `(IS) Computers and Information II', `(IS) Information Storage and Retrieval II', and `(IS) Scientific and Technological Information'. The period from June to 31st August will be devoted to the preparation of a supervised dissertation to be submitted on or before 30th September. ASSESSMENT: Students will be required to pass continuous assessment and examinations for all twelve modules, and produce an acceptable dissertation. These three hurdles will be independent, in that to pass a student must pass all of them and to get a distinction a student must at least approach distinction standard in all of the continuous assessment, the examinations and the dissertation. FEES: The University charges the standard fees 2260 for EU and 7360 for non EU students (Figures in Pounds Sterling). SHEFFIELD: Sheffield is one of the friendliest cities in Britain and is well-situated, having the best and closest surrounding countryside of any major city. The Peak District National Park is only minutes away. It is a good city for walkers, runners, and climbers. It has two theatres, the Crucible and Lyceum. The Lyceum, a beautiful Victorian theatre, has recently been renovated. Also, the city has three mulitplex cinemas. There is a library theatre which shows more artistic films. The city has a number of museums many of which demonstrate Sheffield's industrial past, and there are a number of Galleries in the City, including the Mapping Gallery and Ruskin. A number of important 'stately homes' are close to Sheffield, such as Chatsworth House and Hardwicke Hall. By 1995 Sheffield will be served by a 'supertram' system: the line to the Meadowhall shopping and leisure complex is already open. Sheffield has outstanding sporting facilities, many constructed for the World Student Games in 1991. We have an olympic standard swimming pool and sports complex that is regularly used for international competition. The Sheffield Arena, is becoming an increasingly important venue for touring rock bands. ENQUIRIES AND APPLICATIONS: Please send enquiries and requests for application forms to: Ms. Liz Compton M.Sc. Admissions Department of Computer Science Regent Court 211 Portobello Street University of Sheffield GB- S1 4DP, Sheffield England. E-mail: liz@dcs.shef.ac.uk Fax: 44 742 780972 Phone: 44 742 825590 ********************************************************** IRLIST Digest is distributed from the University of California, Division of Library Automation, 300 Lakeside Drive, Oakland, CA. 94612-3550. Send subscription requests to: LISTSERV@UCCVMA.BITNET Send submissions to IRLIST to: IR-L@UCCVMA.BITNET Editorial Staff: Clifford Lynch calur@uccmvsa.ucop.edu or calur@uccmvsa.bitnet Nancy Gusack ncgur@uccmvsa.ucop.edu or nancy.gusack@ucop.edu Mary Engle meeur@uccmvsa.ucop.edu or mary.engle@ucop.edu The IRLIST Archives is now set up for anonymous FTP, as well as via the LISTSERV. Using anonymous FTP via the host dla.ucop.edu, the files will be found in the directory pub/irl, stored in subdirectories by year (e.g., /pub/irl/1993). Using LISTSERV, send the message INDEX IR-L to LISTSERV@UCCVMA.BITNET. To get a specific issue listed in the Index, send the message GET IR-L LOGYYMM, where YY is the year and MM is the numeric month in which the issue was mailed, to LISTSERV@UCCVMA (Bitnet) or LISTSERV@UCCVMA.UCOP.EDU. You will receive the issues for the entire month you have requested. These files are not to be sold or used for commercial purposes. Contact Nancy Gusack or Mary Engle for more information on IRLIST. THE OPINIONS EXPRESSED IN IRLIST DO NOT REPRESENT THOSE OF THE EDITORS OR THE UNIVERSITY OF CALIFORNIA. AUTHORS ASSUME FULL RESPONSIBILITY FOR THE CONTENTS OF THEIR SUBMISSIONS TO IRLIST.