数字图像处理 冈萨雷斯 3rd 英文原版 非ORC Digital ImageProcessing Third Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods - MD在线建档：2/27/2016 5:24:37 PM by Jimbowhy - CSDN发布： [EBT 道客巴巴的加密与破解 - 实用组合工具箱（2015-08-04 23:06）](http://blog.csdn.net/winsenjiansbomber/article/details/47284463) 冈萨雷斯这部《数字图像处理》在这个领域的地位就不多说了，只是网上找到的电子版不扫描的就OCR的，远不及原版的质量好，这个版本是官方发现的PDF电子版经DOC88转SWF版，经过不久前开发的DDA程序处理，文字可以复制。 DOC88_CRACK by Jimbowhy

- MD在线建档：2/27/2016 5:24:37 PM by Jimbowhy - CSDN发布： [EBT 道客巴巴的加密与破解 - 实用组合工具箱（2015-08-04 23:06）](http://blog.csdn.net/winsenjiansbomber/article/details/47284463) [EBT 道客巴巴的加密与破解 －免费下载器的基础（2015-07-26 11:00）](http://blog.csdn.net/winsenjiansbomber/article/details/47065697) [EBT 道客巴巴的加密与破解 序章（2015-07-25 03:51）](http://blog.csdn.net/winsenjiansbomber/article/details/47051233) 冈萨雷斯这部《数字图像处理》在这个领域的地位就不多说了，只是网上找到的电子版不扫描的就OCR的，远不及原版的质量好，这个版本是官方发现的PDF电子版经DOC88转SWF版，经过不久前开发的DDA程序处理，文字可以复制。 Digital ImageProcessing Third Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods DOC88_CRACK by Jimbowhy

``Crafting a Compiler'' by Charles N. Fisher & Richard J. LeBlanc, Jr. 1988. Benjamin/Cummings Publishing Company. Menlo Park, CA. Brief Contents xvi 1 Introduction 1 2 A Simple Compiler 31 3 Scanning—Theory and Practice 57 4 Grammars and Parsing 113 5 Top-Down Parsing 143 6 Bottom-Up Parsing 179 7 Syntax-Directed Translation 235 8 Symbol Tables and Declaration Processing 279 9 Semantic Analysis 343 10 Intermediate Representations 391 11 Code Generation for a Virtual Machine 417 12 Runtime Support 445 13 Target Code Generation 489 14 Program Optimization 547 Contents xvii 1 Introduction 1 1.1 History of Compilation 2 1.2 What Compilers Do 4 1.2.1 Machine Code Generated by Compilers 4 1.2.2 Target Code Formats 7 1.3 Interpreters 9 1.4 Syntax and Semantics 10 1.4.1 Static Semantics 11 1.4.2 Runtime Semantics 12 1.5 Organization of a Compiler 14 1.5.1 The Scanner 16 1.5.2 The Parser 16 1.5.3 The Type Checker (Semantic Analysis) 17 1.5.4 Translator (Program Synthesis) 17 1.5.5 Symbol Tables 18 1.5.6 The Optimizer 18 1.5.7 The Code Generator 19 1.5.8 Compiler Writing Tools 19 1.6 Programming Language and Compiler Design 20 1.7 Computer Architecture and Compiler Design 21 1.8 Compiler Design Considerations 22 1.8.1 Debugging (Development) Compilers 22 1.8.2 Optimizing Compilers 23 1.8.3 Retargetable Compilers 23 1.9 Integrated Development Environments 24 1.10 Exercises 26 2 A Simple Compiler 31 2.1 An Informal Definition of the ac Language 32 2.2 Formal Definition of ac 33 2.2.1 Syntax Specification 33 2.2.2 Token Specification 36 2.3 Phases of a Simple Compiler 37 2.4 Scanning 38 2.5 Parsing 39 2.5.1 Predicting a Parsing Procedure 41 2.5.2 Implementing the Production 43 2.6 Abstract Syntax Trees 45 2.7 Semantic Analysis 46 2.7.1 Symbol Tables 47 2.7.2 Type Checking 48 2.8 Code Generation 51 2.9 Exercises 54 3 Scanning—Theory and Practice 57 3.1 Overview of a Scanner 58 3.2 Regular Expressions 60 3.3 Examples 62 3.4 Finite Automata and Scanners 64 3.4.1 Deterministic Finite Automata 65 3.5 The Lex Scanner Generator 69 3.5.1 Defining Tokens in Lex 70 3.5.2 The Character Class 71 3.5.3 Using Regular Expressions to Define Tokens 73 3.5.4 Character Processing Using Lex 76 3.6 Other Scanner Generators 77 3.7 Practical Considerations of Building Scanners 79 3.7.1 Processing Identifiers and Literals 79 3.7.2 Using Compiler Directives and Listing Source Lines 83 3.7.3 Terminating the Scanner 85 3.7.4 Multicharacter Lookahead 86 3.7.5 Performance Considerations 87 3.7.6 Lexical Error Recovery 89 3.8 Regular Expressions and Finite Automata 92 3.8.1 Transforming a Regular Expression into an NFA 93 3.8.2 Creating the DFA 94 3.8.3 Optimizing Finite Automata 97 3.8.4 Translating Finite Automata into Regular Expressions 100 3.9 Summary 103 3.10 Exercises 106 4 Grammars and Parsing 113 4.1 Context-Free Grammars 114 4.1.1 Leftmost Derivations 116 4.1.2 Rightmost Derivations 116 4.1.3 Parse Trees 117 4.1.4 Other Types of Grammars 118 4.2 Properties of CFGs 120 4.2.1 Reduced Grammars 120 4.2.2 Ambiguity 121 4.2.3 Faulty Language Definition 122 4.3 Transforming Extended Grammars 122 4.4 Parsers and Recognizers 123 4.5 Grammar Analysis Algorithms 127 4.5.1 Grammar Representation 127 4.5.2 Deriving the Empty String 128 4.5.3 First Sets 130 4.5.4 Follow Sets 134 4.6 Exercises 138 5 Top-Down Parsing 143 5.1 Overview 144 5.2 LL(k) Grammars 145 5.3 Recursive-Descent LL(1) Parsers 149 5.4 Table-Driven LL(1) Parsers 150 5.5 Obtaining LL(1) Grammars 154 5.5.1 Common Prefixes 156 5.5.2 Left Recursion 157 5.6 A Non-LL(1) Language 159 5.7 Properties of LL(1) Parsers 161 5.8 Parse Table Representation 163 5.8.1 Compaction 164 5.8.2 Compression 165 5.9 Syntactic Error Recovery and Repair 168 5.9.1 Error Recovery 169 5.9.2 Error Repair 169 5.9.3 Error Detection in LL(1) Parsers 171 5.9.4 Error Recovery in LL(1) Parsers 171 5.10 Exercises 173 6 Bottom-Up Parsing 179 6.1 Overview 180 6.2 Shift-Reduce Parsers 181 6.2.1 LR Parsers and Rightmost Derivations 182 6.2.2 LR Parsing as Knitting 182 6.2.3 LR Parsing Engine 184 6.2.4 The LR Parse Table 185 6.2.5 LR(k) Parsing 187 6.3 LR(0) Table Construction 191 6.4 Conflict Diagnosis 197 6.4.1 Ambiguous Grammars 199 6.4.2 Grammars that are not LR(k) 202 6.5 Conflict Resolution and Table Construction 204 6.5.1 SLR(k) Table Construction 204 6.5.2 LALR(k) Table Construction 209 6.5.3 LALR Propagation Graph 211 6.5.4 LR(k) Table Construction 219 6.6 Exercises 224 7 Syntax-Directed Translation 235 7.1 Overview 235 7.1.1 Semantic Actions and Values 236 7.1.2 Synthesized and Inherited Attributes 237 7.2 Bottom-Up Syntax-Directed Translation 239 7.2.1 Example 239 7.2.2 Rule Cloning 243 7.2.3 Forcing Semantic Actions 244 7.2.4 Aggressive Grammar Restructuring 246 7.3 Top-Down Syntax-Directed Translation 247 7.4 Abstract Syntax Trees 250 7.4.1 Concrete and Abstract Trees 250 7.4.2 An Efficient AST Data Structure 251 7.4.3 Infrastructure for Creating ASTs 252 7.5 AST Design and Construction 254 7.5.1 Design 256 7.5.2 Construction 258 7.6 AST Structures for Left and Right Values 261 7.7 Design Patterns for ASTs 264 7.7.1 Node Class Hierarchy 264 7.7.2 Visitor Pattern 265 7.7.3 Reflective Visitor Pattern 268 7.8 Exercises 272 8 Symbol Tables and Declaration Processing 279 8.1 Constructing a Symbol Table 280 8.1.1 Static Scoping 282 8.1.2 A Symbol Table Interface 282 8.2 Block-Structured Languages and Scopes 284 8.2.1 Handling Scopes 284 8.2.2 One Symbol Table or Many? 285 8.3 Basic Implementation Techniques 286 8.3.1 Entering and Finding Names 286 8.3.2 The Name Space 289 8.3.3 An Efficient Symbol Table Implementation 290 8.4 Advanced Features 293 8.4.1 Records and Typenames 294 8.4.2 Overloading and Type Hierarchies 294 8.4.3 Implicit Declarations 296 8.4.4 Export and Import Directives 296 8.4.5 Altered Search Rules 297 8.5 Declaration Processing Fundamentals 298 8.5.1 Attributes in the Symbol Table 298 8.5.2 Type Descriptor Structures 299 8.5.3 Type Checking Using an Abstract Syntax Tree 300 8.6 Variable and Type Declarations 303 8.6.1 Simple Variable Declarations 303 8.6.2 Handling Type Names 304 8.6.3 Type Declarations 305 8.6.4 Variable Declarations Revisited 308 8.6.5 Static Array Types 311 8.6.6 Struct and Record Types 312 8.6.7 Enumeration Types 313 8.7 Class and Method Declarations 316 8.7.1 Processing Class Declarations 317 8.7.2 Processing Method Declarations 321 8.8 An Introduction to Type Checking 323 8.8.1 Simple Identifiers and Literals 327 8.8.2 Assignment Statements 328 8.8.3 Checking Expressions 328 8.8.4 Checking Complex Names 329 8.9 Summary 334 8.10 Exercises 336 9 Semantic Analysis 343 9.1 Semantic Analysis for Control Structures 343 9.1.1 Reachability and Termination Analysis 345 9.1.2 If Statements 348 9.1.3 While, Do, and Repeat Loops 350 9.1.4 For Loops 353 9.1.5 Break, Continue, Return, and Goto Statements 356 9.1.6 Switch and Case Statements 364 9.1.7 Exception Handling 369 9.2 Semantic Analysis of Calls 376 9.3 Summary 384 9.4 Exercises 385 10 Intermediate Representations 391 10.1 Overview 392 10.1.1 Examples 393 10.1.2 The Middle-End 395 10.2 Java Virtual Machine 397 10.2.1 Introduction and Design Principles 398 10.2.2 Contents of a Class File 399 10.2.3 JVM Instructions 401 10.3 Static Single Assignment Form 410 10.3.1 Renaming and φ-functions 411 10.4 Exercises 414 11 Code Generation for a Virtual Machine 417 11.1 Visitors for Code Generation 418 11.2 Class and Method Declarations 420 11.2.1 Class Declarations 422 11.2.2 Method Declarations 424 11.3 The MethodBodyVisitor 425 11.3.1 Constants 425 11.3.2 References to Local Storage 426 11.3.3 Static References 427 11.3.4 Expressions 427 11.3.5 Assignment 429 11.3.6 Method Calls 430 11.3.7 Field References 432 11.3.8 Array References 433 11.3.9 Conditional Execution 435 11.3.10 Loops 436 11.4 The LHSVisitor 437 11.4.1 Local References 437 11.4.2 Static References 438 11.4.3 Field References 439 11.4.4 Array References 439 11.5 Exercises 441 12 Runtime Support 445 12.1 Static Allocation 446 12.2 Stack Allocation 447 12.2.1 Field Access in Classes and Structs 449 12.2.2 Accessing Frames at Runtime 450 12.2.3 Handling Classes and Objects 451 12.2.4 Handling Multiple Scopes 453 12.2.5 Block-Level Allocation 455 12.2.6 More About Frames 457 12.3 Arrays 460 12.3.1 Static One-Dimensional Arrays 460 12.3.2 Multidimensional Arrays 465 12.4 Heap Management 468 12.4.1 Allocation Mechanisms 468 12.4.2 Deallocation Mechanisms 471 12.4.3 Automatic Garbage Collection 472 12.5 Region-Based Memory Management 479 12.6 Exercises 482 13 Target Code Generation 489 13.1 Translating Bytecodes 490 13.1.1 Allocating memory addresses 493 13.1.2 Allocating Arrays and Objects 493 13.1.3 Method Calls 496 13.1.4 Example of Bytecode Translation 498 13.2 Translating Expression Trees 501 13.3 Register Allocation 505 13.3.1 On-the-Fly Register Allocation 506 13.3.2 Register Allocation Using Graph Coloring 508 13.3.3 Priority-Based Register Allocation 516 13.3.4 Interprocedural Register Allocation 517 13.4 Code Scheduling 519 13.4.1 Improving Code Scheduling 523 13.4.2 Global and Dynamic Code Scheduling 524 13.5 Automatic Instruction Selection 526 13.5.1 Instruction Selection Using BURS 529 13.5.2 Instruction Selection Using Twig 531 13.5.3 Other Approaches 532 13.6 Peephole Optimization 532 13.6.1 Levels of Peephole Optimization 533 13.6.2 Automatic Generation of Peephole Optimizers 536 13.7 Exercises 538 14 Program Optimization 547 14.1 Overview 548 14.1.1 Why Optimize? 549 14.2 Control Flow Analysis 555 14.2.1 Control Flow Graphs 556 14.2.2 Program and Control Flow Structure 559 14.2.3 Direct Procedure Call Graphs 560 14.2.4 Depth-First Spanning Tree 560 14.2.5 Dominance 565 14.2.6 Simple Dominance Algorithm 567 14.2.7 Fast Dominance Algorithm 571 14.2.8 Dominance Frontiers 581 14.2.9 Intervals 585 14.3 Introduction to Data Flow Analysis 598 14.3.1 Available Expressions 598 14.3.2 Live Variables 601 14.4 Data Flow Frameworks 604 14.4.1 Data Flow Evaluation Graph 604 14.4.2 Meet Lattice 606 14.4.3 Transfer Functions 608 14.5 Evaluation 611 14.5.1 Iteration 611 14.5.2 Initialization 615 14.5.3 Termination and Rapid Frameworks 616 14.5.4 Distributive Frameworks 620 14.6 Constant Propagation 623 14.7 SSA Form 627 14.7.1 Placing φ-Functions 629 14.7.2 Renaming 631 14.8 Exercises 636 Bibliography 651 Abbreviations 661 Pseudocode Guide 663 Index 667

Starting FORTH by Leo Brodie Starting Forth, the classic Forth language tutorial, is available here in its official online edition. readme: http://blog.csdn.net/winsenjiansbomber/article/details/50678053 Eyes protective cascading-style-sheet redefined sample code incl.

Starting FORTH by Leo Brodie Starting Forth, the classic Forth language tutorial, is available here in its official online edition. readme: http://blog.csdn.net/winsenjiansbomber/article/details/50678053 Eyes protective cascading-style-sheet redefined

Starting FORTH by Leo Brodie Starting Forth, the classic Forth language tutorial, is available here in its official online edition. Updates to the original Starting FORTH text include code examples that run on iForth and SwiftForth systems. Aficionados (and detractors) of the original book's illustrations will find most of them restored in this official edition by FORTH, Inc. Code examples run on iForth and SwiftForth.

http://blog.csdn.net/winsenjiansbomber/article/details/50678053 FC红白机编译工具，声效制作工具 ca65.exe、ld65.exe、NESASM.EXE、x816编译链接器x112f.exe 等等编译工具 FamiTracker Magicengine MagicKit v2.51 mck_0228.zip mckc025.zip dmcconv005.zip mckc-e.txt mkit251_dos.zip Nerdtracker II

Bookmars incl. 带目录版 Fonts & EncodingsOct 6, 2007 by Yannis Haralambous and P Scott Horne Paperback $59.99Prime

wxWidgets-2.8.12-vc6-unicode-static.zip wxWidgets 2.8.12 Visual Studio C++ 6.0静态编译库 CSDN发布地址：<http://blog.csdn.net/WinsenJiansbomber/article/details/50616754>

wxWidgets-2.8.12-gcc-4.7.1-mono-static.zip wxWidgets 2.8.12静态编译库 CSDN发布地址：<http://blog.csdn.net/WinsenJiansbomber/article/details/50616754> 编译工具：TDM-GCC 4.7.1 DEBUG编译命令： set mingw=C:\CodeBlocks\mingw471 set path=%mingw%\bin set flags=INCLUDE="%mingw%\include" LIB="%mingw%\\lib" set opts=BUILD=debug UNICODE=1 VENDOR="" GCC_VERSION=4.7.1 set mod=MONOLITHIC=1 USE_GUI=1 USE_GDIPLUS=1 USE_OPENGL=1 set libtype=RUNTIME_LIBS=static SHARED=0 mingw32-make.exe -j4 -f makefile.gcc %flags% %opts% %mod% %libtype% Release编译命令： set mingw=C:\CodeBlocks\mingw471 set path=%mingw%\bin set flags=INCLUDE="%mingw%\include" LIB="%mingw%\\lib" set opts=BUILD=release UNICODE=1 VENDOR="" GCC_VERSION=4.7.1 set mod=MONOLITHIC=1 USE_GUI=1 USE_GDIPLUS=1 USE_OPENGL=1 set libtype=RUNTIME_LIBS=static SHARED=0 mingw32-make.exe -j4 -f makefile.gcc %flags% %opts% %mod% %libtype%

dda_doc88_cracker 源代码 参考：EBT 道客巴巴的加密与破解 - 实用组合工具箱 http://blog.csdn.net/winsenjiansbomber/article/details/47284463#comments

《初识XUL用户界面UI开发》XUL是Mozilia社区开发技术中的一员，总要是为用户界面UI服务，Firefox就XUL以及其它一系列相关的基础库开发出来的成功之作。事实证明XUL是成功的UI开发技术，本文以一个最简明的视角来向看官展示如何使用XUL来开发自己的定制UI程序。由于XUL及相关技术是基于WEB的，所以会HTML开发读者会更容易理解它的整个体系。当然XUL也用于桌面程序开发，Firefox就是最好的证明。 http://blog.csdn.net/winsenjiansbomber/article/details/50468274

从精简的篇幅来讲述 StarUML 建模工具在面向对象编程中的应用，力求向编程人员提供一个Minute级的 StarUML 使用教程。 http://blog.csdn.net/winsenjiansbomber/article/details/50460003

dda_doc88_cracker.zip http://blog.csdn.net/winsenjiansbomber/article/details/47284463

MakeMusic Finale 2011 Manual part2.rar

MakeMusic Finale 2011 Help Manual & quick video tutorials

David Salomon的《Data Compression The Complete Reference》这本书（第四版） 完整目录修正。 AGE LEFT BLANK FOR CONTENT GENERATION 
Contents gen by Jimbowy

SWF代码分析与破解之路 (YueTai VIP视频信息获取工具) Socket续篇附件工具下载 http://blog.csdn.net/winsenjiansbomber/article/details/47436965 上一篇 《Socket与网站保密应用 (隐藏链接的视频下载)》大大咧咧地从 WEB 讲 Socket，再到 TCP/IP 等协议，又再讲到 Wireshark 如何抓IP包分析，最还要复习一下路由与网络的知识，真的涉及面太广了，只能蜻蜓点水一一带过，不过将多领域的知识串烧也是不错的，可以起到一个归纳的作用。这篇针对 Flash 来进行，写作思路以解决问题的过程行为线索。依次展示如何使用 Flex Air 的 ServerSocket 和 Socket 实现简化版本的 HTTP 服务器，以及如何加载外部的 SWF 文件并进行操作。 在 mplayer.swf 内部，使用 FlasCC 集成 C 代码做保护。使用了 Hessian 做对象序列化，Hessian是一个由Caucho Technology开发的轻量级二进制RPC协议。Hessian 自称为 binary web service protocol ，看来加了个 protocol 的都不简单了，好几个平台的版本都出来了。

Adobe Acrobat SDK JavaScript API JavaScript™ for Acrobat® API Reference.zip Ctrl+B 的手动制作目录效率太低， 使用脚本生成PDF目录就看它的了。 含有样例。

Developing Flex Applications 910p dda_doc88_cracker

胡立伟《孤独》水果FLP节奏程序

参考《DOS的古董美》 试想这些软件热卖热卖的时候，很多人想要都得不到的吧。到现在这么旧的“破烂”，估计M$都懒得收费了吧。现在这一切都是免费的，真要把我高兴坏了。最后可以选择一个编辑器作为代码编辑工具，我选择使用 editplus，它小巧，功能齐全，支持正则，可以设置编译工具协同工作。手上还要有一款静态反汇编工具来查看程序文件。像 w32dasm 这种功能太简单，像 c32asm 这就是玩界面的货。像ida又太宏大，对于新手可能难以操控，但无论如何它是我见过最智能的反解软件，它具有图形化代码流程和详尽的系统功能注解，而且各种程序格式都可以应付，交叉平台操作，Windows平台下可以反解Linux程序，也可以其它的CPU构架如ARM。IDA的最大特色就是交互，正如其名 Interactive DisAssembly。如果想简单点，还是用 ETU-Dasm 吧，简单，因为主要用于自己的代码调试，没有涉及复杂的反解代码，所以没有必要使用太复杂的动态反编译功能，而且像 OllyDBG 这样的动态反汇编也不支持DOS程序。如果选择开源的NASM，它也有一个反汇编工具 ndisasm.exe 支持16/32/64−bit。如果你是新手，那么按以上提供的软件列表下载安装吧，开始新奇的体验吧！

Advanced MS-DOS Programming The Microsoft(R) Guide for Assembly Language and C Programmers By Ray Duncan 带目录标签 PUBLISHED BY Microsoft Press A Division of Microsoft Corporation 16011 NE 36th Way, Box 97017, Redmond, Washington 98073-9717 Copyright (C) 1986, 1988 by Ray Duncan Published 1986. Second edition 1988. All rights reserved. No part of the contents of this book may be reproduced or transmitted in any form or by any means without the written permission of the publisher. Library of Congress Cataloging in Publication Data Duncan, Ray, 1952Advanced MS-DOS programming. Rev. ed. of: Advanced MS-DOS. (C)1986. Includes index. 1. MS-DOS (Computer operating system) 2. Assembler language (Computer program language) 3. C (Computer program language) I. Duncan, Ray, 1952-Advanced MS-DOS. II. Title. QA76.76.063D858 1988 005.4'46 88-1251 ISBN 1-55615-157-8 Printed and bound in the United States of America. 1 2 3 4 5 6 7 8 9 FGFG 3 2 1 0 9 8 Distributed to the book trade in the United States by Harper & Row. Distributed to the book trade in Canada by General Publishing Company, Ltd. Penguin Books Ltd., Harmondworth, Middlesex, England Penguin Books Australia Ltd., Ringwood, Victoria, Australia Penguin Books N.Z. Ltd., 182-190 Wairu Road, Auckland 10, New Zealand British Cataloging in Publication Data available IBM(R), PC/AT(R), and PS/2(R) are registered trademarks of International Business Machines Corporation. CodeView(R), Microsoft(R), MS-DOS(R), and XENIX(R) are registered trademarks and InPort TM is a trademark of Microsoft Corporation. Technical Editor: Mike Halvorson Production Editor: Mary Ann Jones Dedication For Carolyn

Microsoft Programmer's Library 1.3.7z LABEL: 125-099V130 PROGRAMMERS LIB 1.30 (CDROM) BOX: Volume 2, Issue 1 0291 Part No. 19929 CD: CDRM 453700 CD Jewel: 0690 Part No. 14491 (Rear Insert) Printed materials: CD-ROM envelope (0389 Part No. 06536) Microsoft CD-ROM Products (0189 Part No. 06210) Microsoft Programmer's Library Version 1.1 Quick Reference Card (0389 Part No. 06872) Microsoft Product Warranty Card (0391 Part No. 22202) Multiuser license order form (0391 Part No. 19928, Kit No. 125-999-131) Registration flyer (0391 Part No. 19927) Programmer's Library 1.2 Networking options information sheet (0790 Part No. 14225) Subscribe to Microsoft OnLine (0889 Part No. 098-12005) User's Guide (0489 Part No. 06209)

Microsoft Programmer's Library 1.3.7z LABEL: 125-099V130 PROGRAMMERS LIB 1.30 (CDROM) BOX: Volume 2, Issue 1 0291 Part No. 19929 CD: CDRM 453700 CD Jewel: 0690 Part No. 14491 (Rear Insert) Printed materials: CD-ROM envelope (0389 Part No. 06536) Microsoft CD-ROM Products (0189 Part No. 06210) Microsoft Programmer's Library Version 1.1 Quick Reference Card (0389 Part No. 06872) Microsoft Product Warranty Card (0391 Part No. 22202) Multiuser license order form (0391 Part No. 19928, Kit No. 125-999-131) Registration flyer (0391 Part No. 19927) Programmer's Library 1.2 Networking options information sheet (0790 Part No. 14225) Subscribe to Microsoft OnLine (0889 Part No. 098-12005) User's Guide (0489 Part No. 06209)

参考文章《DOS的古董美》 摘选段落： 有了以上的工具，后就可以开始安装操作系统了。除DOSBOX仅支持 DOS 和 Windows 3.x 外，其它工具基本上支持各种操作系统的安装。具体安装过程序就不展开了，对于 DOSBOX，配置命令比较容易掌握，相当于使用DOS系统，用它来安装 Windows 3.x 就像在DOS安装其它程序一样。使用内置的 Mount 来映射安装目录来一个当作C盘的目录即可以运行 Windows 3.x 安装程序。DOSBOX 也可以安装Windows 95，借用Bochs的磁盘工具bximage来创建用于安装Windows95的系统盘，再用这个盘来启动就可以了。D-Fend是一个DOSBOX配置的图形界面工具，如果不熟悉DOSBOX则可以使用它来帮助配置。当然不用配置也可以直接运行 DOSBOX，像以下这条命令就可以开始无调试窗口运行，并且将 watcom 目录加载为 C 盘，同时还设置了 CPU 的模拟速度： DOSBox.exe -noconsole -c "mount c c:\watcom" -c "config -set 'cpu cycles=10000'" DOSBOX安装 Windows95B OSR2.1 步骤参考，安装光盘已经上传。注意imgmount命令执行方式选择很重要，不正确的参数可能导致磁盘不被识别。本机使用官方的0.74版本，系统为 Windows 7 64位。DosBox-X是不错的版本，在GitHub上有下载，还有DosBox　Svn Daum 版。借用Bochs的磁盘工具bximage创建一个160MB的flat模式硬盘映像c.img，得到参数CHS=325/16/63，扇区大小使用默认的512字节，将这些参数用来设备DOSBOX的映像装载命令，如下如果第一条命令装入磁盘无法识别，可以替换第二条试试。然后，通过Windows 98引导盘来分区、格式化，最后安装系统到映像上，最后修改DOSBOX为硬盘启动。期间可能需要用到Bootice这个工具来修改引导区的信息。安装完后，进行系统可能会花屏，没有系统更新一下默认的S3显卡驱动就好了，下载地址在后面使用S3 Trio 32/64 PCI驱动。不更新驱动，直接使用16色模式也不会花屏。如果使用 DOSBox Daum，还可以加载显卡BIOS，S3 Trio 64 BIOS。 # 1. load image into dosbox IMGMOUNT 2 .\bochs\c.img -t hdd -fs none -size 512,63,16,325 IMGMOUNT c .\bochs\c.img -t hdd # 2. load floppy into dosbox and boot it IMGMOUNT a .\bochs\win98.img -t floppy boot .\vpc\win98.img -l a # 3. use fdisk to create primary partition & format it fdisk format /q /v:win95 c: # 4. mount windows cdrom or image & setup & boot windows # SMARTDRV.EXE & #13895-OEM-0000716-68627 may be useful IMGMOUNT D .\win95b_osr2.1.iso -t iso boot -l c ![getting_start_95.png][111] 提示，可以用winimage工具来管理img磁盘映射，也可以用Windows系统自带的diskpart磁盘工具来加载img磁盘映射，通过计算机管理中的磁盘页面操作，或都通过命令行来实现，以下是两个脚本文件分别用来加载和卸载，保存为txt文件就可以了，使用 diskpart /s 命令来执行脚本： REM diskpart /s mount.txt select vdisk file="c:\win3x\vpc\d3.vhd" attach vdisk REM diskpart /s unload.txt select vdisk file="c:\win3x\vpc\d3.vhd" detach vdisk

参考文章《DOS的古董美》 win95b_osr2.1.iso DOSBOX 0.74 可以安装的Windows95B OSR2.1 摘录内容： 有了以上的工具，后就可以开始安装操作系统了。除DOSBOX仅支持 DOS 和 Windows 3.x 外，其它工具基本上支持各种操作系统的安装。具体安装过程序就不展开了，对于 DOSBOX，配置命令比较容易掌握，相当于使用DOS系统，用它来安装 Windows 3.x 就像在DOS安装其它程序一样。使用内置的 Mount 来映射安装目录来一个当作C盘的目录即可以运行 Windows 3.x 安装程序。DOSBOX 也可以安装Windows 95，借用Bochs的磁盘工具bximage来创建用于安装Windows95的系统盘，再用这个盘来启动就可以了。D-Fend是一个DOSBOX配置的图形界面工具，如果不熟悉DOSBOX则可以使用它来帮助配置。当然不用配置也可以直接运行 DOSBOX，像以下这条命令就可以开始无调试窗口运行，并且将 watcom 目录加载为 C 盘，同时还设置了 CPU 的模拟速度： DOSBox.exe -noconsole -c "mount c c:\watcom" -c "config -set 'cpu cycles=10000'" DOSBOX安装Windows95步骤参考，注意imgmount命令执行方式选择很重要，不正确的参数可能导致磁盘不被识别。本机使用官方的0.74版本，系统为 Windows 7 64位。DosBox-X是不错的版本，在GitHub上有下载，还有DosBox　Svn Daum 版。借用Bochs的磁盘工具bximage创建一个160MB的flat模式硬盘映像c.img，得到参数CHS=325/16/63，扇区大小使用默认的512字节，将这些参数用来设备DOSBOX的映像装载命令，如下如果第一条命令装入磁盘无法识别，可以替换第二条试试。然后，通过Windows 98引导盘来分区、格式化，最后安装系统到映像上，最后修改DOSBOX为硬盘启动。期间可能需要用到Bootice这个工具来修改引导区的信息。 # 1. load image into dosbox IMGMOUNT 2 .\bochs\c.img -t hdd -fs none -size 512,63,16,325 IMGMOUNT c .\bochs\c.img -t hdd # 2. load floppy into dosbox and boot it IMGMOUNT a .\bochs\win98.img -t floppy boot .\vpc\win98.img -l a # 3. use fdisk to create primary partition & format it fdisk format /q /v:win95 c: # 4. mount windows cdrom or image & setup & boot windows # SMARTDRV.EXE & #13895-OEM-0000716-68627 may be useful IMGMOUNT D .\win95b_osr2.1.iso -t iso boot -l c

windows3.2chs.iso 可以用DOSBOX安装运行的windows.

相关文章《DOS的古董美》 MD DocUmEnT: 3/26/2016 10:26:57 AM by Jimbowhy 当计算机技术越来越先进，越来越快速更新，作为电子FANS，发现这样的现状不仅带给从事这个行业的人更多的便利，还有更多的迷失！而DOS就像是那个本应有活力的游乐园，收集资料的过程中发现，国外确实把DOS当成了计算机世界的大游乐场！国内很多在玩开发板的的同学几乎都不懂得，其实个人电脑才是功能最齐全的“开花板”！ - by Jimbowhy 为了混用汇编和C语言进行编程，就需要配套使用微软的C/C++语言编译器，也即是 Visual C++，它的前身是 Microsoft C/C++，最高版本好像是1992年的Microsoft(R) C/C++, Version 7.0，我手上就有MSC70.zip，还有1991年发布的MSC60.zip两个版本。更早的C语言开发工具就是1990年的QuickC(R) Compiler 2.51 Professional。然后就是Visual系列的天下了，最早的一版是1992年发行的Visual C++ 1.0，20张3.5英寸磁盘装，现在能看到的只有磁盘镜像了，镜像中的Link.EX_是SZDD压缩格式。这个版本支持16位和32位开发，集成MFC框架，集成资源编辑器。链接程序为32位 Executable Linker 1.00，同时提供 link.exe 和 link32.exe 两个命令。在 Win PC World 上下载到一个称为 msvc10_32s.iso 的镜像，它包含了 Win32 和 NT两个套开发工具，标明是 Visual C++ 1.0，但感觉不是，像是一个未发布的版本。因为最后一个DOS开发版本是 Dec 5, 1994发行的 Visual C++ 1.52c，也就是从这一套工具开始，链接程序不再叫做 Executable Linker，而是叫做分段模式程序链接器 Segmented Executable Linker，随CD发行的链接程序版本为 5.60.339，这个链接程序也是MASM32中使用的16位程序链接器。直到今天，它仍然具有强大的生命力，一些为MSDOS、Windows 3.1编写16位应用程序的程序员还在使用这个版本，我个人也很喜欢这样小巧的开发工具，因为我只需库文件和编译工具而已，完成编码后剩下的工作就交给make工具而不是IDE。

Open Watcom manual 1.5.zip 官方PDF文档，已经添加目录标签，包含内容： cguide.pdf Open Watcom C/C++ User’s Guide cguideq.pdf Open Watcom C/C++ Compiler and Tools User’s Guide for QNX 3rd Edition clib.pdf Watcom C Library Reference Volume 1 clr.pdf Open Watcom C Language Reference cpplib.pdf Open Watcom C++ Class Library Reference cw.pdf Open Watcom CauseWay User’s Guide lguide.pdf Open Watcom Linker User’s Guide First Edition pguide.pdf Open Watcom C/C++ Programmer’s Guide tools.pdf Open Watcom C/C++ Tools User’s Guide First Edition wd.pdf Open Watcom Debugger User’s Guide vi.pdf Open Watcom Vi Editor Reference and User’s Guide Watcom使用简明 在Watcom安装目录下有三个程序目录 binnt/binp/binw，对应了 Windows NT/XP、OS2、MSDOS 和 Windows 3.x/9x等系统。当前系统为 Windows 7，使用 binnt 目录下的命令工具，各工具介绍： batserv.exe Batch Server wcc.exe C16 Optimizing Compiler cl.exe C/C++ CL Clone for 386 wcc386.exe C32 Optimizing Compiler ctags.exe CTAGS Utility wcl.exe C/C++16 Compile and Link Utility cvpack.exe CV4 Symbolic Compactor wcl386.exe C/C++32 Compile and Link Utility cvtres.exe C/C++ CVTRES Clone for 386 wd.exe Debugger dbginst.exe Debuger Driver Install wddespy.exe DDE Spy for Windows NT dmpobj.exe OMF Dump Utility wde.exe Dialog Editor for Windows NT drwatcom.exe Dr. Watcom for Windows NT wdis.exe Multi-processor Disassembler fcenable.exe Far Call Optimization Enabling wdw.exe Watcom Debuger ide.exe IDE wfc.exe FORTRAN 77/16 Optimizing Compiler lib.exe C/C++ LIB Clone for 386 wfc386.exe FORTRAN 77/32 Optimizing Compiler lib386.exe C/C++ LIB Clone for 386 wfl.exe F77/16 Compile and Link Utility link.exe C/C++ LINK Clone for 386 wfl386.exe F77/32 Compile and Link Utility link386.exe C/C++ LINK Clone for

Open Watcom manual 1.5.zip 官方文档，带目录书签

《RC4对称加密技术》 http://blog.csdn.net/winsenjiansbomber/article/details/50895293 它的最大亮点是算法的简单性和快速处理，因此它可以很容易多种语言上实现。设有一个256字节的数组，用它来加密明文 plaintext，每使用一次，数组的就要交换其中两个字节。被交换的两个字节通过变量 i j 来指定，它们初始值为 0。计算 i 的新值时，直接加一，计算 j 的新值时，将 i 数值对应的数组字节值和密钥字节值相加得到。要得到密文 ciphertext，将明文和 i j 求和后指示的字节相异或 XOR，加密 encrypt 和解密 decrypt 的过程一样。然后交换 i j 指示的数组字节，所有操作都对256求模，数组使用前经过初始化，值依次为 0-255。密钥长度在 1-256字节，以下就是C语言实现的RC4算法：

《RC4对称加密技术》C语言实现 1987年，Ron Rivest 为他的公司 RSA Data Security, Inc. 发明了 RC4 加密系统，加密过程十分简洁明了，以致可以用大多数据语言重新编写。纳德·李维斯特 Ronald L. Rivest，就是 RSA 非对称加密算法的主要作者。和DES算法一样，RC4 是一种对称加密算法，也就是说使用同一个密钥来实现加密与解密，或者说对明文进行一次加密得到密文，对密文进行一次加密就可以得到明文。和DES不同于的是，RC4不是对明文进行分组处理，而是字节流的方式依次加密明文中的每一个字节，解密的时候也是依次对密文中的每一个字节进行解密。这种加密方式又称流式加密，RC4 是应用最广泛的流加密算法，应用在安全套接字层 SSL Security Socket layer 来保护网络上传输的数据，也应用于网络数据保护 WEP Wired Equivalent Privacy http://blog.csdn.net/WinsenJiansbomber/article/details/50895293

《编程与编码》byJimbowhy 如果遇到不明不的的乱码，无论是UTF8 Unicode GBK GB2312 还是 GB18030, 读我，会有帮助的。 http://blog.csdn.net/winsenjiansbomber/article/details/50693186

LeetCode 44. Wildcard Matching Wildcard Matching O(N) by Jimbowhy http://blog.csdn.net/WinsenJiansbomber/article/details/50862569 在 LeetCode 上看到第二个有趣的问题，是关于字符串匹配的，在接触过正则表达式后就一直想着自己实现一个实用版的正则工具，像 editplus 那样，不用做得功能齐全，实用就好。

mathematica_mywife.cc.zip

DDA实践 DOC88_Cracker_Jimbowhy http://blog.csdn.net/winsenjiansbomber/article/details/50756168

Make自动化编译工具-编译静态库与动态库 MD Document:2/28/2016 2:23:09 AM by Jiimbowhy CSDN PuBLiSh:http://blog.csdn.net/winsenjiansbomber/article/details/50758180 在软件开发过程中，编译程序有时会成为一种额外繁重的工作，对于一些大项目工程而言更是如此。所以像Visual Studio等等IDE都是集成了自动化编译工具的，NMAKE 命令就是MS平台下的自动化编译工具。还有其它平台使用如 Ant、Automake、CMake等等，而GNU社区也有自己的自动化编译工具，它就是 GNU make。很早之前深谙自动化编译的重要，只是一直没有机会写一篇相关的文章，这次真的是巧遇了，@亦楠 同学在《headfirst》实验中遇到自动化编译问题，正好可以切题。 自动化编译工具的基本思想就是通过设置一系列依赖关系或规则，通过依赖关系的最低层目标来执行编译链接命令，或其它任意的命令都可以。一个大工程中，可以定义各个分立的项目，需要时可能通过 make 来执行独立分部的编译，而不需要将整个工程重新编译。个别文件被更新时，make 也可以检测到有哪些相应的依赖目标需要重新编译或链接。

Linear Algebra and Its Applications Fourth Edition Gilbert Strang Preface 0 1 Matrices and Gaussian Elimination 1 1.1 Introduction 1 1.2 The Geometry of Linear Equations 4 1.3 An Example of Gaussian Elimination 13 1.4 Matrix Notation and Matrix Multiplication 21 1.5 Triangular Factors and Row Exchanges 36 1.6 Inverses and Transposes 50 1.7 Special Matrices and Applications 66 1.8 Review Exercises 72 2 Vector Spaces 77 2.1 Vector Spaces and Subspaces 77 2.2 Solving Ax = 0 and Ax = b 86 2.3 Linear Independence, Basis, and Dimension 103 2.4 The Four Fundamental Subspaces 115 2.5 Graphs and Networks 129 2.6 Linear Transformations 140 2.7 Review Exercises 154 3 Orthogonality 159 3.1 Orthogonal Vectors and Subspaces 159 3.2 Cosines and Projections onto Lines 171 3.3 Projections and Least Squares 180 3.4 Orthogonal Bases and Gram-Schmidt 195 3.5 The Fast Fourier Transform 211 3.6 Review Exercises 221 4 Determinants 225 4.1 Introduction 225 4.2 Properties of the Determinant 227 4.3 Formulas for the Determinant 236 4.4 Applications of Determinants 247 4.5 Review Exercises 258 5 Eigenvalues and Eigenvectors 260 5.1 Introduction 260 5.2 Diagonalization of a Matrix 273 5.3 Difference Equations and Powers Ak 283 5.4 Differential Equations and eAt 296 5.5 Complex Matrices 312 5.6 Similarity Transformations 325 5.7 Review Exercises 341 6 Positive Definite Matrices 345 6.1 Minima, Maxima, and Saddle Points 345 6.2 Tests for Positive Definiteness 352 6.3 Singular Value Decomposition 367 6.4 Minimum Principles 376 6.5 The Finite Element Method 384 7 Computations with Matrices 390 7.1 Introduction 390 7.2 Matrix Norm and Condition Number 391 7.3 Computation of Eigenvalues 399 7.4 Iterative Methods for Ax = b 407 8 Linear Programming and Game Theory 417 8.1 Linear Inequalities 417 8.2 The Simplex Method 422 8.3 The Dual Problem 434 8.4 Network Models 444 8.5 Game Theory 451 A Intersection, Sum, and Product of Spaces 459 A.1 The Intersection of Two Vector Spaces 459 A.2 The Sum of Two Vector Spaces 460 A.3 The Cartesian Product of Two Vector Spaces 461 A.4 The Tensor Product of Two Vector Spaces 461 A.5 The Kronecker Product A­B of Two Matrices 462 B The Jordan Form 466 C Matrix Factorizations 473 D Glossary: A Dictionary for Linear Algebra 475 E MATLAB Teaching Codes 484 F Linear Algebra in a Nutshell 486

Linear Algebra and Its Applications Fourth Edition Gilbert Strang Preface 5 1 Matrices and Gaussian Elimination 1 1.1 Introduction 1 1.2 The Geometry of Linear Equations 4 1.3 An Example of Gaussian Elimination 13 1.4 Matrix Notation and Matrix Multiplication 21 1.5 Triangular Factors and Row Exchanges 36 1.6 Inverses and Transposes 50 1.7 Special Matrices and Applications 66 1.8 Review Exercises 72 2 Vector Spaces 77 2.1 Vector Spaces and Subspaces 77 2.2 Solving Ax = 0 and Ax = b 86 2.3 Linear Independence, Basis, and Dimension 103 2.4 The Four Fundamental Subspaces 115 2.5 Graphs and Networks 129 2.6 Linear Transformations 140 2.7 Review Exercises 154 3 Orthogonality 159 3.1 Orthogonal Vectors and Subspaces 159 3.2 Cosines and Projections onto Lines 171 3.3 Projections and Least Squares 180 3.4 Orthogonal Bases and Gram-Schmidt 195 3.5 The Fast Fourier Transform 211 3.6 Review Exercises 221 4 Determinants 225 4.1 Introduction 225 4.2 Properties of the Determinant 227 4.3 Formulas for the Determinant 236 4.4 Applications of Determinants 247 4.5 Review Exercises 258 5 Eigenvalues and Eigenvectors 260 5.1 Introduction 260 5.2 Diagonalization of a Matrix 273 5.3 Difference Equations and Powers Ak 283 5.4 Differential Equations and eAt 296 5.5 Complex Matrices 312 5.6 Similarity Transformations 325 5.7 Review Exercises 341 6 Positive Definite Matrices 345 6.1 Minima, Maxima, and Saddle Points 345 6.2 Tests for Positive Definiteness 352 6.3 Singular Value Decomposition 367 6.4 Minimum Principles 376 6.5 The Finite Element Method 384 7 Computations with Matrices 390 7.1 Introduction 390 7.2 Matrix Norm and Condition Number 391 7.3 Computation of Eigenvalues 399 7.4 Iterative Methods for Ax = b 407 8 Linear Programming and Game Theory 417 8.1 Linear Inequalities 417 8.2 The Simplex Method 422 8.3 The Dual Problem 434 8.4 Network Models 444 8.5 Game Theory 451 A Intersection, Sum, and Product of Spaces 459 A.1 The Intersection of Two Vector Spaces 459 A.2 The Sum of Two