LemIST的专栏

贪心算法一般来说是解决“最优问题”，具有编程简单、运行效率高、空间 复杂度低等特点。是信息学竞赛中的一个有为武器，受到广大同学们的青睐。本 讲就贪心算法的特点作些概念上的总结。

C# 对于系统音量的完全操作包括： int GetVolume()； void SetVolume(int volumeLevel)； bool SetMixer(int i, VolumeStructs.Mixer mixerControl, int volumeLevel)； bool GetMixer(int i, int type, int ctrlType, out VolumeStructs.Mixer mixerControl, out int currVolume)； 可以直接使用，也可以当作学习对象：）

Tony Hoare名下的公理化语义（Axiomatic Semantics）。著名的Hoare Triples, P{C}Q, 就是从这里来的。论文不长，双列6页。前辈们就是这样的，6页纸就能开宗立派。不像俺，6页纸连介绍部分都写不周全。哪位老大想知道怎么证明程序正确。前置条件，不变条件，后置条件的妙用，可以用这篇论文开牙。

Oracle Call Interface Programmer's Guide, 10g Release 2 (10.2)

A Practical FlowSensitive and ContextSensitive C and C++ Memory Leak Detector

The C++ Preprocessor File Inclusion Macro Substitution Conditional Compilation Header Files

ECMA-335 standard: Common LanguageInfrastructure (CLI) Partitions I to VI

几乎各个方面都涉及到，从基本的语言元素，到各个类库都有详细的介绍。推荐。

C++ 函数库参考 基本C/C++ 预处理命令 操作符优先级 转义字符 ASCII码表 基本数据类型 关键字 标准 C 库: Standard C I/O Standard C String & Character Standard C Math Standard C Time & Date Standard C Memory Other standard C functions C++ C++ I/O C++ Strings C++ 标准模板库 C++ Bitsets C++ Double-Ended Queues C++ Lists C++ Maps C++ Multimaps C++ Multisets C++ Priority Queues C++ Queues C++ Sets C++ Stacks C++ Vectors Iterators 全部的 C 函数 全部的 C++ 函数

Preprocessing CC++ Code in CDT

Ecma Standard about C# Language Specification

MSIL Instruction Set Specification

Intel 64 and IA-32 Architectures Software Developer's Manual

C# Version 3.0 Specification (September 2005)

Opening Up The CC++ Preprocessor Black Box

Theory and Techniques of Compiler Construction 介绍编译器相关理论和技术 Contents Preface 1. Introduction 2. Language and Syntax 2.1. Exercises 3. Regular Languages 4. Analysis of Context-free Languages 4.1. The method of recursive descent 4.2. Table-driven top-down parsing 4.3. Bottom-up parsing 4.4. Exercises 5. Attributed Grammars and Semantics 5.1. Type rules 5.2. Evaluation rules 5.3. Translation rules 5.4. Exercises 6. The Programming Language Oberon-0 7. A Parser for Oberon-0 7.1. The scanner 7.2. The parser 7.3. Coping with syntactic errors 7.4. Exercises 8. Consideration of Context Specified by Declarations 8.1. Declarations 8.2. Entries for data types 8.3. Data representation at run-time 8.4. Exercises 9. A RISC Architecture as Target 10. Expressions and Assignments 10.1. Straight code generation according to the stack principle 10.2. Delayed code generation 10.3. Indexed variables and record fields 10.4. Exercises 11. Conditional and Repeated Statements and Boolean Epressions 11.1. Comparisons and jumps 11.2. Conditional and repeated statements 11.3. Boolean operations 11.4. Assignments to Boolean variables 11.5. Exercises 12. Procedures and the Concept of Locality 12.1. Run-time organization of the store 12.2. Addressing of variables 12.3. Parameters 12.4. Procedure declarations and calls 12.5. Standard procedures 12.6. Function procedures 12.7. Exercises 13. Elementary Data Types 13.1. The types REAL and LONGREAL 13.2. Compatibility between numeric data types 13.3. The data type SET 13.4. Exercises 14. Open Arrays, Pointers and Procedure Types 14.1. Open arrays 14.2. Dynamic data structures and pointers 14.3. Procedure types 14.5. Exercises 15. Modules and Separate Compilation 15.1. The principle of information hiding 15.2. Separate compilation 15.3. Implementation of symbol files 15.4. Addressing external objects 15.5. Checking configuration consistency 15.6. Exercises 16. Code Optimizations and the Frontend/backend Structure 16.1. General considerations 16.2. Simple optimizations 16.3. Avoiding repeated evaluations 16.4. Register allocation 16.5. The frontend/backend compiler structure 16.6. Exercises Appendix A: Syntax A.1. Oberon-0 A.2. Oberon A.3. Symbol files Appendix B: The ASCII character set Appendix C: The Oberon-0 compiler C.1. The scanner C.2. The parser C.3. The code generator References

