3 Pages

C90-3085

Course: C 90, Fall 2009
School: UPenn
Rating:
 
 
 
 
 

Word Count: 2081

Document Preview

Indexing Automatic and Government-Binding Theory Robert J. Kuhns 205 Walnut Street Brookline, M A 02146 USA ABSTRACT This project note describes a systern that receives, parses, indexes, and routes news reports. The core of this ,'mtomatic indexer is a parser based on Govermnent-Binding Theory which derives thematic and binding relationships of arguments of the sentences of slories. These syntactic structures...

Register Now

Unformatted Document Excerpt

Coursehero >> Pennsylvania >> UPenn >> C 90

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Indexing Automatic and Government-Binding Theory Robert J. Kuhns 205 Walnut Street Brookline, M A 02146 USA ABSTRACT This project note describes a systern that receives, parses, indexes, and routes news reports. The core of this ,'mtomatic indexer is a parser based on Govermnent-Binding Theory which derives thematic and binding relationships of arguments of the sentences of slories. These syntactic structures are interpreted by a semantic processor which is linked to conceptual representations of terms from a controlled indexing vocabulary. As a result, the system is capable of indexing news with respect to a large set of let+ms that denote Ihe content of the articles. This suggests that systems that could operate at a conceptual level would be capable of indexing in ways that cotdd permit highly effective retrieval. It is with the assumption that NLP technology can provide tile means of categorizing text that guide several recent efforts. In particular, each of/Hayes et al. 1988/,/Kuhns 1988/, and/Rau and Jitcobs 1988/ describes systems that characterize news reports with results that could llOt be obtained by keyword methods alone. Since a news analysis system (NAS) was first reported in/Kuhns 1988/, a number of major enhancements to its design and underlying functionality have been incorporated. It is the purpose of this paper to report on tbe current state of NAS and ils COlllpolleI]ts. S C O P E AND OB,IECTIVES A primary design goal behind NAS is to develop a system employing NLP technology that wouh:t be capable of either routing news t'rom electronic news feeds in real-time or indexing news with respect to very large sets of indexing terms (authority files). ~ This vocabulary is broad and ranges over diverse domains, with lerms representing proper names, concrete objects, or abslract relationships. The last type is dependent on the content of the stories and is particularly suited for the syntactic/ semantic techniques of NAS. The form of the indexes that NAS produces is a set of pairs of headings and subheadings or descriptors. The headings are frequently proper names while the descriptors add detailed information to the index by denoting various relationships of entities mentioned in the news reports. I',ACKGROUNI) With the rapidly increasing \olume of text being generated. transmitted, processed, and stored, it becomes critical that informalion retrieval and routing be highly efficient, both in time of processing and accuracy. To this end, indexing techniques have become the prinmry focus of much research, a~d 3'el dlese methods have relied on automatic keyword identification from texts. This is not to say that natural hmguagc techniques have not been examined with respect to their relevance for indexing and retrieval (cf./Sparck Jones and Kay 1973/, /Walker, Karlgren, and Kay 1977/, and more recently,/Sahon mid Smith 1989/). It is that most systems rely on the presence or absence of keywords with additional mechanisms such as proximity constraints, statistical weighting, word-stem truncation, and boolean relrieval expressions. However, these methods do ~ot take into account the syntactic and semantic structure inherent in tile text being indexed. That is, they make virtually no use of the fact that it is natural language and not a collection of arbitrary strings of characters that is being processed. Natural language processing (NLP) can make its most valuable cont,'ibutions to those aspects of indexing where the keyword approaches fail, viz., the assignment of terms ~.o text based on their semantic or conceptual content. This involves deriving abstract relationships among conceptual units. For example, consider a story stating: ( 1) China bought 6,000 tonncs of wheat from the United States. [)he plausible categorization of (1) is thai it is about foreign trade. However, the phrase "foreign trade" does not appear in (1), and it is invariably absent fl'om foreign trade stories in general. Furthermore, it is extremely unlikely that such foreign trade stories cottld be retrieved in an efficient manner, i.e., with a tew simple queries. The central issue is that although the particulars (e.g., country names and types o fcommodilies) wuy, the basic lneanings of foreign trade slodes are equivalent at some level, and that this level is wduable for indexing purposes. ARCHITECTURAL OVERVIEW Tile architecture of NAS is modular consisting of several main subsystems, viz., a set of preprocessors and template filters, a parser, a lexicon, a semantic interpreter, a set of concept bases, and an indexer (Figure 1). The system is transportable in that it can be interfaced to different news streams and indexing vocabularies. A preprocessor receives a news stream which can be flom a satellite dish link, a direct line, or a text file, and identifies the beginning and ending of stories in addition to their titles, sentences, and words. Since the format of each news feed, e.g., Reuters or Kyodo, is distinct from the others, a single preprocessor will accept only one news feed. For rigidly-formatted articles that are numerical or non-texttlal in form, a template filter, which is an indexing component of low-level routines, categorizes them from lhe title while deriving specifics l'rom the body of tile story. 1 397 Template Filter ~1 I ndexes Textual Stories Lexicon I Words [Parser Structures ~ I i %c~Ttl I to.co, ~ i Terms An Architectural Overview of NAS Figure 1 Figure 2 is an actual example (from Reuters) that has been indexed by the ternplate filter. The system outputs the company name with a descriptor "3rd Quarter Earnings," as well as the current and cumulative earnings or losses. @R101903647 /&ACTMEDIA INC <ACTM.0> 3RD QTR LOSS WESTHAMPTON BEACH, N.Y., Oct 19, Reuter Shr loss 14 cts vs profit 10 cts Net loss 1,674,000 vs profit 1.207,000 Revs 26.7 mln vs 19.1mln Nine Months Shr loss 19 cts vs profit 34 cts Net loss 2,280,000 vs profit 4,080,000 Revs 71.6 mln vs 59.8 rain Reuter indexes: Company Name Descriptor Subject Descriptor Subject Descriptor ACTMEDIA INC 3RD Quarter Earnings Net loss 1,674,000 Current Earnings Net loss 2,280,000 Cumulative Earnings (2) Agent (COMPANY) Predicate (INTRODUCE) Theme (PRODUCT). This structure denotes that a product introduction is one where a company introduces (or, synonymously, releases) a product. In short, it is a list of typed nodes. A report will be characterized as a product introduction story if it contains a sentence some of whose grammatical components (e.g., agent, predicate, theme) can be associated to the corresponding nodes of{ 2), Suppose, l:or example, a news item reports {3) Alpha Corp said it plans to release a new workstation in Japan. The parser, in accordance with GB principles, produces: (4) Agent (Alpha Corp) Predicate (said) Proposition Agent (Alpha Corp) Predicate (plans) Proposition Agent (Alpha Corp) Predicate (release) Theme (a new workstation) In Numerical (Japan) A Story and Its Index Figure 2 In contrast, textual stories require grammatical processing and these are sent to the parser and semantic interpreter. The parser which relies on the principles of Government-Binding (GB) Theory (/Chomsky 1981/3, outputs predicate-argument structure of each sentence of a sto W.a In doing so, the parser identi ties empty categories, viz., PROs, traces, and variables, and thematic relations, and resolves antecedent and anaphor and pronominal bindings. It should be noted that the parser is interfaced to a lexicon of over 17,000 items that was developed by analyzing strings (words) from a newswim. The size of the lexicon is sufficient for news processing. The semantic interpreter maps the grammatical structures onto conceptual representations or filters stored in a concept base. For instance, a representation for "Product Introduction" is The parser binds the pronominal it, the agent of plans, to A~)ha Cor~tx, the subject or agent of the matrix clause. The parser also detects an empty category, viz., PRO, in the embedded sentence (proposition) with release as the verb and binds the pronominal to it. Since bound arguments share the same semantic features, the semantic interpreter determines that the agent of release in (4) is of type COMPANY. In other words, PRO inherits the property of COMPANY from the agent of the matrix sentence via the intermediate pronominal k. It also determines that the predicate release is synonymous with introduce and the theme workstation is a product. With the arguments typed and membership of the predicate within a synonym class known, the semantic processor can match the corresponding nodes of the most deeply embedded clause of (4) with (2), and thus determines that the sentence is about a product introduction. Associated with each conceptual filter is a set of indexing procedures that are invoked 398 2 by the indexing mechanism when a conceptual filter is satisfied. These thnctions are integrated with databases containing the indexing vocabulary and they identify specific information about a story including company, personal, and product names, and descriptors indicating specific relationships, Figure 3 illustrates the corporate and personal name identification capabilities and the level of "understanding" as reflected by the subheadings. @ R080100252 /&ALCO HEALTH<AAIIS.0> CHIEF EXECUTIVE RETIRES VALLEY FORGE, Pa., Aug 1, Renter - Alco Health Services Corp said Ray B. Mundt has been named acting chairman and chief executive officer, succeeding John H. Kennedy, who is retiring. indexes: Company Name Descriptor Personal Name Descriptor Personal Name Descriptor Alco Health Services Corp Officials and Employees Kennedy, John H. Retirement Mundt, Ray B. Select ion",Appointment parser. (/Kuhns 1986/describes an earlier implementation of GB Theory.) From a research perspective, a parser based on linguistic theory and applied to "real-world" text helps identify the boundaries or interface conditions between core and peripheral aspects of the theory. In other words, since GB is a model of core grammar and language contains marginal or marked conslructions, a GB-based parser nmst co-routine principles of the theory with hmguage-specific rules in order to have wide coverage. (/Fomita 1988/makes a similar observation.) Thus, it is this combination of a psychologically-real theory and an application using fl'ee text that may provide insight into the human sentence processing mechanism. REFERENCES Chomsky, N., ( 1981 ) Lectures on Government and Binding, Foris Publications, Dordrecht, Holland. ttayes, P.J., L.E. Knecht, and M.J Cellio, (1988), "A News Categorization System," in Proceedings o1' the Second Conference on AEplied Natural Langu~,~c Processing, Austin, Texas. Kuhns, R.J., (1986), "A PROLOG Implementation of Government-Binding Theory," in Proceedings of the Xlth International Conference on Computational Lin~t_fistic~, Bonn, West Germany. Kuhns, R.J., (1988), "A News Analysis System," in Proceedings of the Xllth International Conference on Computational Lin,,,,uistics...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

