Computer Structure. Topic 2. Contents

Size: px
Start display at page:

Download "Computer Structure. Topic 2. Contents"

Transcription

1 31 Topi 2 Computer Struture Contents 2.1 Introdution Computer Organisation Calulating mahines - from Babbage to integrated iruits Computer organisation The stored program onept Feth-exeute yle Two-state mahine Reviewquestions Struture of a small omputer system Computer omponents and their funtion Memory Random aess memory Read only memory Review questions Cahe memory Memorymaps External memory Central proessing unit The arhiteture of the miroproessor Aessing memory Control unit Arithmeti logi unit Registers Review questions Buses Address bus Data bus Review questions Summary End of topi test

2 u u u u u u u u u u u 32 TOPIC 2. COMPUTER STRUCTURE Prerequisite knowledge Before studying this topi you should be able to: Desribe the purpose of a proessor and list its parts; Represent the data flow between the omponent devies of a omputer system; Distinguish between main memory and baking storage; Desribe the features and uses of Random Aess Memory (RAM) and Read Only Memory (ROM). Learning Objetives By the end of this topi, you will be able to: Desribe the purpose and funtion of the ALU and the Control Unit within a proessor; Desribe the purpose and funtion of registers; Desribe the purpose and funtion of the data bus and address bus; Identify ontrol lines within a omputer inluding reset and interrupt; Desribe the purpose of read, write and timing funtions of ontrol lines; Outline the steps of the feth-exeute yle; Desribe and make distintions between registers, ahe memory, main memory and baking store in terms of funtion and speed of aess. v

3 2.1. INTRODUCTION 33 Revision The following exerise tests the prerequisites for this topi. Ensure that you are happy with your responses before progressing. Q1: What type of memory stores programs that must not be lost when the power to the system is removed? Q2: A proessor will frequently transfer data. Where is the data transferred to and from a) Output devies b) Input devies ) Clok d) Memory 2.1 Introdution This unit on Computer Struture desribes in detail the funtion of the omponent parts of a proessor in the manipulation of data. This is extended to the methods of transferring data within a proessor and between a proessor and memory. The onept of a stored program is onsidered and the steps in the feth-exeute yle to aess and run programs. Memory types are onsidered, from registers to baking storage and how memory is defined and addressed. 2.2 Computer Organisation Computers play a signifiant role in meeting our everyday requirements. You an now browse the Internet for a new home, order from a supermarket on-line and have the goods delivered to your door. You an import a new ar from abroad at the touh of a button, order lothes from a atalogue ompany and ommuniate with friends overseas. The ways in whih you learn are also hanging. You an omplete a shool or ollege assignment using a general purpose pakage, or solve programming problems at home on your own PC, ing your results to your instrutor for feedbak. You an use omputer based learning tools to assist you in understanding new onepts. You are using one suh tool right now! If omputers have made suh a signifiant impat, then it makes sense to find out a little more about how they work and how you an make use of them. For instane, how are w

4 x y z { 34 TOPIC 2. COMPUTER STRUCTURE they strutured? How do they operate internally? How is data represented? Why are some omputers faster and more powerful than others? What devies an you attah to them and how an you get them to ommuniate? These are some of the questions we will be looking at in this topi. There are others. First let us take a loser look at the basi struture of a small omputer system and at how it operates internally Calulating mahines - from Babbage to integrated iruits Learning Objetive At the end of this topi you will know: the ontribution of Charles Babbage to modern omputer design; major tehnologial advanes leading to the development of the Personal Computer. Nowadays you use alulators to perform numerial alulations. This was not always the ase, and for some soieties, is still not. Sine early times humans have tried to find ways to make alulations easier. For instane the abaus was developed by the Chinese around 1300 AD, although similar devies had been used by the Babylonians, sine about 500 BC. Logarithms were developed as a method of alulation by John Napier, who also invented a devie known as Napier s Bones. The slide rule is a further example of an analogue devie for multipliation that is based upon logarithms. Simple, manually operated mehanial alulators were developed by many famous mathematiians, inluding Pasal and Leibniz. The first steps towards automating the mehanial alulator were taken by Charles Babbage ( ) with the design of the speial purpose Differene Engine and the subsequent design of the more general purpose Analytial Engine. The Analytial Engine was ontrolled by a set of instrutions entered as punh holes on a set of metal ards. This idea was first introdued by Jaquard ( ) who designed weaving looms. The pattern woven depended upon the position of holes punhed in metal ards. Unfortunately the tehnology of the time was not advaned enough to allow Babbage to onstrut a working mahine. However his ideas laid the foundations of modern omputer design. These ideas inluded: a memory that ould store 1000 numbers; }

5 ~ ~ ~ 2.2. COMPUTER ORGANISATION 35 a mahine ontrolled by a program entered into it; entering a different program to perform a new task - general purpose; the program was a set of instrutions that, if followed, would aomplish a task - an algorithm. These ideas were not developed further until eletro-mehanial relay tehnology produed omputers in the 1930s. By today s standards these mahines were large and slow. Vauum tube tehnology in the 1940s inreased the speed of the omputers and by the 1960s transistor tehnology redued the size and power requirements. From about 1965 to the present, the iruits for many operations have been inorporated into a single hip as Integrated Ciruits (ICs). Chip fabriation tehniques also improved, allowing further integration to the extent that we now have Very Large Sale Integration (VLSI) and a omplete proessor on a hip. This made possible the Personal Computer. Review Questions Q3: Desribe the Analytial Engine designed by Charles Babbage. Q4: How does the Analytial Engine relate to modern omputers? Q5: What tehnial development in the 1940s and 1950s helped redue the size and power requirements of omputers? Q6: What affet did the development of the integrated iruit have on omputers? Computer organisation Computers are digital mahines that exeute mahine ode programs and operate on data in binary form. By binary form we mean a representation of information as 0s and 1s. Binary representation of information was onsidered earlier in this unit. Here we examine the internal organisation of the omputer to understand how mahine ode programs are run.

6 36 TOPIC 2. COMPUTER STRUCTURE The Organisation of a Simple Computer Until now we have been looking at how we an use simple logi gates to produe devies suh as adders, deoders and flip-flops. Although we have looked at simplified versions of these logi devies, it is devies suh as this that are ombined together to reate a omputer. We will now step bak a level and look at the basi arhiteture of a simple omputer. A simple omputer onsists of the following omponents (see Figure 2.1): Proessor; Memory; Input/output devie; Communiation hannels (shown between the aforementioned omponents in Figure 2.1); Figure 2.1: A Simple Computer Input devies inlude the keyboard and mouse and an be used to supply input to the proessor. Output devies inlude the sreen and printers and these an be used to supply output from the proessor. Input and output devies are often known as peripheral devies. Some omputers have more than one proessor; however we will onentrate on single proessor mahines in this topi. Where there is only one proessor it is known as the Central Proessing Unit, orcpu. This is where instrutions are proessed and omputations are arried out. This is the ontrol entre of the omputer. The ommuniation hannels allow data and ontrol signals to be ommuniated between the main omponents of the omputer via the system bus or external bus. A bus is a olletion of parallel wires eah of whih an arry a digital signal. Thus a 16- bit wide bus ould transmit 16 bits simultaneously. The CPU has its own internal bus allowing the ommuniation of data and ontrol signals between its omponent parts. It is worth noting here that the system bus ontains lines to transmit data, lines to transmit memory addresses and various ontrol lines. Frequently it is thought of as if it were separate buses: a data bus, an address bus and ontrol lines. Sometimes the data and address lines are not separate at all and the same lines are used for different

7 2.2. COMPUTER ORGANISATION 37 purposes at different times. For example, one moment sending an address to memory and the next transmitting data from the addressed memory loation to the CPU. A more detailed diagram of the main omponents of a simple omputer are shown in Figure 2.2. Figure 2.2: The Organisation of a Simple Computer The omputer illustrated in Figure 2.2 is a typial example of a Von Neumann arhiteture. Virtually all omputers follow this arhiteture model that has its origins in the stored program onept proposed by John Von Neumann in The basi idea behind the Stored Program Conept is that the sequene of instrutions (or program) to solve a problem should be stored in the same memory as the data. This ensured that the omputer beame a general-purpose, problem-solving tool, sine to make it solve a different problem required only that a different program be plaed in memory. The omponent parts of the omputer are: Central Proessing Unit (CPU). Carries out omputation and has overall ontrol of the omputer. Main memory. Stores programs and data while the omputer is running. Has fast aess, is diretly aessible by the CPU, is limited in size and non-permanent. External memory. Holds substantial quantities of information too large for storage in main memory. Slower aess than main memory, not aessible diretly by the CPU but an be used to keep a permanent opy of programs and data. Peripheral devies (input/output devies). ommuniate with the outside world. These allow the omputer to ƒ

8 38 TOPIC 2. COMPUTER STRUCTURE External system bus. This allows ommuniation of information between the omponent parts of the omputer. Some possible transfers of information via the system bus are: data transmitted from main memory to the the CPU input data from an external devie (e.g. the keyboard) travelling from the devie to main memory information from external memory transmitted to main memory The speed of the system bus is very important sine, if it is too slow, the speed of the CPU is restrited by having to wait for data. The CPU typially onsists of A Control Unit (CU) whih exerts overall ontrol over the operation of the CPU; An Arithmeti and Logi Unit (ALU) whih arries out omputation; A set of registers whih an hold intermediate results during a omputation. Two of these registers are of partiular importane, namely, The Program Counter (PC) whih holds the address in memory of the next instrution in the program; The Instrution Register (IR) whih holds the instrution urrently being exeuted. These omponents are linked by an internal bus. In pratie, the arhiteture of a modern digital omputer will be more omplex than the desription given here, with eah omponent itself being an assembly of parts onneted by various different buses. However, for the moment, this will suffie as a model for how the major parts of a digital omputer are organised Review Questions Q7: What are the main omponents of a omputer? Q8: What is the purpose of the system bus? What type of information is it likely to transmit? Q9: With what important onept was John Von Neumann assoiated? What large advantage did this onept onfer upon omputers? Q10: What is held in the main memory of the omputer? Why is external memory also required? Q11: How would an item of data that was entered at the keyboard finally find its way into a CPU register for proessing?

