计算机基础理论_计算机类_最新资料_得益网

数据结构教程——抽象数据类型描述(C语言版)

2008-11-21 09:08:55

【内容简介】
　　本书是作者在多年教学实践的基础上，为计算机应用专业等非计算机专业的学生编写的一本教材。本书内容深浅适度，语言生动形象，侧重于程序设计技术、算法和应用。
　　本书从抽象数据类型(ADT)的角度，循序渐进和系统地介绍了线性表、数组、串、栈、队列、树、图和集合等各种基本数据类型的说明、表示和实现，还介绍了查找、排序等各种算法和算法分析方法以及文件的组织结构。
　　本书不仅可作为大专院校计算机应用专业和电子工程、通信工程、信息处理、管理等非计算机专业学生的教材和教学参考书，还可作为各种成人高等教育学校与计算机有关专业学生的教材、教学参考书和自学读本。本书对于计算机科学专业的师生和从事计算机软件工作的人员也是一本很好的参考书。
【下载说明】
　　本资料为《数据结构教程——抽象数据类型描述(C语言版)》一书PDF格式的清晰电子版，推荐使用Adobe Reader 7.0或兼容阅读工具打开！
【图书目录】
第1章抽象数据类型和算法描述
1.1抽象和实现
1.2术语和概念
1.3抽象数据类型
1.4算法分析
习题一
第2章线性表、数组和串
2.1抽象数据类型List
2.2线性表的实现
2.3特殊链表
2.4应用举例——模拟存储管理
2.5数组
2.6串
习题二
第3章栈和队列
3.1栈的数据类型
3.2栈的实现
3.3队列
3.4算术表达式的计算
习题三
第4章树
4.1树的基本概念和术语
4.2一般树
4.3二叉树
4.4遍历二叉树
4.5二叉排序树
4.6穿线二叉树
4.7最优二叉搜索树
4.8堆和优先队列
4.9背包问题
习题四
第5章无向图
5.1基本概念
5.2抽象数据类型Graph
5.3图的表示和实现
5.4图的遍历
5.5生成树和最小代价生成树
5.6割点和双连通分量
5.7货郎担问题
习题五
第6章有向图
6.1有向图的概念和表示
6.2单源最短路径
6.3所有顶点间的最短路径和传递闭包
6.4强连通分量
6.5无圈有向图
习题六
第7章集合和查找技术
7.1抽象数据类型Set
7.2集合的表示和实现
7.3查找表
7.4散列技术
7.5MergeFind抽象数据类型
习题七
第8章排序
8.1排序的概念
8.2简单排序方法
8.3分治法排序
8.4其他的比较型排序方法
8.5分布型排序方法
8.6内部排序算法的比较
8.7外部排序
习题八
第9章文件
9.1文件的基本概念
9.2顺序文件
9.3索引文件
9.4散列文件
9.5多关键字文件
习题九
第10章数据结构实习
10.1数据结构实习指与
10.2实习报告范例——迷宫问题
10.3实习题
参考文献

数据结构自学辅导

2008-11-20 16:25:23

本书依据高等教育自学考试大纲（数据结构）编写，全书共分12章。第1章至第10章的章节结构与考试大纲相对应，每章均先介绍知识点和学习方法，再进行重点与难点分析，最后给出自测练习和答案；第11章是复习应试指南；第12章是模拟试题及参考答案。
本书是高等教育自学考试计算机及应用专业（独立本科段）自学辅导丛书之一，旨在帮助考生充分把握考试内容和题型，做好应试准备，取得理想成绩。
目录
第1章概论

1．1 知识点和学习方法

1．2 重点与难点分析

1．3 自测练习

1．4 自测练习答案

第2章线性表

2．l 知识点和学习方法

2．2 重点与难点分析

2. 3 自测练习

2. 4 自测练习答案

第3章栈和队列

3．l 知识点和学习方法

3．2 重点与难点分析

3．3 自测练习

3．4 自测练习答案

第4章串

4．1 知识点和学习方法

4．2 重点与难点分析

4. 3 自测练习

4．4 自测练习答案

第5章多线数组和广义表

5. 1 知识点和学习方法

5．2 重点与难点分析

5．3 自测练习

5. 4 自测练习答案

第6章树

6．1 知识点和学习方法

6．2 重点与难点分析

6. 3 自测练习

6. 4 自测练习答案

第7章图

7. 1 知识点和学习方法

7. 2 重点与难点分析

7．3 自测练习

7. 4 自测练习答案

第8章排序

8. l 知识点和学习方法

8. 2 重点与难点分析

8．3 自测练习

8．4 自测练习答案

第9章查找

9．1 知识点和学习方法

9．2 重点与难点分析

9. 3 自测练习

9. 4 自测练习答案

第10章文件

10. 1 知识点和学习方法

10．2 重点与难点分析

1O．3 自测练习

10. 4 自测练习答案

第11章复习应试指南

11．1 总纲

11．2 基本概念和术语一

11．3 顺序表

11．3．l 线性表

11．3．2 顺序残

11．3．3 顺序队列

11．4 链表

11．4．l 单链表

11．4．2 循环链表

11．4．3 链栈和链队列

11．5 串

11．5．1 顺序串

11．5．2 链串

11．5. 3 串运算举例

11．6 多维数组和广义表

11．6．l 多维数组

11．6. 2 矩阵的存储

11．6. 3 广义表

11．7 树

11．7. 1 树的概念和术语

11．7．2 二叉树

11．7．3 树和森林

11．7. 4 哈夫曼树

11．8 图的概念

11．8. l 图的基本术语

11．8. 2 图的存储表示方式

11．8. 3 图的基本运算

11．9 排序

11．9．1 排序方法的基本思想

11．9．2 排序方活的分析比较

