Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - idea
Search - idea - List
本书通过85个实例全面讲述了应用MFC进行Visual C++编程的思想。-the book through 85 examples on the application of comprehensive MFC Visual C Programming for the idea.
Update : 2008-10-13 Size : 13591213 Publisher : david

DL : 0
求最大生成树,实际上是以最小生成树的算法为基础进行改进,我采用的是kruskal算法,基本思路是对各个边的权进行排序,然后加入生成树,形成环的点跳过,直到生成最大生成树。JAVA的特点是输入输出比较便利,所以问题的关键在于用监控将图的初始化和树的生成衔接。-Spanning Tree for the largest, is actually the minimum spanning tree algorithm-based improvement, I used the Kruskal algorithm, the basic idea is to the right of each side in order, then joined the spanning tree, formed in Central Point skip until Spanning Tree greatest generation. Java is characterized easier to input and output, Therefore, the key is to use the plan to monitor the initialization and tree generation convergence.
Update : 2008-10-13 Size : 2823 Publisher : 笑笑

算法的基本思想是……大家想看就可以下载哦,不用我多说,来吧支持我吧-algorithm The basic idea is ... we want to be downloaded Oh, I do not have to say, come support me.
Update : 2008-10-13 Size : 3162 Publisher : zhou tian

把编辑框中的文字存为位图,当然,你也可以按照这个思路,你也可以把任何控件、窗口里的东西当作位图来存储-put the text editing box for deposit bitmap, of course, you can also According to this idea, you can also put any controls, The window thing as a bitmap to store
Update : 2008-10-13 Size : 34229 Publisher : 蒋伟

VC产生的临时文件有时真的很烦人!当你编译一个程序,突然系统弹出一个对话框:“D盘已经没有足够的空间~~~~~~~~~请问需要进行磁盘清理吗”,而它只能清掉了Nkb的的东东,你有什么理由不自己写一个专门清理VC垃圾的小工具呢?隔一段时间运行一次,彻底清除指定类型的垃圾文件:干干净净,中国人,奇强! 很明显,这个程序的核心代码肯定是一个有通配符的功能的递归查找文件的函数。我的想法是先查找给定目录下的所有符合条件的文件,再递归查找下级文件夹下所有符合条件的文件。为了保证其封闭性,我用了一个CStringList&变量来保存搜索结果。如果您有好的建议,请给我发邮件。-the temporary files sometimes really annoying! When you compile a program, suddenly a pop-up dialog box system : "D was not enough space ~~~~~~~~~ Will the need for disk clean up?" and it can only Nkb the tune of the price. what is your reason for not writing their own specialized cleaning up a small VC refuse tool? Periodically running a completely remove specified types of waste paper : clean, Chinese, Ever! Obviously, the core of this procedure code is certainly a wildcard recursive function of the document search functions. My idea is to find a given directory of all eligible document, then you lower recursive folder all eligible document. To ensure its closure, I spent a CStringList
Update : 2008-10-13 Size : 13990 Publisher : 蒋伟

编程珠虮随书源码,非常好的软件工程学习思想.-programming with beads Climate source book, a very good idea to study software engineering.
Update : 2008-10-13 Size : 26196 Publisher : 王一丁

遗传算法(Genetic Algorithm, GA)是近几年发展起来的一种崭新的全局优化算法,它借 用了生物遗传学的观点,通过自然选择、遗传、变异等作用机制,实现各个个体的适应性 的提高。这一点体现了自然界中\"物竞天择、适者生存\"进化过程。1962年Holland教授首次 提出了GA算法的思想,从而吸引了大批的研究者,迅速推广到优化、搜索、机器学习等方 面,并奠定了坚实的理论基础。 用遗传算法解决问题时,首先要对待解决问题的模型结构 和参数进行编码,一般用字符串表示,这个过程就将问题符号化、离散化了。也有在连续 空间定义的GA(Genetic Algorithm in Continuous Space, GACS),暂不讨论。-genetic algorithm (Genetic Algorithm. GA) is developed in recent years a new global optimization algorithm, it borrows from the biological point of view of genetics, through natural selection, genetic variation, such as mechanisms to achieve the adaptability of various individuals raised. This is reflected in the natural world, "the process of natural selection and survival of the fittest" evolutionary process. In 1962, Professor Holland first proposed the idea of the algorithm, thereby attracting a large number of researchers, to promote rapid optimization, search, machine learning, and to lay a solid foundation in theory. Using genetic algorithms to solve the problem, we must first solve the problem of the treatment of the model structure and coding parameters, general string,
Update : 2008-10-13 Size : 409964 Publisher : 冯灿科

