搜索结果

经典著作《设计模式》中将策略模式定义为：定义一系列的算法，把它们一个个的封装起来，并且使它们可以相互转换。这个定义还是比较抽象，下面我将通过一个例子来具体的讲解策略模式。感觉这样更容易帮助新手理解模式，这也是《Head First Design Patterns》中讲解模式的方法。先来描述一下用到的例子的背景资料： ...

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 thin ...

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 ...

LL(1)文法，消除隐藏左递归，提取共因子，然后求First,Follow,Select集，以及预测分析表,最后进行预测分析

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 pe ...

学生注册— 本模块允许新的学生创建和维护他们的帐户信息，帐户信息包括：first name, last name, address, e-mail, login name, and password 学生验证— 本模块处理学生的登录过程，像验证用户名和口令，这可以确保仅有已注册的学习可以浏览课程目录和注册课程。 课程目录浏览— 本模块由Web site显示学校当前提供的课 ...

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 ...

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 ...

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.

平均因子分解法，适用于正定矩阵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 triangul ...