11．10 查找

11．10. 1 线性表的查找

11．10．2 树表的查找

11．10．3 散列表查找

11．11 文件

11．11．l 基本概念

11．11．2 顺序文件

11．11．3 索引文件

11．11．4 索引顺序文件

11．11．5 散列文件

11．11．6 多关键字文件

第12章模拟试题

模拟试题1

模拟试题2

模拟试题3

模拟试题4

模拟试题5

模拟试题1参考答案

模拟试题2参考答案

模拟试题3参考答案

模拟试题4参考答案

模拟试题5参考答案

主要参考文献

Computation Engineering: Applied Automata Theory and Logic

2008-11-14 08:20:34

Review

From the reviews:

"One of the constant challenges faced by computer science faculty is how to tie in the theory of computing with applications. This text attempts to do just that … . Overall, this book is a good undergraduate theory text. … It includes exercises, with software tools to aid in visualization of key ideas. … The exercises are appropriate for an undergraduate-level class. … It is a good text … ." (M. D. Derk, Computing Reviews, December, 2006)

Product Description

The computer hardware and software industry is committed to using formal methods. As a result, it is crucial that students who take automata theory and logic courses retain what they have learned and understand how to use their knowledge. Yet many textbooks typically emphasize automata theory only, not logic, thus losing a valuable opportunity to tie these subjects together and reinforce learning. In fact, automata theory and logic evolved hand-in-hand, yet this connection was severed in the '70s as separate automata-theory and logic courses became possible. Now, with computer science departments suffering from overcrowded syllabi, it is often possible for undergraduates to get a BS without having had to take a course in mathematical logic!

Today's students want to know how knowledge can work for them -- learning theory as a tool is preferable to learning theory for theory's sake. To prove that theoretical tenents are not only applicable, but also necessary and relevant, useful examples must be presented. This textbook uses interactive tools throughout, such as simple BDD and SAT tools. By providing a blend of theory and practical applications the material is shown to be both inviting and current. Topics are also illustrated in multiple domains so that information is reinforced and students can begin to tie automata theory and logic together. They will also learn multiple uses of fixed-points, including BDD based model checking and understanding context-free productions.

Having used this book, students will not only know and understand automata theory, but also be able to apply their knowledge in real practice.

Data Strucures and Algorithms in Java

2008-11-11 17:41:58

Data Structures and Algorithms in Java - 4
Introduction - 7
Part I
Chapter 1 - Overview - 11
Chapter 2 - Arrays - 29
Chapter 3 - Simple Sorting - 63
Part II
Chapter 4 - Stacks and Queues - 80
Chapter 5 - Linked Lists - 142
Chapter 6 - Recursion - 200
Part III
Chapter 7 - Advanced Sorting - 243
Chapter 8 - Binary Trees - 280
Chapter 9 - Red-Black Trees - 311
Part IV
Chapter 10 - 2-3-4 Trees and External Storage - 335
Chapter 11 - Hash Tables - 372
Chapter 12 - Heaps - 416
Part V
Chapter 13 - Graphs - 438
Chapter 14 - Weighted Graphs - 476
Chapter 15 - When to Use What - 510
Part VI Appendixes
Appendix A - How to Run the Workshop Applets and Example Programs - 521
Appendix B - Further Reading - 524

Introduction to Calculus and Analysis Volume I （微积分和数学分析引论-第一卷）

2008-11-11 13:40:18

微积分和数学分析引论（第一卷）。本书系统的阐述了微积分许的基本理论。在叙述上，作者尽量作到既严谨而又通俗易懂，并指出概念之间的内在联系和直观北京。原书分两卷，地一卷为单变量情形，第二卷为多变量情形。
第一卷中译本分两册出版。本书为第一卷第一分册，包括前三章，主要接受函数、极限、微分和积分的基本概念及其运算。从第四章开始介绍微积分在物理和几何中的应用；第五章讲述泰勒展开式；第六章讲述数值方法；第七章介绍无穷和与无穷乘积概念；第八章为三角级数；第九章是与振动有关的最简单类型的微分方程。

Handbook of Mathematics

2008-11-07 07:06:48

This 5th edition is based on the fourth English edition and corresponds to the improved sixth German edition. It contains all the chapters of the both mentioned editions. but in a renewed revised and extended form.

Programming Languages: Application and Interpretation

2008-11-05 06:56:12