多阶段决策过程( multistep decision process )是指 这样一类特殊的活动过程,过程可以按时间顺序分解成若干个相互联系的阶段,在每一个阶段都需要做出决策,全部过程的决策是一个决策序列。 动态规划 ( dynamic programming )算法 是解决 多阶段决策过程最优化问题 的一种常用方法,难度比较大,技巧性也很强。利用动态规划算法,可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。动态规划算法的基本思想是:将待求解的问题分解成若干个相互联系的子问题,先求解子问题,然后从这些子问题的解得到原问题的解; 对于重复出现的子问题,只在第一次遇到的时候对它进行求解,并把答案保存起来,让以后再次遇到时直接引用答案,不必重新求解 。动态规划算法将问题的解决方案视为一系列决策的结果,与贪婪算法不同的是,在贪婪算法中,每采用一次贪婪准则,便做出一个不可撤回的决策;而在动态规划算法中,还要考察每个最优决策序列中是否包含一个最优决策子序列,即问题是否具有最优子结构性质。 -multi-stage decision-making process (multistep decision process) is that like a special kind of process, the process can be time-sequence decomposed into a number of interrelated stage, in every stage of a need to make a decision, all of the decision-making process is a sequence of decision-making. Dynamic Programming (dynamic programming) algorithm is a multi-stage decision-making process optimization asked that's a common method was more difficult, skills also have a strong character. Using dynamic programming algorithm can be elegant and efficient solution for many greedy algorithm or partition algorithm to solve the problem. Dynamic programming algorithm is the basic idea : to be solving the problem is decomposed into a number of interrelated issues son, Solving the problem first s
Update : 2008-10-13 Size : 3241 Publisher : 汤烈

DL : 0
这是我编的包括古典密码,还有DES,IDEA等的几个加密算法的加密结果实现,由于时间匆忙有点粗糙,请指教-This is my series, including classical passwords, as well as DES, Several other IDEA Encryption Algorithm encryption achieve results, as a bit hasty rough time, please enlighten
Update : 2008-10-13 Size : 77399 Publisher : 许志平

DL : 0
对电梯系统运行的全面仿真,把各种情况分为电梯内/外两个场景,并将集中控制与分散控制用OO的思想抽象成相关的对象,可以看出其对电梯控制系统进行了深入地分析-to lift the overall system operation simulation, divided into various lift / outside two scenes will focus on control and decentralized control with the idea of OO into the abstract object, we can see their right elevator control system for in-depth analysis
Update : 2008-10-13 Size : 54275 Publisher : oo

修正了时间显示的bug和更改了存储方式 第一次使用要自行更新一次, 点 [UPDATA] 那个按钮, 等进度完成, 要保正你使用的浏览器是 IE5.5 以上, 底版的我就不知了.因为我的是IE5.5-that time showed the bug and change the storage used for the first time to update themselves, points [UPDATA] button, the progress of such completion, FLUX you use the browser is IE5.5 and above, the picture I had no idea. because I was IE5.5
Update : 2008-10-13 Size : 49767 Publisher : wwming

