Download
Another Novel Books Continue Reading ...
Tuesday, December 7, 2010
Supernova - Petir
Daftar Isi
Cuap-cuap (tentang) Penerbit iii
Cuap-cuap (tentang) Penulis iv
Daftar Isi viii
Keping 37 - Kado Hari Jadi 1
Keping 38 - PETIR 9
Keping 39 - Dua Siluet Yang Berangkulan 189
Download
Another Novel Books
Continue Reading ...
Social Networks and the Semantic Web
In this book we provide two major case studies to demonstrate each of these opportunities. The first case study shows the possibilities of tracking a research community over the Web, combining the information obtained from the Web with other
data sources (publications, emails). The results are analyzed and correlated with performance measures, trying to predict what kind of social networks help researchers
succeed (Chapter 8). Social network mining from theWeb plays an impotant role in this case study for obtaining large scale, dynamic network data beyond the possibilities of survey methods. In turn semantic technology is the key to the representation and aggregation of information from multiple heterogeneous information sources (Chapters 4 and 5).
As the methods we are proposing are more generally applicable than the context of our scientometric study, most of this volume is spent on describing our methods rather than discussing the results. We summarize the possibilities for (re)using electronic data for network analysis in Chapter 3 and evaluate two methods of social network mining from theWeb in a separate study described in Chapter 7.We discuss semantic technology for social network data aggregation in Chapters 4 and 5. Lastly, we describe the implementation of our methods in the award-winning Flink system in Chapter 6. In fact these descriptions should not only allow the reader to reproduce
our work, but to apply our methods in a wide range of settings. This includes
adapting our methods to other social settings and other kinds of information sources, while preserving the advantages of a fully automated analysis process based on electronic data.
Our second study highlights the role of the social context in user-generated classifications of content, in particular in the tagging systems known as folksonomies
(Chapter 9). Tagging is widely applied in organizing the content in many Web 2.0
services, including the social bookmarking application del.icio.us and the photo sharing site Flickr. We consider folksonomies as lightweight semantic structures where
the semantics of tags emerges over time from the way tags are applied. We study
tagging systems using the concepts and methodology of network analysis. We establish
that folksonomies are indeed much richer in semantics than it might seem at
first and we show the dependence of semantics on the social context of application.
These results are particularly relevant for the development of the Semantic Web using
bottom-up, collaborative approaches. Putting the available knowledge in a social
context also opens the way to more personalized applications such as social search.
As the above descriptions show, both studies are characterized by an interdisciplinary
approach where we combine the concepts and methods of Artificial Intelligence with those of Social Network Analysis. However, we will not assume any particularly knowledge of these fields on the part of the reader and provide the necessary
introductions to both (Chapters 1 and 2). These introductions should allow access to our work for both social scientists with an interest in electronic data and for information scientists with an interest in social-semantic applications.
Our primary goal is not to teach any of these disciplines in detail but to provide an insight for both Social and Information Scientists into the concepts and methods from outside their respective fields. We show a glimpse of the benefits that this understanding could bring in addressing complex outstanding issues that are inherently
interdisciplinary in nature. Our hope is then to inspire further creative experimentation toward a better understanding of both online social interaction and the nature of human knowledge. Such understanding will be indispensable in a world where the border between these once far-flung disciplines is expected to shrink rapidly through more and more socially immersive online environments such as the virtual worlds of Second Life. Only when equipped with the proper understanding will we succeed in designing systems that show true intelligence in both reasoning and social capabilities and are thus able to guide us through an ever more complex online universe.
The Author would like to acknowledge the support of the Vrije Universiteit Research
School for Business Information Sciences (VUBIS) in conducting the research contained in this volume.
Download
Another Social Network Books
Another Semantic Web Books Continue Reading ...
Fundamentals of Database Systems 3rd Edition
Contents of This Edition
(Fundamentals of Database Systems, Third Edition)
Part 1 describes the basic concepts necessary for a good understanding of database design and implementation, as well as the conceptual modeling techniques used in database systems. Chapter 1 and Chapter 2 introduce databases, their typical users, and DBMS concepts, terminology, and architecture. In Chapter 3, the concepts of the Entity-Relationship (ER) model and ER diagrams are presented and used to illustrate conceptual database design. Chapter 4 focuses on data abstraction and semantic data modeling concepts, and extends the ER model to incorporate these ideas, leading to the enhanced-ER (EER) data model and EER diagrams. The concepts presented include subclasses, specialization, generalization, and union types (categories). The notation for the class diagrams of
UML are also introduced. These are similar to EER diagrams and are used increasingly in conceptual object modeling. Part 1 concludes with a description of the physical file structures and access methods used in database systems. Chapter 5 describes the primary methods of organizing files of records on disk, including static and dynamic hashing. Chapter 6 describes indexing techniques for files, including B-tree and B+-tree data structures and grid files.
Part 2 describes the relational data model and relational DBMSs. Chapter 7 describes the basic relational model, its integrity constraints and update operations, and the operations of the relational algebra. Chapter 8 gives a detailed overview of the SQL language, covering the SQL2 standard, which is implemented in most relational systems. Chapter 9 begins with two sections that describe relational schema design, starting from a conceptual database design in an ER or EER model, and concludes with three sections introducing the formal relational calculus languages and an overview of the QBE language. Chapter 10 presents overviews of the Oracle and Microsoft Access database systems as examples of popular commercial relational database management systems.
Part 3 gives a comprehensive introduction to object databases and object-relational systems. Chapter 11 introduces object-oriented concepts and how they apply to object databases. Chapter 12 gives a detailed overview of the ODMG object model and its associated ODL and OQL languages, and gives examples of two commercial object DBMSs. Chapter 13 describes how relational databases are being extended to include object-oriented concepts and presents the features of two object-relational systems—Informix
Universal Server and ORACLE 8, as well as giving an overview of some of the features of the proposed SQL3 standard, and the nested relational data model.
Part 4 covers several topics related to database design. Chapter 14 and Chapter 15 cover the formalisms, theory, and algorithms developed for relational database design by normalization. This material includes functional and other types of dependencies and normal forms for relations. Step by step intuitive normalization is presented in Chapter 14, and relational design algorithms are given in Chapter 15, which also defines other types of dependencies, such as multivalued and join dependencies. Chapter 16 presents an overview of the different phases of the database design process
for medium-sized and large applications, and it also discusses physical database design issues and includes a discussion on database tuning.
Part 5 discusses the techniques used in implementing database management systems. Chapter 17 introduces DBMS system architectures, including centralized and client-server architectures, then describes the system catalog, which is a vital part of any DBMS. Chapter 18 presents the techniques used for processing and optimizing queries specified in a high-level database language—such as SQL—and discusses various algorithms for implementing relational database operations. A section on query optimization in ORACLE has been added. Chapter 19, Chapter 20 and Chapter 21 discuss
transaction processing, concurrency control, and recovery techniques—this material has been revised to include discussions of how these concepts are realized in SQL. Chapter 22 discusses database security and authorization techniques.
Part 6 covers a number of advanced topics. Chapter 23 gives detailed introductions to the concepts of active and temporal databases—which are increasingly being incorporated into database applications—and also gives an overview of spatial and multimedia database concepts. Chapter 24 discusses distributed databases, issues for design, query and transaction processing with data distribution, and the different types of client-server architectures. Chapter 25 introduces the concepts of deductive database systems and surveys a few implementations. Chapter 26 discusses the new technologies of data warehousing and data mining for decision support applications. Chapter 27 surveys the new trends in database technology including Web, mobile and multimedia databases and overviews impotant emerging applications of databases: geographic information systems (GIS), human genome databases, and digital libraries.
Appendix A gives a number of alternative diagrammatic notations for displaying a conceptual ER or EER schema. These may be substituted for the notation we use, if the instructor so wishes. Appendix B gives some impotant physical parameters of disks. Appendix C and Appendix D cover legacy database systems, based on the network and hierarchical database models. These have been used for over 30
years as a basis for many existing commercial database applications and transaction-processing systems and will take decades to replace completely. We consider it impotant to expose students of database management to these long-standing approaches. Full chapters from the second edition can be found at the Website for this edition.
Download
Another The Core of CS Books
Another Database Books Continue Reading ...
Monday, December 6, 2010
Programming The Microsoft Windows Driver model 2nd
Organization of This Book
After teaching driver programming seminars for many years, I've come to understand that people learn things in fundamentally different ways. Some people like to learn a great deal of theory about something and then learn how to apply that theory to practical problems. Other people like to learn practical things first and then learn the general theory. I call the former approach deductive and the latter approach inductive. I personally prefer an inductive approach, and I've organized this book to suit that style of learning.
My aim is to explain how to write device drivers. Broadly speaking, I want to provide the minimum background you'll need to write an actual driver and then move on to more specialized topics. That "minimum background" is pretty extensive, however; it consumes seven chapters. Once past Chapter 7, you'll be reading about topics that are impotant but not necessarily on the fall line that leads straight downhill to a working driver.
Chapter 1, "Beginning a Driver Project," as I've mentioned, describes WDM device drivers and how they relate to Windows itself. Along the way, I'll relate the story of how we got to where we are today in operating system and driver technology. The chapter also explains how to choose the kind of driver you need, provides an overview and checklist specifically for development managers, and addresses the issue of binary compatibility.
Chapter 2, "Basic Structure of a WDM Driver," explains the basic data structures that Windows 2000 uses to manage I/O devices and the basic way your driver relates to those data structures. I'll discuss the driver object and the device object. I'll also discuss how you write two of the subroutines—the DriverEntry and AddDevice routines—that every WDM driver package contains.
Chapter 3, "Basic Programming Techniques," describes the most impotant service functions you can call on to perform mundane programming tasks. In that chapter, I'll discuss error handling, memory management, and a few other miscellaneous tasks.
Chapter 4, "Synchronization," discusses how your driver can synchronize access to shared data in the multitasking, multiprocessor world of Windows XP. You'll learn the details about interrupt request level (IRQL) and about various synchronization primitives that the operating system offers for your use.
Chapter 5, "The I/O Request Packet," introduces the subject of input/output programming, which of course is the real reason for this book. I'll explain where I/O request packets come from, and I'll give an overview of what drivers do with them when they follow what I call the "standard model" for IRP processing. I'll also discuss the knotty subject of IRP queuing and cancellation, wherein accurate reasoning about synchronization problems becomes crucial.
Chapter 6, "Plug and Play for Function Drivers," concerns just one type of I/O request packet, namely IRP_MJ_PNP. The Plug and Play Manager component of the operating system sends you this IRP to give you details about your device's configuration and to notify you of impotant events in the life of your device.
Chapter 7, "Reading and Writing Data," is where we finally get to write driver code that performs I/O operations. I'll discuss how you obtain configuration information from the PnP Manager and how you use that information to prepare your driver for "substantive" IRPs that read and write data. I'll present two simple driver sample programs as well: one for dealing with a PIO device and one for dealing with a bus-mastering DMA device.
Chapter 8, "Power Management," describes how your driver participates in power management. I think you'll find, as I did, that power management is pretty complicated. Unfortunately, you have to participate in the system's power management protocols, or else the system as a whole won't work right. Luckily, the community of driver writers already has a grand tradition of cutting and pasting, and that will save you.
Chapter 9, "I/O Control Operations," contains a discussion of this impotant way for applications and other drivers to communicate "out of band" with your driver.
Chapter 10, "Windows Management Instrumentation," concerns a scheme for enterprisewide computer management in which your driver can and should participate. I'll explain how you can provide statistical and performance data for use by monitoring applications, how you can respond to standard WMI controls, and how you can alert controlling applications of impotant events when they occur.
Chapter 11, "Controller and Multifunction Devices," discusses how to write a driver for a device that embodies multiple functions, or multiple instances of the same function, in one physical device.
Chapter 12, "The Universal Serial Bus," describes how to write drivers for USB devices.
Chapter 13, "Human Interface Devices," explains how to write a driver for this impotant class of devices.
Chapter 14, "Specialized Topics," describes system threads, work items, error logging, and other special programming topics.
Chapter 15, "Distributing Device Drivers," tells you how to arrange for your driver to get installed on end user systems. You'll learn the basics of writing an INF file to control installation, and you'll also learn some interesting and useful things to do with the system registry. This is where to look for information about WHQL submissions too.
Chapter 16, "Filter Drivers," discusses when you can use filter drivers to your advantage and how to build and install them.
Appendix A, "Coping with Cross-Platform Incompatibilities," explains how to determine which version of the operating system is in control and how to craft a binary-compatible driver.
Appendix B, "Using WDMWIZ.AWX," describes how to use my Visual C++ application wizard to build a driver. WDMWIZ.AWX is not intended to take the place of a commercial toolkit. Among other things, that means that it's not easy enough to use that you can dispense with documentation.
Download
Another Programming Language Continue Reading ...
Sunday, December 5, 2010
Applied Cryptography, Second Edition: Protocols, Algorthms, and Source Code in C
(Publisher: John Wiley & Sons, Inc.)
Author(s): Bruce Schneier
ISBN: 0471128457
Publication Date: 01/01/96
Foreword by Whitfield Diffie
Preface
About the Author
Chapter 1—Foundations
1.1 Terminology
1.2 Steganography
1.3 Substitution Ciphers and Transposition Ciphers
1.4 Simple XOR
1.5 One-Time Pads
1.6 Computer Algorithms
1.7 Large Numbers
Part I—Cryptographic Protocols
Chapter 2—Protocol Building Blocks
2.1 Introduction to Protocols
2.2 Communications Using Symmetric Cryptography
2.3 One-Way Functions
2.4 One-Way Hash Functions
2.5 Communications Using Public-Key Cryptography
2.6 Digital Signatures
2.7 Digital Signatures with Encryption
2.8 Random and Pseudo-Random-Sequence Generation
Chapter 3—Basic Protocols
3.1 Key Exchange
3.2 Authentication
3.3 Authentication and Key Exchange
3.4 Formal Analysis of Authentication and Key-Exchange Protocols
3.5 Multiple-Key Public-Key Cryptography
3.6 Secret Splitting
3.7 Secret Sharing
3.8 Cryptographic Protection of Databases
Chapter 4—Intermediate Protocols
4.1 Timestamping Services
4.2 Subliminal Channel
4.3 Undeniable Digital Signatures
4.4 Designated Confirmer Signatures
4.5 Proxy Signatures
4.6 Group Signatures
4.7 Fail-Stop Digital Signatures
4.8 Computing with Encrypted Data
4.9 Bit Commitment
4.10 Fair Coin Flips
4.11 Mental Poker
4.12 One-Way Accumulators
4.13 All-or-Nothing Disclosure of Secrets
4.14 Key Escrow
Chapter 5—Advanced Protocols
5.1 Zero-Knowledge Proofs
5.2 Zero-Knowledge Proofs of Identity
5.3 Blind Signatures
5.4 Identity-Based Public-Key Cryptography
5.5 Oblivious Transfer
5.6 Oblivious Signatures
5.7 Simultaneous Contract Signing
5.8 Digital Certified Mail
5.9 Simultaneous Exchange of Secrets
Chapter 6—Esoteric Protocols
6.1 Secure Elections
6.2 Secure Multiparty Computation
6.3 Anonymous Message Broadcast
6.4 Digital Cash
Part II—Cryptographic Techniques
Chapter 7—Key Length
7.1 Symmetric Key Length
7.2 Public-Key Key Length
7.3 Comparing Symmetric and Public-Key Key Length
7.4 Birthday Attacks against One-Way Hash Functions
7.5 How Long Should a Key Be?
7.6 Caveat Emptor
Chapter 8—Key Management
8.1 Generating Keys
8.2 Nonlinear Keyspaces
8.3 Transferring Keys
8.4 Verifying Keys
8.5 Using Keys
8.6 Updating Keys
8.7 Storing Keys
8.8 Backup Keys
8.9 Compromised Keys
8.10 Lifetime of Keys
8.11 Destroying Keys
8.12 Public-Key Key Management
Chapter 9—Algorithm Types and Modes
9.1 Electronic Codebook Mode
9.2 Block Replay
9.3 Cipher Block Chaining Mode
9.4 Stream Ciphers
9.5 Self-Synchronizing Stream Ciphers
9.6 Cipher-Feedback Mode
9.7 Synchronous Stream Ciphers
9.8 Output-Feedback Mode
9.9 Counter Mode
9.10 Other Block-Cipher Modes
9.11 Choosing a Cipher Mode
9.12 Interleaving
9.13 Block Ciphers versus Stream Ciphers
Chapter 10—Using Algorithms
10.1 Choosing an Algorithm
10.2 Public-Key Cryptography versus Symmetric Cryptography
10.3 Encrypting Communications Channels
10.4 Encrypting Data for Storage
10.5 Hardware Encryption versus Software Encryption
10.6 Compression, Encoding, and Encryption
10.7 Detecting Encryption
10.8 Hiding Ciphertext in Ciphertext
10.9 Destroying Information
Part III—Cryptographic Algorithms
Chapter 11—Mathematical Background
11.1 Information Theory
11.2 Complexity Theory
11.3 Number Theory
11.4 Factoring
11.5 Prime Number Generation
11.6 Discrete Logarithms in a Finite Field
Chapter 12—Data Encryption Standard (DES)
12.1 Background
12.2 Description of DES
12.3 Security of DES
12.4 Differential and Linear Cryptanalysis
12.5 The Real Design Criteria
12.6 DES Variants
12.7 How Secure Is DES Today?
Chapter 13—Other Block Ciphers
13.1 Lucifer
13.2 Madryga
13.3 NewDES
13.4 FEAL
13.5 REDOC
13.6 LOKI
13.7 Khufu and Khafre
13.8 RC2
13.9 IDEA
13.10 MMB
13.11 CA-1.1
13.12 Skipjack
Chapter 14—Still Other Block Ciphers
14.1 GOST
14.2 CAST
14.3 Blowfish
14.4 SAFER
14.5 3-Way
14.6 Crab
14.7 SXAL8/MBAL
14.8 RC5
14.9 Other Block Algorithms
14.10 Theory of Block Cipher Design
14.11 Using one-Way Hash Functions
14.12 Choosing a Block Algorithm
Chapter 15—Combining Block Ciphers
15.1 Double Encryption
15.2 Triple Encryption
15.3 Doubling the Block Length
15.4 Other Multiple Encryption Schemes
15.5 CDMF Key Shortening
15.6 Whitening
15.7 Cascading Multiple Block Algorithms
15.8 Combining Multiple Block Algorithms
Chapter 16—Pseudo-Random-Sequence Generators and Stream Ciphers
16.1 Linear Congruential Generators
16.2 Linear Feedback Shift Registers
16.3 Design and Analysis of Stream Ciphers
16.4 Stream Ciphers Using LFSRs
16.5 A5
16.6 Hughes XPD/KPD
16.7 Nanoteq
16.8 Rambutan
16.9 Additive Generators
16.10 Gifford
16.11 Algorithm M
16.12 PKZIP
Chapter 17—Other Stream Ciphers and Real Random-Sequence Generators
17.1 RC4
17.2 SEAL
17.3 WAKE
17.4 Feedback with Carry Shift Registers
17.5 Stream Ciphers Using FCSRs
17.6 Nonlinear-Feedback Shift Registers
17.7 Other Stream Ciphers
17.8 System-Theoretic Approach to Stream-Cipher Design
17.9 Complexity-Theoretic Approach to Stream-Cipher Design
17.10 Other Approaches to Stream-Cipher Design
17.11 Cascading Multiple Stream Ciphers
17.12 Choosing a Stream Cipher
17.13 Generating Multiple Streams from a Single Pseudo-Random-Sequence Generator
17.14 Real Random-Sequence Generators
Chapter 18—One-Way Hash Functions
18.1 Background
18.2 Snefru
18.3 N- Hash
18.4 MD4
18.5 MD5
18.6 MD2
18.7 Secure Hash Algorithm (SHA)
18.8 RIPE-MD
18.9 HAVAL
18.10 Other One-Way Hash Functions
18.11 One-Way Hash Functions Using Symmetric Block Algorithms
18.12 Using Public-Key Algorithms
18.13 Choosing a One-Way Hash Function
18.14 Message Authentication Codes
Chapter 19—Public-Key Algorithms
19.1 Background
19.2 Knapsack Algorithms
19.3 RSA
19.4 Pohlig-Hellman
19.5 Rabin
19.6 ElGamal
19.7 McEliece
19.8 Elliptic Curve Cryptosystems
19.9 LUC
19.10 Finite Automaton Public-Key Cryptosystems
Chapter 20—Public-Key Digital Signature Algorithms
20.1 Digital Signature Algorithm (DSA)
20.2 DSA Variants
20.3 Gost Digital Signature Algorithm
20.4 Discrete Logarithm Signature Schemes
20.5 Ong-Schnorr-Shamir
20.6 ESIGN
20.7 Cellular Automata
20.8 Other Public-Key Algorithms
Chapter 21—Identification Schemes
21.1 Feige-Fiat-Shamir
21.2 Guillou-Quisquater
21.3 Schnorr
21.4 Converting Identification Schemes to Signature Schemes
Chapter 22—Key-Exchange Algorithms
22.1 Diffie-Hellman
22.2 Station-to-Station Protocol
22.3 Shamir’s Three-Pass Protocol
22.4 COMSET
22.5 Encrypted Key Exchange
22.6 Fortified Key Negotiation
22.7 Conference Key Distribution and Secret Broadcasting
Chapter 23—Special Algorithms for Protocols
23.1 Multiple-Key Public-Key Cryptography
23.2 Secret-Sharing Algorithms
23.3 Subliminal Channel
23.4 Undeniable Digital Signatures
23.5 Designated Confirmer Signatures
23.6 Computing with Encrypted Data
23.7 Fair Coin Flips
23.8 One-Way Accumulators
23.9 All-or-Nothing Disclosure of Secrets
23.10 Fair and Failsafe Cryptosystems
23.11 Zero-Knowledge Proofs of Knowledge
23.12 Blind Signatures
23.13 Oblivious Transfer
23.14 Secure Multiparty Computation
23.15 Probabilistic Encryption
23.16 Quantum Cryptography
Part IV—The Real World
Chapter 24—Example Implementations
24.1 IBM Secret-Key Management Protocol
24.2 MITRENET
24.3 ISDN
24.4 STU-III
24.5 Kerberos
24.6 KryptoKnight
24.7 SESAME
24.8 IBM Common Cryptographic Architecture
24.9 ISO Authentication Framework
24.10 Privacy-Enhanced Mail (PEM)
24.11 Message Security Protocol (MSP)
24.12 Pretty Good Privacy (PGP)
24.13 Smart Cards
24.14 Public-Key Cryptography Standards (PKCS)
24.15 Universal Electronic Payment System (UEPS)
24.16 Clipper
24.17 Capstone
24.18 AT&T Model 3600 Telephone Security Device (TSD)
Chapter 25—Politics
25.1 National Security Agency (NSA)
25.2 National Computer Security Center (NCSC)
25.3 National Institute of Standards and Technology (NIST)
25.4 RSA Data Security, Inc.
25.5 Public Key Partners
25.6 International Association for Cryptologic Research (IACR)
25.7 RACE Integrity Primitives Evaluation (RIPE)
25.8 Conditional Access for Europe (CAFE)
25.9 ISO/IEC 9979
25.10 Professional, Civil Liberties, and Industry Groups
25.11 Sci.crypt
25.12 Cypherpunks
25.13 Patents
25.14 U.S. Export Rules
25.15 Foreign Impot and Export of Cryptography
25.16 Legal Issues
Afterword by Matt Blaze
Part V—Source Code
References
Index
Another C Books
Download
Another Computer Security Books
Another C Languange Books Continue Reading ...
Introduction to Probability and Statistics for Engineers and Scientists
CONTENTS
Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii
Chapter 1 Introduction to Statistics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Data Collection and Descriptive Statistics . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.3 Inferential Statistics and Probability Models . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.4 Populations and Samples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.5 A Brief History of Statistics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
Chapter 2 Descriptive Statistics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.2 Describing Data Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.2.1 Frequency Tables and Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.2.2 Relative Frequency Tables and Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.2.3 Grouped Data, Histograms, Ogives, and Stem and Leaf Plots . . . . . . . . . . . 14
2.3 Summarizing Data Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
2.3.1 Sample Mean, Sample Median, and Sample Mode . . . . . . . . . . . . . . . . . . . . 17
2.3.2 Sample Variance and Sample Standard Deviation . . . . . . . . . . . . . . . . . . . . . 22
2.3.3 Sample Percentiles and Box Plots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2.4 Chebyshev’s Inequality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
2.5 Normal Data Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.6 Paired Data Sets and the Sample Correlation Coefficient . . . . . . . . . . . . . . 33
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
Chapter 3 Elements of Probability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
3.2 Sample Space and Events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56
3.3 Venn Diagrams and the Algebra of Events . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
3.4 Axioms of Probability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
3.5 Sample Spaces Having Equally Likely Outcomes . . . . . . . . . . . . . . . . . . . . . 61
3.6 Conditional Probability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
3.7 Bayes’ Formula . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
3.8 Independent Events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
Chapter 4 Random Variables and Expectation . . . . . . . . . . . . . . . . . . . . . . . . . . 89
4.1 Random Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
4.2 Types of Random Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
4.3 Jointly Distributed Random Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
4.3.1 Independent Random Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
*4.3.2 Conditional Distributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
4.4 Expectation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107
4.5 Properties of the Expected Value . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
4.5.1 Expected Value of Sums of Random Variables . . . . . . . . . . . . . . . . . . . . . . . 115
4.6 Variance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
4.7 Covariance and Variance of Sums of Random Variables . . . . . . . . . . . . . . 121
4.8 Moment Generating Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126
4.9 Chebyshev’s Inequality and the Weak Law of Large Numbers . . . . . . . . . 127
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130
Chapter 5 Special Random Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
5.1 The Bernoulli and Binomial Random Variables . . . . . . . . . . . . . . . . . . . . . . 141
5.1.1 Computing the Binomial Distribution Function . . . . . . . . . . . . . . . . . . . . . 147
5.2 The Poisson Random Variable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 148
5.2.1 Computing the Poisson Distribution Function . . . . . . . . . . . . . . . . . . . . . . . 155
5.3 The Hypergeometric Random Variable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156
5.4 The Uniform Random Variable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 160
5.5 Normal Random Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 168
5.6 Exponential Random Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
*5.6.1 The Poisson Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
*5.7 The Gamma Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 182
5.8 Distributions Arising from the Normal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 185
5.8.1 The Chi-Square Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 185
*5.8.1.1 The Relation Between Chi-Square and Gamma Random
Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
5.8.2 The t-Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
5.8.3 The F-Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
*5.9 The Logistics Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194
Chapter 6 Distributions of Sampling Statistics . . . . . . . . . . . . . . . . . . . . . . . . . . 201
6.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
6.2 The Sample Mean . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 202
6.3 The Central Limit Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204
6.3.1 Approximate Distribution of the Sample Mean . . . . . . . . . . . . . . . . . . . . . . 210
6.3.2 How Large a Sample is Needed? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 212
6.4 The Sample Variance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213
6.5 Sampling Distributions from a Normal Population . . . . . . . . . . . . . . . . . . . 214
6.5.1 Distribution of the Sample Mean . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
6.5.2 Joint Distribution of X and S2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
6.6 Sampling from a Finite Population . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221
Chapter 7 Parameter Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 229
7.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 229
7.2 Maximum Likelihood Estimators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 230
*7.2.1 Estimating Life Distributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 238
7.3 Interval Estimates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240
7.3.1 Confidence Interval for a Normal Mean When the Variance is
Unknown . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 246
7.3.2 Confidence Intervals for the Variances of a Normal Distribution . . . . . . . . 251
7.4 Estimating the Difference in Means of Two Normal Populations . . . . . . 253
7.5 Approximate Confidence Interval for the Mean of a Bernoulli
Random Variable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
*7.6 Confidence Interval of the Mean of the Exponential Distribution . . . . . . 265
*7.7 Evaluating a Point Estimator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266
*7.8 The Bayes Estimator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 272
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277
Chapter 8 Hypothesis Testing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
8.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
8.2 Significance Levels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292
8.3 Tests Concerning the Mean of a Normal Population . . . . . . . . . . . . . . . . . 293
8.3.1 Case of Known Variance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293
8.3.2 Case of Unknown Variance: The t-Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
8.4 Testing the Equality of Means of Two Normal Populations . . . . . . . . . . . 312
8.4.1 Case of Known Variances . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 312
8.4.2 Case of Unknown Variances . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 314
8.4.3 Case of Unknown and Unequal Variances . . . . . . . . . . . . . . . . . . . . . . . . . . . 318
8.4.4 The Paired t-Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 319
8.5 Hypothesis Tests Concerning the Variance of a Normal Population . . . . 321
8.5.1 Testing for the Equality of Variances of Two Normal
Populations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
8.6 Hypothesis Tests in Bernoulli Populations . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
8.6.1 Testing the Equality of Parameters in Two Bernoulli
Populations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327
8.7 Tests Concerning the Mean of a Poisson Distribution . . . . . . . . . . . . . . . . 330
8.7.1 Testing the Relationship Between Two Poisson Parameters . . . . . . . . . . . . . 331
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 334
Chapter 9 Regression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 351
9.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 351
9.2 Least Squares Estimators of the Regression Parameters . . . . . . . . . . . . . . . . 353
9.3 Distribution of the Estimators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 355
9.4 Statistical Inferences about the Regression Parameters . . . . . . . . . . . . . . . . 361
9.4.1 Inferences Concerning β . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 362
9.4.1.1 Regression to the Mean . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 366
9.4.2 Inferences Concerning α . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 370
9.4.3 Inferences Concerning the Mean Response α + βx0 . . . . . . . . . . . . . . . . . . 371
9.4.4 Prediction Interval of a Future Response . . . . . . . . . . . . . . . . . . . . . . . . . . . . 373
9.4.5 Summary of Distributional Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 375
9.5 The Coefficient of Determination and the Sample Correlation
Coefficient . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 376
9.6 Analysis of Residuals: Assessing the Model . . . . . . . . . . . . . . . . . . . . . . . . . . . 378
9.7 Transforming to Linearity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 381
9.8 Weighted Least Squares . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 384
9.9 Polynomial Regression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 391
*9.10 Multiple Linear Regression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 394
9.10.1 Predicting Future Responses . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 405
9.11 Logistic Regression Models for Binary Output Data . . . . . . . . . . . . . . . . . 410
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 413
Chapter 10 Analysis of Variance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 439
10.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 439
10.2 An Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 440
10.3 One-Way Analysis of Variance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 442
10.3.1 Multiple Comparisons of Sample Means . . . . . . . . . . . . . . . . . . . . . . . . . . . 450
10.3.2 One-Way Analysis of Variance with Unequal Sample Sizes . . . . . . . . . . . . 452
10.4 Two-Factor Analysis of Variance: Introduction and Parameter
Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 454
10.5 Two-Factor Analysis of Variance: Testing Hypotheses . . . . . . . . . . . . . . . . 458
10.6 Two-Way Analysis of Variance with Interaction . . . . . . . . . . . . . . . . . . . . . 463
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471
Chapter 11 Goodness of Fit Tests and Categorical Data Analysis . . . . . . . . 483
11.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 483
11.2 Goodness of Fit Tests When all Parameters are Specified . . . . . . . . . . . . . 484
11.2.1 Determining the Critical Region by Simulation . . . . . . . . . . . . . . . . . . . . . 490
11.3 Goodness of Fit Tests When Some Parameters are Unspecified . . . . . . . . 493
11.4 Tests of Independence in Contingency Tables . . . . . . . . . . . . . . . . . . . . . . . 495
11.5 Tests of Independence in Contingency Tables Having Fixed
Marginal Totals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 499
*11.6 The Kolmogorov–Smirnov Goodness of Fit Test for Continuous
Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 504
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 508
Chapter 12 Nonparametric Hypothesis Tests . . . . . . . . . . . . . . . . . . . . . . . . . . . . 515
12.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 515
12.2 The Sign Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 515
12.3 The Signed Rank Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
12.4 The Two-Sample Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 525
12.4.1 The Classical Approximation and Simulation . . . . . . . . . . . . . . . . . . . . . . . 529
12.5 The Runs Test for Randomness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 537
Chapter 13 Quality Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
13.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
13.2 Control Charts for Average Values: The X -Control Chart . . . . . . . . . . . . 546
13.2.1 Case of Unknown μ and σ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 549
13.3 S-Control Charts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 554
13.4 Control Charts for the Fraction Defective . . . . . . . . . . . . . . . . . . . . . . . . . . . 557
13.5 Control Charts for Number of Defects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 559
13.6 Other Control Charts for Detecting Changes in the Population
Mean . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 563
13.6.1 Moving-Average Control Charts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 563
13.6.2 Exponentially Weighted Moving-Average Control Charts . . . . . . . . . . . . . 565
13.6.3 Cumulative Sum Control Charts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 571
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 573
Chapter 14* Life Testing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 581
14.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 581
14.2 Hazard Rate Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 581
14.3 The Exponential Distribution in Life Testing . . . . . . . . . . . . . . . . . . . . . . . . 584
14.3.1 Simultaneous Testing — Stopping at the rth Failure . . . . . . . . . . . . . . . . . 584
14.3.2 Sequential Testing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 590
14.3.3 Simultaneous Testing — Stopping by a Fixed Time . . . . . . . . . . . . . . . . . . 594
14.3.4 The Bayesian Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 596
14.4 A Two-Sample Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 598
14.5 The Weibull Distribution in Life Testing . . . . . . . . . . . . . . . . . . . . . . . . . . . 600
14.5.1 Parameter Estimation by Least Squares . . . . . . . . . . . . . . . . . . . . . . . . . . . . 602
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 604
Appendix of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 611
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 617
Download
Another Statistic Books Continue Reading ...
Fundamentals of Probability and Statistics for Engineers
This textbook differs from others in the field in that it has been prepared very much with students and their needs in mind, having been classroom tested over many years. It is a true “learner’s book” made for students who require a deeper understanding of probability and statistics. It presents the fundamentals of the subject along with concepts of probabilistic modelling, and the process of model selection, verification and analysis. Furthermore, the inclusion of more than 100 examples and 200 exercises (carefully selected from a wide range of topics), along with a solutions manual for instructors, means that this text is of real value to students and lecturers across a range of engineering disciplines.
Key features:
Presents the fundamentals in probability and statistics along with relevant applications.
Explains the concept of probabilistic modelling and the process of model selection, verification and analysis.
Definitions and theorems are carefully stated and topics rigorously treated.
Includes a chapter on regression analysis.
Covers design of experiments.
Demonstrates practical problem solving throughout the book with numerous examples and exercises purposely selected from a variety of engineering fields.
Includes an accompanying online Solutions Manual for instructors containing complete step-by-step solutions to all problems.
Preface.
1. Introduction.
Part A: Probability and Random Variables.
2. Basic Probability Concepts.
3. Random Variables and Probability Distributions.
4. Expectations And Moments.
5. Functions of Random Variables.
6. Some Impotant Discrete Distributions.
7. Some Impotant Continuous Distributions.
Part B: Statistical Inference, Parameter Estimation, and Model Verification.
8. Observed Data and Graphical Representation.
9. Parameter Estimation.
10. Model Verification.
11. Linear Models and Linear Regression.
Appendix A: Tables.
Download
Another Statistic Books Continue Reading ...
Beginning Visual C#
byKarli Watsonet al. ISBN:0764543822
Wrox Press 2003 (903 pages)
By using this book, you’ll come to understand the fundamentals of the C# language and learn to program the .NET Framework; the book will help you succeed—from your first steps in the language up to where you are ready to write real world C# applications.
Table of Contents Back Cover
Table of Contents
Beginning Visual C#
Introduction
Chapter 1 - Introducing C#
Chapter 2 - Writing a C# Program
Chapter 3 - Variables and Expressions
Chapter 4 - Flow Control
Chapter 5 - More About Variables
Chapter 6 - Functions
Chapter 7 - Debugging and Error Handling
Chapter 8 - Introduction to Object-Oriented Programming
Chapter 9 - Defining Classes
Chapter 10 - Defining Class Members
Chapter 11 - More About Classes
Chapter 12 - Events
Chapter 13 - Using Windows Form Controls
Chapter 14 - Advanced Windows Forms Features
Chapter 15 - Using Common Dialogs
Chapter 16 - Introduction to GDI+
Chapter 17 - Deploying Windows Applications
Chapter 18 - Getting At Your Data
Chapter 19 - Data Access with ADO.NET
Chapter 20 - Working With Files
Chapter 21 - .NET Assemblies
Chapter 22 - Attributes
Chapter 23 - ASP.NET Applications
Chapter 24 - Web Services
Appendix A - Setting the PATH Environment Variable
Appendix B - Installing MSDE
Appendix C - Further References
Index
List of Try It Outs
Download
Another C# Books Continue Reading ...
Saturday, December 4, 2010
Microsoft SQL Server 2000 Administrator's Companion
This title is the definitive daily operations guide to planning, deploying, and maintaining Microsoft SQL Server 2000. With it, administrators learn how to use this scalable, high-performance relational database management system to solve complex business challenges, launch Internet-based solutions, and lower the cost and complexity of distributed database solutions. This comprehensive reference introduces new features of both SQL Server 2000 and the Microsoft Windows 2000 operating system. And it includes an expanded section covering installation and setup, an example-rich segment on how to use SQL Server 2000 to create and modify databases, and information about built-in features such as DTC, MTS, and OLAP services. It's the essential daily operations guide for the SQL Server database administrator!
PUBLISHED BY
Microsoft Press
A Division of Microsoft Corporation
One Microsoft Way
Redmond, Washington 98052-6399
Download
Another Database Books
Another Web Programming Books
Another Internet Books Continue Reading ...
Refactoring Improving the Design of Existing Code
Foreword........................................................................................................................ 6
Preface........................................................................................................................... 8
What Is Refactoring? ............................................................................................... 9
What's in This Book? ............................................................................................... 9
Who Should Read This Book? ............................................................................. 10
Building on the Foundations Laid by Others ...................................................... 10
Acknowledgments .................................................................................................. 11
Chapter 1. Refactoring, a First Example ................................................................ 13
The Starting Point................................................................................................... 13
The First Step in Refactoring ................................................................................ 17
Decomposing and Redistributing the Statement Method ................................ 18
Replacing the Conditional Logic on Price Code with Polymorphism ............. 35
Final Thoughts ........................................................................................................ 44
Chapter 2. Principles in Refactoring........................................................................ 46
Defining Refactoring .............................................................................................. 46
Why Should You Refactor? .................................................................................. 47
Refactoring Helps You Find Bugs ....................................................................... 48
When Should You Refactor?................................................................................ 49
What Do I Tell My Manager?................................................................................ 52
Problems with Refactoring .................................................................................... 54
Refactoring and Design......................................................................................... 57
Refactoring and Performance .............................................................................. 59
Where Did Refactoring Come From?.................................................................. 60
Chapter 3. Bad Smells in Code................................................................................ 63
Duplicated Code ..................................................................................................... 63
Long Method ........................................................................................................... 64
Large Class ............................................................................................................. 65
Long Parameter List............................................................................................... 65
Divergent Change .................................................................................................. 66
Shotgun Surgery..................................................................................................... 66
Feature Envy........................................................................................................... 66
Data Clumps ........................................................................................................... 67
Primitive Obsession ............................................................................................... 67
Switch Statements ................................................................................................. 68
Parallel Inheritance Hierarchies........................................................................... 68
Lazy Class ............................................................................................................... 68
Speculative Generality........................................................................................... 68
Temporary Field ..................................................................................................... 69
Message Chains ..................................................................................................... 69
Middle Man.............................................................................................................. 69
Inappropriate Intimacy........................................................................................... 70
Alternative Classes with Different Interfaces ..................................................... 70
Incomplete Library Class....................................................................................... 70
Data Class ............................................................................................................... 70
Refused Bequest.................................................................................................... 71
Comments ............................................................................................................... 71
Chapter 4. Building Tests.......................................................................................... 73
The Value of Self-testing Code ............................................................................ 73
The JUnit Testing Framework .............................................................................. 74
Adding More Tests ................................................................................................. 80
Chapter 5. Toward a Catalog of Refactorings ....................................................... 85
Format of the Refactorings ................................................................................... 85
Finding References................................................................................................ 86
How Mature Are These Refactorings?................................................................ 87
Chapter 6. Composing Methods .............................................................................. 89
Extract Method........................................................................................................ 89
Inline Method........................................................................................................... 95
Inline Temp.............................................................................................................. 96
Replace Temp with Query .................................................................................... 97
Introduce Explaining Variable............................................................................. 101
Split Temporary Variable..................................................................................... 104
Remove Assignments to Parameters ............................................................... 107
Replace Method with Method Object ................................................................ 110
Substitute Algorithm ............................................................................................. 113
Chapter 7. Moving Features Between Objects.................................................... 115
Move Method ........................................................................................................ 115
Move Field ............................................................................................................. 119
Extract Class ......................................................................................................... 122
Inline Class............................................................................................................ 125
Hide Delegate ....................................................................................................... 127
Remove Middle Man............................................................................................ 130
Introduce Foreign Method................................................................................... 131
Introduce Local Extension................................................................................... 133
Chapter 8. Organizing Data .................................................................................... 138
Self Encapsulate Field......................................................................................... 138
Replace Data Value with Object ........................................................................ 141
Change Value to Reference ............................................................................... 144
Change Reference to Value ............................................................................... 148
Replace Array with Object .................................................................................. 150
Duplicate Observed Data .................................................................................... 153
Change Unidirectional Association to Bidirectional ........................................ 159
Change Bidirectional Association to Unidirectional ........................................ 162
Replace Magic Number with Symbolic Constant ............................................ 166
Encapsulate Field................................................................................................. 167
Encapsulate Collection........................................................................................ 168
Replace Record with Data Class....................................................................... 175
Replace Type Code with Class.......................................................................... 176
Replace Type Code with Subclasses ............................................................... 181
Replace Type Code with State/Strategy........................................................... 184
Replace Subclass with Fields............................................................................. 188
Chapter 9. Simplifying Conditional Expressions ................................................. 192
Decompose Conditional ...................................................................................... 192
Consolidate Conditional Expression ................................................................. 194
Consolidate Duplicate Conditional Fragments ................................................ 196
Remove Control Flag........................................................................................... 197
Replace Nested Conditional with Guard Clauses ........................................... 201
Replace Conditional with Polymorphism .......................................................... 205
Introduce Null Object ........................................................................................... 209
Introduce Assertion .............................................................................................. 216
Chapter 10. Making Method Calls Simpler........................................................... 220
Rename Method ................................................................................................... 221
Add Parameter...................................................................................................... 222
Remove Parameter.............................................................................................. 223
Separate Query from Modifier............................................................................ 225
Parameterize Method .......................................................................................... 228
Replace Parameter with Explicit Methods........................................................ 230
Preserve Whole Object ....................................................................................... 232
Replace Parameter with Method ....................................................................... 235
Introduce Parameter Object ............................................................................... 238
Remove Setting Method...................................................................................... 242
Hide Method.......................................................................................................... 245
Replace Constructor with Factory Method ....................................................... 246
Encapsulate Downcast........................................................................................ 249
Replace Error Code with Exception .................................................................. 251
Replace Exception with Test .............................................................................. 255
Chapter 11. Dealing with Generalization.............................................................. 259
Pull Up Field .......................................................................................................... 259
Pull Up Method ..................................................................................................... 260
Pull Up Constructor Body.................................................................................... 263
Push Down Method.............................................................................................. 266
Push Down Field .................................................................................................. 266
Extract Subclass................................................................................................... 267
Extract Superclass ............................................................................................... 272
Extract Interface ................................................................................................... 277
Collapse Hierarchy............................................................................................... 279
Form Template Method....................................................................................... 280
Replace Inheritance with Delegation................................................................. 287
Replace Delegation with Inheritance................................................................. 289
Chapter 12. Big Refactorings ................................................................................. 293
Tease Apart Inheritance...................................................................................... 294
Convert Procedural Design to Objects ............................................................. 300
Separate Domain from Presentation................................................................. 302
Extract Hierarchy.................................................................................................. 306
Chapter 13. Refactoring, Reuse, and Reality...................................................... 311
A Reality Check .................................................................................................... 311
Why Are Developers Reluctant to Refactor Their Programs? ...................... 312
A Reality Check (Revisited)................................................................................ 323
Resources and References for Refactoring..................................................... 323
Implications Regarding Software Reuse and Technology Transfer............. 324
A Final Note........................................................................................................... 325
Endnotes................................................................................................................ 325
Chapter 14. Refactoring Tools ............................................................................... 328
Refactoring with a Tool........................................................................................ 328
Technical Criteria for a Refactoring Tool.......................................................... 329
Practical Criteria for a Refactoring Tool............................................................ 331
Wrap Up ................................................................................................................. 332
Chapter 15. Putting It All Together ........................................................................ 333
Bibliography........................................................................................................... 336
References ................................................................................................................ 336
Download
Another Software Engineering Books Continue Reading ...
Head First Design Patterns
Table of Contents (summary)
Intro xxv
1 Welcome to Design Patterns: an introduction 1
2 Keeping your Objects in the know: the Observer Pattern 37
3 Decorating Objects: the Decorator Pattern 79
4 Baking with OO goodness: the Factory Pattern 109
5 One of a Kind Objects: the Singleton Pattern 169
6 Encapsulating Invocation: the Command Pattern 191
7 Being Adaptive: the Adapter and Facade Patterns 235
8 Encapsulating Algorithms: theTemplate Method Pattern 275
9 Well-managed Collections: the Iterator and Composite Patterns 315
10 The State of Things: the State Pattern 385
11 Controlling Object Access: the Proxy Pattern 429
12 Patterns of Patterns: Compound Patterns 499
13 Patterns in the Real World: Better Living with Patterns 577
14 Appendix: Leftover Patterns 611
Download 54 MB
Download 11 MB
Another Software Engineering Books Continue Reading ...
Friday, December 3, 2010
MCSD Training Kit-Analyzing Requirements and Defining Solution Architectures
Course Overview
This self-paced course combines text, graphics, and review questions to teach you about analyzing requirements and defining solutions architecture. The course assumes that you will work through the book from beginning to end, but you can choose a customized track and complete only the sections that interest you.
The book is divided into the following chapters:
Chapter 1, "Enterprise Architecture" This chapter examines the need for application and infrastructure guidance at an enterprise level. It begins by suggesting that systems be implemented with an architecture-first process. Next, the chapter introduces the Microsoft Solutions Framework (MSF). Chapter 1 also examines the MSF Enterprise Architecture Model and its Business, Application, Information, and Technology Perspectives. This chapter additionally points out that the four primary goals of an enterprise architecture are that it be integrated, iterative, actionable, and prioritized. Finally, this chapter discusses how to begin the enterprise architecture process and continue to deliver systems and applications while the architecture process is underway.
Chapter 2, "Enterprise Applications" This chapter examines the features of modern enterprise applications, and issues that should be considered. It discusses designing large-scale, distributed, enterprise applications and the need to reduce their complexity. It also recommends managing this enterprise application complexity through abstraction, which involves grouping similar requirements together into a small number of abstract categories. Various architecture descriptions are discussed, such as the Unified Modeling Language (UML), Design Patterns, and AntiPatterns. Additionally, this chapter out-lines ten principles for delivering successful applications. Chapter 2 finally suggests that organizations use the several perspectives represented by Microsoft's Enterprise Application Model and discusses the application architecture framework provided by the separate MSF Application Model for Development.
Chapter 3, "Project Teams" This chapter discusses who is responsible for doing what so that all the different parts of an application project are managed properly. The chapter also discusses building a project team within the context of the MSF Team Model for Application Development (MSF Development Team Model). The discussion progresses from understanding the six equally vital team roles to finding and enlisting leaders from different parts of the organization. Chapter 3 also pinpoints specific responsibilities that must be fulfilled for a project to be successful, and assigns these responsibilities to specific team members. It looks at ways to analyze project requirements from the perspectives of different team members and also explores ways to scale the project team to fit the needs and size of the project. Finally, this chapter examines team and leadership characteristics that will help make an organization's use of its project resources more effective.
Chapter 4, "Development Process" This chapter is primarily devoted to the MSF Process Model for Application Development, otherwise known as the MSF Development Process Model. Rather than a step-by-step methodology, MSF is a structural framework that an organization can adapt to suit its particular needs. The MSF Development Process Model is the part of this framework that describes the life cycle of a successful software development project. Using a development framework has been successfully proven in the software industry to improve project control, minimize risk, improve product quality, and increase development speed. Also in this chapter, we discuss the Unified Process development framework along with its workflows, stages, and milestones.
Chapter 5, "Project Vision" This chapter describes the dynamics of the MSF Development Process Model's Envisioning Phase. This chapter also discusses what information to gather from the project stakeholders, how to create a product vision, how the MSF Development Team Model's various roles participate in the envisioning process, and what their responsibilities are. In addition, Chapter 5 examines how the envisioning process develops over a period of time. Finally, this chapter presents a detailed discussion of risk management, based on the MSF Risk Management Model.
Chapter 6, "Project Plan" This chapter outlines the process of mapping concepts to actions and explains team roles in the Planning Phase of the MSF Development Process Model. It takes an in-depth look at the MSF Design Process Model and the conceptual, logical, and physical architectures of an application. This chapter also discusses how the MSF Application Model's user, business, and data service layers can be incorporated into the application's physical architecture. The MSF Development Process Model's Functional Specification, Master Project Plan, and Master Project Schedule are all emphasized as key deliverables of the Planning Phase. Finally, Chapter 6 discusses principles of scheduling, as well as the ongoing task of risk management.
Chapter 7, "User Service Layer Technologies" This chapter examines how to create effective and efficient user interface (UI) designs. It also explores legacy, current, and future technologies that affect the user service layer design of the MSF Application Model. Additionally, this chapter discusses the impact of Web technologies on current application design techniques. We complete Chapter 7 with an in-depth look at implementing a Web-based application.
Chapter 8, "Business Service Layer Technologies" This chapter focuses on such issues as using an object context to manage state, using explicitly defined interfaces when possible, composing functionality, maintaining state across transaction boundaries, propagating errors, and programmatically controlling security. In addition, this chapter takes a detailed examination using COM and COM+ within the business service of an application's physical design. This chapter concludes with a detailed look at using COM components with Microsoft Transaction Server.
Chapter 9, "Data Service Layer Technologies" This chapter examines design issues related to data requirements and explores characteristics of different data access technologies. This chapter also discusses best uses for each access technology, and normalization of data and data integrity. In addition, this chapter identifies how business rules can affect application data and where these rules are implemented. Furthermore, Chapter 9 examines technologies that provide data access to legacy data system stores and Enterprise Resource Planning (ERP) applications. Finally, this chapter reviews COM+ In-Memory Database (IMDB) features that can improve data access performance.
Chapter 10, "Testing and the Production Channel" This chapter explains how to build a working environment that supports development, testing, certification, and production. Using real-life examples, this chapter describes the production channel and its goals. Chapter 10 thoroughly examines testing, and recommends several ways to execute and monitor tests. It also discusses ways to scale out an application's production environment by adding servers to the physical implementation. Finally, this chapter examines ways to classify program faults and failures, discuss the larger issue of product bugs, and describe methods of tracking, classifying, and resolving known bug problems.
Chapter 11, "Application Security" This chapter looks at different security-related protocols and the basic security concepts of authentication. It also examines encryption, which stores and passes information from one place to another so that it can't be read by anyone who intercepts it. Additionally, this chapter discusses access control, which determines what users are allowed to accomplish, and auditing, which records what goes on inside the operating system as users request and work with the resources the system makes available to them.
Chapter 12, "Development Deliverables" This chapter examines the creation process, including how the various team roles function during development. This chapter further explores testing, bug tracking, and the "zero-defect mindset," and also shows how the project management team makes effective trade-offs. In addition, this chapter discusses how multi-layer applications are implemented as monolithic or client/server, or distributed in physical form. Finally, Chapter 12 explores the end of the MSF Development Process Model's Developing Phase, when code-complete is reached, and all product features and original code are incorporated into the application.
Chapter 13, "Product Stabilization" This chapter emphasizes the evolutionary cycle the team will progress through to move from the Developing Phase's Scope Complete Milestone to the Stabilizing Phase's Release Milestone. We summarize this phase's effort as four primary steps: Fix the bugs, synchronize all product deliverables, ship the release, and extensively test the release. Leading up to the Release Milestone, the chapter identifies several key interim milestones that are reached by the continual iteration of the phase's steps. This chapter also provides some guidelines for the deployment of an application after the product is released. From the preplanning phases though pilot testing, support, and troubleshooting, we explore efficient ways to deploy the application with as little negative impact as possible on the users and their systems and networks.
Chapter 14, "Project Review" This chapter emphasizes the value of a solid project review, as it both relates to a project just completed and to the ongoing growth and improvement of the organization. The chapter examines the relationship between the project review and the Capability Maturity Model for Software, and also shows the project review's impotance in creating a best practice guide for the organization's development teams. This chapter examines the practical considerations of conducting a project review: when to schedule a project review, who should attend, and the proper physical setting for a project review.
Features of This Book
The following features are designed to enhance the usefulness of this course:
The overall structure reflects the way a development team would progress through the process of creating an application.
Each chapter contains reference material that also serves as additional recommended reading.
Each chapter ends with a short summary of the material presented.
Review questions at the end of each chapter let you test what you have learned in the chapter.
Case studies provide a different and interesting way to learn development and application design by participating in the complete development life cycle of a multi-layer, distributed application. Although the case study events are purely fictional, they provide fresh insight on how people build applications. See the "Case Studies" section for more information.
Conventions Used in This Book
Before you start reading any of the chapters, it is impotant that you understand the following notational conventions used in this book:
Italic is used for emphasis when defining new terms. Italic is also used for book titles.
Names of files and folders appear in Title Caps. Unless otherwise indicated, you can use all lowercase letters when you type a file or folder name in a dialog box or at a command prompt.
File name extensions appear in all lowercase.
Acronyms appear in all uppercase.
Monospace type represents code samples, examples of screen text, or entries that you might type at a command prompt or in initialization files.
Square brackets [ ] are used in syntax statements to enclose optional items. For example, [filename] in command syntax indicates that you can choose to type a file name with the command. Type only the information within the brackets, not the brackets themselves.
Braces { } are used in syntax statements to enclose required items. Type only the information within the braces, not the braces themselves.
Download
Another Training Kit Books
Another Software Engineering Books Continue Reading ...
Subscribe to:
Posts (Atom)
Put Your Ads Here!
Link Exchange
Recent Posts
.jpg)
Posts