This book is the primary text for Brown University’s course cs173. This course is intended for junior and
senior (3rd and 4th year) undergraduates, as well as beginning graduate students. In practice, the course
enrollment includes some outstanding sophomores as well as advanced graduate students.
The course and book are my attempt to synthesize two conflicting traditions of teaching programming
languages: through interpreters and by survey. I believe interpreters are a superior framework for understanding,
but surveying languages makes them more tangible, resulting in bottom-up learning. In an ideal
world, we would have time enough to oer both courses and, the survey course, being rid of the need to
teach programming language principles, would show students how to really use dierent languages powerfully:
“in anger”, as Phil Wadler would say. This book is a compromise wherein every feature is either
explicitly or implicitly driven by experience, with use preceding implementation.
Design Principles
? Concepts like design, elegance and artistic sensibility are rarely manifest in computer science courses;
in the name of not being judgmental, we may be running the risk of depriving our students of judgment
itself. We should reverse this trend. Students must understand that artificial objects have their
own aesthetic; the student must learn to debate the tradeos that lead to an aesthetic. Programming
languages are some of the most thoroughly designed artifacts in computer science. Therefore, the
study of programming languages oers a microcosm to study design itself.
? The best means we have to lead students to knowledge is through questions, not answers. The best
education prepares them to assess new data by confronting it with questions, processing the responses,
and iterating until they have formed a mental model of it. This book is therefore structured more like
a discussion than a presentation. It leads the reader down wrong paths (so don’t blindly copy code
from it!). It allows readers to get comfortable with mistaken assumptions before breaking them down
systematically.
? The programming languages course is one of the few places in the curriculum where we can tease
out and correct our students’ misconceptions about this material. They are often misled on topics
such as eciency and correctness. Therefore, material on compilation, type systems and memory
management should directly confront their biases. For instance, a presentation of garbage collection
that does not also discuss the trade-os with manual memory management will fail to address the
prejudices students bear.
iii
iv PREFACE
Background and Prerequisite
This book assumes that students are comfortable reasoning informally about loop invariants, have modest
mathematical maturity, and are familiar with the existence of the Halting Problem. At Brown, they have all
been exposed to Java but not necessarily to any other languages (such as Scheme).
Supplementary Material
There is some material I use in my course that isn’t (currently) in this book:
preparation in Scheme For the first week, I oer supplementary sessions that teach students Scheme. The
material from these sessions is available from my course Web pages. In addition, I recommend the
use of a simple introduction to Scheme, such as the early sections of The Little Schemer or of How to
Design Programs.
garbage collection I have provided only limited notes on garbage collection because I feel no need to oer
my own alternative to Paul Wilson’s classic survey, Uniprocessor Garbage Collection Techniques. I
recommend choosing sections from this survey, depending on student maturity, as a supplement to
this text.
model checking I supplement the discussion of types with a presentation on model checking, to show
students that it is possible to go past the fixed set of theorems of traditional type systems to systems
that permit developers to state theorems of interest. I have a pre-prepared talk on this topic, and would
be happy to share those slides.
Web programming Before plunging into continuations, I discuss Web programming APIs and demonstrate
how they mask important control operators. I have a pre-prepared talk on this topic, and would
be happy to share those slides. I also wrap up the section on continuations with a presentation on
programming in the PLT Scheme Web server, which natively supports continuations.
articles on design I hand out a variety of articles on the topic of design. I’ve found Dan Ingalls’s dissection
of Smalltalk, Richard Gabriel’s on Lisp, and Paul Graham’s on both programming and design the
most useful.
logic programming The notes on logic programming are the least complete. Students are already familiar
with unification from type inference by the time I arrive at logic programming. Therefore, I focus on
the implementation of backtracking. I devote one lecture to the use of unification, the implications
of the occurs-check, depth-first versus breadth-first search, and tabling. In another lecture, I present
the implementation of backtracking through continuations. Concretely, I use the presentation in Dorai
Sitaram’s Teach Yourself Scheme in Fixnum Days. This presentation consolidates two prior topics,
continuations and macros.
I also have material on programming in Haskell (written by Greg Cooper) and on the lambda calculus
(transcribed by Don Blaheta) that I will incorporate in a future version of this text.
v
Exercises
In addition to several exercises sprinkled throughout the book (under the banner of “Puzzles”), there are
numerous homework exercises and exams available from my course’s Web pages (where hyeari is one of
2000, 2001, 2002 and 2003):
http://www.cs.brown.edu/courses/cs173/hyeari/

图和网络与算法

2008-11-03 07:50:46

第一篇图论
第一章基本概念
第二章树、割集和回路
第三章欧拉图和哈密顿图
第四章图和矢量空间
第五章有向图
第六章图的矩阵
第七章平面性和对偶性
第八章连通度和匹配
第九章覆盖和着色
第十章拟阵
第二篇电网络理论
第十一章图和网络
第十二章 N端口电阻网络
第十三章网络函数和网络灵敏度
第三篇算法图论
第十四章算法分析
第十五章算法优化
名词索引

微软公司内部所有工程师的必读之书 I. M. Wright's Hard Code

2008-10-29 08:48:25

Copyright
Reader Acclaim for I. M. Wright's "Hard Code" Column
Foreword
Introduction
Chapter 1. Project Mismanagement
June 1, 2001: "Dev schedules, flying pigs, and other fantasies"
October 1, 2001: "Pushing the envelopes: Continued contention over dev schedules"
May 1, 2002: "Are we having fun yet? The joy of triage."
December 1, 2004: "Marching to death"
October 1, 2005: "To tell the truth"
Chapter 2. Process Improvement, Sans Magic
September 2, 2002: "Six Sigma? Oh please!"
October 1, 2004: "Lean: More than good pastrami"
April 1, 2005: "Customer dissatisfaction"
March 1, 2006: "The Agile bullet"
Chapter 3. Inefficiency Eradicated
July 1, 2001: "Late specs: Fact of life or genetic defect?"
June 1, 2002: "Idle hands"
June 1, 2004: "The day we met"
July 1, 2006: "Stop writing specs, co-located feature crews"
February 1, 2007: "Bad specs: Who is to blame?"
Chapter 4. Cross Disciplines
April 1, 2002: "The modern odd couple? Dev and Test"
July 1, 2004: "Feeling testy—The role of testers"
May 1, 2005: "Fuzzy logic—The liberal arts"
November 1, 2005: "Undisciplined—What's so special about specialization?"
Chapter 5. Software Quality—More Than a Dream
March 1, 2002: "Are you secure about your security?"
November 1, 2002: "Where's the beef? Why we need quality"
April 1, 2004: "A software odyssey—From craft to engineering"
July 1, 2005: "Review this—Inspections"
October 1, 2006: "Bold predictions of quality"
Chapter 6. Software Design If We Have Time
September 1, 2001: "A tragedy of error handling"
February 1, 2002: "Too many cooks spoil the broth—Sole authority"
May 1, 2004: "Resolved by design"
February 1, 2006: "The other side of quality—Designers and architects"
August 1, 2006: "Blessed isolation—Better design"
Chapter 7. Adventures in Career Development
December 1, 2001: "When the journey is the destination"
October 1, 2002: "Life isn't fair—The review curve"
November 1, 2006: "Roles on the career stage"
May 1, 2007: "Get yourself connected"
Chapter 8. Personal Bug Fixing
December 1, 2002: "My way or the highway—Negotiation"
February 1, 2005: "Better learn life balance"
June 1, 2005: "Time enough"
August 1, 2005: "Controlling your boss for fun and profit"
April 1, 2006: "You talking to me? Basic communication"
March 1, 2007: "More than open and honest"
Chapter 9. Being a Manager, and Yet Not Evil Incarnate
February 1, 2003: "More than a number—Productivity"
September 1, 2004: "Out of the interview loop"
November 1, 2004: "The toughest job—Poor performers"
September 1, 2005: "Go with the flow—Retention and turnover"
December 1, 2005: "I can manage"
May 1, 2006: "Beyond comparison—Dysfunctional teams"
Chapter 10. Microsoft, You Gotta Love It
November 1, 2001: "How I learned to stop worrying and love reorgs"
March 1, 2005: "Is your PUM a bum?"
September 1, 2006: "It's good to be the King of Windows"
December 1, 2006: "Google: Serious threat or poor spelling?"
April 1, 2007: "Mid-life crisis"
Glossary
About the Author
Index