9 2.2. COMPUTER ORGANISATION 39 Q12: All CPUs ontain two partiular registers. What are these registers and for what are they used? The stored program onept All omputers are based upon the same basi design, known as the Von Neumann Arhiteture. Computers arry out tasks by exeuting mahine instrutions. instrutions is alled a mahine ode program. A series of these A mahine ode program is held in main memory as a stored program, a onept first proposed by John Von Neumann in A unit, known as the Central Proessing Unit (CPU) fethes, deodes and exeutes the mahine instrutions. By altering the stored program it is possible to have the omputer arry out a different task. As a user of a desktop omputer you will already know this. You may have loaded a word proessing program to enter and edit text. Using the same omputer you may have opened a spreadsheet or drawing program to enter numerial values or reate graphi images. Being able to load and exeute different programs allows the omputer to beome a general purpose problem solving mahine Feth-exeute yle To exeute a mahine ode program it must first be loaded, together with any data that it needs, into main memory (RAM). One loaded, it is aessible to the CPU whih fethes one instrution at a time, deodes and exeutes it at eletroni speed. Feth, deode and exeute are repeated until a program instrution to HALT is enountered. This is known as the feth-exeute yle.

10 40 TOPIC 2. COMPUTER STRUCTURE Feth exeute yle in greater detail Earlier we introdued the feth-exeute yle and desribed the stored program onept where mahine ode instrutions are repeatedly transferred from main memory to the CPU for exeution. We would now like to show you how the address bus, data bus, ontrol bus and internal registers take part in reading a program instrution from main memory - essentially the feth phase of the feth-exeute yle. Figure 2.3 below illustrates in more detail the feth-exeute yle. Simulation of an instrution feth Figure 2.3: Feth-exeute yle On the web is a simulation whih shows you how the buses and the internal registers of the CPU take part in reading an instrution from main memory. You should now look at this simulation.

11 2.2. COMPUTER ORGANISATION Registers used by the proessor in the feth-exeute yle Memory address register To aomplish the tasks, a proessor has a olletion of dediated registers. These are used to hold information speifi to this task. Note that these registers are in addition to the general purpose registers provided by the proessor. Unlike the general purpose registers, these registers are not usually visible to the assembly level programmer. The first register that we will disuss is the memory address register (MAR). This is used to hold a value representing the address in memory that the proessor needs to aess. Usually the MAR will hold a bit pattern orresponding to the state (0 or 1) of the address bus. When the proessor needs to aess memory, the value of the loation in memory is plaed in the MAR and the proessor iruitry will ensure that the address bus lines are set to the orret values. Memory data register The memory data register (MDR) is used to hold bit patterns that represent data values. For example, when reading from memory, the MAR will be used to set up the address lines to selet a loation. After a short delay, the memory devie will set the lines on the data bus to appropriate values. When the values on the data bus have settled, the iruitry of the proessor will set the value of the MDR to the value that appeared on the data bus. Instrution register The instrution register is a dediated storage spae used by the ontrol unit when it is deoding instrutions. General purpose registers involved in the feth-exeute yle The program ounter (PC) is the general purpose register most involved in the fethexeute yle. Remember that this register is used to keep trak of where in the program exeution has reahed. Other general purpose registers are only usually affeted as part of the exeution of the program and as suh, are not fundamental to the operation of the yle The feth phase The first of the two main phases of the feth-exeute yle is the feth phase, and onsists of the following steps: 1. The ontents of the PC are opied into the MAR; 2. The ontents of memory at the loation designated by the MAR are opied into the MDR; ˆ

12 42 TOPIC 2. COMPUTER STRUCTURE 3. The PC is inremented; 4. The ontents of the MDR are opied into the IR. Remember that the PC is used to keep trak of where exeution has reahed. Thus the first step is onerned with establishing the loation of the next instrution to exeute. The seond step is to get the value into the MDR. The third step is to ensure that the PC points to the next instrution to be exeuted: if we did not inrement the PC at some point, we would ontinually exeute the same instrution over and over again!. The fourth step ensures that there is a opy of the instrution in the IR ready for exeution to begin. Sequening the steps in an instrution feth On the web is an assessment that requires you to plae the steps of an instrution feth in the orret order. You should now arry out this assessment The exeute phase The exeute phase onsists of the following steps: 1. Deode the instrution in the IR; 2. Exeute the instrution in the IR. One the exeute phase has ompleted, the feth phase will be arried out again. Animation of the feth-exeute yle On the web is an animation of the feth, deode and exeution of the instrution LOAD[16]. You should now look at this animation. Pseudoode representation of the feth-exeute yle For onveniene we an write this series of steps as a pseudoode representation: >Š>Š Œ ŠYŽ4 Y 4 YŽ, >š >š,œ Y ž>š, >Ÿ,,ž,š Y š ž 4 YŠ š «ª4, š Y,,Š>ŠY Note that «means is opied to and that pointed to by, >š. >š œ ± means the ontents of the loation

13 ³ µ 2.2. COMPUTER ORGANISATION Two-state mahine The eletroni omponents of a omputer are designed to be in only one of two states. For example, a magneti storage devie reords data magnetised in one diretion or another, transistors ondut or do not ondut. The binary digits 0 and 1 are used to represent these two states and hene the omputer is termed a two-state mahine Review questions Q13: Whih of the following is true? a) mahine ode is represented in binary b) data is represented in deimal or hexadeimal ) a stored program is exeuted from disk Q14: What is meant by the term stored program? Q15: The CPU: a) was invented by John Von Neumann b) holds a stored program ) fethes, deodes and exeutes mahine instrutions Q16: What is meant by the term feth-exeute yle? Q17: Whih of the following is false? a) magneti storage devies are two-state devies b) a two-state devie an only be in one of two states ) binary annot be used to represent a two-state devie Struture of a small omputer system ² Learning Objetive At the end of this sub-topi you will know: The main funtions of the omponents of a small omputer system; Organisation of Main Memory and types of main memory;. The purpose of the Address Bus, the Data Bus and the Control Bus; Internal registers of the CPU and their purpose; The steps involved in a memory read operation. We want to look at the internal organisation of the omputer at a level of abstration that desribes the system as interating, high-level omponents. For now, we are not that interested in the lower level detail of shunting bits around the mahine. To get a feel for this omponent level, imagine you are a ar driver. When you step into the ar, what is visible to you are interfaes to the omponents that allow you to drive it.

14 44 TOPIC 2. COMPUTER STRUCTURE The ignition omponent allows you to start the ar and to swith it off. You do not need to know how the ignition system works, this is hidden from sight. Aelerator pedals, brake pedals and a gear mehanism eah interfae to omponents whih alter the speed of the ar. To manouvre the ar you operate a steering wheel whih interfaes to a steering omponent. From this desription, you ould produe a diagram of these interating omponents. It would not be very detailed and ertainly would not have enough information for a ar mehani to work with, but it would, at a higher level, desribe how the driver interats with the ar. This is the omponent level we will introdue. Identifying system omponents used in a task 5min You should find a partner to work with. Imagine that you have a PC or a Ma running a windows interfae and that you have powered it up. Now think about the sequene of events that our when you reate a new word proessing doument. Try to identify the omponents of your PC that are involved in this task. For instane, there will need to be a transfer of the word proessing appliation (program) from the hard disk omponent to the main memory omponent in order to run the program. What happens next and what omponents do you think are involved? Computer omponents and their funtion The omponents of the CPU and the onnetions to devies that are external to it are showninfigure2.4

15 2.3. MEMORY 45 Figure 2.4: Components of a Small Computer System 2.3 Memory Main memory (RAM and ROM) stores programs and data while the omputer is operating. Memory used to be soldered onto the system board of the proessor (motherboard). The need to provide more readily upgradable omputers led to the development of Single In-Line Memory Modules (SIMMs). These plug into a SIMM soket on the motherboard. Eah SIMM ontains a number of DRAM hips and varies depending on the type of omputer and the amount of RAM required. Later, we will take a loser look at the harateristis of RAM and ROM hips and the differenes between DRAM and SRAM. Main memory onsists of a large sequene of bytes (typially 64 Mbytes in a PC) eah of whih may be diretly aessed using its memory address. In a bytewide memory, the first byte in memory has address 0 and subsequent bytes have addresses 1,2,3, et. as shown in a simplified representation of RAM in Figure 2.5 ¹

16 º º º º 46 TOPIC 2. COMPUTER STRUCTURE Figure 2.5: A simplified representation of RAM Any loation in memory an be read from or written to by referring to its address. Memory an be organised as: 8- bit wide (PC-8088) 16-bit wide (XT-8086, AT-80286) 32-bit wide (386DX, 486SX, 486DX) 64-bit wide (Pentium) Random aess memory Random Aess Memory (RAM) is a volatile memory. This means that the ontents of RAM are lost when power is no longer supplied to the hip. RAM an be written to and read from. There are two types of RAM, namely stati and dynami (SRAM and DRAM) SRAM hips are very fast but are not suited for very large amounts of memory. They are more suited to ahe memory, where only small amounts are required. You will learn more about ahe memory when we look at fators that affet system performane. DRAM hips are more widely used. They are muh heaper to produe, an hold larger amounts of data in a smaller physial area and require less power. They are dynami, requiring a ontinuous signal to refresh the ontents of the hip Read only memory Read Only Memory (ROM) is a non-volatile store whih means that the ontents are held permanently. The software and data stored on the ROM are fixed at the time of manufature. One programs and data have been entered into the ROM they annot be subsequently altered.»

