4 Pages

1213901598-1

Course: ARH 2050, Summer 2008
School: UCF
Rating:
 
 
 
 
 

Word Count: 896

Document Preview

of History Western Art I Prof. Margaret Ann Zaho ARH 2050.B001 Summer B 2008 Course Information: Course name: History of Western Art I Course id and section: ARH 2050.B001 Semester /Year: Summer 2008 Class meeting days: MTWTH 10:00 11:50 Course meeting location: COM 101 Credit hours: 3 credit hours Contact Information: Instructor: Margaret Ann Zaho, Ph.D. Office location: VAB 203 Office hours: T 9:00- 10:00...

Register Now

Unformatted Document Excerpt

Coursehero >> Florida >> UCF >> ARH 2050

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.
of History Western Art I Prof. Margaret Ann Zaho ARH 2050.B001 Summer B 2008 Course Information: Course name: History of Western Art I Course id and section: ARH 2050.B001 Semester /Year: Summer 2008 Class meeting days: MTWTH 10:00 11:50 Course meeting location: COM 101 Credit hours: 3 credit hours Contact Information: Instructor: Margaret Ann Zaho, Ph.D. Office location: VAB 203 Office hours: T 9:00- 10:00 & 12:00 -1:00 Office phone: 407-823-5620 E-mail: mzaho@mail.ucf.edu (preferred method of contact) Required Textbook: Kleiner, Fred S., and Christin J. Mamiya. Gardner's Art Through The Ages: The Western Perspective; Volume I. 12th edition (or new 13th edition). Course Description: Painting, sculpture, and architecture from the Prehistoric era through the Gothic. Course Objectives: Students will be able to identify specific examples of artistic production from each of the periods covered in this course. Students will have a basic knowledge of the historical and cultural factors that shaped the art of each culture or period. Students will have a basic knowledge of terms associated with each period and culture, and technical terms related to art production. Students will recognize and understand the specific characteristics that represent the artistic production of a particular culture, dynasty, region, or ruler. Students will have a basic understanding of the different materials, mediums, tools, and techniques used in the artistic production for each period. Prerequisites: None Evaluation and Grading: A plus/minus grading system is used in this course. Grade Scale: Letter Grade Numerical Grade Grade Points A 100 95 4.00 AB+ B BC+ C CD+ D DF 94 90 89 87 86 83 82 80 79 76 75 73 72 70 69 67 66 64 63 60 59 and below 3.75 3.25 3.00 2.75 2.25 2.00 1.75 1.25 1.00 0.75 0.74 Exams: There are 3 exams (celebrations of knowledge) in this course. The exams are weighted 30%, 35%, and 35%. Grades are not curved. Examination Method: Exams are administered in a multiple-choice format. Exams will include image identifications, terms, definitions, maps, contextual, and historical questions. A raspberry scantron is needed for each exam. Students must know and provide their correct PID on the scantron form; failure to do will result in a penalty of 4 points. Note: There are no make-up exams (except in cases of documented Medical Emergency). If a student misses an exam due to a medical emergency the Instructor must be notified within 24 hours. There is no extra credit of any kind. Attendance: Attendance is not taken in class. However, it is imperative that students attend all lectures in order to do well in this course. If a student misses a class it is recommended that the student get the notes from a classmate. The instructor will not provide written notes or power-point images for lectures missed. Advisement: The Art Department affirms that a theoretical and working understanding of the historical meanings and studio applications of the human image are critical in education the of visual art and art history students. To develop such an understanding, Art Department courses often utilize images of clothed and unclothed human figures and, in certain studio classes, live nude models. Course material will include information that pertains to various religions or religious beliefs/practices, in particular Western Christianity. Lecture and Exam Schedule: Week 1: M T 6/23 6/24 Intro / Stone Age Stone Age / Near East 2 W TH 6/25 6/26 Near East Egypt Week 2: M T W TH M T W TH 6/30 7/1 7/2 7/3 7/7 7/8 7/9 7/10 Egypt Egypt Aegean EXAM 1 Greece Greece Greece Greece/ Rome Week 3: Week 4: M T W TH 7/14 7/15 7/16 7/17 Rome Rome Rome EXAM 2 Week 5: M T W TH 7/21 7/22 7/23 7/24 Early Christian Early Christian Byzantine Byzantine Week 6: M T W TH 7/28 7/29 7/30 7/31 Early Medieval Early Medieval Romanesque FINAL EXAM Technology: Students are expected to be able to send and receive e-mail. Students are expected to be able to use and download materials from Web CT. Students must be able to access grades using My UCF grades. Laptops are permitted for note-taking during class. A student using their computer for other purposes during class time can be asked to leave. Tape recorders are not permitted. No video of any kind for any purpose is permitted. Policies: This course is conducted, and students are expected to behave, in accordance with the UCF Golden Rule. 3 The Golden Rule, published annually by the Office of Student Conduct, describes university standards for students regarding their conduct in the university community and their rights and responsibilities. Students are expected to conduct themselves in accordance with the UCF Creed. The UCF Creed Integrity, scholarship, community, creativity, and excellence are the core values that guide our conduct, performance, and decisions. Integrity I will practice and defend academic and personal honesty. Scholarship I will cherish and honor learning as a fundamental purpose of my membership in the UCF community. Community I will promote an open and supportive campus environment by respecting the rights and contributions of every individual. Creativity I will use my talents to enrich the human experience. Excellence I will strive toward the highest standards of performance in any endeavor I undertake. Common Courtesy: Cell phones must be turned off during class. Education is a privilege. The classroom is a place of learning. Individuals are expected to exercise common courtesy; no loud talking, no talking during lecture, no music during lecture, no playing games, no reading newspapers. If the behavior of a student is determined by the Instructor to be disruptive, rude, inflammatory, or disrespectful, that student will be asked to comply with common courtesy guidelines. If the student does not comply, the student will be asked to leave. Dismissal from the class will result in failure of the course. This syllabus is subject to change/revision at the Instructor's discretion. 4
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:

UCF - ARH - 2050
History of Western Art I Prof. Margaret ZahoCourse Image List: History of Western Art IYou are required to know all of the information listed here as well as the relative size and medium of each object. You must also know the maps and relevant geo
UCF - ARH - 2050
History of Western Art I Prof. Margaret ZahoCourse Image List: History of Western Art IYou are required to know all of the information listed here as well as the relative size and medium of each object. You must also know the maps and relevant geo
Berkeley - EE - 40
UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer SciencesEE40 Homework 1Summer 2008Due 5:00PM on Wednesday, July 2nd, 2008 in the "EE40" box in 240 Cory 1. Problem 1.7 (Hambley, 4th Edi
Berkeley - EE - 40
UNIVERSITY OF CALIFORNIA, BERKELEY EE40 Summer 2008 Lab 2Equivalent Circuits GuideImportant Notes Please make sure the current limit set higher than the current required by the circuit but lower than 2 amps. This is to ensure that you provide y
Berkeley - EE - 40
UNIVERSITY OF CALIFORNIA, BERKELEY EE40 Summer 2008 Lab 1 Introduction to Circuits and Instruments Guide1. Objectives The electronic circuit is the basis for all branches of electrical engineering. In this lab, basic electronic circuit theory, elect
Berkeley - EE - 40
UNIVERSITY OF CALIFORNIA, BERKELEY EE40 Summer 2008 Lab 1 Introduction to Circuits and Instruments PrelabName_ Session/TA_1. Two resistors are connected in parallel to an ideal voltage source of 5 V. Choose the value of R2 so that the total current
Berkeley - EE - 40
UNIVERSITY OF CALIFORNIA, BERKELEY EE40 Summer 2008 Lab 1 Introduction to Circuits and Instruments ReportName/SID: _ Name/SID: _ Section/TA: _ Part I: Instrument practice (a) Record the voltages measured from the instruments below Power Supply Multi
Berkeley - EE - 40
Name:_ Student ID:_ Section:_ Date:_UNIVERSITY OF CALIFORNIA, BERKELEY EE40 Summer 2008 Lab 2Equivalent Circuits PrelabNOTE: Many of these theoretical values will be used in your lab. Please record your theoretical values in questions 2 and 5 of
Berkeley - EE - 40
Name:_ Student ID:_ Name:_ Student ID:_ Section:_ Date:_UNIVERSITY OF CALIFORNIA, BERKELEY EE40 Summer 2008 Lab 2Equivalent Circuits ReportEquivalent Resistor Networks1) Step1: Max Current through resistor network:_ 2) Step 2: Resistance acros
Berkeley - EE - 40
UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer SciencesEE40 Homework 2Summer 2008Due 5:00PM on Wednesday, July 9th, 2008 in the "EE40" box in 240 Cory 1. Problem 2.58 (Hambley, 4th Ed
Berkeley - EE - 40
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresLecture 15 Floating Point I 2008-02-27TA Ordinaire Dave JacobsQuote of the daywww.ocf.berkeley.edu/~djacobs "Doomsday" Seed Vault Opens"The seed bank on a remote island near the Arctic O
Berkeley - CS - 61c
UC Berkeley CS61C : Machine StructuresLecture 16 Floating Point II 2008-02-29inst.eecs.berkeley.edu/~cs61cReviewExponent tells Significand how much (2i) to count by (., 1/4, 1/2, 1, 2, .) Floating Point lets us: Represent numbers containing
Berkeley - CS - 61c
UC Berkeley CS61C : Machine StructuresLecture 17 Instruction Representation III 2008-03-03TA Matt Johnsoninst.eecs.berkeley.edu/~cs61c-tminst.eecs.berkeley.edu/~cs61ciPhone games! (and general SDK) Apple is (finally) releasing an iPhone Softw
Berkeley - CS - 61c
UC Berkeley CS61C : Machine StructuresLecture 17 Instruction Representation III 2008-03-03TA Matt Johnsoninst.eecs.berkeley.edu/~cs61c-tminst.eecs.berkeley.edu/~cs61cReview MIPS Machine Language Instruction: 32 bits representing a single inst
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61c CS61C : Machine StructuresReview C program: foo.c Compiler Assembly program: foo.s Assembler Object(mach lang module): foo.o lib.o Executable(mach lang pgm): a.out Loader Memory Linker Lecture #20 Introduction
Berkeley - CS - 61c
3/14/08inst.eecs.berkeley.edu/~cs61cReview ISA is very important abstraction layerContract between HW and SWCS61C : Machine StructuresLecture #21 State Elements: Circuits that Remember 2008-3-14 Scott Beamer, Guest Lecturer3.141592653589
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresLecture #1 Introduction 2008-01-23"I stand on the shoulders of giants."There is one handout today at the front and middle of the room!Lecturer SOE Dan Garcia www.cs.berkeley.edu/~ddgarc
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61cCS61C : Machine Structures2007-01-25Review Continued rapid improvement in computing 2X every 2.0 years in memory size; every 1.5 years in processor speed; every 1.0 year in disk capacity; Moores Law enables proces
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresNumber review.META: We often make design decisions to make HW simpleLecture 3 Introduction to the C Programming Language (pt 1) 2008-01-28Hello to Dev Anand from Pune, Maharashtra, INDI
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresMore C Pointer Dangers Declaring a pointer just allocates space to hold the pointer it does not allocate something to be pointed to! Local variables in C are not initialized, they may cont
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresReview Pointers and arrays are virtually same C knows how to increment pointers C is an efficient language, with little protection Array bounds not checked Variables not automatically in
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresReview Use handles to change pointers Create abstractions (and your own data structures) with structures Dynamically allocated heap memory must be manually deallocated in C. Use malloc()
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresReview C has 3 pools of memory Static storage: global variable storage, basically permanent, entire program run The Stack: local variable storage, parameters, return address The Heap (dyn
Berkeley - CS - 61c
inst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresLecture 8 Introduction to MIPS Assembly language : Arithmetic 2008-02-08Ni Hao to Yi Chen from CHINA!Review Several techniques for managing heap w/ malloc/free: best-, first-, next-fit,
Berkeley - CS - 61c
UCBCS61C:MachineStructuresLecture9IntroductiontoMIPS DataTransfer&DecisionsI LecturerSOE DanGarcia HitoNickCarlsonfrom UNorthernColorado inst.eecs.berkeley.edu/~cs61cReview InMIPSAssemblyLanguage: Registersreplacevariables OneInstruction(s
Berkeley - CS - 61c
UCBCS61C:MachineStructuresLecture10IntroductiontoMIPS DecisionsII LecturerSOE DanGarcia Obamasweeps8thstate inarow;it'sgettingtight! inst.eecs.berkeley.edu/~cs61cReview Memoryisbyteaddressable,butlwandswaccessonewordatatime.20080213 A
Berkeley - CS - 61c
UCBCS61C:MachineStructuresLecture11IntroductiontoMIPS ProceduresI LecturerSOE DanGarcia inst.eecs.berkeley.edu/~cs61cReview Inordertohelptheconditionalbranchesmake20080215 Internet2,anonprofitadvancedUS networkingconsortium,isdesigninga "
Berkeley - CS - 61c
UCBCS61C:MachineStructuresLecture12IntroductiontoMIPS ProceduresII&LogicalOps LecturerSOE DanGarcia inst.eecs.berkeley.edu/~cs61cReview Functionscalledwithjal,returnwithjr $ra. Thestackisyourfriend:Useittosaveanything20080220 youneed.Jus
Berkeley - CS - 61c
UCBCS61C:MachineStructuresLecture13 MIPSInstructionRepresentationI LecturerSOE DanGarcia inst.eecs.berkeley.edu/~cs61c61CLevelsofRepresentation(abstractions)High Level Language Program (e.g., C)20080222 Compiler Assembly Language Program
Berkeley - CS - 61c
UCB CS61C : Machine StructuresLecture 14 MIPS Instruction Representation IILecturer SOE Dan Garciainst.eecs.berkeley.edu/~cs61cReview Simplifying MIPS: Define instructions to be2008-02-25IBM wants to use "self-assembling" nanotechnology to
Berkeley - CS - 61c
UCB CS61C : Machine StructuresLecture 18 Running a Program I(Compiling, Assembling, Linking, Loading)Lecturer SOE Dan Garciainst.eecs.berkeley.edu/~cs61cReview Disassembly is simple and starts bydecoding opcode field.2008-03-04 Be crea
Berkeley - CS - 61c
UCB CS61C : Machine StructuresLecture 19 Running a Program II(Compiling, Assembling, Linking, Loading)Lecturer SOE Dan Garciainst.eecs.berkeley.edu/~cs61cWhere Are We Now?2008-03-0620000 15000 10000 5000 01998 1999 2000 2001 2002 2003 20
Berkeley - CS - 61c
UC Berkeley CS61C : Machine Structures Representations of Combinatorial Logic Circuits inst.eecs.berkeley.edu/~cs61cCombinational Logic FSMs had states and transitions How to we get from one state to the next? Answer: Combinational LogicLectur
Berkeley - CS - 61c
UC Berkeley CS61C : Machine Structures Lecture 23 Combinational Logic Blocks 2008-03-19 Lecturer SOE Dan Garciainst.eecs.berkeley.edu/~cs61cReview Use this table and techniques we learned to transform from 1 to anotherwww.cs.berkeley.edu/~
Berkeley - CS - 61c
Five Elements of a Computer CS61C ReviewMidterm Spring 2008 Control Datapath Memory Input OutputNegative Numbers Sign/Magnitude One's Complement Two's Complement Pros, Cons of Each C TopicsPointers! malloc, free Handles Pass by V
Berkeley - CS - 61c
Question 1: You must be kidding! (groan) (15 pts, 40 min)We have a simple linked list that consists of kids' names (a standard C string) and the grade they are in an integer between 0 (Kindergarten) and 12. The structure appears as follows, with an
Berkeley - CS - 61c
Question 1: You must be kidding! (groan) (15 pts, 40 min)We have a simple linked list that consists of kids' names (a standard C string) and the grade they are in an integer between 0 (Kindergarten) and 12. The structure appears as follows, with an
Korea University - COMPUTER S - 583
Korea University - COMPUTER S - 583
Korea University - COMPUTER S - 664
Traditional DIY approachDIY approach Do everything by yourself Design hardware CPU, Peripherals I/O and Memory address mapping Entire software ROM Bios or Monitor program Interrupt processing Application functions In charge of entire CPU
Korea University - COMPUTER S - 664
QoS-Driven Optimal Resource ManagementChang-Gun Lee Seoul National UniversityResource Assignment Problem Resources: CPU, Bandwidth, etc. Resource Assignment Problem: How much resource should be assigned to real-time tasks? Always satisfy minim
Korea University - COMPUTER S - 583
22.2 a) 1) The root of r is an articulation point of G The root of G has at least two children. - let r be the root of G. If r has no child, the G has only one vertex r. Thus r is not articulation point of G according to definition. If r has one chi
Korea University - COMPUTER S - 583
Korea University - COMPUTER S - 525A
Final Exam, Spring Semester, 2008 Data Networks Professor: Sunghyun Choi 2008-06-13 (Fri), 11am-1pm 1. (20 points) Consider a slotted Aloha with an infinite set of nodes and with "perfect capture." That is, ifmore than one packet are transmitted i
Korea University - COMPUTER S - 583
4-6 VLSI chip testingThere are four possible outcomes of a test#of good chips is more than n/2Chip A says 1. B is good2. B is good 3. B is bad 4. B is badChip B says Conclusion A is good both are good or both are bad A is bad at least A is
Korea University - COMPUTER S - 664
Scheduling of Aperiodic and Sporadic Jobs in Priority-Driven Systems - Chapter 7 (Fixed-Priority Framework)Types of Aperiodic Requests The jobs of an aperiodic task have random release times Soft aperiodic tasks: random arrivals such as a Poiss
Korea University - COMPUTER S - 664
Resources and Resource Access Control (only on Fixed-Priority System)- Chapter 8 -Overview Resource access (Mutual Exclusive) Priority inversion Unbounded priority inversion Resource access control protocol Priority inheritance protocol Pri
Korea University - COMPUTER S - 664
Real-Time Task Model - Chapter 3 -"Monolithic approach" Good enough? No! For a complex system, it is really hard to design a single superloop Really hard to validate cross-related temporal requirements So, we need a more structured way to look
Korea University - COMPUTER S - 664
Real-time Communications over Wireless Sensor NetworksInstructor: Chang-Gun LeeForest Monitoring Sensor NetworksPeriodic monitoring of forest Fast delivery of emergency event1Rescue Supporting Sensor NetworksPeriodic messages message deli
Korea University - COMPUTER S - 583
Korea University - COMPUTER S - 664
Real-Time SystemsChan-Gun LeeWhat are real-time embedded systems? Embedded Systems Cell phones, PDAs Digital cameras Microwave ovens Multimedia systems such as DVR, VOD server, etc Factory process control Radar systems Avionics Most of e
Korea University - COMPUTER S - 664
Real-Time and Embedded Systems ? - Chapter 1 & 2 -Definition is not clear!1Let's take a look at "examples"Cell phones, PDAs Digital cameras Microwave ovens Network adaptor box (e.g., ISDN adaptor) Multimedia systems such as DVR, VOD server, et
Korea University - COMPUTER S - 664
Monolithic Design ApproachISDN Terminal Adaptor (HW)TimerCPU 80186Text/ImageD/A A/DROM RAMVoice HandsetSiemens Siemens ITAC ISAC1ISDN Terminal Adaptor (SW) Control Plane: Protocol Processing Layer 2: LAPD Data link management Lay
Korea University - COMPUTER S - 664
Priority-Driven Scheduling of Periodic Tasks - Chapter 6 (Dynamic Priority (2)Summary All of the above schedulability check works only under limited conditions Preemptable at any time Context switch overhead is negligible Scheduling decision i
Korea University - COMPUTER S - 664
Objected-Oriented Real-Time System DesignMotivations Next-Generation real-time systems become Complicated Distributed Networked Examples Military unmanned command/control system City-wide disaster monitoring and management system Hospital
Korea University - COMPUTER S - 664
Real-Time Ubiquitous System: A Case Study"Combined Scheduling of Sensing and Communication for Real-Time Indoor Tracking in Assisted Living" RealLiving"M.-Y. Nam M.CS Dept. UIUCM. Z. Al-Sabbagh C.-G. Lee, J. Kim, M. Yoon AlC.ECE Dept. Ohio State
Korea University - COMPUTER S - 664
Inter-process communication (FIFO and Shared Memory)RTOS Support NOT necessarily responsible everything RTOS system callsTask Managementpthread_create pthread_setschedparam/ pri. sched pthread_make_periodic_np pthread_wait_np pthread_delete_np
Korea University - COMPUTER S - 664
Power Aware SchedulingMotivations PDAs and Pocket PCs Display, processor, hard disk, and wireless LAN card are main sources of power consumption Processor may consume up to 25% of the system power for laptop computers Technology advance in proc
Korea University - COMPUTER S - 664
Scheduling of Aperiodic and Sporadic Jobs in Priority-Driven Systems - Chapter 7 (Dynamic Priority Framework)Dynamic priority servers We focused on fixed priority servers so far. Such servers can be used along with RM. Now, we will focus on dyna
Korea University - COMPUTER S - 664
WCET AnalysisOverview Measurement method vs. Analytical method Simple analytical method Architecture-aware analysis1Why analytical methods? Measurement does NOT guarantee WCET The execution time depends on branches taken, loop count, cach