共四个演示。分别如下: 1:Sample    一个简单的使用了共享内存映射的例子,运行两个实例看看就知道,没有什么特别。 2:SendText    不用窗口子类化,而达到和发送自定义消息同样的效果。  3:SendFile    由于演示2中还是通过发消息来传递字符串,不可能传递大块文本,本例综合演示1和演示2达到传递大块文本的功能。 4:Chat    演示2和演示3使用的都是SendMessage来发放通知消息,所以不能异步通讯,SetWindowText不能跨进程使用,PostMessage只能在WM_USER以上的自定义消息中才能传递指针,那么如何才能异步通讯呢?我还没有好主意,就用定时器吧!看看这个可以聊天的程序就知道了。 Common目录下有四个模块。 其中ShareStr2.cls是原来大师Bruce MicKenney写的东西,就是这个东西害我浪费很多时间来调试。原来大师的东西也会有错。-a total of four demonstration. Respectively, as follows : 1 : Sample a simple use of shared memory mapping example, look at two examples run, we know that nothing special. 2 : SendText not window-type, and to achieve this definition of news from the same effect. 3 : As demonstrated SendFile 2 updates, or to pass through the string, impossible to send large text, the cases demonstrate a comprehensive and demonstration to send two large text functions. 4 : Chat demonstration two and three demonstration SendMessage are used to notify the news release, it is not asynchronous communications, inter-process SetWindowText not use, PostMessage WM_USER only in the above-defined messages can transfer target, How can we asynchronous communication? I have not a good idea, on the timer! Chat can look at
Update : 2008-10-13 Size : 52570 Publisher : cohoo

DL : 0
设计模式——访问者模式 Visitor模式允许我们在不改动原有结构的基础之上不断增加新的功能。 ICumulation接口定义了方法Cumulate(),旨在计算1+2+……+n,有两种不同的实现方法,一个是一般的叠加算法GeneralArithmetic,一个是高斯算法GaoSiArithmetic。 因为某种原因,系统需要添加求平均值的功能,还有计算1到n的平方和。 按照一般的思路,我们需要在ICumulation中定义两个方法分别计算平均值和平方和,并在实现类中同时添加相应的方法。在搭建了visitor模式的架构以后,添加功能的代码被移植到ICumulationVisitor中,添加的两种功能也分别被以子类AverageVisitor和PowerVisitor实现。 功能的扩展从在类中添加方法的方式变成了添加新类的方式,该类继承一定的Visitor接口。这是一个90度的转换,使得架构符合开放封闭(OCP)原则:功能的扩展无需改动原有代码。 同时,这里也体现了单一职责原则(SRP),ICumulation层次结构可以因为出现了不同的算法而改变,但是不应该因为需要计算不同的东西(功能)而改变,算法和功能是横向和纵向的关系。这里visitor模式隔离了算法和功能,ICumulation层次结构负责算法,ICumulationVisitor层次结构负责功能。-design patterns -- Visitor visitors model allows us to model without changing the original structure on the basis of constantly adding new features. ICumulation interface definition of the method Cumulate (), designed to calculate a +2 + ... + n, there are two different method, a general superposition GeneralArithmetic algorithm, is a Gaussian algorithms GaoSiArithmetic. For some reason, the system needs to add functions for the average, there is a calculation of n and the square. As a general idea, we need to define ICumulation two methods were calculated and the average square, and in achieving category by adding the corresponding method. The erection of a visitor model, after adding functional code are transferred to ICumulationVisitor, adding the two functions were also a subclass Aver
Update : 2008-10-13 Size : 87871 Publisher : linhuibaby