17 2.3. MEMORY 47 ROMs are used to store programs and data that do not hange during the operation of the system. These are known as mask programmed ROM. Where different software and/or data is needed on a ROM hip, manufaturers produed a hip that allows existing data to be erased and new data written. These are known as eletrially programmable read-only memory hips (EPROMs). Data is erased by shining ultraviolet light onto the hip. EPROMs have the disadvantage that all the hip ontents are removed during erasure. The entire hip has to be reprogrammed, even if only a single memory word needs to be hanged. Another type of ROM tehnology where the ontents of the hip an be altered is the eletrially erasable programmable read-only memory (EEPROM). By applying suitable eletrial pulses, this hip an be seletively reprogrammed whih means that the entire ontents need not be erased Review questions Q18: Whih of the following is true? a) RAM is volatile b) ROM is volatile ) Neither RAM nor ROM is volatile Q19: Explain what is meant by the term non-volatile? Q20: Whih of the following memory hips an be seletively reprogrammed? a) PROM b) EEPROM ) EPROM Q21: Explain how EPROM hips an be reprogrammed and give one disadvantage of EPROM. Q22: Whih of the following statements is false? a) RAM annot be written to b) ROM an only be read from and not written to ) EEPROM is erased using eletrial pulses ROM tehnologies On the web is an ativity that asks you to math ROM tehnologies to their desriptions. You should now arry out this ativity Cahe memory Program instrutions are usually read sequentially. From one instrution it would be reasonable to assume that the next instrution required will be in the next memory loation. This assumption is used to inrease proessor effiieny. Although the movement of data within the proessor is getting faster and faster, the system buses are not keeping up. This leads to wasted time while the proessor waits for data to be fethed from memory. ¼

18 48 TOPIC 2. COMPUTER STRUCTURE To redue this problem most mahines now have a seond, smaller, area of memory known as ahe memory. This is usually SRAM whih is faster than DRAM, and although this is muh smaller than RAM there is a benefit from the fat that it is always faster to aess a small memory segment. When data or an instrution is read from memory, the memory loations following are opied into the ahe memory. At the next read instrution the ahe memory is read first. If the data is in ahe the aess time will be muh lower than going to main memory. If the data is not in ahe then main memory will be aessed, and although there is a slight loss of time from reading twie, the overall time saving in this method is quite signifiant. Observing ahe memory On the web is a simplified simulation of the operations of ahe memory. You should now look at this simulation. The ontents of ahe are simultaneously held in RAM. When data is to be written bak to memory it must be written to ahe so that the ahe is kept urrent. At some stage it will also have to be written bak to RAM. Cahe that has not been updated doesn t have to be opied bak to memory it is just removed from ahe when it is to be replaed by something the proessor has a greater need for. There are 2 different ways to update ahe memory. Write through ahe. When ahe is updated memory is updated at the same time. Write bak ahe. Cahe is updated, but RAM is not updated until the ontent of ahe is being leared. Write bak requires fewer write operations but there is an overhead in managing the seleted updates. Write bak ahe is generally about 10% faster than write through ahe Memory maps Main memory is made up of a matrix of ells. However when studying the ontent of memory it is helpful to use a logial view of a set of ells, arranged in numerial order in whih the lowest memory position is loation 0 and the highest is loation ½. Different proessors have different ways of organising information in RAM, the BIOS and part of the operating system will always be in the same proteted areas. Certain areas are alloated for user appliations. Memory addresses are often written in hexadeimal as they would otherwise be awkwardly long binary strings. Example : Memory addresses Problem: A proessor has a 16 line address bus. If a partiular memory holds an operating ¾

19 Æ 2.3. MEMORY 49 system from position 0 16 to , and a 32 Kb program starts at position ,is there enough free memory spae for a 1 Kb blok of data starting at position C000 16? Solution: O/S Program Data 02K 8K 40K 48K 64K Step 1 There are 16 address lines. The maximum number of address loations = 2 16 = =64K. Mark 64K on the memory map. Step 2 O/S from 0 16 to Æ «ÀÀ Á.Â0ÃÅÄ Kb ÀÀ Á.Â0Ã Ç Kb Operating system from 0 to 2 Kb Mark this blok on the memory map. Step 3 Program from for 32 Kb «ÀÀÀ Á.ÂÃ Kb ÆÊÉÌË Ç«ÍÎÃ «À so the program runs from 8 Kb to È Mark this blok on the memory map. Step 4 The starting position for the data blok is C This is at 48 Kb and needs 1 Kb of spae. Mark this on the memory map. The data will fit. Kb. Desribing memory maps Q23: A proessor has 16 lines. The memory has 4 KB s of BIOS data starting at position 0. Ï

20 Ð Ð Ð Ð Ð Ð 50 TOPIC 2. COMPUTER STRUCTURE There are devie drivers positioned from for 8 Kb A program runs from 32 K to the top of memory. Identify where, in memory, there is free spae and how muh there is. Q24: A proessor has 32 address lines. There is BIOS data from 0 to 8 Kb The DOS kernel lies between and There is a program from F using 24 Kb There is a data blok from F using32k. Draw the memory map learly identifying the start and end of eah used memory area External memory External memory, suh as the hard disk, holds quantities of data too large to store in main memory. It is also used to keep a permanent opy of programs and data. Examples of external memory devies are: hard disk; floppy disk; zip disk; CD-R; magneti tape; flash drive. Ñ

21 Ò Ò Ò 2.4. CENTRAL PROCESSING UNIT Central proessing unit Central Proessing Unit. The CPU oordinates and ontrols the ativities of all other units in the omputer system. It exeutes program instrutions and manipulates data in aordane with the instrutions. The CPU is the most important omponent of a omputer and it is essential to have a good knowledge of its internal organisation, i.e. its arhiteture. Just as the arhiteture of a building refers to a struture of rooms, failities and aess whih links all parts of the building, proessor arhiteture refers to its internal organisation of subsystems and how they interat. CPUs are fairly omplex and at this level of study we will onentrate on a simplified funtional desription of its struture using a standard arhiteture omposed of the following three omponents: Arithmeti and logi unit (ALU); Control unit; Registers. All three omponents work together to form the proessor The arhiteture of the miroproessor We will now study the internal arhiteture of the miroproessor (CPU) itself. Beause of the stored program onept, any onsideration of this arhiteture must onsider the relationship between the CPU and memory. Figure 2.6 is a shemati diagram of a fairly typial miroproessor design, showing the internal struture of the CPU and its relationship to the memory of the omputer. Ó

22 Ô Ô Ô Ô 52 TOPIC 2. COMPUTER STRUCTURE Figure 2.6: Typial Miroproessor Design We will now look at the role that these omponents play in the operation of the proessor Aessing memory The CPU has to aess memory both for instrutions and to reeive and transmit data from or to memory. For this purpose it typially has two internal registers, namely: Memory Address Register (MAR) - speifies the address in memory for the next read or write operation from or to memory; The Memory Data Register (MDR) or Memory Buffer Register (MBR) - ontains the data to be written to memory or reeives the data read from memory. The MAR register is onneted to the address portion of the system bus and the MDR register is onneted to the data portion of the system bus. To read data from memory, the CPU plaes the address of the required memory loation into the MAR and ativates the memory-read ontrol line of the system bus. This will ause the required data to be transmitted from memory via the data bus to the MDR; To write from the CPU to memory, the CPU plaes the data to be written in the MDR; the address of the memory loation where they are to be written is plaed in the MAR; and the memory-write ontrol line is ativated. The MAR and MDR registers have a large part to play in the feth-exeute yle. When fething an instrution from memory during the feth-exeute yle, the address ontained in the PC will be opied to the MAR using the proessor s internal bus. When the memory-read ontrol line is ativated, the instrution will be sent to the MDR using the data bus. From the MDR it will be opied to the IR using the proessor s internal bus. When exeuting an add to aumulator instrution, the address part of the instrution will be sent to the MAR so that the operand an be obtained from memory. The operand Õ

23 2.4. CENTRAL PROCESSING UNIT 53 is then plaed in the MDR from where it an be sent to the ALU, viathecpu internal bus, for adding to the ontents of the aumulator Control unit The mahine ode programs stored in main memory tell the omputer what steps must be arried out to solve a problem. They also tell it the sequene in whih it must arry out the steps. The ontrol unit inludes timing/ ontrol logi and the instrution deoder. It sends signals to other parts of the omputer to diret the feth and exeution of mahine instrutions. Using timing and ontrol signals, it tells other parts of the system what to do and when to do it, i.e. it synhronises the whole system. Signals are sent out and reeived on the ontrol bus. For example, if data is to be read from main memory, the ontrol unit will initiate a read signal on the ontrol bus. Some signals, suh as interrupts, originate from external devies, ating as inputs to the CPU. The ontrol bus is not really a bus at all. Unlike the address and data buses where bits are simultaneously transmitted along a set of parallel wires, the ontrol bus is made up of disrete wires, eah having a speifi funtion. These funtions are desribed in the table below: Control Line lok reset interrupt NMI Funtion generates a onstant pulse at a frequeny measured in Hertz (Hz). Eah pulse auses a mahine operation to be arried out. Mahine operations inlude reading data from main memory or adding numbers together. auses the proessor to halt the exeution of the stored program. All internal registers are leared and the mahine reboots. tells the proessor that an external event has ourred, suh as the transfer of data from an external devie. The proessor may ignore this type of interrupt. a non-maskable interrupt that annot be ignored by the proessor. For example, low power failure. When data is to be read from a memory loation then the ontrol unit will initiate a read signal on the ontrol bus and when data is to be written to a memory loation then the ontrol unit will initiate a write signal. These operations are desribed later in greater detail when we take a loser look how an instrution is fethed from main memory. Ö