[Gale] Encyclopedia of Learning & Memory

ISO C++ Standards. Usually refered when design compilors.

(LISP)How.to.Design.Programs

Apress.Pro.LINQ.Language.Integrated.Query.in.C#2008

What you'll learn Use Android to build Java-based mobile applications for Google phones with a touch screen or keyboard Design and architect using Google’s Android SDK Use the Android SDK to write mobile applications for embedded devices Create 3D graphics with OpenGL and custom components Cuild multimedia and game apps using Android’s Media APIs and OpenGL Use Android’s location-based services, networking (Wi-Fi APIs), and security Create and allow for more integrated local and web searches Build handwriting gesture UIs Incorporate Google Translate into your Android applications

Perl最佳实践 如何成为优秀的Perl程序员

[Perl.by.Example(4th.Edition)] Perl 实例精解，很有帮助

Perl语言入门(第五版)英文原版 简单的入门书籍

Perl程序员必备. Perl Cookbook is a comprehensive collection of problems, solutions, and practical examples for anyone programming in Perl. The book contains hundreds of rigorously reviewed Perl "recipes" and thousands of examples ranging from brief one-liners to complete applications. The second edition of Perl Cookbook has been fully updated for Perl 5.8, with extensive changes for Unicode support, I/O layers, mod_perl, and new technologies that have emerged since the previous edition of the book. Recipes have been updated to include the latest modules. New recipes have been added to every chapter of the book, and some chapters have almost doubled in size.

如此经典的书就不用多说了。 Introduction to Algorithms, Second Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein ISBN:0262032937 The MIT Press © 2001 (1180 pages) A course in computer algorithms, suitable for use as a field reference for working software developers.

Introduction+to+the+Theory+of+Computation 计算理论的基础

Contents 1. Getting Started 1 1.1 Starting Prolog 1 1.2 Prolog Programs 3 1.3 Data Objects in Prolog: Prolog Terms 8 Practical Exercise 1 12 2. Clauses and Predicates 13 2.1 Clauses 13 2.2 Predicates 15 2.3 Loading Clauses 19 2.4 Variables 21 Practical Exercise 2 27 3. Satisfying Goals 29 Introduction 29 3.1 Unification 31 3.1.1 Unifying Call Terms 32 3.2 Evaluating Goals 35 3.3 Backtracking 39 3.4 Satisfying Goals: A Summary 50 3.5 Removing Common Variables 52 3.6 A Note on Declarative Programming 52 Practical Exercise 3 55 4. Operators and Arithmetic 57 4.1 Operators 57 4.2 Arithmetic 59 4.3 Equality Operators 63 4.4 Logical Operators 66 Practical Exercise 4 68 xii Contents 5. Input and Output 69 Introduction 69 5.1 Outputting Terms 69 5.2 Inputting Terms 71 5.3 Input and Output Using Characters 72 5.4 Outputting Characters 73 5.5 Inputting Characters 73 5.6 Using Characters: Examples 74 5.7 Input and Output Using Files 77 5.8 File Output: Changing the Current Output Stream 77 5.9 File Input: Changing the Current Input Stream 78 5.9.1 Reading from Files: End of File 78 5.9.2 Reading from Files: End of Record 79 5.10 Using Files: Examples 79 Practical Exercise 5 82 6. Loops 85 Introduction 85 6.1 Looping a Fixed Number of Times 85 6.2 Looping Until a Condition Is Satisfied 89 6.2.1 Recursion 89 6.2.2 Using the 'repeat' Predicate 91 6.3 Backtracking with Failure 94 6.3.1 Searching the Prolog Database 94 6.3.2 Finding Multiple Solutions 96 Practical Exercise 6 97 7. Preventing Backtracking 99 Introduction 99 7.1 The Cut Predicate 99 7.2 Cut with Failure 106 Practical Exercise 7 108 8. Changing the Prolog Database 109 8.1 Changing the Database: Adding and Deleting Clauses 109 8.2 Adding Clauses 110 8.3 Deleting Clauses 111 8.4 Changing the Database: Example 112 8.5 Maintaining a Database of Facts 114 Practical Exercise 8 118 Contents xiii 9. List Processing 119 9.1 Representing Data as Lists 119 9.2 Notation for Lists 120 9.3 Decomposing a List 122 9.4 Built-in Predicate: member 125 9.5 Built-in Predicate: length 126 9.6 Built-in Predicate: reverse 126 9.7 Built-in Predicate: append 127 9.8 List Processing: Examples 129 9.9 Using findall/3 to Create a List 133 Practical Exercise 9 136 10. String Processing 137 10.1 Converting Strings of Characters To and From Lists 137 10.2 Joining Two Strings 139 10.3 Trimming a String 139 10.4 Inputting a String of Characters 141 10.5 Searching a String 142 10.6 Dividing a String into Its Component Parts 144 Practical Exercise 10 147 11. More Advanced Features 149 Introduction 149 11.1 Extending Prolog: Arithmetic 149 11.2 Extending Prolog: Operations on Strings 155 11.3 Extending Prolog: Sets 157 11.4 Processing Terms 160 Practical Exercise 11 166 Appendix 1. Built-in Predicates 167 Appendix 2. Built-in Operators 179 Appendix 3. Specimen Solutions to Practical Exercises 185 Appendix 4. Glossary 209 Index 221