Fixed-point theory and applications

2008-10-27 10:05:37

一本关于定点数字信号处理理论的英文资料，比较难，但是对研究定点器件数字信号处理很有帮助！
目录
1 Nielsen theory and related topics
2 Duan's fixed point theorem:proof and generalization,Martin Arkowitz
3 Fixed point indices and manifolds with collars
4 Epsilon Nielsen fixed point theory
5 A base-point-free definition of the Lefschetz inrariant
6 the Anosov theorem for infranilmanifolds with an odd-order Abelian holonomy group
7 Wecken type problems for self-maps of the Klein bottle
8 Algebraic periods of self-maps of a rational exterior
9 Nielsen number of a covering map
10 Geometric and homotopy theoretic methods in Nielsen
11 Fixed point sets of maps homotopic to a given map
12 Coincidence classes in nonorientable manifolds
13 reducing the number of fixed points of some homeomorphisms

Introduction to Algorithms

2008-10-25 23:16:48

Book Info: 简称为CLRS的<<算法导论>>,被称作"计算机算法的圣经".
　　本书的主要作者来自麻省理工大学计算机,作者之一Ronald L.Rivest 由于其在公开秘钥密码算法RSA上的贡献获得了图灵奖,目前是算法的标准教材,美国许多名校的计算机系都使用它,国内有些院校也将本书作为算法课程的教材.另外许多专业人员也经常引用它.由于TAOCP只出版了3卷,CLRS比较起前者来则显得内容更为全面,基本包含了所有的经典算法.本书程序全部由伪代码实现,这更增添了本书的通用性,使得利用各种程序设计语言的程序员都可以作为参考.语言方面通俗,很适合作为算法教材和自学算法之用.国内的很多作品名为数据结构,从本书中断章取义,把数据结构与算法混为一谈,搞得作者自己都迷迷糊糊.这也是我不十分愿意向大家推荐国内作品的原因.你会发现现在基本上所有的数据结构与算法书籍都会将本书作为参考文献之一,更可以说明一个问题,本书是作为读者进行算法学习的最佳选择.

通信中的自适应信号处理

2008-10-24 20:30:15

【摘要和目录】：
本书主要介绍自适应信号处理的基本理论和方法，着重介绍了自适应信号处理在通信技术中的应用。全书分为11章。在简要介绍有关自适应信号处理基本原理的基础上，详细介绍了通信信号波形的数字表示，通信中的自适应系统辨识，码间干扰与信道均衡，通信中的自适应噪声抵消（ANC）技术，自适应时间延迟估计，自适应阵列信号处理与波束形成，自适应天线系统，移动通信中的自适应信号处理，以及网络通信中的自适应信号处理等。
本书可作为高等院校电子信息类专业高年级本科生和研究生的教学参考书，也可供相关领域的科研开发人员和工程技术人员阅读。

第1章绪论
1.1 自适应滤波器的基本概念
1.2 通信系统的一般概念
1.3 通信中自适应信号得理的典型应用
参考文献
第2章自适应滤波器的基本原理
2.1 维纳滤波器
2.2 横向自适应滤波器
2.3 最小均方(LMS)算法
2.4 递归最小二乘(RLS)自适应滤波器
2.5 其他自适应滤波器算法与结构
参考文献
第3章通信信号波形的数字表示
3.1 连续时间信号的采样与采样定理
3.2 量化与脉冲编码调制(PCM)
3.3 自适应差分脉冲编码调制(ADPCM)与增量调制(DM)
3.4 其他编码方式
3.5 第三代移动通信系统中应用的编码技术
参考文献
第4章通信中的自适应系统辩识
4.1 自适应系统辩识的要领
4.2 全极点模型的估计
4.3 极点-零点模型的辨识
4.4 多径通信道中的自适应辩识
参考文献
第5章码间干扰与信道均衡
5.1 通信信道的非理想特性与码间干扰(ISI)
5.2 信道的线性均衡
5.3 自适应信道均衡
5.4 其他信道均衡方法
5.5 通信信道的盲均衡
5.6 基于分数低阶统计量的均衡方法
参考文献
第6章通信中的自适应噪声抵消(ANC)技术
……
第7章自适应时间延迟估计
第8章自适应阵列信号处理
第9章自适应天线系统
第10章移动通信中的自适应信号处理
第11章网络通信中的自适应信号处理

