《信息安全导论》全面介绍了信息安全的基本概念、原理和知识体系，主要内容包括网络攻击与安全防范、密码学基础、认证技术与PKI、信息隐藏技术、访问控制与防火墙技术、入侵检测技术、防病毒技术、安全扫描技术、系统安全、信息安全风险评估和信息安全管理等内容。

Editorial Reviews Review "...well written and flows smoothly...provides electrical engineering students with a new perspective in applied electromagnetics and circuit design...highly recommended." (CHOICE, September 2006) "...well written and flows smoothly...provides electrical engineering students with a new perspective in applied electromagnetics and circuit design...highly recommended." (CHOICE, September 2006) Product Description A Landmark text thoroughly updated, including a new CD As digital devices continue to be produced at increasingly lower costs and with higher speeds, the need for effective electromagnetic compatibility (EMC) design practices has become more critical than ever to avoid unnecessary costs in bringing products into compliance with governmental regulations. The Second Edition of this landmark text has been thoroughly updated and revised to reflect these major developments that affect both academia and the electronics industry. Readers familiar with the First Edition will find much new material, including: * Latest U.S. and international regulatory requirements * PSpice used throughout the textbook to simulate EMC analysis solutions * Methods of designing for Signal Integrity * Fortran programs for the simulation of Crosstalk supplied on a CD * OrCAD(r) PSpice(r) Release 10.0 and Version 8 Demo Edition software supplied on a CD * The final chapter on System Design for EMC completely rewritten * The chapter on Crosstalk rewritten to simplify the mathematics Detailed, worked-out examples are now included throughout the text. In addition, review exercises are now included following the discussion of each important topic to help readers assess their grasp of the material. Several appendices are new to this edition including Phasor Analysis of Electric Circuits, The Electromagnetic Field Equations and Waves, Computer Codes for Calculating the Per-Unit-Length Parameters and Crosstalk of Multiconductor Transmission Lines, and a SPICE (PSPICE) tutorial. Now thoroughly updated, the Second Edition of Introduction to Electromagnetic Compatibility remains the textbook of choice for university/college EMC courses as well as a reference for EMC design engineers. An Instructor's Manual presenting detailed solutions to all the problems in the book is available from the Wiley editorial department. From the Publisher Deals with the topic of interference (electromagnetic compatibility) in electronic systems. It builds on basic undergraduate electrical engineering concepts and principles and applies them to the design of electronic systems that operate compatibly with other electronic systems and do not create interference phenomena. To facilitate classroom teaching it is divided in two parts. The first provides the basic principles and skills for review, while the second refers to applications and aspects of EMC design. --This text refers to an out of print or unavailable edition of this title. From the Back Cover A Landmark text thoroughly updated, including a new CD As digital devices continue to be produced at increasingly lower costs and with higher speeds, the need for effective electromagnetic compatibility (EMC) design practices has become more critical than ever to avoid unnecessary costs in bringing products into compliance with governmental regulations. The Second Edition of this landmark text has been thoroughly updated and revised to reflect these major developments that affect both academia and the electronics industry. Readers familiar with the First Edition will find much new material, including: Latest U.S. and international regulatory requirements PSpice used throughout the textbook to simulate EMC analysis solutions Methods of designing for Signal Integrity Fortran programs for the simulation of Crosstalk supplied on a CD OrCAD® PSpice® Release 10.0 and Version 8 Demo Edition software supplied on a CD The final chapter on System Design for EMC completely rewritten The chapter on Crosstalk rewritten to simplify the mathematics Detailed, worked-out examples are now included throughout the text. In addition, review exercises are now included following the discussion of each important topic to help readers assess their grasp of the material. Several appendices are new to this edition including Phasor Analysis of Electric Circuits, The Electromagnetic Field Equations and Waves, Computer Codes for Calculating the Per-Unit-Length Parameters and Crosstalk of Multiconductor Transmission Lines, and a SPICE (PSPICE) tutorial. Now thoroughly updated, the Second Edition of Introduction to Electromagnetic Compatibility remains the textbook of choice for university/college EMC courses as well as a reference for EMC design engineers. About the Author CLAYTON R. PAUL, PHD, is Professor and Sam Nunn Chair of Aerospace Systems Engineering, Department of Electrical and Computer Engineering, Mercer University. He is also Emeritus Professor of Electrical Engineering at the University of Kentucky, where he served on the faculty for twenty-seven years. Dr. Paul is the author of twelve textbooks in electrical engineering, has contributed numerous chapters to engineering handbooks and reference texts, and has published numerous technical papers in scientific journals and symposia. He is a Fellow of the IEEE and a Honorary Life Member of the IEEE EMC Society.

支持向量机(Support Vector Machine,SVM)是Corinna Cortes和Vapnik8等于1995年首先提出的，它在解决小样本、非线性及高维模式识别中表现出许多特有的优势，并能够推广应用到函数拟合等其他机器学习问题中。

