Electric Machinery

Electric Machinery

Title: Electric Machinery

Author: A. E. Fitzgerald, Charles Kingsley Jr., Stephen Umans

Rating:

Document Preview

ased upon a synchronous speed of ns = 60fe (2/poles) = 826 r/min. If this is done, the equivalent circuit will give exactly the same results as those of part (a).

Unformatted Document Excerpt
Coursehero

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.

upon ased a synchronous speed of ns = 60fe (2/poles) = 826 r/min. If this is done, equivalent the circuit will give exactly the same results as those of part (a).

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:

Montana - PHYS - 295
Montana - PHYS - 295
Montana - PHYS - 295
Montana - PHYS - 295
Montana - PHYS - 295
Phys 295:ExamII7 November 2007Name:K uvl.Q0 pts) The gate is located the endof a 6-ft-widewater AB at channel is supported hingesalongits top edge Knowing and by A, thatthefloor ofthe channel frictionless, is determine reactions the atA andB.gp6
Montana - PHYS - 295
Phys295:ExamI3 October 2007Name:Eachproblern worth 20 points. Showall of your work andassumptions. is 1. Determine forcesin AB andBC (Units:lbs,in) the-T-_-s6*o ( :,j,^ fr. I{c^"^-'ffi))t ,l'"'"'*lne-\u.od T. < : 3G,1" 9 = fo^-
Berkeley - CS - 252
Instructor:John Kubiatowicz, Associate Professor 673 Soda Hall, 643-6817 kubitron@cs.berkeley.edu Office Hours: Monday, 1:00-2:30, 673 Soda HallTeaching Assistant: TBA Location: Lecture: Mon/Wed 2:30-4:00 PM, 310 Soda Hall Catalog Description: Gr
Berkeley - CS - 252
General:ISCA 25-year retrospective (only within Berkeley): [ps,pdf]Reading Assignments:Reading Assignment #1: Due Monday 1/29 Reading Assignment #2: Due Wednesday 1/31 Reading Assignment #3: Due Wednesday 2/7 Reading Assignment #4: Due Monday 2/1
Montana - PHYS - 295
Montana - PHYS - 295
9.11 PROBLEMDetermine by direct integration the moment of inertia of the shadedarea to with respect the.r axis.\ : b : 4r(,-e/-K:6b= rr,a."t-Pf Z,ro{" \,L,e-*J'n"t- ' > b= :rx [ ['t'.ila c ,r(r-.-9 r bJ ^ =t " - * ' l, [ o,
Montana - PHYS - 295
8.8 PROBLEMIfuowing that the coefficientof static friction betweenthe 30-lb block and the incline is ,u" = 0.25, determine(a) the smallestvalue of P to value required maintaintheblock in equilibriura (b) the conesponding ofp.;r-00-o\\,-*-9-L
Montana - PHYS - 295
7.5 PROBLEMDetermine the internal forces at point -I of the sffucture shown.ic f+-rz m..,"_lrn e ttnt<-nI,| ul ra u u gE E H(n|ara ooo roOO-(rlrl {AttfrB ts ",- {r.ro S-n.d*cic{ cl c.{:h"=Nx ( t t " ) -Gt \'")(r.l\t')@
Montana - PHYS - 295
6.90 PROBLEMThe 120N load is removedand a 48-N'm clockrvisecoupleis applied at of the-components the reactions at zuccessively A, D, md E. Detennine .BandF whenthe coupleis applied(a) atA, (b) at D, (c) at E.5)tG 1).r^n -+[BCiiG)$-orce
Montana - PHYS - 295
PROBLEM 6.7using the method of joints, determinethe force in each member of the *ln trussshown. state whethereachmemberis in tensionor compression.$o.\,a -^,.\*l- Ta; ^* E tr:. E o,q,.3KNI \ q_\DELAr^ot\ -jY I Dg.'\r 3K\t3rx)O.9
Cornell - CS - 3810
CS 381 Fall 2006Second Mid TermMonday, Nov. 13, 2006 Upson B17This is a 50-minute in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. Grading will take
Cornell - CS - 3810
CS 381 Fall 2006First Mid TermFriday, Oct. 27, 2006 Upson B17This is a 50-minute in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. Grading will take i
Cornell - CS - 3810
CS 381 Fall 2006Final Exam Closed Book9-11:30 Wed Dec 13 Hollister B14All problems should be straight forward. Partial credit will depend on clarity and conciseness of your answer. Please do not put down correct but irrelevant information. 1. W
Berkeley - CS - 152
CS152 Homework 1 Solutions Spring 2004 1.51 Yield = 1 / (1 + (Defects per area * Die Area / 2)^2) Thus, if die area increases, defects per area must decrease. 1.52 Solving the yield equation for Defects per area, we get: Defects per area = (1 / (sqr
Berkeley - CS - 152
University of California, Berkeley College of Engineering Computer Science Division EECS Fall 2001 John KubiatowiczPrerequisite QuizSeptember 7, 2001 CS152 Computer Architecture and EngineeringThis prerequisite quiz will be used in determining
Berkeley - CS - 152
University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2004 John KubiatowiczHomework Quiz (HW #5)April 26, 2004 CS152 Computer Architecture and EngineeringThis quiz combines two of the problems from home
Berkeley - CS - 152
University of California, Berkeley - College of Engineering Electrical Engineering and Computer Science, Computer Science Division Spring 2004 J. KubiatowiczCS152 - Computer Architecture and EngineeringHomework Quiz #4 Solutions 1. [1 point] One.
Berkeley - CS - 152
University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2004 John KubiatowiczPrerequisite QuizFebruary 2, 2004 CS152 Computer Architecture and EngineeringThis prerequisite quiz will be used in determining
Berkeley - CS - 152
University of California, Berkeley - College of Engineering Electrical Engineering and Computer Science, Computer Science Division Spring 2004 J. KubiatowiczCS152 - Computer Architecture and EngineeringHomework Quiz #3 Solutions Pseudo-code for bz
Cornell - CS - 3810
CS 381 Fall 2005Final Exam Closed bookWednesday Dec 14 Philips 101 7-9:30pmAll problems should be straight forward. Partial credit will depend on clarity and conciseness of your answer. Please do not put down correct but irrelevant information.
Cornell - CS - 3810
CS381 Fall 2004 Hollister B14Second Mid Term Friday Nov 5, 2004 9:05-9:55This is a 50-minute in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. Credit wi
Cornell - CS - 3810
CS381 Fall 2004First Mid TermFriday Oct 1, 2004 Hollister B14 9:05-9:55This is a 50-minute in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. Thank you
Cornell - CS - 3810
Final Exam CS 381 Fall 2004 Wednesday Dec 15, 2004 Upson B17 9-11:30This is a closed book exam. All questions are straight forward. Please show all work and write legibly. Credit will be based on both correctness and clarity of answers. 1. Let R be
Cornell - CS - 3810
CS381 Fall 2003Second Mid TermFriday Nov 7, 2003 Olin 255 9:05-9:55This is a 50-minute in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. Thank you. 1.
Montana - PHYS - 295
F\orl.,e.rrot-KPuyr atfThree loads are applied as shown to a light beam supported by cables attached at B and D. Knowing that the maximum allowable tension in each cable is 12 kN and neglecting the weight of the beam, determine the range of values
Montana - PHYS - 295
FROGLEfl 5.67' Deterrnine the reactions a.tthe beam supportsfor the given loading.S)rc-e +p{\c{<-{er-i\d t1 o\r'ec^- r-ro.r '.g* dr6ru)", c}\d,$;"\s q.-}a*J$.* *^,b. l1u;"o-\e^I *i[h,ts 'hJ@: do',e - "l-' l, ,$o* , JL\ernnr*g{=-,(r,+Xr
Cornell - CS - 3810
CS381 Fall 2002Final ExamThursday Dec 19, 2002 Location Olin 155 12:00-2:30pmThis is a 2 and hour in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. T
Cornell - CS - 3810
CS381: Introduction to Theory of Computing Fall 2007[Location] [Announcements] [Course Staff] [Office Hours] [Textbook] [Grading] [Exams] [Concepts] [Homework]LocationM W F 9:05-9:55 am, Hollister B14.Announcements[December 11, Tuesday] Soluti
Berkeley - CS - 152
Course Format:Three hours of lecture and two hours of discussion per week and one large design project. Instruction set design, Register Transfer. Computer design project requiring about 100 hours. Data-path design. Controller design. Memory system.
Berkeley - CS - 152
HandoutsGeneral:Student Questionnaire (survey) [ps,pdf]Useful Handouts:Sample Online Notebook: [html] Lab Report Format: [html] Paper on testing by Douglas Clark: [ps,pdf] SPIM Documentation [ps,pdf] Information about the Calinxboardsthat we wi
Berkeley - CS - 152
HW2 solutions 3.10 Pseuodinstructions Move $t5, $t3 Clear $t5 Li $t5, small Li $t5, big Lw $t5, big($t3) What is accomplished $t5=$t3 $t5=0 $t5=small $t5=big $t5=mem[$t3+big] Minimum sequence of Mips Add $t5, $t3, $0 Xor $t5, $t5, $t5 Addi $t5, $0, s
Berkeley - CS - 152
HW3 Solutions Spring 2004 Kubi P&H: 4.44, 4.46, 5.2, 5.11, 5.17, 5.18, 5.20, 5.21, 5.22, 5.24, 5.27, 5.28, 5.294.444.465.25.115.175.185.205.215.225.245.275.285.29
Berkeley - CS - 152
HW4 Solutions Spring 2004 Kubi 6.2, 6.3, 6.4, 6.9, 6.15, 6.18, 6.19, 6.21, 6.23, 6.26, 6.27, 6.28, 6.29, 6.316.26.36.46.96.15 Dependencies: One from MEM/WB of inst N to IDEX of inst N+1 Resolution: Insert stall between inst N and N+1 Total
Berkeley - CS - 152
University of California, Berkeley - College of Engineering Electrical Engineering and Computer Science, Computer Science Division Spring 2004 J. KubiatowiczCS152 - Computer Architecture and EngineeringHomework #5 Solutions 7.77.97.117.127.
Berkeley - CS - 152
University of California, Berkeley College of Engineering Computer Science Division - EECS Spring 2004 Handout #0, Survey J. KubiatowiczStudent Questionnaire: Required to be in Class CS152 Computer Architecture and Engineering Please answer the fol
Berkeley - CS - 152
University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2004 John KubiatowiczHomework Quiz (HW #3)March 3rd, 2004 CS152 Computer Architecture and EngineeringThis quiz covers one of the problems from homew
Berkeley - CS - 152
University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2004 John KubiatowiczHomework Quiz (HW #4)March 31, 2004 CS152 Computer Architecture and EngineeringThis quiz covers one of the problems from homewo
Berkeley - CS - 152
University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2004 John KubiatowiczHomework Quiz (HW #5)April 26, 2004 CS152 Computer Architecture and EngineeringThis quiz combines two of the problems from home
Berkeley - CS - 152
Lab 1CS152 Computer Architecture and EngineeringLab #1: MIPS & Broken SPIMSpring 2004, Prof John KubiatowiczHomework 1 due Monday 2/2 in class. Please include the TIME or TA NAME of the DISCUSSION section that you attend as well as your NAME and
Berkeley - CS - 152
Homework #2/Lab #2: Multipliers and CAD toolsCS152 Computer Architecture and EngineeringHomework #2/Lab #2: Multipliers and CAD toolsFall 2003, Prof. John KubitowiczHomework number 2 is due on Wednesday 2/18 in class. There will also be a quiz i
Berkeley - CS - 152
Lab 3: Single Cycle ProcessorCS152 Computer Architecture and EngineeringLab #3: Single Cycle ProcessorSpring 2004, Prof. John KubiatowiczLab reports for Lab 3 due Thursday 3/11 at 11:59pm via the submit program. You will demonstrate your lab to
Berkeley - CS - 152
Homework #4/Lab #4: Pipelined ProcessorCS152 Computer Architecture and EngineeringHomework #4/Lab #4: Pipelining Your ProcessorSpring 2004, Prof. John KubiatowiczLab reports for Lab 4 due Thursday 4/1 (No, it's not a joke) at 11:59pm via the sub
Berkeley - CS - 152
CS152 Lab #5: The Memory SubsystemCS152 Computer Architecture and EngineeringHomework/Lab #5: The Memory SubsystemSpring 2004, Prof. John KubiatowiczA formal design document and a division of labor is due via e-mail to your TA Wednesday 4/7 by 9
Berkeley - CS - 152
Recap: I/O Summary CS152 Computer Architecture and Engineering Lecture 25 Low Power Design, Advanced Intel Processors I/O performance limited by weakest link in chain between OS and device Queueing theory is important 100% utilization means very l
Berkeley - CS - 152
Recap: Nano-layered Disk Heads CS152 Computer Architecture and Engineering Lecture 24 I/O and Storage SystemsCoil for writing Special sensitivity of Disk head comes from "Giant Magneto-Resistive effect" or (GMR) IBM is leader in this technology
Berkeley - CS - 152
Recap: A Three-Bus System (+ backside cache)Processor Memory BusCS152 Computer Architecture and Engineering Lecture 23 I/O and Storage SystemsProcessor Backside Cache bus Bus Adaptor Bus Adaptor Bus Adaptor I/O Bus I/O BusMemoryL2 CacheApr
Berkeley - CS - 152
Recall: Cache Performance CS152 Computer Architecture and Engineering Lecture 21 Caches (finished) Virtual MemoryExecution_Time = Instruction_Count x Cycle_Time x (ideal CPI + Memory_Stalls/Inst + Other_Stalls/Inst) Memory_Stalls/Inst = Instruction
Berkeley - CS - 152
Review: OrganizationProcessor InputCS152 Computer Architecture and Engineering Lecture 2 Review of MIPS ISA and Design Concepts January 26, 2004 John Kubiatowicz (http.cs.berkeley.edu/~kubitron) lecture slides: http:/inst.eecs.berkeley.edu/~cs152/
Berkeley - CS - 152
Overview Intro to Computer Architecture (30 minutes) CS152 Computer Architecture and Engineering Lecture 1 Introduction and Five Components of a Computer January 21, 2004 John Kubiatowicz (www.cs.berkeley.edu/~kubitron) lecture slides: http:/inst.ee
Berkeley - CS - 152
Course Lecture PlanPermission is granted to copy and distribute this material for educational purposes only, provided that the complete bibliographic citation and following credit line is included: "Copyright (C) 2001 UCB." Permission is granted to
Berkeley - CS - 152
Recap: What is virtual memory? CS152 Computer Architecture and Engineering Lecture 22 Virtual Memory (continued) BusesVirtual Address Space Physical Address SpaceVirtual Address V page no. 10 offset Page Table Page Table Base Reg index into page t
Berkeley - CS - 152
Review:MIPS R3000 Instruction Set Architecture Register Set CS152 Computer Architecture and Engineering Lecture 3 Logic Design, Technology, and Delay 32 general 32-bit registers Register zero ($R0) always zero Hi/Lo for multiplication/divisi
Berkeley - CS - 152
Review: Combinational Elements+DeMorgan EquivalenceWireIn OutInverterIn Out In Out 0 1 1 0 0 1 0 1CS152 Computer Architecture and Engineering Lecture 4 Performance and The Design ProcessOut = In NAND GateOut = In NOR GateA A B Out 0 0 1 1
Berkeley - CS - 152
Review: Elements of the Design Process Divide and Conquer (e.g., ALU) Formulate a solution in terms of simpler components. Design each of the components (subproblems) Generate and Test (e.g., ALU) Given a collection of building blocks, look for
Berkeley - CS - 152
Review from last time Design Process Design Entry: Schematics, HDL, Compilers High Level Analysis: Simulation, Testing, Assertions Technology Mapping: Turn design into physical implementation Low Level Analysis: Check out Timing, Setup/Hold, etc
Berkeley - CS - 152
CS152 Computer Architecture and Engineering Lecture 7 Designing a Single Cycle DatapathReview: Sequential Logic + (Non-)blocking assignments Must be careful mixing zero-time blocking assignments and edge-triggering: Probably won't do what you expec
Berkeley - CS - 152
Recap: A Single Cycle Datapath CS 152 Computer Architecture and Engineering Lecture 8 Single-Cycle (Con't) Designing a Multicycle Processor Rs, Rt, Rd and Imed16 hardwired into datapath from Fetch Unit We have everything except control signals (und