LOGIC IN COMPUTER SCIENCE： MODELLING AND REASONING ABOUT SYSTEMS，SECOND EDITON

2008-10-23 22:05:21

数理逻辑是计算机科学的基础之一，在模型与系统的规约与验证等方面有着广泛的应用。随着当今软硬件产品(电路、程序和通信协议等)日趋复杂，数理逻辑已经成为越来越多设计开发人员的日常工具。
本书适合作为高等院校计算机及相关专业的数理逻辑／形式化方法课程教材，涵盖了命题逻辑、谓词逻辑、模态逻辑与Agent、二元决策图、模型检查和程序验证等内容。与传统数理逻辑教科书相比，它的主要特色就是紧紧围绕软硬件规约和验证这一主题，反映了计算机科学中数理逻辑的新发展和实际需要。第2版新增了可满足性(SAT)算法、紧致性理论和Lowenheim-Skolem定理，并介绍了Alloy语言和NuSMV工具。
本书自出版以来受到广泛好评，已经被包括美国普林斯顿大学、卡内基—梅隆大学、英国剑桥大学、德国汉堡大学、加拿大多伦多大学、荷兰Vrije大学、印度理工学院在内的多个国家几十所高校采纳为教材。

Conformal.Array.Antenna.Theory.and.Design

2008-10-23 18:28:06