Introduction to Algorithms Third Editio Contents I Foundations Introduction 3 1 The Role of Algorithms in Computing 5 1.1 Algorithms 5 1.2 Algorithms as a technology 11 2 Getting Started 16 2.1 Insertion sort 16 2.2 Analyzing algorithms 23 2.3 Designing algorithms 29 3 Growth of Functions 43 3.1 Asymptotic notation 43 3.2 Standard notations and common functions 53 4 Divide-and-Conquer 65 4.1 The maximum-subarray problem 68 4.2 Strassen’s algorithm for matrix multiplication 75 4.3 The substitution method for solving recurrences 83 4.4 The recursion-tree method for solving recurrences 88 4.5 The master method for solving recurrences 93 4.6 Proof of the master theorem 97 5 Probabilistic Analysis and Randomized Algorithms 114 5.1 The hiring problem 114 5.2 Indicator random variables 118 5.3 Randomized algorithms 122 5.4 Probabilistic analysis and further uses of indicator random variables 130 vi Contents II Sorting and Order Statistics Introduction 147 6Heapsort151 6.1 Heaps 151 6.2 Maintaining the heap property 154 6.3 Building a heap 156 6.4 The heapsort algorithm 159 6.5 Priority queues 162 7 Quicksort 170 7.1 Description of quicksort 170 7.2 Performance of quicksort 174 7.3 A randomized version of quicksort 179 7.4 Analysis of quicksort 180 8 Sorting in Linear Time 191 8.1 Lower bounds for sorting 191 8.2 Counting sort 194 8.3 Radix sort 197 8.4 Bucket sort 200 9 Medians and Order Statistics 213 9.1 Minimum and maximum 214 9.2 Selection in expected linear time 215 9.3 Selection in worst-case linear time 220 III Data Structures Introduction 229 10 Elementary Data Structures 232 10.1 Stacks and queues 232 10.2 Linked lists 236 10.3 Implementing pointers and objects 241 10.4 Representing rooted trees 246 11 Hash Tables 253 11.1 Direct-address tables 254 11.2 Hash tables 256 11.3 Hash functions 262 11.4 Open addressing 269 11.5 Perfect hashing 277 Contents vii 12 Binary Search Trees 286 12.1 What is a binary search tree? 286 12.2 Querying a binary search tree 289 12.3 Insertion and deletion 294 ? 12.4 Randomly built binary search trees 299 13 Red-Black Trees 308 13.1 Properties of red-black trees 308 13.2 Rotations 312 13.3 Insertion 315 13.4 Deletion 323 14 Augmenting Data Structures 339 14.1 Dynamic order statistics 339 14.2 How to augment a data structure 345 14.3 Interval trees 348 IV Advanced Design and Analysis Techniques Introduction 357 15 Dynamic Programming 359 15.1 Rod cutting 360 15.2 Matrix-chain multiplication 370 15.3 Elements of dynamic programming 378 15.4 Longest common subsequence 390 15.5 Optimal binary search trees 397 16 Greedy Algorithms 414 16.1 An activity-selection problem 415 16.2 Elements of the greedy strategy 423 16.3 Huffman codes 428 16.4 Matroids and greedy methods 437 16.5 A task-scheduling problem as a matroid 443 17 Amortized Analysis 451 17.1 Aggregate analysis 452 17.2 The accounting method 456 17.3 The potential method 459 17.4 Dynamic tables 463 viii Contents V Advanced Data Structures Introduction 481 18 B-Trees 484 18.1 Definition of B-trees 488 18.2 Basic operations on B-trees 491 18.3 Deleting a key from a B-tree 499 19 Fibonacci Heaps 505 19.1 Structure of Fibonacci heaps 507 19.2 Mergeable-heap operations 510 19.3 Decreasing a key and deleting a node 518 19.4 Bounding the maximum degree 523 20 van Emde Boas Trees 531 20.1 Preliminary approaches 532 20.2 A recursive structure 536 20.3 The van Emde Boas tree 545 21 Data Structures for Disjoint Sets 561 21.1 Disjoint-set operations 561 21.2 Linked-list representation of disjoint sets 564 21.3 Disjoint-set forests 568 21.4 Analysis of union by rank with path compression 573 VI Graph Algorithms Introduction 587 22 Elementary Graph Algorithms 589 22.1 Representations of graphs 589 22.2 Breadth-first search 594 22.3 Depth-first search 603 22.4 Topological sort 612 22.5 Strongly connected components 615 23 Minimum Spanning Trees 624 23.1 Growing a minimum spanning tree 625 23.2 The algorithms of Kruskal and Prim 631 Contents ix 24 Single-Source Shortest Paths 643 24.1 The Bellman-Ford algorithm 651 24.2 Single-source shortest paths in directed acyclic graphs 655 24.3 Dijkstra’s algorithm 658 24.4 Difference constraints and shortest paths 664 24.5 Proofs of shortest-paths properties 671 25 All-Pairs Shortest Paths 684 25.1 Shortest paths and matrix multiplication 686 25.2 The Floyd-Warshall algorithm 693 25.3 Johnson’s algorithm for sparse graphs 700 26 Maximum Flow 708 26.1 Flow networks 709 26.2 The Ford-Fulkerson method 714 26.3 Maximum bipartite matching 732 ? 26.4 Push-relabel algorithms 736 ? 26.5 The relabel-to-front algorithm 748 VII Selected Topics Introduction 769 27 Multithreaded Algorithms 772 27.1 The basics of dynamic multithreading 774 27.2 Multithreaded matrix multiplication 792 27.3 Multithreaded merge sort 797 28 Matrix Operations 813 28.1 Solving systems of linear equations 813 28.2 Inverting matrices 827 28.3 Symmetric positive-definite matrices and least-squares approximation 832 29 Linear Programming 843 29.1 Standard and slack forms 850 29.2 Formulating problems as linear programs 859 29.3 The simplex algorithm 864 29.4 Duality 879 29.5 The initial basic feasible solution 886 x Contents 30 Polynomials and the FFT 898 30.1 Representing polynomials 900 30.2 The DFT and FFT 906 30.3 Efficient FFT implementations 915 31 Number-Theoretic Algorithms 926 31.1 Elementary number-theoretic notions 927 31.2 Greatest common divisor 933 31.3 Modular arithmetic 939 31.4 Solving modular linear equations 946 31.5 The Chinese remainder theorem 950 31.6 Powers of an element 954 31.7 The RSA public-key cryptosystem 958 ? 31.8 Primality testing 965 ? 31.9 Integer factorization 975 32 String Matching 985 32.1 The naive string-matching algorithm 988 32.2 The Rabin-Karp algorithm 990 32.3 String matching with finite automata 995 ? 32.4 The Knuth-Morris-Pratt algorithm 1002 33 Computational Geometry 1014 33.1 Line-segment properties 1015 33.2 Determining whether any pair of segments intersects 1021 33.3 Finding the convex hull 1029 33.4 Finding the closest pair of points 1039 34 NP-Completeness 1048 34.1 Polynomial time 1053 34.2 Polynomial-time verification 1061 34.3 NP-completeness and reducibility 1067 34.4 NP-completeness proofs 1078 34.5 NP-complete problems 1086 35 Approximation Algorithms 1106 35.1 The vertex-cover problem 1108 35.2 The traveling-salesman problem 1111 35.3 The set-covering problem 1117 35.4 Randomization and linear programming 1123 35.5 The subset-sum problem 1128 Contents xi VIII Appendix: Mathematical Background Introduction 1143 A Summations 1145 A.1 Summation formulas and properties 1145 A.2 Bounding summations 1149 B Sets, Etc. 1158 B.1 Sets 1158 B.2 Relations 1163 B.3 Functions 1166 B.4 Graphs 1168 B.5 Trees 1173 C Counting and Probability 1183 C.1 Counting 1183 C.2 Probability 1189 C.3 Discrete random variables 1196 C.4 The geometric and binomial distributions 1201 ? C.5 The tails of the binomial distribution 1208 D Matrices 1217 D.1 Matrices and matrix operations 1217 D.2 Basic matrix properties 1222 Bibliography 1231 Index 1251