HPL: Vol. IV: Functional and Logic Programming Languages by Peter Salus Macmillan Technical Publishing, Macmillan Computer Publishing ISBN: 1578700116 Pub Date: 06/11/98 Foreword to the Handbook of Programming Languages About the Authors Part 1—Lisp Chapter 1—The LISP Language Chapter 2—Emacs Lisp: A Short Description 2.1. GNU Emacs and Emacs Lisp 2.2. Lisp Lists 2.2.1. Parts of Lisp 2.3. Example: Two Plus Two 2.4. Evaluation 2.5. A Function Definition 2.5.1. An Example of a Search Within a Buffer 2.5.2. An Example: multiply-by-seven 2.6. Variables 2.7. A Chest of Drawers 2.8. Functions 2.9. The read-eval-print Loop and Side Effects 2.10. Types of Variables 2.10.1. defvar and defconst 2.10.2. setq 2.10.3. Passing an Argument 2.10.4. A let Expression 2.10.5. Buffer-Local Variables 2.11. Sequencing 2.12. Conditionals 2.12.1. and, or, and not 2.13. while Loops and Recursion 2.13.1. while 2.13.2. car, cdr, cons: Fundamental Functions 2.13.3. while, Continued 2.13.4. Recursion 2.14. Macros 2.14.1. The list Built-in Function 2.14.2. Backquote 2.15. Property Lists 2.16. Keymaps 2.17. Editing Lisp 2.18. Help 2.19. Debugging 2.19.1. The Built-in Debugger 2.19.2. Edebug 2.20. Backups and Auto-Saving 2.21. Evaluating or Loading a Whole File 2.22. Byte Compilation 2.23. Your .emacs Initialization File Part II—Scheme Chapter 3—Scheme 3.1. Who Uses Scheme? 3.2. Scheme as a Dialect of Lisp 3.2.1. Expressions 3.2.2. Uniform Syntax 3.2.3. Automatic Storage Management 3.2.4. High-Level Data Types 3.2.5. Untyped Variables 3.3. Scheme as a Dialect of Algol 3.3.1. Internal Definitions 3.3.2. Lexical Scope 3.4. Innovations in Scheme 3.4.1. First-Class Data 3.4.2. Tail Call Elimination 3.4.3. First-Class Continuations 3.4.4. Lexical Scoping Rules for Macros 3.5. Functional Programming in Scheme 3.6. Object-Oriented Programming in Scheme 3.7. Common Problems for Beginning Scheme Programmers 3.7.1. Function Comp