DL : 0
从2005年10月开始着手编写,开始的想法主要是做个自己看资料方便的工具 因为自己有不少从网上down下来的资料,看了大多的资料收集的软件都是以 数据库的形式存储,个人觉得不方便,而且没时间去存,我的资料主要是htm和 txt文本,所以主要功能是能显示文本类文件和网页文件。 现在主要功能有: 1. 简单文本编辑功能 2. 语法作色功能 3. 正则表达式匹配替换功能 4. 2006-2-9 增加书签功能(待修改) 5. 2006-2-12 改善正则匹配功能,增加在匹配数据中搜索功能 6. 2006-2-17 改善语法着色的设置功能 7. 2006-2-21 增加快速语法着色颜色设置功能,添加delphi风格,Visua Studio风格, 和自定义三种选择! 8. 2006-2-21 修改书签显示,添加文件名 9. 2006-3-10 改进正则匹配显示效率 ......其他好象没什么好说的,没什么特色了,简单说来主要是方便自己看资料(主要是-from October 2005 initiated the preparation, the idea started mainly to be a look at information for their own tools because they have a lot of down down from the Internet information read Most of the information collected by the software are in the form of database storage, personal inconvenient -- but no time to survive, my information is mainly htm and txt text, Therefore, the main function is to display text types of documents and Web documents. Now main functions are : 1. simple text editing 2. 3 vertex function syntax. Regular expressions are matched four functional replacement. 2006-2 - nine increase bookmarking (to be revised) 5. while improvement is 2006-2-12 matching function, Matching the increase in data search capabilities 6. 2006-2-17 syntax coloring to improve the setup func
Update : 2008-10-13 Size : 834429 Publisher : 龙龙龙

设计模型23种C++代码讲解 建议结合大牛的书用 上载那么多文件名限制就算了 上载失败回来还要重写说明重选类别太不爽了-Design Model 23 C code on the idea of combining the largest cattle use the book contains so many restrictions even if the documents were available on the failure to return to rewrite note also re-elected the category too quickly
Update : 2008-10-13 Size : 1216763 Publisher : 李宏伟

ORACLE数据库实现的原型法设计.caj讲述了数据苦基本设计思想-ORACLE Database Design of a prototype. CAJ on data from the basic design idea
Update : 2008-10-13 Size : 191988 Publisher : zhao

一个很简单的程序:在word里添加自己的工具条。程序虽然简单,但提供了一种用VC向word添加工具条的思路。-a very simple : add the word itself of the tools. Simple procedures, but provides a VC tool to add word of the idea.
Update : 2008-10-13 Size : 79720 Publisher : 刘德小花

The Code Project is an exciting site with impressive teaching and professional exchange capabilities. I have learned much from it and also decided to submit my contribution. Occasionally I was involved in a project to check experimental data for consistency. The data were collected in several binary files, which also contain \"holes\", i.e. missing data segments. The main idea to simplify the fast check report was to embed this report inside the progress control.-The Code Project is an exciting site with im pressive teaching and professional exchange c apabilities. I have learned much from it and als o decided to submit my contribution. Occasiona lly I was involved in a project to check experime ntal data for consistency. The data were collec ted in several binary files, which also contain "holes" ie missing data segments. The main idea to sim plify the fast check report was to embed this rep ort inside the progress control.
Update : 2008-10-13 Size : 18508 Publisher : 小叹号

关于银行家算法的实现,其中的思想为: 银行家可以把一定数量的资金供多个用户周转使用,为保证资金的安全银行家规定: 1.当一个用户对资金的最大需求量不超过银行家现有的资金就要接纳该用户 2.用户可以分期贷款,但垡的总数不能超过最大需求量 3.当银行家现有的资金不能满足用户的沿需垡数时,对用户的贷款可推迟支付,但总能使用户在有限的时间里得到贷款 4当用户得到所需的全部资金后,一定能在有限的时间里归还所有的资金. -bankers algorithm on the realization of the idea is as follows : bankers can be a certain amount of funds for working capital to use multiple users, in order to guarantee the safety of funds bankers : 1. When a user of the biggest demand for funds does not exceed the funds available bankers have accepted the users. users can loan installments, but the plow can not exceed the total demand for the biggest three. bankers existing funds can not meet the user's need to plow a few along, users of the loan may be deferred payment, but enables users to the limited time loan four when users receive all the money, will the limited time return of all funds.
Update : 2008-10-13 Size : 1694 Publisher : zhou

DL : 0
IDEA算法的加密实现,实现对明文的加密,加密效果很不错-IDEA encryption algorithm, has implemented an express right of encryption, encryption is very good effect
Update : 2008-10-13 Size : 4028 Publisher : xchf
« 1 2 ... 9 10 11 12 13 1415 16 17 18 19 ... 50 »
DSSZ is the largest source code store in internet!
Contact us :
1999-2046 DSSZ All Rights Reserved.