数据挖掘导论（第二版）第3章：分类-基础.pptx

...

MIT算法导论视频PPT课件及其课后作业，分享出来，一起学习

　神经网络是： 　　思维学普遍认为，人类大脑的思维分为抽象（逻辑）思维、形象（直观）思维和灵感（顿悟）思维三种基本方式。 　　逻辑性的思维是指根据逻辑规则进行推理的过程；它先将信息化成概念，并用符号表示，然后，根据符号运算按串行模式进行逻辑推理；这一过程可以写成串行的指令，让计算机执行。然而，直观性的思维是将分布式存储的信息综合起来，结果是忽然间产生想法或解决问题的办法。这种思维方式的根本之点在于以下两点:1.信息是通过神经元上的兴奋模式分布储在网络上;2.信息处理是通过神经元之间同时相互作用的动态过程来完成的。 　　人工神经网络就是模拟人思维的第二种方式。这是一个非线性动力学系统，其特色在于信息的分布式存储和并行协同处理。虽然单个神经元的结构极其简单，功能有限，但大量神经元构成的网络系统所能实现的行为却是极其丰富多彩的。

地理信息系统（Geographic information System，简称GIS)是集计算机科学、信息科学、测绘科学、地理科学、空间科学、环境科学和管理科学等为一体的新兴边缘学科。

系统工程导论 涵盖所有章节内容的PDF 增加的相关PPT内容