经典著作《设计模式》中将策略模式定义为：定义一系列的算法，把它们一个个的封装起来，并且使它们可以相互转换。这个定义还是比较抽象，下面我将通过一个例子来具体的讲解策略模式。感觉这样更容易帮助新手理解模式，这也是《Head First Design Patterns》中讲解模式的方法。先来描述一下用到的例子的背景资料：
上传时间： 2015-05-29
上传用户：lizhizheng88
MFC Black Book Introduction: Are you an MFC programmer? Good. There are two types of MFC programmers. What kind are you? The first kind are the good programmers who write programs that conform to the way MFC wants you to do things. The second bunch are wild-eyed anarchists who insist on getting things done their way. Me, I’m in the second group. If you are in the same boat (or would like to be) this book is for you. This book won’t teach you MFC—not in the traditional sense. You should pick it up with a good understanding of basic MFC programming and a desire to do things differently. This isn’t a Scribble tutorial (although I will review some fundamentals in the first chapter). You will learn how to wring every drop from your MFC programs. You’ll discover how to use, abuse, and abandon the document/view architecture. If you’ve ever wanted custom archives, you’ll find that, too.
标签： MFC Introduction programmer programme
上传时间： 2015-05-30
上传用户：youke111
The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d . Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet. Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1. Definition
标签： government streamline important alphabet
上传时间： 2015-06-09
上传用户：weixiao99
LL(1)文法，消除隐藏左递归，提取共因子，然后求First,Follow,Select集，以及预测分析表,最后进行预测分析
标签： LL
上传时间： 2014-12-19
上传用户：GHF
Single-layer neural networks can be trained using various learning algorithms. The best-known algorithms are the Adaline, Perceptron and Backpropagation algorithms for supervised learning. The first two are specific to single-layer neural networks while the third can be generalized to multi-layer perceptrons.
标签： Single-layer algorithms best-known networks
上传时间： 2015-06-17
上传用户：赵云兴
学生注册— 本模块允许新的学生创建和维护他们的帐户信息，帐户信息包括：first name, last name, address, e-mail, login name, and password 学生验证— 本模块处理学生的登录过程，像验证用户名和口令，这可以确保仅有已注册的学习可以浏览课程目录和注册课程。 课程目录浏览— 本模块由Web site显示学校当前提供的课程和他们的 细节，课程细节包括课程名和费用 注册购物车— 本模块允许学生在浏览课程目录中将选择的课程放置入购物车，同时在下订单前查看购物车的内容。 订单处理— 本模块允许学生下订单，和在正式下单前执行必要的验证 管理员界面— 本模块允许管理员查看和同意注册的订单 通知— 本模块由系统发送E-MAIL给已注册课程的学生
标签： 模块
上传时间： 2015-06-18
上传用户：yuzsu
Title: STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library (2nd Edition) Author: David R. Musser / Gillmer J. Derge / Atul Saini / Gilmer J. Derge Publisher: Addison-Wesley Page: 560 Edition: 2nd edition (March 27, 2001) Format: PDF Summary: The Standard Template Library was created as the first library of genetic algorithms and data structures, with four ideas in mind: generic programming, abstractness without loss of efficiency, the Von Neumann computation model, and value semantics. This guide provides a tutorial, a description of each element of the library, and sample applications. The expanded second edition includes new code examples and demonstrations of the use of STL in real-world C++ software development it reflects changes made to STL for the final ANSI/ISO C++ language standard.
标签： Programming Reference Standard Template
上传时间： 2014-01-19
上传用户：netwolf
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
标签： optimization demonstrate the traveling
上传时间： 2015-07-12
上传用户：偷心的海盗
A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists.
标签： algorithm frequent itemsets program
上传时间： 2013-12-27
上传用户：ouyangtongze
平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition.
标签： 分解
上传时间： 2013-12-24
上传用户：啊飒飒大师的