24 54 TOPIC 2. COMPUTER STRUCTURE Identifying funtions of the ontrol bus On the web is an ativity that asks you to orretly identify 4 funtions of the ontrol bus. You should now arry out this ativity Getting the proessor s attention A omputer reeives signals from a number of different soures. Charaters keyed in on the keyboard, the lik of a mouse, data from a sanner. The arrival of this type of signal is not neessarily expeted at any partiular time and the omputer has to have a way of deteting them. There are two ways that this an happen, known as polling and interrupts Polling The first is known as polling. This is what ertain types of door to door salespeople do. They ensure that all their ustomers have a opy of the ompany atalogue and then they visit every house on a rota basis to ask if the ustomer would like to plae an order. This means that the salesperson will visit every house, say, every month. They may know that the average time between orders is about 3 months but they an t take the risk of leaving the ustomer unattended when they might want to plae a big order. This means that the salesperson may be wasting a lot of time making unneessary alls. From the ustomer s point of view this is not ideal either, beause they might realise a week after the last visit that they have forgotten something important and there is no way to shorten the waiting time until next month. For a omputer system this would work quite satisfatorily if the proessor was running a mirowave oven beause the proessor would be dediated to that one task and effiieny would be a meaningless onept. The life of the door to door salesperson would be simpler and they would be able to handle far more ustomers, if the ustomer was given a phone number or address and asked to initiate ontat when they wanted to order. This would provide the ustomer with a muh better servie and also allow the salesperson more time to do other things Interrupts In omputer terms, the signal from a peripheral devie or program that the attention of the proessor is needed is known as an interrupt. Every time a keyboard key is pressed an interrupt is generated. When the mahine is designed, the handling of interrupts is planned for. In an IBM type PC there is an allowane for 256 different types of interrupt. When one of these ours the system is able to identify its type. With this information the proessor then looks at an area in memory in whih an address for eah of the 256 interrupts is stored. At this address there is a program known as an Interrupt Servie Routine. The

25 Ø Ø Ø Ø Ø 2.4. CENTRAL PROCESSING UNIT 55 address table is used to furnish addresses indiretly beause this makes it possible for a programmer to ontrol. Many of the ISRs are stored in ROM. When an interrupt is reeived, the proessor will: store the ontents of its internal registers in an area of memory alled the stak; find the address for the ISR; jump to the servie routine and proess it; reload the internal registers from the stak; ontinue proessing from where it stopped. There are different priority levels assigned to interrupts. If an interrupt arrives while the proessor is already dealing with one, it an do one of two things. If the seond interrupt is of a lower priority the proessor will arry on until the urrent interrupt has been servied then it will servie the seond. If the new interrupt is of a high priority the proessor will store it s urrent state on the stak and start to proess the newer interrupt. When that one is finished it will omplete the proessing of the first interrupt and then revert to the original proess. This is known as nesting interrupts. Interrupts an be generated by hardware or software. Any signal oming from a peripheral devie will prompt an interrupt. Eah I/O onnetion has a physial link alled an IRQ line. This serves to arry the interrupt signal and in turn to identify the soure of the interrupt. Internal devies onneted via the motherboard also use IRQ lines. There is a limited number of IRQ lines and this an be a limiting fator in adding hardware to a omputer system. However the newer systems using USB (Universal Serial Bus) or Firewire an aept a number of hardware devies sharing IRQ lines. A software interrupt is one generated from within a program. This inludes routine ativities like sending a harater to the keyboard or the sreen. A software fault like trying to divide by zero, or trying to write into a proteted area of memory, will also all an interrupt. Generally the proessor an mask or delay the serviing of interrupts until it is ready. There is, however, a group of interrupts that annot be ignored. These are known nonmaskable interrupts (NMIs). Typially this interrupt would indiate a problem suh as loss of power, requiring the omputer to shut down immediately Arithmeti logi unit Ù The arithmeti logi unit (ALU) is where data is proessed and manipulated and an be onsidered the "brain" of the omputer. Proessing an involve either arithmeti operations and the ALU must ontain iruitry to perform additions. Note that multipliation an be ahieved through a series of additions, while division an be ahieved through a series of subtrations.

26 Ú Ú Ú Ú Ú Ú Ú Ú 56 TOPIC 2. COMPUTER STRUCTURE The ALU may also perform logial operations suh as a logial OR operation. This requires in-built logi elements. The ALU uses arithmeti registers whih are storage loations used to hold data and temporary results of alulations. One speial storage register used by the ALU is the aumulator whih it uses to hold the results of additions. Typial operations performed by the ALU inlude: addition; subtration; shift left; shift right; logial OR; logial AND; inrement; derement Registers A register is a storage loation used to hold instrutions, memory addresses, data or the temporary results of alulations. Beause registers are internal to the proessor, they an be aessed at high speed. The CPU has a set of general and speial purpose registers and the number and type of registers in any one CPU will be different from those in another CPU. Speial purpose registers typially found within a proessor are listed below: memory address register (MAR) is used to hold the address of a loation in main memory. memory buffer register (MBR) is used to hold data that has just been read from main memory or is to be written to main memory. instrution register (IR) is used to hold the urrent instrution that is being exeuted. program ounter (PC) holds the address of the next instrution to be fethed from memory. The proessor also has a set of general purpose registers. They are alled general purpose beause their role is not defined at manufature and an be used by programmers as appropriate Review questions Q25: What is the funtion of the CPU? Q26: Whih of the following is NOT a omponent of the CPU? Û

27 2.5. BUSES 57 a) ALU b) RAM ) Speial purpose registers Q27: How does the ontrol unit synhronise operations within the omputer? Q28: Whih of the following desribes how the ALU performs multipliation? a) using a logial OR operation b) suessive addition ) using an inrement operation Q29: Why are general purpose registers provided within the CPU? Mathing CPU registers to their purpose On the web is an ativity that asks you to math some CPU registers to their purpose. You should now arry out this ativity. Mathing CPU omponents to their desriptions On the web is an ativity that asks you to math CPU omponents to their desriptions. You should now arry out this ativity. 2.5 Buses The system bus is a group of parallel wires, eah arrying a single bit of data. In a single bus system, input/output devies (I/O) and memory use the same ommuniations hannel. A two bus system has a separate I/O hannel and memory transfer hannel. Larger systems make use of several I/O buses for more effetive operation. A single bus system is typial of small omputer systems. The system bus must provide omponents with the use of a Data Bus, Address Bus and Control Bus. Ü

28 58 TOPIC 2. COMPUTER STRUCTURE Address bus The address bus is a uni-diretional bus, transferring information in one diretion only. In a single bus system, input/output devies (I/O) and memory use the same ommuniations hannel. When the CPU needs to put data into memory or send it to a disk then it does so in the same way, only using different addresses. Devies are memory mapped and are treated by the system as if they were memory. The address bus is made up of parallel wires, eah apable of arrying 1 bit. The size of the address bus will determine how many memory loations an be diretly addressed. To understand this, onsider first an address bus width of 1-bit. There are 2 distint values that a single bit an represent (0 or 1). Thus a bus width of 1-bit an identify 2 unique addresses. Now add another address line. There are now 2 lines, eah of whih an represent 2 distint values. This results in 4 possible unique addresses shown below. Now add another address line. There are now 3 lines, eah of whih an represent 2 distint values, resulting in 8 unique addresses. Can you think of a general formula to relate the number of diretly addressable memory loations to the width of the address bus? If not, try answering the questions below and then think through the problem again. Q30: How many memory loations an be diretly addressed using 5 bits? a) 10 b) 7 ) 32 Q31: How many memory loations an be diretly addressed using 8 bits? a) 8 b) 256 ) 16 Ý

29 2.5. BUSES 59 Generally then, The number of memory loations = 2width of address bus Thus, a 24-bit address bus will be able to distinguish between: 2 24 = 16,777,216 memory loations Addressability When the proessor has to send or reeive data or instrutions from memory, ahe or external devies, the medium along whih the signal is arried is known as a bus. This is a set of wires or lines that an eah transmit 1 bit at a time. Thus when an instrution is read from memory the bits are plaed on the data bus and moved in parallel to the proessor. Typially the data bus will be the same size as one memory loation. While the data bus moves data and instrutions, a seond bus, the address bus arries the address of the memory loation to be aessed. The size of the address bus affets the amount of main memory offered. If there were 8 address lines able to transmit 8 bits the maximum number of different addresses would be Þ«ßÊàÞáâ A 32 bit address bus addressing up to 4 Gb of memory is a more typial urrent size. When an address is being speified there has to be a way to determine whether it refers to a main memory address or to one of the I/O interfaes that ontrol ommuniation with other peripheral devies. This an be done in two ways. Memory mapped I/O If the interfae is memory mapped, a blok of main memory addresses is mapped to the I/O interfae. In this way the addressing proess is exatly the same for main memory or I/O. If there is no memory mapping the destination is defined by a signal on one of the ontrol lines. This means that the same address values an be used for I/O and memory without onfusion. The address bus is effetively one way (uni-diretional) while the data bus an transfer data in both diretions (bi-diretional), outwards for a write operation and inwards for a read operation. A third bus, the ontrol bus has the signal that identifies the type of operation, read or ã