大家好，这本书主要研究天线理论，书中内容全面，特别适合做通讯的朋友！以下是简介！
This book is the result of close cooperation between industry and academia, notably Ericsson
and two universities in Sweden: Chalmers University of Technology (CTH) in G?teborg
and The Royal Institute of Technology (KTH) in Stockholm. In 1987, a student at
CTH presented her PhD thesis on the topic of conformal antennas. It was then considered
an interesting but difficult technology with no immediate application. About 10 years later,
many conformal array applications were seriously considered or in development. At
that time, we became involved in several conformal R&D programs that also included experimental
hardware for model verification. Our intention was to compile results from
these efforts into one, thick internal report. However, with the support and encouragement
from many colleagues, we set out on the much more demanding route to write a book on
the subject.
1 INTRODUCTION 1
1.1 The Definition of a Conformal Antenna 1
1.2 Why Conformal Antennas? 2
1.3 History 4
1.4 Metal Radomes 9
1.5 Sonar Arrays 9
References 11
2 CIRCULAR ARRAY THEORY 15
2.1 Introduction 15
2.2 Fundamentals 16
2.2.1 Linear Arrays 16
2.2.2 Circular Arrays 19
2.3 Phase Mode Theory 23
2.3.1 Introduction 23
2.3.2 Discrete Elements 27
2.3.3 Directional Elements 29
2.4 The Ripple Problem in Omnidirectional Patterns 34
2.4.1 Isotropic Radiators 37
2.4.2 Higher-Order Phase Modes 40
2.4.3 Directional Radiators 40
2.5 Elevation Pattern 41
2.6 Focused Beam Pattern 41
References 46
3 THE SHAPES OF CONFORMAL ANTENNAS 49
3.1 Introduction 49
3.2 360° Coverage
3.2.1 360° Coverage Using Planar Surfaces 52
3.2.2 360° Coverage Using a Curved Surface 54
3.3 Hemispherical Coverage 57
3.3.1 Introduction 57
3.3.2 Hemispherical Coverage Using Planar Surfaces 58
3.3.3 Half Sphere 60
3.3.4 Cone 60
3.3.5 Ellipsoid 62
3.3.6 Paraboloid 63
3.3.7 Comparing Shapes 64
3.4 Multifaceted Surfaces 67
3.5 References 70
4 METHODS OF ANALYSIS 73
4.1 Introduction 73
4.2 The Problem 75
4.3 Electrically Small Surfaces 76
4.3.1 Introduction 76
4.3.2 Modal Solutions 76
4.3.2.1 Introduction 76
4.3.2.2 The Circular Cylinder 77
4.3.2.3 A Unit Cell Approach 79
4.3.3 Integral Equations and the Method of Moments 80
4.3.4 Finite Difference Time Domain Methods (FDTD) 81
4.3.4.1 Introduction 81
4.3.4.2 Conformal or Contour-Patch (CP) FDTD 82
4.3.4.3 FDTD in Global Curvilinear Coordinates 83
4.3.4.4 FDTD in Cylindrical Coordinates 84
4.3.5 Finite Element Method (FEM) 87
4.3.5.1 Introduction 87
4.3.5.2 Hybrid FE-BI Method 88
4.4 Electrically Large Surfaces 89
4.4.1 Introduction 89
4.4.2 High-Frequency Methods for PEC Surfaces 90
4.4.3 High-Frequency Methods for Dielectric Coated Surfaces 93
4.5 Two Examples 95
4.5.1 Introduction 95
4.5.2 The Aperture Antenna 95
4.5.3 The Microstrip-Patch Antenna 98
4.6 A Comparison of Analysis Methods 100
Appendix 4A—Interpretation of the ray theory 100
4A.1 Watson Transformation 103
4A.2 Fock Substitution 103
4A.3 SDP Integration 104
4A.4 Surface Waves 105
4A.5 Generalization 107
References
5 GEODESICS ON CURVED SURFACES 123
5.1 Introduction 123
5.1.1 Definition of a Surface and Related Parameters 125
5.1.2 The Geodesic Equation 127
5.1.3 Solving the Geodesic Equation and the Existence of Geodesics 128
5.2 Singly Curved Surfaces 130
5.3 Doubly Curved Surfaces 135
5.3.1 Introduction 135
5.3.2 The Cone 135
5.3.3 Rotationally Symmetric Doubly Curved Surfaces 137
5.3.4 Properties of Geodesics on Doubly Curved Surfaces 139
5.3.5 Geodesic Splitting 141
5.4 Arbitrarily Shaped Surfaces 149
5.4.1 Hybrid surfaces 150
5.4.2 Analytically Described Surfaces 152
References 152
6 ANTENNAS ON SINGLY CURVED SURFACES 155
6.1 Introduction 155
6.2 Aperture Antennas on Circular Cylinders 157
6.2.1 Introduction 157
6.2.2 Theory 157
6.2.3 Mutual Coupling 158
6.2.3.1 Isolated Mutual Coupling 158
6.2.3.2 Cross Polarization Coupling 168
6.2.3.3 Array mutual coupling 168
6.2.4 Radiation Characteristics 173
6.2.4.1 Isolated-Element Patterns 175
6.2.4.2 Embedded-Element Patterns 176
6.3 Aperture Antennas on General Convex Cylinders 192
6.3.1 Introduction 192
6.3.2 Mutual Coupling 193
6.3.2.1 The Elliptic Cylinder 193
6.3.2.2 The Parabolic Cylinder 194
6.3.2.3 The Hyperbolic Cylinder 194
6.3.3 Radiation Characteristics 194
6.3.3.1 The Elliptic Cylinder 196
6.3.3.2 End Effects 196
6.4 Aperture Antennas on Faceted Cylinders 200
6.4.1 Introduction 200
6.4.2 Mutual Coupling 207
6.4.3 Radiation Characteristics 209
6.5 Aperture Antennas on Dielectric Coated Circular Cylinders 209
6.5.1 Introduction 209
6.5.2 Mutual Coupling 213
6.5.2.1 Isolated Mutual Coupling 213
6.5.2.2 Array Mutual Coupling 215
6.5.3 Radiation Characteristics 221
6.5.3.1 Isolated-Element Patterns 221
6.5.3.2 Embedded-Element Patterns 223
6.6 Microstrip-Patch Antennas on Coated Circular Cylinders 230
6.6.1 Introduction 230
6.6.2 Theory 231
6.6.3 Mutual Coupling 232
6.6.3.1 Single-Element Characteristics 232
6.6.3.2 Isolated and Array Mutual Coupling 232
6.6.4 Radiation Characteristics 237
6.6.4.1 Isolated-Element Patterns 237
6.6.4.2 Embedded-Element Patterns 238
6.7 The Cone 245
6.7.1 Introduction 245
6.7.2 Mutual Coupling 246
6.7.2.1 Aperture Antennas 246
6.7.2.2 Microstrip-Patch Antennas 247
6.7.3 Radiation Characteristics 248
6.7.3.1 Aperture Antennas 248
6.7.3.2 Microstrip-Patch Antennas 257
References 258
7 ANTENNAS ON DOUBLY CURVED SURFACES 265
7.1 Introduction 265
7.2 Aperture Antennas 267
7.2.1 Introduction 267
7.2.2 Mutual Coupling 267
7.2.2.1 Isolated Mutual Coupling 269
7.2.2.2 Array Mutual Coupling 282
7.2.3 Radiation Characteristics 283
7.3 Microstrip-Patch Antennas 289
7.3.1 Introduction 289
7.3.2 Mutual Coupling 289
7.3.2.1 Single-Element Characteristics 291
7.3.2.2 Isolated Mutual Coupling 294
7.3.3 Radiation Characteristics 297
References 302
8 CONFORMAL ARRAY CHARACTERISTICS 305
8.1 Introduction 305
8.2 Mechanical Considerations 306
8.2.1 Array Shapes 306
8.2.2 Element Distribution on a Curved Surface 308
8.2.3 Multifacet Solutions 308
8.2.4 Tile Architecture 309
8.2.5 Static and Dynamic Stress 312
8.2.6 Other Electromagnetic Considerations 312
8.3 Radiation Patterns 313
8.3.1 Introduction 313
8.3.2 Grating Lobes 315
8.3.3 Scan-Invariant Pattern 319
8.3.4 Phase-Scanned Pattern 319
8.3.5 A Simple Aperture Model for Microstrip Arrays 323
8.4 Array Impedance 327
8.4.1 Introduction 327
8.4.2 Phase-Mode Impedance 330
8.5 Polarization 336
8.5.1 Polarization Definitions 336
8.5.2 Cylindrical Arrays 337
8.5.2.1 Dipole Elements 337
8.5.2.2 Aperture elements 337
8.5.3 Polarization in Doubly Curved Arrays 340
8.5.3.1 A Paraboloidal Array 341
8.5.4 Polarization Control 348
8.6 Characteristics of Selected Conformal Arrays 351
8.6.1 Nearly Planar Arrays 351
8.6.2 Circular Arrays 351
8.6.3 Cylindrical Arrays 351
8.6.4 Conical Arrays 351
8.6.5 Spherical Arrays 354
8.6.6 Paraboloidal Arrays 356
8.6.7 Ellipsoidal Arrays 358
8.6.8 Other Shapes 359
References 359
9 BEAM FORMING 365
9.1 Introduction 365
9.2 A Note on Orthogonal Beams 366
9.3 Analog Feed Systems 366
9.3.1 Vector Transfer Matrix Systems 367
9.3.2 Switch Matrix Systems 367
9.3.3 Butler Matrix Feed Systems 370
9.3.4 RF Lens Feed Systems 374
9.3.4.1 The R-2R Lens Feed 374
9.3.4.2 The R-kR Lens Feed 375
9.3.4.3 Mode-Controlled Lenses 376
9.3.4.4 The Luneburg Lens 377
9.3.4.5 The Geodesic Lens 378
9.3.4.6 The Dome Antenna 380
9.4 Digital Beam Forming 380
9.5 Adaptive Beam Forming 384
9.5.1 Introduction 384
9.5.2 The Sample Matrix Inversion Method 384
9.5.3 An Adaptive Beam Forming Simulation Using a 385
Circular Array
9.6 Remarks on Feed Systems 388
References 389
10 CONFORMAL ARRAY PATTERN SYNTHESIS 395
10.1 Introduction 395
10.2 Shape Optimization 397
10.3 Fourier Methods for Circular Ring Arrays 397
10.4 Dolph-Chebysjev Pattern Synthesis 398
10.4.1 Isotropic Elements 398
10.4.2 Directive Elements 399
10.5 An Aperture Projection Method 401
10.6 The Method of Alternating Projections 404
10.7 Adaptive Array Methods 406
10.8 Least-Mean-Squares Methods (LMS) 407
10.9 Polarimetric Pattern Synthesis 409
10.10 Other Optimization Methods 409
10.11 A Synthesis Example Including Mutual Coupling 411
10.12 A Comparison of Synthesis Methods 414
References 418
11 SCATTERING FROM CONFORMAL ARRAYS 421
11.1 Introduction 431
11.2 Definitions 422
11.3 Radar Cross Section Analysis 423
11.3.1 General 423
11.3.2 Analysis Method for an Array on a Conducting Cylinder 424
11.3.3 Analysis Method for an Array on a Conducting Cylinder 426
with a Dielectric Coating
11.4 Cylindrical Array 427
11.4.1 Analysis and Experiment—Rectangular Grid 427
11.4.2 Higher-Order Waveguide Modes 430
11.4.3 Triangular Grid 432
11.4.4 Conclusions from the PEC Conformal Array Analysis 433
11.5 Cylindrical Array with Dielectric Coating 435
11.5.1 Single Element with Dielectric Coating 436
11.5.2 Array with Dielectric Coating 437
11.6 Radiation and Scattering Trade-off 446
11.6.1 Introduction 446
11.6.2 Single-Element Results 449
11.6.3 Array Results 454
11.7 Discussion 458
References 459

