RealLife Math Phần 3 ppt

66 181 0
RealLife Math Phần 3 ppt

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

Thông tin tài liệu

Charts 112 REAL-LIFE MATH pie, and the whole pie would represent the total points scored. Alternatively, to look at points scored by just three players, a pie chart is not useful, because other points could have been scored by different players, and the play- ers do not represent the whole, they are only a fraction of the whole. USING THE COMPUTER TO CREATE CHARTS There are many computer programs that quickly do most chart plotting. The most common is Microsoft Excel, which has many different predetermined chart templates, based on the three basic charts, and formats data into a chart. Excel and other charting programs have created pre- formatted charts to represent data in as many ways as possible, but at the root of all these charts are the three basic chart formats. One area where they have made sig- nificant changes in appearance is in area charts, or other three-dimensional chart types. While the basic charting procedure is basically the same, these charting programs have tried to add a third dimension, depth, to the basic two-dimensional chart. While this is helpful with very specific types of data, the two-dimensional charts are still the most commonly used. CHOOSING THE RIGHT TYPE OF CHART FOR THE DATA Organization of data is an important part of telling a story, and conveying that story to others. Charts are a quick way of showing the relational aspects of different categorized data sets; charts take the quantitative aspects of information and create a picture to make it easier for the viewer to quickly see relationships. Therefore, choos- ing the correct chart to represent data sets is a key ele- ment of conveying the story, and communicating how the data looks. For example, at the beginning of the semester the math teacher makes the following announcement: the school administrators want to analyze the demographics of this high school relative to three other high schools in neighboring states. Furthermore, the administration has made the analysis a contest, and everyone in any math class is welcome to participate. All entries will be voted on fairly and independently. The teacher also states: if the winner is in a particular class, that participating student will receive an A for the course. After collecting the data, the student ends up with the following information for all four schools: total stu- dents, broken out by grade; number of male and female students; total square feet of each school; number of teachers; number of classes offered; and the number of students who took the SAT tests, per state, over a 25-year period. Using line, column, and pie charts, the data is organ- ized in the following way: First, a basic column chart is created showing the total students for each school, as in Figure 12. Secondly, in Figure 13, a stacked bar chart is cre- ated, each with four columns, so each segment is repre- senting one grade and each column is representing each school. Figure 14 represents this same concept used to show the distribution of males and females for each school. 500 700 900 0 School 1 School 2 School 3 School 4 650 200 400 100 350 850 Female Male Figure 14. 9th Grade 10th Grade 11th Grade 12th Grade 500 700 900 0 School 1 School 2 School 3 School 4 650 200 400 100 350 850 Figure 13. 540 600 400 780 500 700 900 0 School 1 School 2 Students School 3 School 4 650 200 400 100 350 850 Figure 12. Charts REAL-LIFE MATH 113 Using a pie chart to plot the square feet per school, the pie chart has four segments, one for each school, and each segment of pie represents the percentage of square feet as a portion of the whole, as shown in Figure 15. Fig- ure 16 represents a pie chart to plot the number of teach- ers for each school, and Figure 17 is the third pie chart that has the number of classes per school. Lastly, Figure 18 is a line chart used to plot the aver- age SAT scores over the 25-year period. With 25 cate- gories on the x axis, and the scores on the y axis, the data points are plotted, the dots connected, and a line chart is created that spans the 25-year period. Where to Learn More Books Excel Charts. Somerset, NJ: John Wiley & Sons, 2005. 1996 1998 2000 2002 1988 1990 1992 1994 1980 1982 1984 1886 2004 3,000 4,000 1,000 2,000 5,000 6,000 7,000 8,000 0 School 1 School 2 School 3 School 4 Figure 18. School 1 Classes School 2 School 3 School 4 Figure 17. School 1 Teachers School 2 School 3 School 4 Figure 16. School 1 Square Feet School 2 School 3 School 4 Figure 15. Key Terms Dependant variable: What is being modeled; the output. Independent variable: Data used to develop a model, the input. 114 REAL-LIFE MATH Computers and Mathematics Overview Mathematics is integral to computers. Most com- puter processes and functions rely on mathematical prin- ciples. The word “computers” is derived from computing, meaning the process of solving a problem mathemati- cally. Large complex calculations (or computing) in engi- neering and scientific research often require basic calculators and computers. Computers have evolved greatly over the years. These days, computers are used for practically anything under the Sun, education, communication, business, shopping, or entertainment. Mathematics forms the basis of all these applications. Applications of mathematical concepts are seen in the way computers process data (or information) in the form of bits, bytes, and codes, store large quantities of data by compression, and send data from one computer to another by transmission. With the advent of the Internet, communication has become extremely easy. Every computer is assigned a unique identity, using mathematical principles, making communication possible. In addition, mathematics has also found other applications in computers, such as security and encryption. Fundamental Mathematical Concepts and Terms BINARY SYSTEM All computers or computing devices think and process in binary code, a binary number system. In a binary number system, everything is described using two values—on or off, true or false, yes or no, one or zero, and so on. The simplest example of a binary system is a light switch, which is always either on or off. A computer con- tains millions of similar switches. The status of each switch in the computer represents a bit or binary digit. In other words, each switch is either on or off. The computer describes one as “on” and zero as “off.” Any number can be represented in the binary system as a combination of zeros and ones. In the binary num- ber system, each number holds the value of increasing powers of two, e.g., 2 0 ,2 1 , and so on. This makes counting in binary easy. The binary representation for the numbers one to ten can be shown as follows: •0 ϭ 0 •1 ϭ 1 •2 ϭ 10 •3 ϭ 11 Computers and Mathematics REAL-LIFE MATH 115 •4 ϭ 100 •5 ϭ 101 •6 ϭ 110 •7 ϭ 111 •8 ϭ 1000 •9 ϭ 1001 • 10 ϭ 1010. ALGORITHMS The key principle in all computing devices is a sys- tematic process for completing a task. In mathematics, this systematic process is called an algorithm. Algorithms are common in daily life as well. For example, when building a house, the first step involves building the floor base (or foundation), followed by the walls, and then the ceiling or roof. This systematic procedure to solve the problem of building a house is an example of an algorithm. In a nutshell, algorithms are a list of step-by-step instructions. In mathematical terms, these are also some- times known as theorems. A computer program, or appli- cation, is made up of a number of such algorithms. Besides, every process in a computer also depends on a specific algorithm. For example, when switching on the computer, the computer does what is known as “booting.” Booting helps in properly loading the operating system (Windows, Mac, Dos, UNIX, and so on). During booting, the computer follows a set of instructions (defined by an algorithm). Similarly, while opening any program (say, MS Word), the computer is again instructed to follow a set of tasks so that the program opens properly. Like complex mathematical problems, even the most complex software programs are based on numerous algorithms. A Brief History of Discovery and Development Although the modern computer was built only in the twentieth century, many primitive forms of the computer were used in ancient times. The early calculators can also be considered as extremely basic computers based on similar mathematical concepts. The word calculator, is derived from the Latin word calculus (or a small stone). Early A calculating device created by Scottish mathematician John Napier in 1617 which consists of cylinders inscribed with multiplication tables. It’s also known as “Napier’s Bones.” BETTMANN/CORBIS. Computers and Mathematics 116 REAL-LIFE MATH human civilizations used small stones for counting. Count- ing boards made up of stones were used for basic arithmetic tasks such as addition, subtraction, and multiplication. This led to development of devices that enabled cal- culation of more complex numbers, and in quick time. With the progress of civilization, man saw the development of the abacus, the adding machine, the Babbage, and the prototype mainframe computers. Modern computers, however, were invented in the twentieth century. In 1948, the mathematician Claude Shannon (1916–2001), working at Bell Laboratories in the United States, developed computing concepts that would form the basis of modern information theory. Shannon is often known as the father of information sci- ence. Computers were earlier only used by government institutions. Home or personal computers (known as PCs) came much later in the late 1970s and 1980s. Today, personal computers and servers with a micro- processor chip (a small piece of computer hardware) are embedded in almost all lifestyle electronic products, from the washing machine and television to calculators and automobiles. Many of these chips are capable of comput- ing in the same capacity as some basic computers. The advancement of mathematical concepts and theories has made it possible to develop sophisticated computers in smaller and smaller sizes, such as those found in hand- held computers like the PDA (personal data assistant) and PMP (personal media player). Ciphers, codes, and secret writing based on mathe- matical concepts have been around since ancient times. In ancient Rome, they were used to communicate secrets over long distances. Such codes are now used extensively in the field of computer science. Real-life Applications BITS The bit is the smallest unit of information in a com- puter. As discussed earlier, a bit is a basic unit in a binary number system. A bit or binary digit stands for true or false, one or zero, on or off. The computer is made up of numerous switches. Each switch has two states (on and off). The value of each state represents a bit. Bits are the basic unit of storage in computers. In other words, all data is stored in the form of bits. The rea- son for using a binary number system rather than deci- mal system for storage (and other purposes) is that with prevailing technology, it is much easier to implement the binary system in computers. Implementing the binary system is significantly cheaper, as well. The speed of the computer (processor speed) in terms of processing applications is related to many fac- tors, including memory space (also known as random access memory, or RAM). Most home computers are either 32-bit or 64-bit; 32-bit and 64-bit are the sizes of the memory space. BYTES In computers, bits are bundled together into man- ageable collections called bytes. A byte consists of eight bits. Bits and bytes are always clubbed together like atoms and molecules. Computers are designed to store data and process instructions in bytes. To handle large quantities of information (or bits), other units such as kilobytes, megabytes, and gigabytes are used. One kilobyte (KB) ϭ 1,024 bytes ϭ 2 10 bytes (and not 1,000 bytes as commonly thought). Similarly, 1 megabyte (MB) ϭ 1,048,576 bytes ϭ 2 20 bytes, and 1 gigabyte (GB) ϭ 1,073,741,824 bytes ϭ 2 30 bytes. The first computers were 1-byte machines. In other words, they used octets or 8-bit bytes to store informa- tion, and they represented 256 values (2 8 values, integers zero to 255). The latest computing machines are 64-bit (or eight bytes). This type of representation makes computing eas- ier in terms of both storage and speed. Bits and bytes form the basis of many other computer processes and functions. These include CD storage, screen resolution, text coding, data comparison, data transmission, and much more. TEXT CODE All information in the computer is stored in the form of binary numbers. This includes text, as well. In other words, text is not stored as text, but as binary numbers. The rule that governs this representation is known as ASCII (American Standard Code for Information Inter- change). The ASCII system assigns a code to every letter of the alphabet (and other characters). This code is stored as a seven digit binary number in computers. Moreover, the ASCII code for a capital letter is different than the code for the small letter. For example, the ASCII code for “A” is 10, whereas that for “a” is 97. Consequently, the value of “A” is stored as 0001010 (its binary representa- tion), whereas “a” is 1100001. Every character is stored as eight bits (a leading bit in addition to the seven bits for the ASCII code), or one byte. Thus, the word “happy” would require five bytes. An entire page with 20 lines and 60 characters per line would require 1,200 bytes. Computers and Mathematics REAL-LIFE MATH 117 The main benefit of storing text code as binary num- bers is that it makes it easier for the computer to store and process the data. Besides, mathematical operations can be performed on binary representations of text. PIXELS, SCREEN SIZE, AND RESOLUTION A pixel is derived from the words picture and ele- ment. The smallest and the most basic unit of images in computers is the pixel. A pixel is a tiny square block. Images are made up of numerous pixels. The total num- ber of pixels in a computer image is known as the resolu- tion of the image. For example, a standard computer monitor displays images with the resolution 800 ϫ 600. This simply means that the image (or the entire computer screen) is 800 pixels wide and 600 pixels high. Each pixel is also stored as eight bits (or one byte). Again, its representation is in the form of binary num- bers. Storing the value of the color of a pixel is far easier in binary format, as compared with other formats. The maximum number of combinations of zeros and ones in an 8-bit number is 256 (2 8 ). Each combination represents a color. Simply put, every pixel can have one of 256 dif- ferent colors. This kind of computer display is called an “8-bit” or “256-color” display, and was very common in computers built in the 1990s. In contrast, newer computer monitors built after the year 2000 have a significantly higher num- ber of colors (in millions). These are the 16-bit and 24-bit monitors. The color of every pixel in a computer image is a combination of three different colors—red, green, and blue (RGB). RGB is common terminology used in com- puter graphics and images, and simply means that every color is a combination of some portion of red, green, and blue colors. The value of each of these colors is stored in one byte. For example, the color of a pixel could be 100 of red, 155 of green, and 200 of blue. Each of these values is stored in binary format in a byte. Note that the color val- ues can range from zero to 255. Thus, every color pixel has three bytes. Subsequently, a computer monitor with the resolution 800 ϫ 600 would need 3 ϫ 800 ϫ 600, or 1,440,000 bytes. IP ADDRESS Every computer on a network has a specific address. A number, known as the Internet protocol address, or IP address, indicates this. The reason for having an IP address is simple. To send a packet or a letter through reg- ular mail, the address of the recipient is required. Simi- larly, for communicating with a computer (from another computer), the address of that computer is required. Every computer has a unique IP address that clearly dis- tinguishes it from other computers. The concept of the IP address is based on mathematical principles, and there are rules that govern the value of the IP address. For example, an IP address is always a set of four numbers separated by dots (e.g., 204.65.130.40). Remember, the computer only understands binary numbers. Consequently, the IP address is also represented as a binary number. The binary representation is octet (equivalent to the representation of a byte). Technically, every IP address is a 32-bit number divided into four bytes, or octets (eight bites). Each octet represents a spe- cific number. For example, in the above case, 204 would be stored in one octet, 65 in another octet, and so on. The binary representation (as stored in the computer) for the above-mentioned IP address would be: 11001100 .01000001.10000010.0101000. Communication between computers becomes far easier with binary representation. The IP address consists of two components, the network address and the host address. The network address (the first two numbers) represents the address of the entire network. For example, if a computer is part of a network of computers con- nected into an entire company, the first two numbers would represent the IP address of the company. In other words, for all computers connected to the company net- work, the first two numbers would remain the same. Internet mathematics translates binary code into web addresses and other information. ROYALTY-FREE/CORBIS. Computers and Mathematics 118 REAL-LIFE MATH The host address (the last two numbers) represents the address of a computer specifically. For example, the third number might represent a particular department within a company, whereas the last number would represent a particular computer in that department. Consequently, two computers within the same depart- ment (and part of the same company) would have the same first three numbers. Only the last number would be different. Similarly, two computers that are part of dif- ferent departments would have the same first two numbers. As each number in the IP address is allowed a maxi- mum of one octet (or eight bites), the maximum value the number can have is 255. In other words, the values of every number in the IP address ranges from zero to 255. An IP address that contains a number higher than this range would be incorrect. For example, 204.256.12.0 is incorrect, as 256 is not valid. SUBNET MASK With the advent of the Internet, the number of com- puters that are connected worldwide is quickly rising. The Internet is a huge network of computers. Subsequently, each computer has an IP address that helps it communi- cate with the rest. For example, to send an email, the email address must be entered. This email address is translated to a specific IP address, that of the recipient. As of 2005, there are millions of computers connected to the Internet. As mentioned earlier, IP addresses have a limita- tion. Each number can only have a value within a specific range (zero to 255). The IP address given to any computer on the Inter- net is temporary. In other words, as soon as a computer connects to the Internet, it receives a unique IP address. As soon as the Internet is disconnected, this IP address is free and can be used by another computer. When the same computer connects again, it would get another IP address. With the high number of computers connected to the Internet simultaneously, it is difficult to accommo- date every computer within this range. This is where the concept of Subnet mask comes in. Subnets, as the name suggests, are sub-networks. The host address (from the IP address) is divided into further subnets to accommodate more computers. This is done in such a way that a part of the host address identifies the subnet. The subnet is also shown as a binary number. Communication becomes easier because of the binary representation. Take, for example, the IP address 204.65.130.40. Its binary equivalent is 11001100.01000001.10000010 .00101000. The subnets would have the same network address (first two numbers). The first four bits of the host address (third number) would be the same as well, to identify the host of the subnet. In this case, 1000 would be unchanged. The remaining four bits of the host address would be unique to each subnet. Every subnet, in turn, can have numerous computers. Every computer on the subnet would have a unique fourth number in the IP address. Consider the following scenario: The main IP address is 11001100.01000001 .10000010.00101000. This could have many subnets such as 11001100.01000001.10000111.00111010, 11001100 .01000001.10000101.0100010, and so on. Note that the first four digits of the third number (host address) are same but the remaining are different, indicating different sub- nets on the same host. The fourth number indicates a specific computer on the subnet. For computers on the same subnet, the first three numbers would remain the same. Simply put, the subnet mask ensures that more com- puters can be accommodated within a network. Every subnet mask number identifies the network address, the host, the subnet, as well as the computer. COMPRESSION Computers store (and process) data that include numbers, arithmetic calculations, and words. In addition, the data may also be in the form of pictures, graphics, and videos. In computers, data is stored in files. File sizes, depending on the type of data, can be huge. Many times the size of a file becomes unmanageable. In such cases, bet- ter ways of storing and process data, must be used. Given below are some comparisons to provide a better under- standing of sizes of different files on a computer. One alphabetic character is represented by one byte, one word is equivalent to eight to ten bytes or so, a page averages about two kilobytes, an entire book averages one megabyte or more, twenty seconds of good quality video occupy anywhere from two to ten megabytes, and so on. Similarly, a compact disc (CD) has 600–800 megabytes of data. Storing such huge amounts of information in a com- puter can often be difficult. Besides, it is almost impossi- ble to send large data from one computer to another through e-mail or other similar means. Moreover, down- loading a significant amount of data from the Internet (such as movie files, databases, application programs) can be extremely time consuming, especially if using a slow dial up connection. This is where compression of the data into a manageable size becomes important. Computers and Mathematics REAL-LIFE MATH 119 Certain applications based on mathematical algo- rithms compress the data. This allows the basic data that a computer sees in binary format, to be stored in a com- pressed format requiring much lower storage space. Compressed data can be uncompressed using the same application and algorithm. Compression is extremely beneficial, especially when a large file has to be sent from one computer to another. In case of e-mail, sending a one-megabyte (MB) file through a dial up connection, would take considerable time, anywhere from fifteen to thirty minutes. Bigger files would take even longer. Besides, e-mails might not have the capacity of sending (or receiving) bigger files. In such cases, sending zipped files that are much smaller is useful. Similarly, downloading compressed files from the Inter- net rather than the large original ones is a better option. There are also other types and methods for compress- ing. Run length compression is another type that is used widely. In run length compression, large chunks, or runs, of consecutive identical data values are taken, and each of these is replaced by a common code. In addition to the code, the data value and the total length are also recorded. Run length compression can be quite effective. However, it is not used for certain types of data such as text, and exe- cutable programs. For these types of files, run length com- pression does not work. Without going into the technical specifics of run length compression, this method works quite well on certain types of data (especially images and graphics), and is subsequently applied to many data com- pression algorithms. Most compressed files can be un- compressed to obtain the original. However, in almost all cases, some data is lost in the process. For visual and audio data, some loss of quality is allowed without losing the main data. By taking advantage of limitations of the human sensory system, a great deal of space is saved while creating a copy that is very similar to the original. In other words, although compression results in some data loss, this loss can be insignificant and the naked eye usually cannot usually discern the difference between the original and the un-compressed file. The defining characteristics of these compression methods are their compression speed, the compressed size, and the loss of data during compression. Apart from computers, compression of images and video is also used in digital cameras and camcorders. The main purpose is to reduce the size of the image (or video) without compromising on the quality. Similarly, DVDs also use compression techniques based on mathematical algorithms to store video. In audio compression, compression methods remove non-audible (or less audible) components of the signal while compressing. Compression of human speech is sometimes done using algorithms and tools that are far more complex. Audio compression has applications in Internet telephony (voice chat through the internet), audio CDs, MP3 CDs, and more. DATA TRANSMISSION In computing, data transmission means sending a stream of data (in bits or bytes) from one location to another, using different technologies. Two of these technologies are coding theory and hamming codes. These are both based on algorithms and other mathematical concepts. Coding theory ensures data integrity during trans- mission. In other words, it ascertains that the original data is safely received, without any loss. Messages are usu- ally not transmitted in their original form. They are transmitted in coded or encrypted form (described later). Coding theory is about making transmitted messages easy to read. Coding theory is based on algorithms. In 1948, the mathematician Claude Shannon presented cod- ing theory by showing that it was possible to encode in an effective manner. In its simplest form, a coded message is in the form of binary digits or bits, strings of zero or one. The bits are transmitted along a channel (such as a tele- phone line). While transmitting, a few errors may occur. To compensate for the errors, more bits of information than required are generally transmitted. The simplest method (part of the coding theory developed by Shannon) for detecting errors in binary data is the parity code. Concisely, this method transmits an extra bit, known as the parity bit, after every seven bits from the source message. However, the parity code method can merely detect errors, not correct them. The only method for correcting them is to ask for the data to be transmitted again. Shannon developed another algorithm, known as the repetition algorithm, to ensure detection as well as correc- tion of errors. This is accomplished by repeating each bit a specific number of times. The recipient sees which value (zero or one) occurred more often and assumed that was the actual value. This process can detect and correct any number of errors, depending on how many repeats of each bit are sent. The disadvantage of the repetition algorithm is that it transmits a high number of bits, resulting in a considerable amount of repetitive bits. Besides, the assumption that a bit that is received more often, is the actual bit, may not hold true in all cases. Another mathematician, Richard Hamming (1915– 1998), built more complex algorithms for error correction. Known as Hamming codes, these were more efficient, even Computers and Mathematics 120 REAL-LIFE MATH with very low repetition. Initially, Hamming produced a code (based on an algorithm) in which four data bits were followed by three check bits that allowed the detection and the correction of a single error. Although, the number of additional bits is still high, it is without a doubt lower than the total number of bits transmitted by the repetition algo- rithm. Subsequently, these additional bits (check bits) were reduced even further by improving the underlying algo- rithms. Hamming codes are commonly used for transmit- ting not just basic data (in the form of simple email messages), but also more complex information. One such example is astronomy. The National Aero- nautics and Space Administration (NASA) uses these techniques while transmitting data from their spacecrafts back to Earth (and vice versa). Take, for example, the NASA Mariner spacecraft sent to Mars in the 1960s. In this case, coding and error correction in data transmis- sion was vital, as the data was sent from a weak transmit- ter over very long distances. Here the data was read perfectly using the Hamming code algorithm. In the late 1960s and early 1970s, the NASA Mariner sent data using more advanced versions of the Hamming and coding the- ories, capable of correcting seven errors out of thirty-two bits transmitted. Using this algorithm, over 16,000 bits per second of data was successfully relayed back to Earth. Similar data transmission algorithms are used exten- sively for communication through the Internet since the late 1990s. The Hamming codes are also used in prepar- ing compact discs (CDs). To guard against scratches, cracks, and similar damage, two overlapped Hamming codes are used. These have a high rate of error correction. ENCRYPTION Considerable confidential data is stored and trans- mitted from computers. Security of such data is essential. This can be achieved through specialized techniques known as encryption. Encryption converts the original message into coded form that cannot be interpreted unless it is de-coded back to the original (decryption). Encryption, a concept of cryptography, is the most effec- tive way to achieve data security. It is based on complex mathematical algorithms. Consider the message abcdef1234ghij56789. There are several ways of coding (or encrypting) this informa- tion. One of the simplest ways is to replace each alphabet by a corresponding number, and vice versa. For example, “a” would become “1”, “b” would be “2”, and so on. The above original message can, thus be encrypted as 123456abcd78910 efghi. The message is decrypted using the same process and converted back in the original form. Complex mathematical algorithms are designed to cre- ate far more complex encryption methods. The informa- tion regarding the encryption method is known as the key. Cryptography provides three types of security for data: • Confidentiality through encryption—This is the process mentioned above. All confidential data is encrypted using certain mathematical algorithms. A key is required to decrypt the data back into its origi- nal form. Only the right people have access to the key. • Authentication—A user trying to access coded or protected data must authenticate himself/herself. This is done through his/her personal information. Password protection is a type of authentication that is widely used in computers and on the Internet. • Integrity—This type of security does not limit access to confidential information, as in the above cases. However, it detects when such confidential is modi- fied. Cryptographic techniques, in this case, do not show how the information has been modified, just that it has been modified. There are two main types of encryption used in computers (and the Internet)—asymmetric encryption (or public-key encryption), and symmetric encryption (or secret key encryption). Each of these is based on dif- ferent mathematical algorithms that vary in function and complexity. In brief, public key encryption uses a pair of keys, the public key, and the private key. These keys are compli- mentary, in the sense that a message encrypted using a particular public key can only be decrypted using a cor- responding private key. The public key is available to all (it is public). However, the private key is accessible only by the receiver of a data transmission. The sender encrypts the message using the public key (corresponding to the private key of the receiver). Once the receiver gets the data, it is decrypted using the private key. The private key is not shared with anyone other than the receiver, or the security of the data is compromised. Alternatively, symmetric secret key encryption relies on the same key for both encryption and decryption. The main concern in this case is the security of the key. Sub- sequently, the key has to be such that even if someone gets hold of it, the decryption method does not become too obvious. For this purpose, encryption and decryption algorithms for secret key encryption are quite complex. The key, as expected, is shared only by the receiver and the sender (unlike public key encryption, where everyone knows the public key). The key can be anything ranging from a number, a word, or a string of jumbled up letters and other characters. In simple terms, the original [...]... words, the average score is determined Bob’s GPA is (4.00 ϩ 3. 33 ϩ 3. 00 ϩ 2.00 ϩ 1.67) / 5, or 2.80 John’s GPA is (4.00 ϩ 4.00 ϩ 3. 33 ϩ 3. 00 ϩ 1.00) / 5, or 3. 066 Points 4.00 3. 67 3. 33 3.00 2.67 2 .33 2.00 1.67 1 .33 1.00 0.67 0.0 Figure 2 Where to Learn More Bob A Bϩ B C CϪ John 4.00 3. 33 3.00 2.00 1.67 A A Bϩ B D 4.00 4.00 3. 33 3.00 1.00 Figure 3 GPA is based on the points that are assigned to a course... 200-meter race in 19 .32 seconds, he runs at an average speed of average speed of 10 .35 meters per second [200 m / 19 .32 s ϭ 10 .35 m/s] If a student wishes to convert this to miles per hour the conversion should be carried out as follows: (10 .35 m/s) (1 mile / 1,609 m) (3, 600 s / 1 hr) ϭ 23. 2 miles/hr The units cancel as follows: (10 .35 m/s) (1 mile / 1,609 m) (3, 600 s / 1 hr) ϭ 23. 2 miles/hr Students... coincide with the horizontal, or the x axis in the Cartesian system E 8 Figure 1: Rectangular coordinates P O L A R C O O R D I N AT E S R 7 X axis F E M A T H 120° 60° 150° 30 ° 180° 10 20 30 210° 40 0° 50 33 0° (30 , 30 0) 240° 30 0° 270° Figure 2: Polar coordinates valley of the Nile in ancient Egypt, and recording journeys of global exploration such as those of the Spanish explorer Christopher Columbus... either the Kelvin scale or the absolute temperature scale The normal freezing and boiling points of water on the Kelvin scale, then, are 273K and 37 3K, respectively, or, more accurately, 2 73. 16K and 37 3.16K To convert a Celsius temperature to Kelvin, just add 2 73. 16 The Kelvin scale is not the only absolute temperature scale The Rankine scale, named for the Scottish engineer William Rankine (1820–1872),... Sausalito: Math Solutions Publications, 2002 Mitchell, C Funtastic Math! Decimals and Fractions New York: Scholastic, 1999 Schwartz, D.M On Beyond a Million: An Amazing Math Journey New York: Dragonfly Books, 2001 Web sites BMCC Math Tutorials “Introduction to Decimals.” Ͻhttp:// www.bmcc.org/nish/MathTutorials/Decimals/Ͼ (October 30 , 2004) R E A L - L I F E M A T H Overview Demographics is the mathematical... University Press, 20 03 Wallace, P Agequake: Riding the Demographic Rollercoaster Shaking Business, Finance, and Our World London: Nicholas Brealey Publishing, 2001 1 43 Overview Discrete Mathematics Discrete mathematics includes all types of math that deal with discrete objects, that is, things that are distinct, unconnected, or step-by-step in nature For example, the natural numbers 0, 1, 2, 3, 4, are discrete,... Earth is slowing down; with days keep getting a little longer as time passes Thus, the second is now defined in terms of the vibrations of the cesium- 133 atom One second is defined as the amount of time it takes for a cesium- 133 atom to vibrate 9,192, 631 ,770 times This may sound like a strange definition, but it is a superbly accurate way of fixing the standard size of the second, because the vibrations... The increasing use of computers in science, engineering, mathematics, and daily life has led to fast growth in discrete mathematics over the last 30 years or so Digital computers store numbers, words, and images in discrete form, that is, as ones and zeroes, so designing and programming computers involves discrete mathematics Today, discrete mathematics is basic to most areas of computer science, including... branch of mathematics that is concerned mostly with continuous rather than discrete objects However, discrete and continuous mathematics often overlap or influence each other Fundamental Mathematical Concepts and Terms LOGIC, SETS, AND FUNCTIONS The foundation of discrete mathematics is the study of logic, statements, sets, and functions Logic is the study of the rules of thinking It helps mathematicians... machines had been built) Boole’s book, in which he laid out the rules of arithmetic using the simplest possible number system (0 and 1), was thought to be “pure” math, that is, math having no application to reallife. ” But in 1 938 the American mathematician Claude Shannon (1916–2001) showed that Boolean algebra could be used to design electrical circuits It is easier and cheaper to build a circuit that . on the Kelvin scale, then, are 273K and 37 3K, respectively, or, more accurately, 2 73. 16K and 37 3.16K. To convert a Celsius temperature to Kelvin, just add 2 73. 16. The Kelvin scale is not the. [200 m / 19 .32 s ϭ 10 .35 m/s]. If a student wishes to convert this to miles per hour the conversion should be carried out as follows: (10 .35 m/s) (1 mile / 1,609 m) (3, 600 s / 1 hr) ϭ 23. 2 miles/hr School 3 School 4 650 200 400 100 35 0 850 Female Male Figure 14. 9th Grade 10th Grade 11th Grade 12th Grade 500 700 900 0 School 1 School 2 School 3 School 4 650 200 400 100 35 0 850 Figure 13. 540 600 400 780 500 700 900 0 School

Ngày đăng: 05/08/2014, 14:20

Từ khóa liên quan

Tài liệu cùng người dùng

  • Đang cập nhật ...

Tài liệu liên quan