30 ä ä ä ä 60 TOPIC 2. COMPUTER STRUCTURE write. This an take 4 signals: read from memory; write to memory; read from I/O; write to I/O. Therefore to feth an instrution or data item from memory all 3 buses are used. Address bus Data bus Control bus This is illustrated in Figure 2.7 address in memory or I/O devie data to be written to or data being read from memory operation read / write memory or read/write I/O Data bus CPU Control bus Address bus I/O interfae Cahe I/O interfae Memory Figure 2.7: Data bus The data bus is used to transfer data to and from the CPU. The data bus is a bi-diretional bus whih transfers data in both diretions. In a single bus system, the data bus is shared by main memory and external devies suh as sreens, printers and disk drives. You an appreiate why this bus needs to be bi-diretional if you onsider some typial operations that are arried out. For instane, the CPU must feth instrutions from main memory whih requires transfer in the diretion from main memory to the CPU. If å

31 æ æ æ æ æ æ æ æ 2.6. SUMMARY 61 the stored program has instrutions to alulate values and update variables, then the results of the alulations need to be stored in main memory. This requires a transfer of data from the CPU registers to main memory. In the ase of ommuniating with an external devie, suh as a hard disk, data must be loaded from the devie and also saved to the devie. This requires bi-diretional data transfer Review questions Q32: The purpose of the address bus is to: a) initiate a read from memory operation b) arry a memory address from whih data an be read or to whih data an be written ) store results of alulations Q33: Why is the address bus desribed as uni-diretional? Q34: The data bus is used: a) to store the results of alulations b) to signal a read event ) to arry data/instrutions from main memory to CPU or to arry data from CPU to main memory 2.6 Summary The following summary points are related to the learning objetives in the topi introdution: Organisation of the omponent parts of a omputer system; Desription and struture of the omponents parts of a proessor; The stored program onept and the feth-exeute yle; The funtion of the proessor omponents; Control lines funtions and timings; The use of buses; The storage of data using registers, ahe, memory and baking storage; Aessing memory. 2.7 End of topi test An online assessment is provided to help you review this topi. ç

32 62 TOPIC 2. COMPUTER STRUCTURE è

Unit 12: Installing, Configuring and Administering Microsoft Server

Unit 12: Installing, Configuring and Administering Microsoft Server Unit 12: Installing, Configuring and Administering Mirosoft Server Learning Outomes A andidate following a programme of learning leading to this unit will be able to: Selet a suitable NOS to install for

More information

Sebastián Bravo López

Sebastián Bravo López Transfinite Turing mahines Sebastián Bravo López 1 Introdution With the rise of omputers with high omputational power the idea of developing more powerful models of omputation has appeared. Suppose that

More information

Computer Networks Framing

Computer Networks Framing Computer Networks Framing Saad Mneimneh Computer Siene Hunter College of CUNY New York Introdution Who framed Roger rabbit? A detetive, a woman, and a rabbit in a network of trouble We will skip the physial

More information

' R ATIONAL. :::~i:. :'.:::::: RETENTION ':: Compliance with the way you work PRODUCT BRIEF

' R ATIONAL. :::~i:. :'.:::::: RETENTION ':: Compliance with the way you work PRODUCT BRIEF ' R :::i:. ATIONAL :'.:::::: RETENTION ':: Compliane with the way you work, PRODUCT BRIEF In-plae Management of Unstrutured Data The explosion of unstrutured data ombined with new laws and regulations

More information

Electrician'sMathand BasicElectricalFormulas

Electrician'sMathand BasicElectricalFormulas Eletriian'sMathand BasiEletrialFormulas MikeHoltEnterprises,In. 1.888.NEC.CODE www.mikeholt.om Introdution Introdution This PDF is a free resoure from Mike Holt Enterprises, In. It s Unit 1 from the Eletrial

More information

Open and Extensible Business Process Simulator

Open and Extensible Business Process Simulator UNIVERSITY OF TARTU FACULTY OF MATHEMATICS AND COMPUTER SCIENCE Institute of Computer Siene Karl Blum Open and Extensible Business Proess Simulator Master Thesis (30 EAP) Supervisors: Luiano Garía-Bañuelos,

More information

A Holistic Method for Selecting Web Services in Design of Composite Applications

A Holistic Method for Selecting Web Services in Design of Composite Applications A Holisti Method for Seleting Web Servies in Design of Composite Appliations Mārtiņš Bonders, Jānis Grabis Institute of Information Tehnology, Riga Tehnial University, 1 Kalu Street, Riga, LV 1658, Latvia,

More information

Channel Assignment Strategies for Cellular Phone Systems

Channel Assignment Strategies for Cellular Phone Systems Channel Assignment Strategies for Cellular Phone Systems Wei Liu Yiping Han Hang Yu Zhejiang University Hangzhou, P. R. China Contat: wliu5@ie.uhk.edu.hk 000 Mathematial Contest in Modeling (MCM) Meritorious

More information

1.3 Complex Numbers; Quadratic Equations in the Complex Number System*

1.3 Complex Numbers; Quadratic Equations in the Complex Number System* 04 CHAPTER Equations and Inequalities Explaining Conepts: Disussion and Writing 7. Whih of the following pairs of equations are equivalent? Explain. x 2 9; x 3 (b) x 29; x 3 () x - 2x - 22 x - 2 2 ; x

More information

Using Live Chat in your Call Centre

Using Live Chat in your Call Centre Using Live Chat in your Call Centre Otober Key Highlights Yesterday's all entres have beome today's ontat entres where agents deal with multiple queries from multiple hannels. Live Chat hat is one now

More information

Microcontroller Based PWM Controlled Four Switch Three Phase Inverter Fed Induction Motor Drive

Microcontroller Based PWM Controlled Four Switch Three Phase Inverter Fed Induction Motor Drive SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 7, No., November 00, 95-04 UDK: 004.466 Miroontroller Based PWM Controlled Four Swith Three Phase Inverter Fed Indution Motor Drive Nalin Kant Mohanty, Ranganath

More information

From a strategic view to an engineering view in a digital enterprise

From a strategic view to an engineering view in a digital enterprise Digital Enterprise Design & Management 2013 February 11-12, 2013 Paris From a strategi view to an engineering view in a digital enterprise The ase of a multi-ountry Telo Hervé Paault Orange Abstrat In

More information

Information Security 201

Information Security 201 FAS Information Seurity 201 Desktop Referene Guide Introdution Harvard University is ommitted to proteting information resoures that are ritial to its aademi and researh mission. Harvard is equally ommitted

More information

Neural network-based Load Balancing and Reactive Power Control by Static VAR Compensator

Neural network-based Load Balancing and Reactive Power Control by Static VAR Compensator nternational Journal of Computer and Eletrial Engineering, Vol. 1, No. 1, April 2009 Neural network-based Load Balaning and Reative Power Control by Stati VAR Compensator smail K. Said and Marouf Pirouti

More information

State of Maryland Participation Agreement for Pre-Tax and Roth Retirement Savings Accounts

State of Maryland Participation Agreement for Pre-Tax and Roth Retirement Savings Accounts State of Maryland Partiipation Agreement for Pre-Tax and Roth Retirement Savings Aounts DC-4531 (08/2015) For help, please all 1-800-966-6355 www.marylandd.om 1 Things to Remember Complete all of the setions

More information

Computers. Hardware. The Central Processing Unit (CPU) CMPT 125: Lecture 1: Understanding the Computer

Computers. Hardware. The Central Processing Unit (CPU) CMPT 125: Lecture 1: Understanding the Computer Computers CMPT 125: Lecture 1: Understanding the Computer Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 3, 2009 A computer performs 2 basic functions: 1.

More information

Chapter 1 Microeconomics of Consumer Theory

Chapter 1 Microeconomics of Consumer Theory Chapter 1 Miroeonomis of Consumer Theory The two broad ategories of deision-makers in an eonomy are onsumers and firms. Eah individual in eah of these groups makes its deisions in order to ahieve some

More information

Table of Contents. Appendix II Application Checklist. Export Finance Program Working Capital Financing...7

Table of Contents. Appendix II Application Checklist. Export Finance Program Working Capital Financing...7 Export Finane Program Guidelines Table of Contents Setion I General...........................................................1 A. Introdution............................................................1

More information

Wireless Transmission Systems. Instructor

Wireless Transmission Systems. Instructor Teleommuniation Engineering Tehnology, Texas A&M University Wireless Transmission Systems Leture Notes - Copyright Jeff M. MDougall 2 Wireless Transmission Systems Teleommuniation Engineering Tehnology,

More information

UNIVERSITY AND WORK-STUDY EMPLOYERS WEB SITE USER S GUIDE

UNIVERSITY AND WORK-STUDY EMPLOYERS WEB SITE USER S GUIDE UNIVERSITY AND WORK-STUDY EMPLOYERS WEB SITE USER S GUIDE September 8, 2009 Table of Contents 1 Home 2 University 3 Your 4 Add 5 Managing 6 How 7 Viewing 8 Closing 9 Reposting Page 1 and Work-Study Employers

More information

A Keyword Filters Method for Spam via Maximum Independent Sets

A Keyword Filters Method for Spam via Maximum Independent Sets Vol. 7, No. 3, May, 213 A Keyword Filters Method for Spam via Maximum Independent Sets HaiLong Wang 1, FanJun Meng 1, HaiPeng Jia 2, JinHong Cheng 3 and Jiong Xie 3 1 Inner Mongolia Normal University 2

More information