UPenn - X - 96
A N O V E R V I E W OF THE P R O T O T Y P E I N F O R M A T I O N DISSEMINATION SYSTEM (PRIDES)Virginia Cevasco Logicon, Operating Systems Division 2100 Washington Blvd. Arlington, VA 22204 gcevasco@logicon.com (703) 486-3500INTRODUCTIONThe Prot
UPenn - P - 81
J. Norwood Crout Artificial Intelligence Corporation The INTELLECT n a t u r a l language database query system, a product of Artificial Intelligence Corporation, is the only commercially available system with true English query capability. Based on
UPenn - P - 80
FUTURE PROSPECTS FOR COMPUTATIONAL LINGUISTICS Gary G. H e n d r i x SRI International Preparation of this paper was supported by the Defense Advance Research Projects Agency The views under contract N00039-79-C-0118 with the Naval Electronic Systems
UPenn - X - 93
DICTIONARY CONSTRUCTION BY DOMAIN EXPERTSEllen Riloff and Wendy G. LehnertDepartment of Computer Science University of Massachusetts Amherst MA 01003 Sites participating in the recent message understanding conferences have increasingly focused thei
UPenn - C - 86
Q&amp;A: A l r e a d y a S u c c e s s ?Gary G. Hendrix Symantec Corporation Cupertino, CA 95014 USA When Prof. Wolfgang Wahlster (the organizer of this COLING-86 panel on &quot;Natural Language Interfaces: Ready for Commercial Success?&quot;) sent out invitatio
UPenn - H - 91
Bayesian Learning of Gaussian M i x t u r e Densities for Hidden Markov ModelsJean-Luc Gauvain I and Chin-Hui LeeSpeech Research Department AT&amp;T Bell Laboratories Murray Hill, NJ 07974 ABSTRACTAn investigation into the use of Bayesian learning of
UPenn - N - 06
From Pipedreams to Products, and Promise!Janet M. BakerSaras Institute / Dibner Institute MIT Bldg E56-100 38 Memorial Drive Cambridge, MA 02139 USA HistSpch@mit.eduPatri J. PuglieseSaras Institute / Dibner Institute MIT Bldg E56-100 38 Memori
UPenn - E - 89
Fourth Conferenceof the European Chapterof theAssociation for Computational LinguisticsProceedings of the Conference10- 12 April 1989 University of Manchester Institute of Science and Technology Manchester, EnglandPublished by the Associat
UPenn - J - 96
Book ReviewsJapanese Sentence Processing Reiko Mazuka and Noriko Nagai (editors)(Duke University) Hillsdale, NJ: Lawrence Erlbaum Associates, 1995, x+360 pp; hardbound, ISBN 0-8058-1125-7, $89.95Reviewed by Patrick Sturt University of Edinburgh
UPenn - J - 96
Computational LinguisticsVolume 22, Number 2Representing Time in Natural Language: The Dynamic Interpretation of Tense and AspectAlice G. B. ter M e u l e n(Indiana University) Cambridge, MA: The MIT Press, 1995, xii+144 pp; hardbound, ISBN 0-
UPenn - E - 87
Third Conference of t h e European Chapter of t h e A s s o c i a t i o n for C o m p u t a t i o n a l LinguisticsP r o c e e d i n g s of t h e C o n f e r e n c e1-3 A p r i l 1987 U n i v e r s i t y of C o p e n h a g e n Copenhagen, Denmark
UPenn - J - 95
Briefly NotedParallel natural language processing Geert Adriaens and Udo Hahn (editors)(University of Leuren and University of Freiburg) Norwood, NJ: Ablex Publishing Company, 1994, vi + 467 pp. Hardbound, ISBN 0-89391-869-5, $79.50 ($37.50 prepaid
UPenn - J - 96
Book ReviewsNatural Language Processing for Prolog Programmers Michael A. Covington(University of Georgia) Englewood Cliffs, NJ: Prentice-Hall, 1994, xvi+348 pp; hardbound, ISBN 0-13-629213-5, no price listedReviewed by Ken Barkerand Stan Szpako
UPenn - J - 01
Book ReviewsLexicon Development for Speech and Language Processing Frank Van Eynde and Dafydd Gibbon (editors)(University of Leuven and University of Bielefeld) Dordrecht: Kluwer Academic Publishers (Text, speech and language technology series, ed
UPenn - J - 89
Book ReviewsBriefly Notedfully, and with a pedagogically attractive style, it discusses topics related to expert systems (e.g., representation, rules, shells, explanation, and confidence factors) as well as topics related to natural language proc
UPenn - J - 89
Book ReviewsText Coherence in TranslationTEXT COHERENCE IN TRANSLATION Bart Papegaaij and Klaus Schubert (BSO/Research, Utrecht)Dordrecht: Foils Publications, 1988, 211 pp. (Distributed language translation 3) ISBN 90-6765-360-8, Dfl 110.- (hb)
UPenn - J - 92
Book ReviewsCognitive M o d e l s of Speech Processing Gerry T. M. Altmann (editor)(University of Sussex) Cambridge, MA: The MIT Press (The ACL-MIT Press Series in Natural Language Processing), 1990, x + 540 pp. Hardbound, ISBN 0-262-01117-4, $55.0
UPenn - J - 88
Book ReviewsMachine Translation: Past, Present, Futurepresented as the only significant computational contributions. There is no discussion of processing as it is defined computationally. There is no mention of processing concerns that require in
UPenn - J - 81
Book ReviewsNatural Language Processing Harry Tennant Petrocelli Books, Princeton, 1981, 276 pp., Paperback, $17.50, ISBN 089433-100-0. (Dist: Van Nostrand-Reinhold, New York)How do computers understand natural language? This question is asked by
UPenn - J - 92
Computational LinguisticsVolume 18, Number 3Adaptive Parsing: Self-Extending Natural Language Interfaces Jill Fain Lehman(Carnegie Mellon University) Boston: Kluwer Academic Publishers (The Kluwer International Series in Engineering and Computer
UPenn - E - 83
AssooJatil~ Computatlona in uisticsProceeding:s of the ConferenceFirst Conference of the European Chapter of the for1-2 September 1983 Pisa, ItalyPublished by the Association for Computational LinKuistics1983, Association [or Computational L
UPenn - E - 93
Sixth Conference of the European Chapter of the Association for Computational LinguisticsProceedings of the Conference9~~21 - 23 April 1993 OTS - ResearchInstitute for Languageand Speech Utrecht University Utrecht, The NetherlandsPublishe
UPenn - E - 99
Ninth Conference of the European C h a p t e r of the Association for C o m p u t a t i o n a l Linguistics8-12 June 1999 University of Bergen Bergen, NorwayPublished by the Association for Computational LinguisticsThe conference was sponsored
UPenn - J - 00
Book ReviewsSpeech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition Daniel Jurafskyand James H. Martin(University of Colorado, Boulder) Upper Saddle River, NJ: Prentice Hall
UPenn - J - 05
Book ReviewsSpoken Dialogue Technology: Toward the Conversational User InterfaceMichael F. McTear (University of Ulster) London: Springer-Verlag, 2004, x+432 pp; paperbound, ISBN 1-85233-672-2, $59.95 Reviewed by Johannes Pittermann University of
UPenn - J - 96
Computational LinguisticsVolume 22, Number 3D e i x i s in Narrative: A C o g n i t i v e S c i e n c e Perspective Judith F. Duchan, Gail A. Bruder, and Lynne E. Hewitt (editors)(State University of New York at Buffalo) Hillsdale, NJ: Lawrence
UPenn - J - 98
Computational LinguisticsVolume 24, Number 4Multilingual Text-to-Speech Synthesis: The Bell Labs Approach Richard Sproat(editor)(Bell Laboratories, Lucent Technologies) Dordrecht: Kluwer Academic Publishers, 1998, xxvi+300 pp; hardbound, ISBN 0-
UPenn - J - 86
Book ReviewsConceptual Structuresinferences are generated, how many inferences are generated, and what knowledge sources contribute to the generation of inferences. In their book Structures and Procedures of Implicit Knowledge, Graesser and Clark
UPenn - J - 95
Briefly NotedVerbmobih A Translation System for Face-to-Face Dialog Martin Kay, Jean Mark Gawron, and Peter Norvig(Xerox Palo Alto Research Center, SRI International, and Sun Microsystems Laboratories) Stanford: Center for the Study of Language and
UPenn - J - 99
Book ReviewsType-Logical SemanticsBob Carpenter(Lucent Technologies) Cambridge, MA: The MIT Press (Language, speech, and communication series), 1997, xxi+575 pp; hardbound, ISBN 0-262-03248-1, $60.00; paperbound, ISBN 0-262-53149-6, $35.00Revie
UPenn - J - 00
Book ReviewsLocal Constraints vs. E c o n o m y David E. Johnson and Shalom Lappin (IBM Thomas J. Watson Research Center and King's College, University of London)Stanford, CA: CSLI Publications (Stanford monographs in linguistics), 1999, x+150 pp;
UPenn - J - 91
The Logical Structure of English: Computing Semantic Content Allan Ramsay(University College Dublin) London: Pitman, 1990, iv + 209 pp. Paperbound ISBN 0-273-03287-9, 19.99Reviewed by Martin Volk University of Koblenz-LandauH o w do you judge whe
UPenn - J - 04
Book ReviewHandbook for Language EngineersAli Farghaly (editor) (SYSTRAN Software Corporation) Stanford, CA: CSLI Publications (CSLI lecture notes, number 164) (distributed by the University of Chicago Press), 2003, xi+442 pp; hardbound, ISBN 1-575
UPenn - N - 04
HLT-NAACL 2004Human Language Technology Conference of the North American Chapter of the Association for Computational LinguisticsProceedings of the Main ConferenceMay 2-7, 2004 Boston, Massachusetts, USAISBN 1-932432-23-X900009 781932 432
UPenn - J - 90
Book ReviewsComputationalLinguistics: An IntroductionG6ran Maimgren describes regularities in polysemy: types of metaphoric transfer of meaning in nouns, regular extensions in verb meanings, and changes in adjective meanings as the argument chang
UPenn - J - 98
Book ReviewsCorpus-Based Methods in Language and Speech Processing Steve Young and Gerrit Bloothooft (editors)(Cambridge University and Utrecht University) Dordrecht: Kluwer Academic Publishers (Text, Speech and Language Technology series, edited b
UPenn - J - 01
Computational LinguisticsVolume 27, Number 2Learnability in Optimality Theory Bruce Tesar and Paul Smolensky(Rutgers University and The Johns Hopkins University) Cambridge, MA: The MIT Press, 2000, vii+140 pp; hardbound, ISBN 0-262-20126-7, $25.
UPenn - J - 93
Book ReviewsA n I n t r o d u c t i o n to M a c h i n e Translation W. John Hutchins and Harold L. Somers (University of East Anglia and University of Manchester Institute of Science and Technology)London: Academic Press, 1992, xxi + 362 pp. Hardb
UPenn - CIS - 610
Chapter 8 A Detour On Fractals8.1 Iterated Function Systems and FractalsA pleasant application of the Hausdor distance and of the xed point theorem for contracting mappings is a method for dening a class of self-similar fractals. For this, we can
UPenn - CIS - 610
Chapter 5 Lie Groups, Lie Algebras and the Exponential Map5.1 Lie Groups and Lie AlgebrasIn Chapter 2, we dened the notion of a Lie group as a certain type of manifold embedded in RN , for some N 1. Now that we have the general concept of a manif
UPenn - CIS - 610
Chapter 7 Geodesics on Riemannian Manifolds7.1 Geodesics, Local Existence and UniquenessIf (M, g) is a Riemannian manifold, then the concept of length makes sense for any piecewise smooth (in fact, C 1) curve on M . Then, it possible to dene the s
UPenn - CIS - 610
Chapter 6 The Classication Theorem for Compact Surfaces6.1 Cell ComplexesIt is remarkable that the compact (two-dimensional) polyhedras can be characterized up to homeomorphism. This situation is exceptional, as such a result is known to be essent
UPenn - CIS - 610
Chapter 4 The Fundamental Group, Orientability4.1 The Fundamental GroupIf we want to somehow classify surfaces, we have to deal with the issue of deciding when we consider two surfaces to be equivalent. It seems reasonable to treat homeomorphic su
UPenn - CIS - 610
Chapter 4 Polyhedra and Polytopes4.1 Polyhedra, H-Polytopes and V-PolytopesThere are two natural ways to dene a convex polyhedron, A: (1) As the convex hull of a nite set of points. (2) As a subset of En cut out by a nite number of hyperplanes, mo
UPenn - CIS - 511
Chapter 8 Phrase-Structure Grammars and Context-Sensitive Grammars8.1 Phrase-Structure GrammarsContext-free grammars can be generalized in various ways. The most general grammars generate exactly the recursively enumerable languages. Between the c
UPenn - CIS - 610
Chapter 4 Basics of Classical Lie Groups: The Exponential Map, Lie Groups, and Lie AlgebrasLe rle prpondrant de la thorie des groupes en mathmatiques a t longtemps o e e e e ee insouponn; il y a quatre-vingts ans, le nom mme de groupe tait ignor. Ce
UPenn - CIS - 511
Chapter 6 Elementary Recursive Function Theory6.1 Acceptable IndexingsIn a previous Section, we have exhibited a specic indexing of the partial recursive functions by encoding the RAM programs. Using this indexing, we showed the existence of a uni
UPenn - CIS - 610
Chapter 4 Manifolds, Tangent Spaces, Cotangent Spaces, Vector Fields, Flow, Integral Curves4.1 ManifoldsIn Chapter 2 we dened the notion of a manifold embedded in some ambient space, RN . In order to maximize the range of applications of the theor
UPenn - CIS - 610
Chapter 8 The Log-Euclidean Framework Applied to SPD Matrices and Polyane Transformations8.1 IntroductionIn this Chapter, we use what we have learned in previous chapters to describe an approach due to Arsigny, Fillard, Pennec and Ayache to dene a
UPenn - CIS - 610
Chapter 6 Riemannian Manifolds and Connections6.1 Riemannian MetricsFortunately, the rich theory of vector spaces endowed with a Euclidean inner product can, to a great extent, be lifted to various bundles associated with a manifold. The notion of
UPenn - CIS - 610
Chapter 4 Partial Orders, Lattices, Well Founded Orderings, Equivalence Relations, Distributive Lattices, Boolean Algebras, Heyting Algebras4.1 Partial OrdersThere are two main kinds of relations that play a very important role in mathematics and
UPenn - CIS - 610
Chapter 2 Relations, Functions, Partial Functions2.1 What is a Function?We use functions all the time in Mathematics and in Computer Science. But, what exactly is a function? Roughly speaking, a function, f , is a rule or mechanism, which takes in
UPenn - STAT - 102
Homework 1Spring 2007(HW for Sections 2 &amp; 3 (Zhao) is due in class on Jan. 16th and for Section1 is due in class on Jan. 17th.)Read: Chapter 2: Sections 2.1 through 2.7 should be review. Sections 2.8 &amp; 2.9 may be newWritten HW: Problems 2.25,
UPenn - STAT - 102
Statistics 102Lecture 2L. Brown &amp; L. ZhaoSpring 2007Tests and Confidence Intervals for Two MeansRead: Sections 2.7 and 2.8 of Dielman Do advertisements help to increase store sales? Data from two independent samples Analysis assuming equal
UPenn - STAT - 102
Department of Statistics The Wharton School University of Pennsylvania Statistics 102L. Brown &amp; L. ZhaoSpring 2007Administrative IssuesWeb site www-stat.wharton.upenn.edu/~stat102 TEXT: Dielman, T. Applied Regression Analysis Fourth Edition,
UPenn - STAT - 011
UPenn - STAT - 542
Stat 542 Homework 1 - Due Thursday, February 12th at 10:30am You are required to submit a hard copy document in class with answers to the following questions. This document must be generated using the LaTeX typesetting language. It should also includ
UPenn - STAT - 430
STAT 430SyllabusFall 2008Statistics 430: ProbabilityMW 12:00-1:30, 1:30-3:00 @ JMHH F50Professor: T. Tony Cai, tcai@wharton.upenn.edu, Oce: JMHH 469. Oce hours: Tuesday 9:15 - 11:00am. Teaching Assistant: Dongyu Lin, dongyu@wharton.upenn.edu
UPenn - PHYS - 151
Physics 151Electric ChargeCoulombs Law of ForceElectric FieldsGausss Law Electric Potenial CapicitanceElectric CurrentConductors DC Electric CircuitsMagnetic FieldsBiot-Savart Law and Amperes Law Inductance and Faradays LawElectromagneti
UPenn - ASTRO - 12
Recommended exercises pre-Test 1Galaxy formationConsider a spherical and homogeneous proto galactic cloud of mass M = 6 1011 Msolar , radius R = 100 Kpc. Write the expression for the free fall time as a function of its mass and radius. Evaluate th
UPenn - ASTRO - 12
EBSCOhost04/17/2006 10:44 PMBack8 page(s) will be printed.Record: 1 Title: READING THE BLUEPRINTS of CREATION. Authors: Strauss, Michael A.1 Source: Scientific American; Feb2004, Vol. 290 Issue 2, p54-61, 8p, 1 graph, 11c Document Type: Artic