5 Pages

Fin02

Course: CS 242, Fall 2009
School: Rochester
Rating:
 
 
 
 
 

Word Count: 1675

Document Preview

Midterm CSC Second 242 10 May 2002 Write your NAME legibly on the bluebook. Work all problems. Best strategy is not to spend more than the indicated time on any question (minutes = points). Open book, open notes. 1. Grammar: 30 mins. We all remember: Wenn Fliegen iegen hinter Fliegen, Fliegen iegen Fliegen nach. And of course Die Mnner, die vor dem Schokoladen Laden Laden laden, laden Ladenmdchen zum Tanze a a...

Register Now

Unformatted Document Excerpt

Coursehero >> New York >> Rochester >> CS 242

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.
Midterm CSC Second 242 10 May 2002 Write your NAME legibly on the bluebook. Work all problems. Best strategy is not to spend more than the indicated time on any question (minutes = points). Open book, open notes. 1. Grammar: 30 mins. We all remember: Wenn Fliegen iegen hinter Fliegen, Fliegen iegen Fliegen nach. And of course Die Mnner, die vor dem Schokoladen Laden Laden laden, laden Ladenmdchen zum Tanze a a ein. (These Germanic noun capitalizations make parsing these sentences easier, nicht? ) A. Make up a context-free phrase structure grammar with a lexicon made up only of transitive verbs, adjectives, and nouns that will parse (or generate) sentences of the form: cats ght dogs. troy cats ght dogs. cats ght albany dogs. troy cats ght albany dogs. cats love dogs albany residents hate. syracuse cats hate albany dogs albany residents love. rochester cats rochester dogs hate love syracuse cats albany dogs hate. .... But which do not include sentences of the form: cats ght. big troy cats ght dogs. the rochester cats ght large syracuse dogs. ... (Note that we dont need no stinkin capitalization.) B. Now consider your grammar with the following lexicon. Noun: bualo (as in bison). Adjective: bualo (as in from Bualo, NY). Verb: bualo (as in bae, frustrate). How many parses does your grammar give for the following sentence? bualo bualo bualo bualo bualo. C. What is the longest sentence your grammar can generate (or parse) consisting entirely of repetitions of the word bualo? Considered as a model of actual English usage, is the embedding property of these phrase structure grammars a problem? If not why not, and if so what do you suggest we do about it? D. Consider the sentences I dropped the lightbulb on the table and it broke. I dropped the anvil on the table and it broke. 1 What mechanisms do NLU systems provide to resolve the reference of it in sentences like the above? Answer: A. I think something like this should work: S = ModN V ModN ModN = SubN | SubN NClause NClause = SubN ModN V | SubN V SubN = N | A N N = cats | dogs V = fight | love | hate A = troy | syracuse | albany | buffalo B. I get three, with the main verb being the 2nd, 3rd, or 4th bualo. C. Innite. Denite problem because the famous linguistic touchstone, the native informant, will not agree an innitely long sentence (or even a deeply embedded one) is grammatical. What to do, I dunno...one would have to check out some linguistics books. Clearly some sort of quick hack would be to put a limit on the number of times you invoke certain embedding rules like the 2nd and 3rd mutually recursive ones above. D. Lexical categories and information could encode some of this common sense knowledge, but also logical rules about object properties and the associated inferences may have to be used. 2. Vision and Linear Systems: 30 mins A. What does the convolution theorem for Fourier transforms tell us and why is it useful? B. What does the sampling theorem for Fourier transforms tell us and why is it useful? C. (see D.) What are three sorts of variation in an image that we might want to ignore for the purposes of object recognition? What algorithms or methods could implement such invariance calculations? D. (see C.) On the other hand, how could each of the irrelevant variations in your answer to C be used to tell you something about the object? Be technical and specic. E. On page 729 your text states that a Lambertian surface appears equally bright to an observer in any direction. That is, the number of photons per second impinging on a retinal receptor is constant for an observer looking at the surface from any angle. (Just how bright is given by the equation in the book, but thats irrelevant to this question.). Now I have another text that says that a Lambertian surface is one for which the photon ux, or amount of light (that is the number of photons per second emitted from the surface in any direction) is proportional to the cosine of the angle between the surface normal and the emittance direction. So one text says that the brightness is constant with angle A and the other says that the ux varies with A. In the gures, the arrow measuring brightness follows the semicircle and stays constant size, the arrow measuring ux follows around the circle and goes from 0 to 1 and back to 0 as the angle goes from 90 degrees to zero and back to 90. Since these are textbooks, they have to be correct, so how do you reconcile these statements? 2 Surface Surface Normal Normal To Viewer A A To Viewer Length of Arrow is Brightness in its Direction Length of Arrow is Flux in its Direction Answer: A. convolution in time (spatial) domain is multiplication in (spatial) frequency domain, which yields elegant ways to think about the operation of linear operators. since Also, the fast FT is fast, the conv. th. allows convolution, usually an expensive (n2 in one dimension) operation, to be done quickly (n log n) by swapping domains. B. If you sample faster than the Nyquist frequency (twice the highest freq in the signal), you can reconstuct a continuous (but band-limited) function with a nite number of discontinuous samples. Basic to digital image science. C. Shading, texture variation, perspective distortion (size variation with distance), color appearance with dierent colored lights, etc... To beat shading you could lter or edge-nd to remove slowly-varying components. Or you could reason backward from assumptions of light source location and object surface reectance uniformity. Texture variation could maybe be beat by something like ane invariants, that is extracting geometric properties of the texels and their arrangements that are invariant to size, rotation, and skew. Color constancy is something humans are pretty good at, and ways to get it vary from trying to guess the color of the light source(s) to assuming all light sources and reectances are made up of a small number (3) of basis functions. Also the dierences of of colors between the various patches in the scene can be less variant than the colors themselves... this is basis of Lands color theory. Size-invariant measures can beat down the shrinks with distance phenomenon, as would an inverse camera model. D. Shape from shading, shape from texture: one approach is the equivalent of a reectance function mapping properties (for shading, just brightness, for textures, maybe some other properties) to a small subset of surface normals. Then some regularization and boundary condition assumptions can allow for iterative solution. Using location or size in an image to infer distance (above or smaller means farther) is quite common. E. The foreshortening of the surface when you see it from more oblique angles means that each receptor in your eye gets photons from a larger chunk of surface. In fact the size of the surface goes as 1/cosine, while the ux is going as the cosine of that angle. These eects cancel, leading to the uniform brightness you experience. 3 3. Perceptrons: 40 mins A. You have a perceptron with a threshold permanently xed at zero (0) and two inputs, one for the x-coordinate of a data point and one for the y coordinate. It looks like this with T xed at 0. x A Sum B Threshold T Output (0 or 1) y Inputs Weights Can it discriminate between the lled and hollow data points in the data shown below for the left and right cases? Why or why not in each case? (0,0) (0,0) left right B. You have a similar perceptron to the one in part A, only it can have a non-zero threshold. In fact you know that the weight on its x input is A, the weight on its y input is B, and its threshold is T . Specify the decision surface (in...

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:

Rochester - CS - 242
MidtermCSC 242 March 2006Write your NAME legibly on the bluebook. Work all problems. You may use two double-sided pages of notes. Please hand your notes in with your bluebook. The best strategy is not to spend more than the indicated time on any questio
Rochester - CS - 242
Midterm Answers, with FFQ(TM) featureCSC 242 March 2007Write your NAME legibly on the bluebook. Work all problems. You may use two double-sided pages of notes. Please hand your notes in with your bluebook. The best strategy is not to spend more than the
Rochester - CS - 242
WebCT - Start-Up Info for StudentsYour instructor has elected to put course materials online this term using WebCT. This information sheet will help you get started using it.How do I get to my course in WebCT?Open a browser and point tohttp:/webct.roc
Rochester - CS - 242
g C cf bcdeG a E 8A U @ 89 7! 6 5 4 3 ' ) )% ( " '& %$ # "! 1 20 H X VW UQT RS QIP HG FBCDE S Y `C f C cf bcdeG a E X VW U H UQT RS QIP HG FBCDE S Y `C% $) $" ) ) 2 # 2 % $% ! #" ! # 3 )0 ) & 1 #" ' # #1 " ( ' # #) #) ( )0 P C #bcdeG a E Y X VW S U
Rochester - CS - 173
Descsription and Experience of my projectXiaoqing Tang November 20, 2008This scheme program can solve the N-puzzle problem, though N can't be too large. Generally it should be less than 5. The program can't guarantee for all inputs with N greater or equ
Rochester - CS - 173
Garrett Hall CSC 173 Prolog, Week 3-4 OverviewI created a compact scanner, parser, and evaluator that can calculate basic arithmetic expressions. First it prompts the user to type an expressionparser.pl -? test. Input:Then it outputs the result of each
Rochester - CS - 173
LogicChris Brown October 21, 2008If there is a lot of prose in your answers (as opposed to math), consider using a textprocessor! Write mathematics correctly if in doubt see the courses Helper Tools page in the Resources section of the course homepage.
Rochester - CS - 173
BASIC INFORMATIONXiaoqing Tangxiaoqing.tang@rochester.eduProgramming - CWeek 3-4LISTOFFILESchar_classes.cchar_classes.h(character classes. They're unmodified.)format.c(main program code file of calculating a single expression)grammar(the parse
Rochester - CS - 282
Chapter 7Network Flow7.5 Bipartite MatchingSlides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved.1MatchingMatching. Input: undirected graph G = (V, E). M " E is a matching if each node appears in at most edge in M. Max
Rochester - CS - 282
CSC282 Fall 2005 Homework #61. CLRS 14.1-5 (p. 307) 2. CLRS 14.2-2 (p. 310) 3. CLRS 14.2-3 (p. 310) 4. CLRS 14.2-4 (p. 310) 5. CLRS 14-1 (p. 318)
Rochester - CS - 282
Recurrence: Solve, Prove, Ruminate.Chris Brown September 14, 20051SolveThe problemT (0) = 0T (n) =1 n1 T (i) + cn, n > 0. n i=0Prove your answer. What is the asymptotic order of T (n)? What can you say about generalizations?2Solution (creating a
Washington - ENVH - 453
ENVH 453 October 7, 2008 Problem Set #2 Due 14 October, 2008 I. Select the single best answer. In some cases, a better answer might exist, but has not been included among the choices. Provide your best answer where appropriate, and be prepared to offer it
SUNY IT - MKT - 301
MKT 301 Principles of Marketing Management Dr. John W. Barnes4:00 5:50 PM MW Donovan 1242 Fall 2004Course Description: MKT 301 provides a description and analysis of the ways in which products move to points of consumption within the global economy. Top
SUNY IT - MKT - 301
MKT 301: PRINCIPLES OF MARKETING MANAGEMENT 10:40-11:50 AM MWF; Donovan1242 Fall 2004 Course Syllabus Instructor: John W. Barnes, Ph.D Office: Donovan 1258A Office Hours: MWF 2:00-4:00 PM; And by appointment. Phone: (315) 792-7807 E-Mail: barnesj2@sunyit.
University of Florida - FIN - 4504
Name _Answer Key_ Section (circle one): 4:05 PM, 6:15 PM, 8:20 PM Homework #3 FIN 4504 Karceski Fall 2003 Due on Wednesday, December 10 at the beginning of class Answer all questions (1 through 22). Multiple choice: Please circle the best/most correct res
Minnesota - JERP - 0001
Parent Education Course Comparison - August 28, 2004FE 5698: Introduction to Parent Education: History and Philosophy (1 cr) Overview of the history, philosophy and implementation of parent education programs. This course is required for employment in th
UCCS - CS - 401
Apache Web Server A PAtCHy server: developed by the Apache group formed 2/95 around a number of people who provided patch files for NCSA httpd 1.3 by Rob McCool. History-http:/www.apache.org/ABOUT_APACHE.html First official public release (0.6.2) in Apri
East Los Angeles College - KX - 08126
Kingston University LondonLibrary ServicesEARTH SCIENCE & GEOGRAPHYEarth Science & Geography Journals: Human GeographyAll journals appear on the main Library Catalogue. Take care to note down when the Library began to subscribe to the journal title to
Delaware - CISC - 2602008
Homework: (each of 5 questions are worth 1.5 grade points: max 7.5 points per homework)1. Write the truth table, then draw the logic diagram for 2-bit (AND, XOR, NOR) and a 1-bit NOT. (you may cut and paste the spare parts on the next slide but must labe
Monmouth IL - HONORS - 210
1 Anna E. Prohaska Honors 210 Professor P. Draves September 28, 2005 Personal Born on February 25, 1986 to Dennis and Mary Ann Prohaska was a little girl, and they called her Anna. Like many college students I have been forced to identify myself by my maj
Oakland University - CSE - 60833
INTRODUCTION TO PARALLEL ALGORITHMS AND PROGRAMMINGCSE 40833/60833 - FALL 2007Instructor Scott Emrich Ofce: 351 Fitzpatrick Hall Phone: (574)631-0353; E-mail: semrich@nd.edu Ofce hours: 10-11:30am, Wed and Fri and by appointment Overview This course wil
Michigan State University - EXAMS - 260
EEP 260: Study Guide for Exam I 2007Topics covered: Whats Development? Whats the Food Problem? How Can LDCs Increase Their Food Production? Source of Questions: Questions will draw on the readings (study questions), lectures, and videos. Structure of the
UMass (Amherst) - RESEC - 460
RESEC 460 - FAMILY ECONOMICS T,Th: 11:15 -12:30 137 Hasbrouck Spring 2003 Professor: M.J. Alhabeeb Office: 212A Stockbridge Hall Phone: 545-5010 Office Hours: T,Th: 3:45-5:00, or by appointment Course Description and Objectives: The major objective of thi
Toledo - GGR - 117
UNIVERSITY OF TORONTO AT MISSISSAUGAGGR117: WHERE ON EARTH?2004/2005 LANDSCAPES OF S-ONTARIO: WHERE?. WHEN. WHAT?. WHY? EXERCISE-1 OBJECTIVES The major objective of this assignment is to learn landscape interpretation, to understand the interrelationshi
UCSD - MAE - 250
MATS 258/MAE 250 - Medical Device Materials and Applications (UC San Diego, Spring 2009)Instructors: Dr. Eunsung Park (Medtronic), Stents, Pacemakers, Implant Materials/Devices Prof. Sungho Jin (UCSD), Advanced/Functional Materials for Implants, Imaging/
Washington - CS - 466
Features High-performance, Low-power AVR 8-bit Microcontroller Advanced RISC Architecture 131 Powerful Instructions Most Single-clock Cycle Execution 32 x 8 General Purpose Working Registers Fully Static Operation Up to 16 MIPS Throughput at 16 MHz On-c
Washington - CS - 466
MAX232, MAX232I DUAL EIA-232 DRIVER/RECEIVERSLLS047H FEBRUARY 1989 REVISED FEBRUARY 2002D D D D D D D D DDOperates With Single 5-V Power Supply LinBiCMOS Process Technology Two Drivers and Two Receivers 30-V Input Levels Low Supply Current . . . 8 mA
Washington - CS - 466
r rTSL230R-LF, TSL230AR-LF, TSL230BR-LF PROGRAMMABLE LIGHT-TO-FREQUENCY CONVERTERSTAOS079 - JANUARY 2006D High-Resolution Conversion of Light D D D D D D D DIntensity to Frequency With No External Components Programmable Sensitivity and Full-Scale Out
Washington - CS - 466
User ManualTDS3000 Series Digital Phosphor Oscilloscopes 071-0274-01This document supports firmware version 2.00 and above.Copyright Tektronix, Inc. All rights reserved. Tektronix products are covered by U.S. and foreign patents, issued and pending. In
Washington - CS - 466
Intel StrongARM SA-1100 MicroprocessorDevelopers ManualAugust 1999Order Number: 278088-004Information in this document is provided in connection with Intel products. No license, express or implied, by estoppel or otherwise, to any intellectual propert
Washington - CS - 466
aFEATURES 2-Axis Acceleration Sensor on a Single IC Chip Measures Static Acceleration as Well as Dynamic Acceleration Duty Cycle Output with User Adjustable Period Low Power <0.6 mA Faster Response than Electrolytic, Mercury or Thermal Tilt Sensors Bandw
Washington - CS - 466
$SSOL.DWLRQ1RWHV7KLVSDJHDQGDOOOLQNHGGR.XPHQWVKDYHEHHQZULWWHQE\/HLWQHU+DUDOG 7KH.UHDWLRQRIPDNHILOHV 0DNHILOHVSURYLGHWKHSRVVLELOLW\RIWUDQVODWLQJRZQSURJUDPVHIIL.LHQWO\ +HUH,GHV.ULEHKRZ\RXKDYHWRDOWHUWKHPDNHILOHVIRU\RXURZQSURJUDPV PDNHGR.SGI 7KH.RPELQDWLRQRI
Oakland University - EG - 120
Spring 2000 means - EG 120 - Test 1 : 27.5 / 30 Test 2 : 24.0 / 30 Test 3 : 21.3 / 30 Project : 13.5 / 15 (with a max of 18 with extra credit) Final Exam : 35.3 / 50
Cornell - ENGRD - 221
ENGRD 221 Prof. N. Zabaras HOMEWORKS 7 & 8 Handed out: Thursday, 11 October 2007 Due: Monday, 22 October 2007 by 5 pm10/11/2007Notes: 1. Drop HW off in the designated homework box in Upson 123 2. Be sure that you indicate your recitation section (and yo
National Taiwan University - MKT - 846
Decision MakingMKT 846 Professor WestAgenda Lookingback.What clues can our "information processing model" provide? Evaluating Ad Effectiveness The Art of Persuasion Whatshould Levi Strauss & Co. be doing? Relating attitudes to choiceThe role of
Wisc Eau Claire - WCC - 0708
2007 Blugold Open Hosted by University of Wisconsin Eau Claire Whitetail Golf Course September 21st, 2007 = WOMENS TEAM SCORE = = 6k Open = 1. 57 UW-La Crosse ( 24:20 2:01:39) = 1 6 Kristen Howe 24:07 2 7 Meghan Dugan 24:08 3 9 Katelyn Williams 24:13 4 11
Washington University in St. Louis - CSE - 131
CSE 131 Quest 1: Conditional Statements and TestingLab Section C, 2:30-4pm Wednesday, September 29, 2004This is an exam. You may use your notes and you may also use the CSE 131 web site. You may ask the TAs to clarify the directions, but there is to be
Michigan State University - CPS - 360
CPS 360 Review: Worksheet I Part I: Problems These questions are designed to make you restate what the major focus of this course is. 1. In this course, we have said we use computers for one main purpose. What is that purpose?2. In this course, we want t
Cornell - HASH - 0177
Biological Pest Management AGR 121Course Description Thiscoursewillemphasizethebuildingandmaintainingofhealthysoil,plantandinsectbiologicalcyclesasthekeytopestand diseasemanagement.Coursecontentincludesstudyofmajorcroppestsanddiseases,includingstructure,
Clarkson - MA - 383
MATH 383 SAMPLE TEST TWO ANSWER KEY Spring 2006Part One: True/False Circle T for true and F for false. 1. F If the relationship between X and Y is dened by the equation Y = 3X 5 then the correlation between X and Y will be zero. 2. T The correlation coec
Auburn - E - 7250
Independent Fault SetsRavi Chandra Paruchuri Auburn University Auburn , Alabama. Abstract This paper discusses the generation and use of independent fault sets in order to obtain the more global approach to automatic test generation. Independent faults w
Winona - COURSE - 410
COPOLYMER EQUATION n = proportion of monomer 1 and monomer 2 being incorporated into a polymer at some point in the reaction. This is given by the change in concentration of monomer 1 relative to monomer 2 as shown below. n = d[M1] d[M2] = (k11[M1][M1*] +
LSU - APPL - 003
Common Professional Staff Titles and Salary Ranges - July 2007 (based on 12 month salary levels) Title CodeN655 N655 N541 N541 N541 N332 N332 N257 N257 N088 N088 N088 N088 N650 N650 N650 N536 N536 N536 L862 L862 L862 L862 N269 N269 F775 F774 F731 F731 F7
Stanford - MERQE - 1035
Case 5:05-cv-03395-JFDocument 206Filed 01/23/2007Page 1 of 151 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28JOEL H. BERNSTEIN (admitted pro hac vice) CHRISTOPHER J. KELLER (admitted pro hac vice) LOUIS GOTTLIEB (admitted pr
USC - CS - 510
University of Southern CaliforniaCenter for Systems and Software EngineeringUniWord Case StudyCS 510 Fall 2007 Barry Boehm, USCUniversity of Southern CaliforniaCenter for Systems and Software EngineeringUniWord Case Study Background The Competition
RPI - BCBP - 4870
Protein Structure Determination, BCBP 4870, Fall 2007 Homework 2 due Nov 8, 2007 (A) Using a Bragg plane diagram, explain why a crystal with P2 symmetry (2-fold screw along the c1axis), has only even-numbered reflections in the c* direction. i.e. (001),
SUNY Buffalo - CSE - 563
Knowledge Representation and Reasoning Logics for Articial IntelligenceStuart C. ShapiroDepartment of Computer Science and Engineering and Center for Cognitive Science University at Bualo, The State University of New York Bualo, NY 14260-2000 shapiro@cs
SUNY Buffalo - CSE - 563
Knowledge Representation and Reasoning Logics for Articial IntelligenceStuart C. ShapiroDepartment of Computer Science and Engineering and Center for Cognitive Science University at Bualo, The State University of New York Bualo, NY 14260-2000 shapiro@cs