OpenScape 4000 CSTA V7 Connectivity Adapter - CSTA III, Part 2, Version 4.1. Developer s Guide A31003-G9310-I200-1-76D1

OpenScape 4000 CSTA V7 Connectivity Adapter - CSTA III, Part 2, Version 4.1. Developer s Guide A31003-G9310-I200-1-76D1 OpenSape 4000 CSTA V7 Connetivity Adapter - CSTA III, Part 2, Version 4.1 Developer s Guide A31003-G9310-I200-1-76 Our Quality and Environmental Management Systems are implemented aording to the requirements

More information

Henley Business School at Univ of Reading. Pre-Experience Postgraduate Programmes Chartered Institute of Personnel and Development (CIPD)

Henley Business School at Univ of Reading. Pre-Experience Postgraduate Programmes Chartered Institute of Personnel and Development (CIPD) MS in International Human Resoure Management For students entering in 2012/3 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date of speifiation:

More information

Programming Basics - FORTRAN 77 http://www.physics.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html

Programming Basics - FORTRAN 77 http://www.physics.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html CWCS Workshop May 2005 Programming Basis - FORTRAN 77 http://www.physis.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html Program Organization A FORTRAN program is just a sequene of lines of plain text.

More information

Henley Business School at Univ of Reading. Chartered Institute of Personnel and Development (CIPD)

Henley Business School at Univ of Reading. Chartered Institute of Personnel and Development (CIPD) MS in International Human Resoure Management (full-time) For students entering in 2015/6 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date

More information

F220 Series. Installation Instructions. Photoelectric Smoke/Heat Detectors

F220 Series. Installation Instructions. Photoelectric Smoke/Heat Detectors F0 Series EN Installation Instrutions Photoeletri Smoke/Heat Detetors F0 Series Installation Instrutions.0 General Information EN.0 General Information. F0-B6 Series Bases Use with the F0 Series Heat and

More information

Improved SOM-Based High-Dimensional Data Visualization Algorithm

Improved SOM-Based High-Dimensional Data Visualization Algorithm Computer and Information Siene; Vol. 5, No. 4; 2012 ISSN 1913-8989 E-ISSN 1913-8997 Published by Canadian Center of Siene and Eduation Improved SOM-Based High-Dimensional Data Visualization Algorithm Wang

More information

Professional Certificate Training in Business Writing

Professional Certificate Training in Business Writing Professional Certifiate Training in Business Writing About Training in Business Writing ZeebraCross Centre for Management Exellene (ZCME) is an initiative of ZeebraCross (Unit of InfousRx Marketing and

More information

Hierarchical Clustering and Sampling Techniques for Network Monitoring

Hierarchical Clustering and Sampling Techniques for Network Monitoring S. Sindhuja Hierarhial Clustering and Sampling Tehniques for etwork Monitoring S. Sindhuja ME ABSTRACT: etwork monitoring appliations are used to monitor network traffi flows. Clustering tehniques are

More information

Impedance Method for Leak Detection in Zigzag Pipelines

Impedance Method for Leak Detection in Zigzag Pipelines 10.478/v10048-010-0036-0 MEASUREMENT SCIENCE REVIEW, Volume 10, No. 6, 010 Impedane Method for Leak Detetion in igzag Pipelines A. Lay-Ekuakille 1, P. Vergallo 1, A. Trotta 1 Dipartimento d Ingegneria

More information

Deadline-based Escalation in Process-Aware Information Systems

Deadline-based Escalation in Process-Aware Information Systems Deadline-based Esalation in Proess-Aware Information Systems Wil M.P. van der Aalst 1,2, Mihael Rosemann 2, Marlon Dumas 2 1 Department of Tehnology Management Eindhoven University of Tehnology, The Netherlands

More information

Computational Analysis of Two Arrangements of a Central Ground-Source Heat Pump System for Residential Buildings

Computational Analysis of Two Arrangements of a Central Ground-Source Heat Pump System for Residential Buildings Computational Analysis of Two Arrangements of a Central Ground-Soure Heat Pump System for Residential Buildings Abstrat Ehab Foda, Ala Hasan, Kai Sirén Helsinki University of Tehnology, HVAC Tehnology,

More information

Weighting Methods in Survey Sampling

Weighting Methods in Survey Sampling Setion on Survey Researh Methods JSM 01 Weighting Methods in Survey Sampling Chiao-hih Chang Ferry Butar Butar Abstrat It is said that a well-designed survey an best prevent nonresponse. However, no matter

More information

SOFTWARE ENGINEERING I

SOFTWARE ENGINEERING I SOFTWARE ENGINEERING I CS 10 Catalog Desription PREREQUISITE: CS 21. Introdution to the systems development life yle, software development models, analysis and design tehniques and tools, and validation

More information

Wireless Networking Guide 2007 www.lexmark.com

Wireless Networking Guide 2007 www.lexmark.com Wireless Networking Guide 2007 www.lexmark.om P/N 13L0828 E.C. 3L0101 Contents Installing the printer on a wireless network...4 Wireless network ompatiility...4 Information you will need to set up the

More information

REDUCTION FACTOR OF FEEDING LINES THAT HAVE A CABLE AND AN OVERHEAD SECTION

REDUCTION FACTOR OF FEEDING LINES THAT HAVE A CABLE AND AN OVERHEAD SECTION C I E 17 th International Conferene on Eletriity istriution Barelona, 1-15 May 003 EUCTION FACTO OF FEEING LINES THAT HAVE A CABLE AN AN OVEHEA SECTION Ljuivoje opovi J.. Elektrodistriuija - Belgrade -

More information

protection p1ann1ng report

protection p1ann1ng report f1re~~ protetion p1ann1ng report BUILDING CONSTRUCTION INFORMATION FROM THE CONCRETE AND MASONRY INDUSTRIES Signifiane of Fire Ratings for Building Constrution NO. 3 OF A SERIES The use of fire-resistive

More information

Computer Performance. Topic 3. Contents. Prerequisite knowledge Before studying this topic you should be able to:

Computer Performance. Topic 3. Contents. Prerequisite knowledge Before studying this topic you should be able to: 55 Topic 3 Computer Performance Contents 3.1 Introduction...................................... 56 3.2 Measuring performance............................... 56 3.2.1 Clock Speed.................................

More information

Customer Efficiency, Channel Usage and Firm Performance in Retail Banking

Customer Efficiency, Channel Usage and Firm Performance in Retail Banking Customer Effiieny, Channel Usage and Firm Performane in Retail Banking Mei Xue Operations and Strategi Management Department The Wallae E. Carroll Shool of Management Boston College 350 Fulton Hall, 140

More information

Soft-Edge Flip-flops for Improved Timing Yield: Design and Optimization

Soft-Edge Flip-flops for Improved Timing Yield: Design and Optimization Soft-Edge Flip-flops for Improved Timing Yield: Design and Optimization Abstrat Parameter variations ause high yield losses due to their large impat on iruit delay. In this paper, we propose the use of

More information

Intuitive Guide to Principles of Communications By Charan Langton www.complextoreal.com

Intuitive Guide to Principles of Communications By Charan Langton www.complextoreal.com Intuitive Guide to Priniples of Communiations By Charan Langton www.omplextoreal.om Understanding Frequeny Modulation (FM), Frequeny Shift Keying (FSK), Sunde s FSK and MSK and some more The proess of

More information

Classical Electromagnetic Doppler Effect Redefined. Copyright 2014 Joseph A. Rybczyk

Classical Electromagnetic Doppler Effect Redefined. Copyright 2014 Joseph A. Rybczyk Classial Eletromagneti Doppler Effet Redefined Copyright 04 Joseph A. Rybzyk Abstrat The lassial Doppler Effet formula for eletromagneti waves is redefined to agree with the fundamental sientifi priniples

More information

An integrated optimization model of a Closed- Loop Supply Chain under uncertainty

An integrated optimization model of a Closed- Loop Supply Chain under uncertainty ISSN 1816-6075 (Print), 1818-0523 (Online) Journal of System and Management Sienes Vol. 2 (2012) No. 3, pp. 9-17 An integrated optimization model of a Closed- Loop Supply Chain under unertainty Xiaoxia

More information

Behavior Analysis-Based Learning Framework for Host Level Intrusion Detection

Behavior Analysis-Based Learning Framework for Host Level Intrusion Detection Behavior Analysis-Based Learning Framework for Host Level Intrusion Detetion Haiyan Qiao, Jianfeng Peng, Chuan Feng, Jerzy W. Rozenblit Eletrial and Computer Engineering Department University of Arizona

More information

Parametric model of IP-networks in the form of colored Petri net

Parametric model of IP-networks in the form of colored Petri net Parametri model of IP-networks in the form of olored Petri net Shmeleva T.R. Abstrat A parametri model of IP-networks in the form of olored Petri net was developed; it onsists of a fixed number of Petri

More information

10.1 The Lorentz force law

10.1 The Lorentz force law Sott Hughes 10 Marh 2005 Massahusetts Institute of Tehnology Department of Physis 8.022 Spring 2004 Leture 10: Magneti fore; Magneti fields; Ampere s law 10.1 The Lorentz fore law Until now, we have been

More information

Customer Reporting for SaaS Applications. Domain Basics. Managing my Domain

Customer Reporting for SaaS Applications. Domain Basics. Managing my Domain Produtivity Marketpla e Software as a Servie Invoiing Ordering Domains Customer Reporting for SaaS Appliations Domain Basis Managing my Domain Managing Domains Helpful Resoures Managing my Domain If you

More information

Picture This: Molecular Maya Puts Life in Life Science Animations

Picture This: Molecular Maya Puts Life in Life Science Animations Piture This: Moleular Maya Puts Life in Life Siene Animations [ Data Visualization ] Based on the Autodesk platform, Digizyme plug-in proves aestheti and eduational effetiveness. BY KEVIN DAVIES In 2010,

More information

INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS

INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS Virginia Department of Taxation INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS www.tax.virginia.gov 2614086 Rev. 01/16 Table of Contents Introdution... 1 Important... 1 Where to Get Assistane... 1 Online File

More information

Deduplication with Block-Level Content-Aware Chunking for Solid State Drives (SSDs)

Deduplication with Block-Level Content-Aware Chunking for Solid State Drives (SSDs) 23 IEEE International Conferene on High Performane Computing and Communiations & 23 IEEE International Conferene on Embedded and Ubiquitous Computing Dedupliation with Blok-Level Content-Aware Chunking

More information

INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS

INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS Virginia Department of Taxation INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS www.tax.virginia.gov 2614086 Rev. 07/14 * Table of Contents Introdution... 1 Important... 1 Where to Get Assistane... 1 Online

More information

Implementation of PIC Based LED Displays

Implementation of PIC Based LED Displays International Journal of Eletronis and Computer Siene Engineering Available Online at www.ijese.org ISSN- - Implementation of PIC Based LED Displays Htet Htet Thit San, Chaw Myat Nwe and Hla Myo Tun Department

More information

An Enhanced Critical Path Method for Multiple Resource Constraints

An Enhanced Critical Path Method for Multiple Resource Constraints An Enhaned Critial Path Method for Multiple Resoure Constraints Chang-Pin Lin, Hung-Lin Tai, and Shih-Yan Hu Abstrat Traditional Critial Path Method onsiders only logial dependenies between related ativities

More information

ADVANCED PROCESSOR ARCHITECTURES AND MEMORY ORGANISATION Lesson-17: Memory organisation, and types of memory

ADVANCED PROCESSOR ARCHITECTURES AND MEMORY ORGANISATION Lesson-17: Memory organisation, and types of memory ADVANCED PROCESSOR ARCHITECTURES AND MEMORY ORGANISATION Lesson-17: Memory organisation, and types of memory 1 1. Memory Organisation 2 Random access model A memory-, a data byte, or a word, or a double

More information

WORKFLOW CONTROL-FLOW PATTERNS A Revised View

WORKFLOW CONTROL-FLOW PATTERNS A Revised View WORKFLOW CONTROL-FLOW PATTERNS A Revised View Nik Russell 1, Arthur H.M. ter Hofstede 1, 1 BPM Group, Queensland University of Tehnology GPO Box 2434, Brisbane QLD 4001, Australia {n.russell,a.terhofstede}@qut.edu.au

More information

) ( )( ) ( ) ( )( ) ( ) ( ) (1)

) ( )( ) ( ) ( )( ) ( ) ( ) (1) OPEN CHANNEL FLOW Open hannel flow is haraterized by a surfae in ontat with a gas phase, allowing the fluid to take on shapes and undergo behavior that is impossible in a pipe or other filled onduit. Examples