中大课程录象概率统计51

2008-10-23 14:57:06

《机器学习》英文版

2008-10-23 00:47:15

内容简介
　　机器学习这门学科研究的是能通过经验自动改进的计算机算法，其应用从数据挖掘程序到信息过滤系统，再到自动机工具，已经非常丰富。机器学习从很多学科吸收了成果和概念，包括人工智能、概论论与数理统计、哲学、信息论、生物学、认知科学和控制论等，并以此来理解问题的背景、算法和算法中的隐含假定。
　　本书展示了机器学习中的核心算法和理论，并阐明了算法的过行过程。书中主要涵盖了目前机器学习中各种最实用的理论和算法，包括概念学习、决策树、神经网络、贝叶斯学习、基于实例的学习、遗传算法、规则学习、基于解释的学习和增强学习等。对每一个主题，作者不仅进行了十分详尽和直观的解释，还给出了实用的算法流程。本书被卡内基梅隆等许多大学作为机器学习课程的教材。机器学习这门学科研究的是能通过经验自动改进的计算机算法，其应用从数据挖掘程序到信息过滤系统，再到自动机工具，已经非常丰富。机器学习从很多学科吸收了成果和概念，包括人工智能、概论论与数理统计、哲学、信息论、生物学、认知科学和控制论等，并以此来理解问题的背景、算法和算法中的隐含假定。

作者简介
　　Tom M.Mitchell是卡内基梅隆大学教授，目前担任该校自动学习和发现中心主任。他还是美国人工智能协会的主席，并且是《Machine Learning》杂志和国际机器学习会议的创办者。

目录
1 Introduction
2 Concept Learning and the General-to-Specific Ordering
3 Decision Tree Learning
4 Artificial Neural Networks
5 Evaluating Hypotheses
6 Bayesian Learning
7 Computational Learning Theory
8 Instance-Based Learning
9 Genetic Algorithms
10 Learning Sets Rules
11 Analytical Learning
12 Combining Inductive and Analytical Learning
13 Reinforcement Learning
Appendix

算法设计与分析（化工版）

2008-10-22 20:24:35

【内容简介】
　　本书介绍算法及其设计、分析的基础知识，并通过PASCAL语言描述的实例讲解了递归法、分治法、贪心算法、回溯及排序等算法策略。书中每章后面都附有一定数量的习题，帮助读者理解和掌握书中的内容。
　　本书可以作为高等院校计算机及其相关专业高年级本科生算法设计课程的教材，也可作为计算机工作者、广大程序设计爱好者和信息学爱好者的参考书。
【下载说明】
　　本资料为《算法设计与分析》一书PDF格式的高清晰电子版，推荐使用Adobe Reader 7.0或兼容阅读工具打开！
【图书目录】
前言
第一章　绪论
第二章　数据结构
第三章　算法和计算复杂性
第四章　递归和生成函数
第五章　分治法
第六章　排序
第七章　动态规划
第八章　贪心法
第九章　回溯法
第十章　P、NP和NP完全问题
参考文献

中大课程录象概率统计50

2008-10-22 10:36:23

中大课程录象概率统计49

2008-10-22 10:36:21

中大课程录象概率统计48

2008-10-22 10:36:15

中大课程录象概率统计48

2008-10-22 10:31:41

人工智能:一种现代的方法(第二版)英文版

2008-10-22 02:43:43