Artificial intelligence through prolog

Lisp in a Box for Windows Lisp in a Box on Windows has been modularized! •First, download the base installer and run it. This gives you GNU Emacs 21.3 and SLIME 2004-06-26. •Next, choose an implementation's module, and install it: ◦CLISP module. Includes CLISP 2.33. ◦Allegro Trial Edition 6.2 module. You must first install the trial edition from Franz's website. ◦Allegro 6.2 module. For people who have Allegro Common Lisp Enterprise Edition 6.2 already. •More than one implementation module can be installed.

Artificial Intelligence - A Modern Approach Solution Manual

Logic programming for .NET Prolog.NET is a full featured Prolog programming environment for the .NET Framework. It includes an enhanced compiler with language extensions and a code generator targeting Microsoft's Intermediate Language (MSIL) and integration with Visual Studio .NET Integrated development environment. The purpsoe of this project is to provide seamless integration between .NET and Prolog by compiling Prolog code into reusable .NET objects that leverage the rich feature set provided by the .NET framework. This makes it easy to develop applications that combine the powerful features of both imperative and logic programming paradigms, as well as use logic programming as a meta-language to reason about object-oriented programs.

Pro C# With 3.0, Special Edition - 2007-01 Apress.pdf 很好的排版~~

[计算机系统结构-量化研究方法].John.L.Hennessy,.David.A.Patterson.-.Computer.Architecture.-.A.Quantitative.Approach.pdf 最好的排版~~

Iczelion的Win32汇编教程 Iczelion的Odbc教程 Iczelion的Vxd教程 Iczelion的PE教程 罗云彬的Win32汇编教程 Win32ASM经验点滴 X86汇编语言编程 加密解密 病毒的分析和防治

FastReport.Net is a full-featured reporting solution for Windows Forms and ASP.NET. It can be used in Microsoft Visual Studio 2005 and 2008.

BLOWFISH B-P算法（二） B-P算法（三） DES数据加密标准 DES算法 DSA算法 ElGamal算法 Kohonen的SOFM(自组织特征映射) LAM（线性联想记忆）算法 LZW 压缩算法 MD5算法 PGP的安全性(一) PKCS #7 RSA算法 SSL是怎样工作的？ Ternary Search Trees 产生组合的非递归算法 大整数的乘法 对LZW算法的改进及其在图象无损压缩中的应用 复数快速傅立叶变换算法 加密算法与密钥管理 经典加密算法在VB中的实现（1）- Rsa 经典加密算法在VB中的实现（2）- MD5 经典加密算法在VB中的实现（3）- RC4 经典加密算法在VB中的实现（4）- DES 经典字符串HASH函数测试 离散的Hopfield算法 秘密天窗加密方法C++源程序 浅谈图像压缩算法 求全排列的非递归算法 如何实现DES算法 神经元网络 LVQ(学习矢量量化)算法 神经元网络的经典B-P算法1 神经元网络的经典B-P算法2 神经元网络的经典B-P算法3 实数快速fft变换算法 实数快速fft算法二 使用ASP加密算法加密你的数据 手写体数据变换成像素位图的算法 算法网站 图形图像压缩存储技术 我的毕业论文的一部分算法 线性规划的单纯型算法vb实现 行程编码算法RCL 一个堆栈模块（C++实现） 一个关于网络路由选择的算法 一个圆周率的算法 有监督学习的前馈网络 自适应共振理论（ART） 最短路径算法 2^(67)的算法(转载) 16色BMP格式图像的压缩算法的改进 2002年考题之二

This booklet contains a collection of sorting and searching algorithms. While many books on data structures describe sorting and searching algorithms, most assume a background in calculus and probability theory. Although a formal presentation and proof of asymptotic behavior is important, a more intuitive explanation is often possible. The way each algorithm works is described in easy-to-understand terms. It is assumed that you have the knowledge equivalent to an introductory course in C or Pascal. In particular, you should be familiar with arrays and have a basic understanding of pointers. The material is presented in an orderly fashion, beginning with easy concepts and progressing to more complex ideas. Even though this collection is intended for beginners, more advanced users may benefit from some of the insights offered. In particular, the sections on hash tables and skip lists should prove interesting.

遗传 算法 的 数学 基础 西安交通大学出版社