More information

BUILDING CODE SUMMARY GENERAL NOTES DESIGN BUILD ELECTRICAL DESIGN BUILD MECHANICAL & PLUMBING GENERAL NOTES GENERAL NOTES G101

BUILDING CODE SUMMARY GENERAL NOTES DESIGN BUILD ELECTRICAL DESIGN BUILD MECHANICAL & PLUMBING GENERAL NOTES GENERAL NOTES G101 D D BUILDING CODE SUMMARY GENERAL NOTES PROJECT DESCRIPTION: THIS PROJECT IS THE MINOR RENOVATION OF AN EXISTING OUTPATIENT CLINIC. SCOPE CONSISTS OF PAINT, CARPET, TILE, AND UPGRADE TO DIGITAL X-RAY BUILDING

More information

In this chapter, we ll see state diagrams, an example of a different way to use directed graphs.

In this chapter, we ll see state diagrams, an example of a different way to use directed graphs. Chapter 19 State Diagrams In this hapter, we ll see state diagrams, an example of a different way to use direted graphs. 19.1 Introdution State diagrams are a type of direted graph, in whih the graph nodes

More information

computer science Program Educational Objectives

computer science Program Educational Objectives omputer siene bahelor of siene minor ertifiates: managing information on the world wide web master of siene in omputer siene master of siene in software engineering advaned ertifiate programs: bioinformatis

More information

Findings and Recommendations

Findings and Recommendations Contrating Methods and Administration Findings and Reommendations Finding 9-1 ESD did not utilize a formal written pre-qualifiations proess for seleting experiened design onsultants. ESD hose onsultants

More information

A novel active mass damper for vibration control of bridges

A novel active mass damper for vibration control of bridges IABMAS 08, International Conferene on Bridge Maintenane, Safety and Management, 3-7 July 008, Seoul, Korea A novel ative mass damper for vibration ontrol of bridges U. Starossek & J. Sheller Strutural

More information

i_~f e 1 then e 2 else e 3

i_~f e 1 then e 2 else e 3 A PROCEDURE MECHANISM FOR BACKTRACK PROGRAMMING* David R. HANSON + Department o Computer Siene, The University of Arizona Tuson, Arizona 85721 One of the diffiulties in using nondeterministi algorithms

More information

TECHNOLOGY-ENHANCED LEARNING FOR MUSIC WITH I-MAESTRO FRAMEWORK AND TOOLS

TECHNOLOGY-ENHANCED LEARNING FOR MUSIC WITH I-MAESTRO FRAMEWORK AND TOOLS TECHNOLOGY-ENHANCED LEARNING FOR MUSIC WITH I-MAESTRO FRAMEWORK AND TOOLS ICSRiM - University of Leeds Shool of Computing & Shool of Musi Leeds LS2 9JT, UK +44-113-343-2583 kia@i-maestro.org www.i-maestro.org,

More information

Capacity at Unsignalized Two-Stage Priority Intersections

Capacity at Unsignalized Two-Stage Priority Intersections Capaity at Unsignalized Two-Stage Priority Intersetions by Werner Brilon and Ning Wu Abstrat The subjet of this paper is the apaity of minor-street traffi movements aross major divided four-lane roadways

More information

A Context-Aware Preference Database System

A Context-Aware Preference Database System J. PERVASIVE COMPUT. & COMM. (), MARCH 005. TROUBADOR PUBLISHING LTD) A Context-Aware Preferene Database System Kostas Stefanidis Department of Computer Siene, University of Ioannina,, kstef@s.uoi.gr Evaggelia

More information

THE UNIVERSITY OF TEXAS AT ARLINGTON COLLEGE OF NURSING. NURS 6390-004 Introduction to Genetics and Genomics SYLLABUS

THE UNIVERSITY OF TEXAS AT ARLINGTON COLLEGE OF NURSING. NURS 6390-004 Introduction to Genetics and Genomics SYLLABUS THE UNIVERSITY OF TEXAS AT ARLINGTON COLLEGE OF NURSING NURS 6390-004 Introdution to Genetis and Genomis SYLLABUS Summer Interession 2011 Classroom #: TBA and 119 (lab) The University of Texas at Arlington

More information

How To Fator

How To Fator CHAPTER hapter 4 > Make the Connetion 4 INTRODUCTION Developing seret odes is big business beause of the widespread use of omputers and the Internet. Corporations all over the world sell enryption systems

More information

luxcontrol DALI manual

luxcontrol DALI manual luxcontrol DALI manual . Tridoni GmbH & Co KG Färbergasse 15 6851 Dornbirn Austria Version 3.0 www.tridoni.om Subjet to hange without prior notie. All information is subjet to hange 2 / 93 Table of ontents

More information

Price-based versus quantity-based approaches for stimulating the development of renewable electricity: new insights in an old debate

Price-based versus quantity-based approaches for stimulating the development of renewable electricity: new insights in an old debate Prie-based versus -based approahes for stimulating the development of renewable eletriity: new insights in an old debate uthors: Dominique FINON, Philippe MENNTEU, Marie-Laure LMY, Institut d Eonomie et

More information

Chapter 5 Single Phase Systems

Chapter 5 Single Phase Systems Chapter 5 Single Phase Systems Chemial engineering alulations rely heavily on the availability of physial properties of materials. There are three ommon methods used to find these properties. These inlude

More information

Granular Problem Solving and Software Engineering

Granular Problem Solving and Software Engineering Granular Problem Solving and Software Engineering Haibin Zhu, Senior Member, IEEE Department of Computer Siene and Mathematis, Nipissing University, 100 College Drive, North Bay, Ontario, P1B 8L7, Canada

More information

Green Cloud Computing

Green Cloud Computing International Journal of Information and Computation Tehnology. ISSN 0974-2239 Volume 4, Number 4 (2014), pp. 431-436 International Researh Publiations House http://www. irphouse.om /ijit.htm Green Cloud

More information

On the Characteristics of Spectrum-Agile Communication Networks

On the Characteristics of Spectrum-Agile Communication Networks 1 On the Charateristis of Spetrum-Agile Communiation Networks Xin Liu Wei Wang Department of Computer Siene University of California, Davis, CA 95616 Email:{liu,wangw}@s.udavis.edu Abstrat Preliminary

More information

In order to be able to design beams, we need both moments and shears. 1. Moment a) From direct design method or equivalent frame method

In order to be able to design beams, we need both moments and shears. 1. Moment a) From direct design method or equivalent frame method BEAM DESIGN In order to be able to design beams, we need both moments and shears. 1. Moment a) From diret design method or equivalent frame method b) From loads applied diretly to beams inluding beam weight

More information

Retirement Option Election Form with Partial Lump Sum Payment