本书被全世界89个国家的900多所大学用作教材。
本书以详尽和丰富的资料，从理性智能体的角度，全面阐述了人工智能领域的核心内容，并深入介绍了各个主要的研究方向。全书分为8大部分：第一部分“人工智能”，第二部分“问题求解”，第三部分“知识与推理”，第四部分“规划”，第五部分“不确定知识与推理”，第六部分“学习”，第七部分“通信、感知与行动 ”，第八部分“结论”。本书既详细介绍了人工智能的基本概念、思想和算法，还描述了其各个研究方向最前沿的进展，同时收集整理了详实的历史文献与事件。另外，本书的配套网址http://aima.cs.berkeley.edu/为教师和学生提供了大量教学和学习资料。
本书适合于不同层次和领域的研究人员及学生，是高等院校本科生和研究生人工智能课的首选教材，也是相关领域的科研与工程技术人员的重要参考书。

作者简介
Stuart Russell,was born in 1962 in Portsmouth,England.He received his B.A.with first-class hon-ours in physics from Oxford Undiversity in 1982,and his Ph,D.in computer science from Stanford in 1986.He then joined the faculty of the University of California at Berkeley,where he is a professor of computer science,director of the Center for Intelligent Systems,and holder of the Smith-Zadeh Chair in Engineering.In 1990,he received the Presidential Young Investigator Award of the National Science Foundation,and in 1995 he was cowinner of the Computers and Thought Award.He was a 1996Miller Professor of the University of California and was appointed to a Chancellor s Professor ship in 2000.In 1998,he gave the Forsythe Memorial Lectures at Stanford University He is a Fellow and former Executive Council member of the American Association for Artificial Intelligence.He has published over 100 papers on a wide range of topics in artificial intelligence.His other books include The Use of Knowledge in Analogy and Induction and (with Eric Wefald)Do the Right Thing:Studies in Limited Rationality.

目录
I Artificial Intelligence
1 Introduction
2 IntelligentAgents
11 Problem-solving
3 Solving Problems by Searching
4 Informed Search and Exploration
5 Constraint Satisfaction Problems
6 Adversarial Search
Ill Knowledge and reasoning
7 Logical Agents
8 First-Order Logic
9 Inference in First-Order Logic
10 Knowledge Representation
IV Planning
11 Planning
12 Planning and Acting in the Real WOrld
V Uncertain knowledge and reasoning
13 Uncertainty
14 Probabilistic Reasoning
15 Probabilistic Reasoning over Time
16 Making Simple Decisions
17 Making Complex Decisions
VI Learning
18 Learning from Observations
19 Knowledge in Learning
20 Statistical Learning Methods
21 Reinforcement Learning
Vll Communicating, perceiving, and acting
22 Communication
23 Probabilistic Language Processing
24 Perception
25 Robottes
Vlll ConCluSionS
26 Philosophical Foundations
27 Al: Present and Future
A Mathematical background
B Notes on Languages and Algorithms.
Bibliography
Index

信息论与编码理论(第二版)

2008-10-21 17:16:18

本书全面系统地介绍了由香农于1948年提出的信息论与编码理论的主要内容，以及近几十年来该领域的一些重要研究成果。作者首先在引言中向读者简单介绍了信息论与编码理论的基本思想；第一部分讲解了香农信息论与编码理论的主要内容，如熵和信息量的基本概念与性质，以及信道编码定理和信源编码定理；第二部分介绍了一些基于香农编码理论的信道和信源编码方法，具体包括线性码、循环玛、BCH和RS码、卷积码等信道纠错编码，以及变长信源编码等。本书内容丰富翔实，对基本概念和基础理论的阐述清晰明了，同时也充分反映了相关领域的研究进展情况。
　　本书适合作为高等院校信息与通信工程专业研究生或本科生的教材或参考书。书中提供的几十道例题和几百道习题也有助于具有一定概率论和线性代数知识的人自学。

作者简介 · · · · · ·
　　Robert J.McEliece是美国加州理工大学院电子工程系的知名教授，美国国家工程院院士，IEEE、美国工程教育协会和美国数学协会会员。McEliece教授长期从事信息论与编码理论的研究和教学工作，因成绩卓越而多次获奖，曾因在纠错编码领域的突出贡献而获NASA团体成就奖，以及IEEE成立百年杰出贡献奖章。

线性代数

2008-10-21 16:18:21

1.行列式
2.矩阵
3.线性方程组
4.向量空间与线性变换
5.特征值和特征向量
6.二次型
7.应用问题
8.附录：内积空间

中大课程录象概率统计47

2008-10-21 10:07:09

中大课程录象概率统计46

2008-10-21 10:07:04

中大课程录象概率统计45

2008-10-21 10:07:00

中大课程录象概率统计44

2008-10-21 10:06:56

中大课程录象概率统计43

2008-10-21 10:06:51

中大课程录象概率统计42

2008-10-21 10:06:47

中大课程录象概率统计41

2008-10-21 10:06:42

中大课程录象概率统计40

2008-10-21 09:49:13

中大课程录象概率统计39

2008-10-21 09:49:09

中大课程录象概率统计38

2008-10-21 09:48:42

中大课程录象概率统计37

2008-10-21 09:47:49

中大课程录象概率统计36

2008-10-21 09:47:38

中大课程录象概率统计35

2008-10-21 09:45:56

中大课程录象概率统计35

2008-10-20 15:13:36

中大课程录象概率统计34

2008-10-17 16:52:27

中大课程录象概率统计33

2008-10-17 16:52:24

中大课程录象概率统计32

2008-10-17 16:52:21

中大课程录象概率统计31

2008-10-17 16:52:19

中大课程录象概率统计30

2008-10-17 16:52:16

中大课程录象概率统计29

2008-10-17 16:52:13

中大课程录象概率统计28

2008-10-17 16:52:11

中大课程录象概率统计27

2008-10-17 16:52:07

中大课程录象概率统计26

2008-10-17 16:41:11

中大课程录象概率统计25

2008-10-17 16:41:08

中大课程录象概率统计24

2008-10-17 16:41:04

中大课程录象概率统计23

2008-10-17 16:41:00