Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!
|
|
|
Study Smarter, Score Higher
Here are the top 5 related documents
...Supreme Court of Canada Beatty v. The King, [1944] S.C.R. 73 Date: 1944-01-06 Douglas R. Beatty Appellant; and His Majesty The King Respondent.
1943: October 6, 7; 1944: January 6. Present: Duff C.J. and Davis, Kerwin, Hudson, Taschereau and Rand JJ....
...SUPREME COURT OF CANADA Sweitzer v. The Queen, [1982] 1 S.C.R. 949 Date: 1982-06-23 James Dennis Sweitzer (Accused/Appellant) Appellant; and The Queen (Respondent) Respondent. File No.: 16277. 1982: February 8; 1982: June 23. Present: Laskin C.J. and...
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one
below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
hackers Curious Vandals Industrial spies Accidental data disclosure Solution? A computer or computer software that prevents unauthorized access to private data (as on a company s local area network or intranet) by outside computer users (as of the Internet) By definition, firewall is a combination of hardware and software. Architecture Functions Single Layer functions concentrated on one host, small number of networks inter-connected cost-effective, easy to maintain susceptibility to implementation flaws or configuration errors Multi-Layer firewall functions distributed on a number of hosts Greater security, can use different tech in different hosts to reduce implementation flaws and configuration errors Costly, difficult to design, configure and operate packet filtering : simple, fast application proxies : complex, slow combination of above two (stateful inspection packet filters) Packet filtering Executed by routers (or host acting as router) Checking packet headers(e.g. source IP, destination IP, protocol, port) High level performance coming from low layer configuration IP address filtering TCP/UDP port filtering Client TCP/UDP port filtering Stateful inspection packet filters Filtering decision based on inspection of both header and payload Provide more complex access control General purpose computer Unlimited functional extensibility Special purpose router Highest performance Large number of interfaces Minimal functional extensibility May require more memory Moderate performance Small number of interfaces OS Application vulnerabilities Proxy Proxy forward traffic in two/one direction Proxy running on proxy machines or general purpose computers TIS Trusted Information System A set of programs and configuration practices Designed to run on UNIX systems using TCP/IP with Berkeley-style socket interface The host connected to Internet and private network Routing between Internet and private network disabled Private network invisible to Internet except host, which provides proxies to services Packet screening capability of router Traffic permitted only to bastion host Most common, most flexible Screening router can be configured to permit nodes on private network to directly access Internet via TELNET or FTP A sandbox network between Internet and private network Nodes on Internet and private network can only communicate with sandbox network Application gateways handle store and forward traffic and some types of interactive traffic Log/audit traffic Tn-gw : TELNET protocol proxy Rlogin-gw : Rlogin Ftp-gw : FTP protocol proxy Plug-gw : Generic TCP plug-board proxy Netacl manages network access control Permit access based on client s network address and service requested No support for UDP security, disabled System call chroot before invoking service so that service is performed in an empty directory and no executables are available for attackers Rely on IP address and/or host names Susceptible to IP spoofing via sourcerouting Router capable of screening source routed packets is necessary
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more.
Course Hero has millions of course related materials that will enable you to learn better,
faster and get an A in all your courses.
Below is a small sample set of documents:
Below is a small sample set of documents:
Rochester >> CSC >> 258 (Fall, 2009)
Treadmarks Shared Memory Computing on Networks of Workstations Hongzhou Zhao 2007/3/21 Treadmarks: Shared Memory Computing Distrbuted shared Memory System - Consist of N networked workstations, each with its own memory, connected by a network - A g...
Rochester >> CSC >> 254 (Fall, 2009)
Questions not answerable by a CFG Semantics: Context-Sensitive Analysis Is x a scalar, an array, or a function? Is x declared before it is used? Are any names declared but not used? Which declaration of x does this reference? Is an expre...
Rochester >> CSC >> 254 (Fall, 2009)
LR Parsers SLR(1) LR(0) items (construct DFA for recognizing viable prefix with no lookahead), use FOLLOW information to More guide reductions general LALR(1) merge states of LR(1) with same core (LR(0) items) LR(1) store lookahead information ...
Rochester >> CSC >> 458 (Fall, 2009)
Where we are Parallelism, dependences, synchronization Patterns of parallelism data parallelism task parallelism Programming Languages Concurrent languages e.g., Occam, SR, Java, Ada Compiler-supported extensions e.g., HPF Library packages ...
Rochester >> CSC >> 458 (Fall, 2009)
Basics of Parallelization Dependence analysis Synchronization Events Mutual exclusion Steps in the Parallelization Decomposition into tasks Expose concurrency Assignment to processes Balancing load and maximizing locality Orchestration N...
Rochester >> CSC >> 256 (Fall, 2009)
File Systems of Solid-State Drives A Brief Teaching by Mark Veronda Tuesday, November 4, 2008 Tuesday, November 4, 2008 1 Outline Background Solid-State Drives (SSD) History and Motivations Properties Implications Log-Structured (LS) File S...
Rochester >> CSC >> 458 (Fall, 2009)
Processes or Threads A process or thread is a potentially-active execution context Processes/threads can come from Multiple CPUs Kernel-level multiplexing of single physical CPU (kernel-level threads or processes) Language or library-level multi...
Rochester >> CSC >> 173 (Fall, 2009)
CSC 173 Midterm Examination October 25th, 2005 Total: 75 points This is a closed book, closed notes exam. There are a total of 75 points. There is also an additional 5 points of extra credit (as part of your choice in question 5). In all cases, expl...
Rochester >> CSC >> 458 (Fall, 2009)
What is and Why Concurrency? What is a concurrent program? One with more than one active execution context (thread of control) Programming Models Standard models of parallelism shared memory (Pthreads) message passing (MPI) data parallel (Fort...
Rochester >> CSC >> 258 (Fall, 2009)
Why Threads Cant be a library - and - The Java Memory Model CS 458 28 February 2007 Matt Post CSPicture@ University of Rochester 28 February 2006 Matt Post Big 2/458 @ University of Rochester 20 October 2007 Review Memory consistency models A...
Rochester >> ECO >> 510 (Fall, 2009)
An Exploration of the Forward Premium Puzzle in Currency Markets Ravi Bansal Duke University A standard empirical nding is that expected changes in exchange rates and interest rate differentials across countries are negatively related, implying that...
Rochester >> ECO >> 108 (Fall, 2009)
ECONOMICS 108 FINAL EXAM with ANSWERS Fall, 1997 There are 120 points on this exam, allocated as marked in parentheses after each problem. You have 3 hours. Print Name_ Sign Name__ ID Number_ Page 2_ Page 3_ Page 4_ Page 5_ Page 6_ Page 7...
Rochester >> ECO >> 108 (Fall, 2009)
ECONOMICS 108, Fall, 1998 Second Midterm Professor Stockman There are 100 points on this exam. You have 55 minutes. Answers 1. Comment: \"A seller has an incentive to make its product fall apart quickly so that people have to replace it, raising d...
Rochester >> ECO >> 108 (Fall, 2009)
Is America Number 1? Study Guide Introduction Who\'s Number 1? What does it mean to be Number 1? You might say that your school football team is Number 1, meaning that the team usually beats other teams in its league. A Number 1 hit song sells the mo...
Rochester >> ECO >> 217 (Fall, 2009)
ECO217 Homework 2 Suggested Answers PROBLEM 2.1 Consider three risky assets. The expected returns (in %) on those are: The variance-covariance matrix is For convenience you are also given the inverse variance-covariance matrix: a) Find the express...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 9 The Arbitrage Pricing Theory, APT AIM OF LECTURE 9 Introduce the main arguments behind the APT. Learn how to form risk-free arbitrage portfolios. Understand how non-arbitrage arguments can pin down the structure of expected returns. Show ho...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 10 Empirical Applications of the Capital Asset Pricing Model AIM OF LECTURE 10 Formulate different tests of the CAPM Become familiar with the literature testing the CAPM Form an understanding of the problems involved in empirical testing of t...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 11 Empirical Applications of the Arbitrage Pricing Theory AIM OF LECTURE 11 Formulate different tests of the APT Become familiar with the literature testing the APT Form an understanding of the problems involved in empirical testing of the AP...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 12 Introduction to Options AIM OF LECTURE 12 Learn the terminology of options Learn how to use payoff diagrams Introduce to Put-Call Parity 12.1 WHAT IS AN OPTION? An option is a contract (a financial contract) between two parties. We refer ...
Rochester >> ECO >> 217 (Fall, 2009)
ECO217 FINANCIAL MARKETS: THEORIES & EVIDENCE Spring 2002 Time: Place: Instructor: Mondays and Wednesdays, 2pm to 3.15pm Dewey 2110D Thomas Renstrm Wallis Institute of Political Economy 110 Harkness Hall tel: 275-6834 e-mail: rnsm@troi.cc.rochester...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 7 The Capital Asset Pricing Model AIM OF LECTURE 7 Derive the Capital Asset Pricing Model (CAPM) Become familiar with Fund-Separation results 7.1 OVERVIEW We will derive the (standard) Capital Asset Pricing Model (CAPM) through Mean-Variance...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 8 Relaxing the assumptions: Zero-Beta CAPM, Taxation, and Borrowing-Lending constraints AIM OF LECTURE 8 Relax some of the assumptions underlying the Capital Asset Pricing Model (CAPM) 8.1 ZERO-BETA CAPM Why no risk-free asset? - inflation u...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 6 The Investment Opportunity Set AIM OF LECTURE 6 Derive the Investment Opportunity Set Illustrate investment decisions of individuals 6.1 DERIVING THE INVESTMENT OPPORTUNITY SET In the last lecture we found the portfolios that give the mini...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 13 Introduction to Continuous-Time Finance and Option Pricing AIM OF LECTURE 13 Become familiar with some continuous-time finance Learn how to form hedge portfolios with options Gain understanding of how a no-arbitrage argument underlies the ...
Rochester >> ECO >> 217 (Fall, 2009)
Financial Markets: Theories and Evidence 1 ECO217 Revision Lecture 2 R2.1 RELAXING ASSUMPTIONS UNDERLYING THE CAPM No risk-free borrowing/lending The zero-beta CAPM [Black (1972)]. E[Rj] - E[Rz] = j.(E[Rm] - E[Rz]) where j COV(Rj,Rm)/VAR(Rm)...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 3 Choice Under Uncertainty: Risk and Insurance Premia AIM OF LECTURE 3 Introduce the concept of risk aversion Provide measures of risk aversion Introducing the risk premium Solve for the Markowitz risk premium and analyze its components Intro...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 2 Return, Risk and Choice Under Uncertainty AIM OF LECTURE 2 Calculate return and risk of portfolios using matrix algebra Revise portfolio formation in the context of short sales Revise expected utility and provide a numerical example Show th...
Rochester >> ECO >> 217 (Fall, 2009)
ECO217 Example of Final Examination for Financial Markets: Theories and Evidence INSTRUCTIONS Answer four questions of your choice (of the five below). Write your name clearly on all answer booklets. Pocket calculator is allowed. Formulae attached at...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 5 The Efficient Frontier and MeanVariance Efficient Portfolios AIM OF LECTURE 5 Derive the Frontier Portfolios Analyse the properties of Frontier Portfolios 5.1 DERIVING THE FRONTIER PORTFOLIOS In the last lecture we formulated the optimisat...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 4 Introduction to Mean-Variance Efficient Portfolios AIM OF LECTURE 4 Introduce the intuitive idea behind efficient portfolios Formulate the optimisation problem in order to find efficient portfolios Learn how to differentiate with respect to...
Rochester >> ECO >> 217 (Fall, 2009)
ECO217 Answer to Sample Question 3 Question 3 (20%) Answer True or False (T or F ) T F (a) Two-fund separation is obtained only if there is a risk-free asset. (b) One-fund separation is obtained if returns are identically independently distributed. ...
Rochester >> ECO >> 217 (Fall, 2009)
Recitation 1 Return, Risk and Choice Under Uncertainty INSTRUCTIONS Make an attempt to solve the problems below (you need not to hand in your answers). The TA will go through the problems in the recitation. You are expected to actively participate an...
Rochester >> ECO >> 217 (Fall, 2009)
Financial Markets: Theories and Evidence 1 ECO217 Revision Lecture R.1 INTRODUCTION Course is about financial economics (pricing of risky assets) Three components: 1. 2. 3. Preferences (utility) Portfolios (the set of efficient portfolios is like a ...
Rochester >> ECO >> 217 (Fall, 2009)
Homework 2 Mean-Variance Efficient Portfolios INSTRUCTIONS 1. Solve the Problem 2.1 below (a-d), carefully showing your steps. 2. Hand in your work in the Class on Wednesday, March 20. 3. Your work will be marked and returned to you in respective rec...
Rochester >> ECO >> 217 (Fall, 2009)
ECO217 Sample Questions for Financial Markets: Theories and Evidence AIM OF QUESTIONS These questions give you an idea of the level, structure and type of questions you may expect on the midterm examination (you will have to answer all three question...
Rochester >> ECO >> 217 (Fall, 2009)
ECO217 Suggestion of Topics for Writing Credit INSTRUCTIONS Choose a topic and search for relevant literature. Produce an outline of your essay. Type your essay (5-10 pages), and hand it in on April 22. Prepare a presentation of your essay (10-15min)...
Rochester >> ECO >> 217 (Fall, 2009)
Homework 1 Return, Risk and Choice Under Uncertainty INSTRUCTIONS 1. Solve the two problems below (taken from Lecture 2), carefully showing your steps. 2. Hand in your work in the Class on Wednesday, February 6. 3. Your work will be marked and return...
Rochester >> ECO >> 217 (Fall, 2009)
ECO217 Answer to Question 5A in Example of Final Examination Question 5 A Calculate the theoretical price of the a call option to buy one share. The current share price is 70, the exercise price is 65 and the annual risk free rate is 6%. The option m...
Rochester >> ECO >> 217 (Fall, 2009)
Lecture 1 Return, Risk and Choice Under Uncertainty AIM OF LECTURE 1 Introduction of return and risk Calculate return and risk of portfolios Introduce matrix notation 1.1 NOTATION AND DEFINITIONS USED IN THIS COURSE Notation U( )= utility function (...
Rochester >> SOSP >> 2003 (Fall, 2009)
SIGOPS General chair Michael L. Scott U. of Rochester scott@cs.rochester.edu Program chair Larry Peterson Princeton University llp@cs.princeton.edu Program Committee Brian Bershad Washington Ken Birman Cornell Peter Druschel Rice Dawson Engler Stanfo...
Rochester >> CSC >> 248 (Fall, 2009)
Context Free Grammars So far we have looked at models of language that capture only local phenomena, namely what we can analyze when looking at only a small window of words in a sentence. To move towards more sophisticated applications that require s...
Rochester >> CSC >> 248 (Fall, 2009)
Lecture 16: Applications Using Ordered Alignment Models Many of the problems we have seen so far can be seen as the translation of some source stream of data into a target stream. For instance, in part of speech tagging we have a source stream of wor...
Rochester >> CS >> 247 (Fall, 2009)
p ut s {p z s t n Xoirdv9dvom p u u u ivtrFV%$~Cg$gg$Fx u 5g$Fy`g~0x p t s i!Vd%\"t5v~t4tx t t u z u VgVT\"gVgy`d43x u x p u %vgV zt x ...
Rochester >> CS >> 242 (Fall, 2009)
Comprehensive Final Exam Answers with FFQ(TM) Feature. CSC 242 May 2004 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). There are 120 points. O...
Rochester >> CS >> 242 (Fall, 2009)
b\"8Y2d |dp bdFdd |ee(2xebx bbx2dbxbYQYx|F22pbb\"b x\"sqY2pdek2gb3bdYbxebYYFYdYYeDYbYbebex0d @H82Qb d2b...
Rochester >> CS >> 242 (Fall, 2009)
Second Midterm CSC 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:...
Rochester >> CS >> 242 (Fall, 2009)
Midterm CSC 242 3 March 2005 Write your NAME legibly on the bluebook. Work all problems. You may use three 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 an...
Rochester >> CS >> 242 (Fall, 2009)
Midterm CSC 242 March 2006 Write 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 qu...
Rochester >> CS >> 242 (Fall, 2009)
Success Facilitation Survey: Unit 1. CSC 242 May 2004 Write your NAME legibly on this paper. Open book, open notes. Youre in a startup company working on a shortest-time algorithm for driving in Rochester to bundle with a global positioning system. W...
Rochester >> CS >> 242 (Fall, 2009)
Midterm Answers New, Improved, and Including the Postmortem FFQ Feature [look for square brackets] CSC 242 18 March 2002 Write your NAME legibly on the bluebook. Work all problems. Best strategy is not to spend more than the indicated time on any que...
Rochester >> CS >> 242 (Fall, 2009)
Final with Answers and FFQ (tm) CSC 242 9 May 2003 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. Bayes Nets: 15 Min...
Rochester >> CS >> 242 (Fall, 2009)
Clustering and Classication Chris Brown April 7, 2005 1 Explanation This is actually an assignment from the computer vision class. It sort of shows what a possible classication project would be like, and it has a tutorial about clustering techniqu...
Rochester >> CS >> 242 (Fall, 2009)
Midterm Answers, with FFQ(TM) feature CSC 242 March 2007 Write 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 tha...
Rochester >> CS >> 242 (Fall, 2009)
CSC 242 Written Assignment #1 Knowledge Representation Using Logic Spring 1999 Answer all four questions below. Due date is MARCH 4th. 1. (25 points) Consider the following sentences: a. b. c. d. 2. John likes all kinds of food Apples are fo...
Rochester >> CS >> 242 (Fall, 2009)
Final CSC 242 5 May 2000 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, total of 140). Open book, open notes. Note to Instructor: use of book m...
Rochester >> CS >> 242 (Fall, 2009)
2nd Midterm Exam CSC 242 6 May 2005 Write your NAME legibly on the bluebook. Work all problems. You may use three double-sided pages of notes. Please hand your notes in with your bluebook. The best strategy is not to spend more than the indicated tim...
Rochester >> CS >> 242 (Fall, 2009)
Midterm with Answers and FFQ (tm) CSC 242 6 March 2003 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. Search: 5 Min....
Rochester >> CS >> 242 (Fall, 2009)
Mabel Extending Human Interaction and Robot Rescue Designs Thomas Kollar, Jonathan Schmid, Eric Meisner, Micha Elsner, Diana Calarese, Chikita Purav, Jenine Turner, Dasun Peramunage, Gautam Altekar, and Victoria Sweetser Advised by Dr. Chris Brown De...
Rochester >> CS >> 242 (Fall, 2009)
Jess: AProductionSystemLanguage 4.209AgentBasedVirtualWorlds MaryLouMaherMITFall2002 JessKnowledgeBase A rule-based system maintains a collection of knowledge nuggets called facts. This collection is known as the knowledge base. It is somewhat a...
Rochester >> CS >> 242 (Fall, 2009)
Second Midterm CSC 242 May 2008 Write 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 a...
Rochester >> CS >> 242 (Fall, 2009)
Optical Character Segmentation and Recognition from a Rochester Flag Thomas Kollar and Jonathan Schmid 05/07/02 Abstract This project investigated segmentation and recognition of characters from a Rochester Flag as visual behaviors for landmark reco...
Rochester >> CS >> 242 (Fall, 2009)
Creating a Computer Cop An Integrated Approach to Recognizing Human Eating Activity Peter Barnum, Dominic Marino, Evan Merz, Matt Pelmear, and Dasun Peramunage Under Randall Nelson University of Rochester May 2003 Abstract Food damage causes untold d...
Rochester >> CS >> 242 (Fall, 2009)
Artificial Intelligence in Games: A look at the smarts behind Lionhead Studios Black and White and where it can and will go in the future James Wexler University of Rochester Rochester, NY 14627 jw005i@mail.rochester.edu Keywords: artificial intell...
Rochester >> CS >> 242 (Fall, 2009)
Practical applications of Philosophy in Artificial Intelligence Karim Oussayef Among the sciences, Artificial Intelligence holds a special attraction for philosophers. A.I. involves using computers to solve problems that seem to require human reason...
Rochester >> CS >> 242 (Fall, 2009)
Intelligent Autonomous Agents in Quake David Ganzhorn, William de Beaumont University of Rochester February 27th, 2004 Abstract For several weeks we researched and developed agents that interact with Quake2UR, a version of Quake2 that has been modifi...
Rochester >> CS >> 242 (Fall, 2009)
Adressing CML by Using Line Detection Techniques for More Reliable Sonar Information. Eric M. Meisner, CSC 242Term Project University of Rochester 2003 Abstract The purpose of this paper will be to describe a method for performing concurrent mapping...
Rochester >> CS >> 242 (Fall, 2009)
Kiana Ross CS242 3.23.00 UCPOP: ANALYSIS There are several aspects of partial order planners that are interesting and worth considering. The following paper will examine these aspects as they pertain to UCPOP. This paper will consider three domains: ...
Rochester >> CS >> 242 (Fall, 2009)
A Poker Player Chris Brown The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report January 2006 Abstract This Texas Hold Em client relies on enumerations and probabilities. As parameters, it uses many funct...
Rochester >> CS >> 242 (Fall, 2009)
Artificial Intelligence Beating Human Opponents in Poker Stephen Bozak University of Rochester Independent Research Project May 08, 2006 Abstract In the popular Poker game, Texas HoldEm, there are never more than three moves an agent can make. Howev...
Rochester >> CS >> 242 (Fall, 2009)
Q-Learning and Collection Agents Tom O\'Neill Leland Aldridge Harry Glaser CSC242, Dept. of Computer Science, University of Rochester {toneill, hglaser, la002k}@mail.rochester.edu Abstract Reinforcement learning strategies allow for the creation ...
What are you waiting for?