Retirement Option Election Form with Partial Lump Sum Payment Offie of the New York State Comptroller New York State and Loal Retirement System Employees Retirement System Polie and Fire Retirement System 110 State Street, Albany, New York 12244-0001 Retirement Option

More information

Customer Reporting for SaaS Applications

Customer Reporting for SaaS Applications Aelerate. Produtivity Marketplae Software as a Servie Invoiing Navigating Produtivity Marketplae Ordering SaaS Appliations Customer Reporting for SaaS Appliations Managing Domains Helpful Resoures Upgrading/Downgrading/Changing

More information

Intelligent Measurement Processes in 3D Optical Metrology: Producing More Accurate Point Clouds

Intelligent Measurement Processes in 3D Optical Metrology: Producing More Accurate Point Clouds Intelligent Measurement Proesses in 3D Optial Metrology: Produing More Aurate Point Clouds Charles Mony, Ph.D. 1 President Creaform in. mony@reaform3d.om Daniel Brown, Eng. 1 Produt Manager Creaform in.

More information

MEDICATION MANAGEMENT ASSESSMENT

MEDICATION MANAGEMENT ASSESSMENT MEDICATION MANAGEMENT ASSESSMENT The Mediation Management Assessment provides evidene-based reommendations/standards for Minnesota hospitals in the development of a omprehensive mediation safety program.

More information

VOLTAGE CONTROL WITH SHUNT CAPACITANCE ON RADIAL DISTRIBUTION LINE WITH HIGH R/X FACTOR. A Thesis by. Hong-Tuan Nguyen Vu

VOLTAGE CONTROL WITH SHUNT CAPACITANCE ON RADIAL DISTRIBUTION LINE WITH HIGH R/X FACTOR. A Thesis by. Hong-Tuan Nguyen Vu VOLTAGE CONTROL WITH SHUNT CAPACITANCE ON RADIAL DISTRIBUTION LINE WITH HIGH R/X FACTOR A Thesis by Hong-Tuan Nguyen Vu Eletrial Engineer, Polytehni University of HCMC, 1993 Submitted to the College of

More information

A Survey of Usability Evaluation in Virtual Environments: Classi cation and Comparison of Methods

A Survey of Usability Evaluation in Virtual Environments: Classi cation and Comparison of Methods Doug A. Bowman bowman@vt.edu Department of Computer Siene Virginia Teh Joseph L. Gabbard Deborah Hix [ jgabbard, hix]@vt.edu Systems Researh Center Virginia Teh A Survey of Usability Evaluation in Virtual

More information

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 3, MAY/JUNE 2012 401

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 3, MAY/JUNE 2012 401 IEEE TRASACTIOS O DEPEDABLE AD SECURE COMPUTIG, VOL. 9, O. 3, MAY/JUE 2012 401 Mitigating Distributed Denial of Servie Attaks in Multiparty Appliations in the Presene of Clok Drifts Zhang Fu, Marina Papatriantafilou,

More information

THERMAL TO MECHANICAL ENERGY CONVERSION: ENGINES AND REQUIREMENTS Vol. I - Thermodynamic Cycles of Reciprocating and Rotary Engines - R.S.

THERMAL TO MECHANICAL ENERGY CONVERSION: ENGINES AND REQUIREMENTS Vol. I - Thermodynamic Cycles of Reciprocating and Rotary Engines - R.S. THERMAL TO MECHANICAL ENERGY CONVERSION: ENGINES AND REQUIREMENTS Vol. I - Thermodynami Cyles of Reiproating and Rotary Engines - R.S.Kavtaradze THERMODYNAMIC CYCLES OF RECIPROCATING AND ROTARY ENGINES

More information

Static Fairness Criteria in Telecommunications

Static Fairness Criteria in Telecommunications Teknillinen Korkeakoulu ERIKOISTYÖ Teknillisen fysiikan koulutusohjelma 92002 Mat-208 Sovelletun matematiikan erikoistyöt Stati Fairness Criteria in Teleommuniations Vesa Timonen, e-mail: vesatimonen@hutfi

More information

Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes

Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes 1 Asymmetri Error Corretion and Flash-Memory Rewriting using Polar Codes Eyal En Gad, Yue Li, Joerg Kliewer, Mihael Langberg, Anxiao (Andrew) Jiang and Jehoshua Bruk Abstrat We propose effiient oding shemes

More information

SLA-based Resource Allocation for Software as a Service Provider (SaaS) in Cloud Computing Environments

SLA-based Resource Allocation for Software as a Service Provider (SaaS) in Cloud Computing Environments 2 th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing SLA-based Resoure Alloation for Software as a Servie Provider (SaaS) in Cloud Computing Environments Linlin Wu, Saurabh Kumar

More information

arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrence Berkeley National Laboratory One Cyclotron Road Berkeley, CA 94720 USA

arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrence Berkeley National Laboratory One Cyclotron Road Berkeley, CA 94720 USA LBNL-52402 Marh 2003 On the Speed of Gravity and the v/ Corretions to the Shapiro Time Delay Stuart Samuel 1 arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrene Berkeley National Laboratory

More information

Impact Simulation of Extreme Wind Generated Missiles on Radioactive Waste Storage Facilities

Impact Simulation of Extreme Wind Generated Missiles on Radioactive Waste Storage Facilities Impat Simulation of Extreme Wind Generated issiles on Radioative Waste Storage Failities G. Barbella Sogin S.p.A. Via Torino 6 00184 Rome (Italy), barbella@sogin.it Abstrat: The strutural design of temporary

More information

User s Guide VISFIT: a computer tool for the measurement of intrinsic viscosities

User s Guide VISFIT: a computer tool for the measurement of intrinsic viscosities File:UserVisfit_2.do User s Guide VISFIT: a omputer tool for the measurement of intrinsi visosities Version 2.a, September 2003 From: Multiple Linear Least-Squares Fits with a Common Interept: Determination

More information

Deliverability on the Interstate Natural Gas Pipeline System

Deliverability on the Interstate Natural Gas Pipeline System DOE/EIA-0618(98) Distribution Category UC-950 Deliverability on the Interstate Natural Gas Pipeline System May 1998 This report was prepared by the, the independent statistial and analytial ageny within

More information

Software Ecosystems: From Software Product Management to Software Platform Management

Software Ecosystems: From Software Product Management to Software Platform Management Software Eosystems: From Software Produt Management to Software Platform Management Slinger Jansen, Stef Peeters, and Sjaak Brinkkemper Department of Information and Computing Sienes Utreht University,

More information

A Comparison of Default and Reduced Bandwidth MR Imaging of the Spine at 1.5 T

A Comparison of Default and Reduced Bandwidth MR Imaging of the Spine at 1.5 T 9 A Comparison of efault and Redued Bandwidth MR Imaging of the Spine at 1.5 T L. Ketonen 1 S. Totterman 1 J. H. Simon 1 T. H. Foster 2. K. Kido 1 J. Szumowski 1 S. E. Joy1 The value of a redued bandwidth

More information

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

More information

Account Contract for Card Acceptance

Account Contract for Card Acceptance Aount Contrat for Card Aeptane This is an Aount Contrat for the aeptane of debit ards and redit ards via payment terminals, on the website and/or by telephone, mail or fax. You enter into this ontrat with

More information

A Three-Hybrid Treatment Method of the Compressor's Characteristic Line in Performance Prediction of Power Systems

A Three-Hybrid Treatment Method of the Compressor's Characteristic Line in Performance Prediction of Power Systems A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition of Power Systems A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition

More information

Performance Analysis of IEEE 802.11 in Multi-hop Wireless Networks

Performance Analysis of IEEE 802.11 in Multi-hop Wireless Networks Performane Analysis of IEEE 80.11 in Multi-hop Wireless Networks Lan Tien Nguyen 1, Razvan Beuran,1, Yoihi Shinoda 1, 1 Japan Advaned Institute of Siene and Tehnology, 1-1 Asahidai, Nomi, Ishikawa, 93-19

More information

Big Data Analysis and Reporting with Decision Tree Induction

Big Data Analysis and Reporting with Decision Tree Induction Big Data Analysis and Reporting with Deision Tree Indution PETRA PERNER Institute of Computer Vision and Applied Computer Sienes, IBaI Postbox 30 11 14, 04251 Leipzig GERMANY pperner@ibai-institut.de,

More information

Discovering Trends in Large Datasets Using Neural Networks

Discovering Trends in Large Datasets Using Neural Networks Disovering Trends in Large Datasets Using Neural Networks Khosrow Kaikhah, Ph.D. and Sandesh Doddameti Department of Computer Siene Texas State University San Maros, Texas 78666 Abstrat. A novel knowledge

More information

MEMBER. Application for election MEMBER, NEW GRADUATE. psychology.org.au. April 2015

MEMBER. Application for election MEMBER, NEW GRADUATE. psychology.org.au. April 2015 MEMBER Appliation for eletion MEMBER, NEW GRADUATE April 2015 psyhology.org.au MEMBER Belonging to the Australian Psyhologial Soiety (APS) means you are part of an ative, progressive organisation whih

More information

Logical Operations. Control Unit. Contents. Arithmetic Operations. Objectives. The Central Processing Unit: Arithmetic / Logic Unit.

Logical Operations. Control Unit. Contents. Arithmetic Operations. Objectives. The Central Processing Unit: Arithmetic / Logic Unit. Objectives The Central Processing Unit: What Goes on Inside the Computer Chapter 4 Identify the components of the central processing unit and how they work together and interact with memory Describe how

More information

FIRE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero

FIRE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero FE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero Robotis, Computer Vision and Intelligent Control Group. University

More information