damn multi-inheritance! [问题点数:100分,结帖人ajoo]

Bbs4
本版专家分:1749
结帖率 100%
Bbs4
本版专家分:1742
Blank
蓝花 2002年5月 C/C++大版内专家分月排行榜第三
Bbs4
本版专家分:1749
Bbs3
本版专家分:781
Bbs5
本版专家分:2068
Bbs4
本版专家分:1749
Bbs3
本版专家分:982
Bbs5
本版专家分:2068
Bbs3
本版专家分:781
Bbs3
本版专家分:781
Bbs4
本版专家分:1749
Bbs6
本版专家分:6328
Blank
红花 2002年4月 C/C++大版内专家分月排行榜第一
Blank
黄花 2002年3月 C/C++大版内专家分月排行榜第二
Blank
蓝花 2002年7月 C/C++大版内专家分月排行榜第三
Bbs4
本版专家分:1749
Bbs4
本版专家分:1749
Bbs4
本版专家分:1749
Bbs6
本版专家分:6328
Blank
红花 2002年4月 C/C++大版内专家分月排行榜第一
Blank
黄花 2002年3月 C/C++大版内专家分月排行榜第二
Blank
蓝花 2002年7月 C/C++大版内专家分月排行榜第三
Bbs4
本版专家分:1749
Bbs3
本版专家分:558
Bbs6
本版专家分:6328
Blank
红花 2002年4月 C/C++大版内专家分月排行榜第一
Blank
黄花 2002年3月 C/C++大版内专家分月排行榜第二
Blank
蓝花 2002年7月 C/C++大版内专家分月排行榜第三
Bbs4
本版专家分:1749
Bbs4
本版专家分:1749
Bbs4
本版专家分:1749
Bbs3
本版专家分:558
Bbs6
本版专家分:6328
Blank
红花 2002年4月 C/C++大版内专家分月排行榜第一
Blank
黄花 2002年3月 C/C++大版内专家分月排行榜第二
Blank
蓝花 2002年7月 C/C++大版内专家分月排行榜第三
Bbs4
本版专家分:1749
Bbs4
本版专家分:1749
Bbs4
本版专家分:1749
Bbs3
本版专家分:558
Bbs4
本版专家分:1749
Bbs6
本版专家分:6328
Blank
红花 2002年4月 C/C++大版内专家分月排行榜第一
Blank
黄花 2002年3月 C/C++大版内专家分月排行榜第二
Blank
蓝花 2002年7月 C/C++大版内专家分月排行榜第三
Bbs4
本版专家分:1749
Bbs3
本版专家分:558
Bbs3
本版专家分:781
Bbs4
本版专家分:1749
Bbs4
本版专家分:1749
Bbs4
本版专家分:1749
Bbs3
本版专家分:781
Bbs5
本版专家分:4753
Bbs3
本版专家分:558
Bbs5
本版专家分:4753
Bbs5
本版专家分:4753
Bbs5
本版专家分:4753
Bbs3
本版专家分:558
Bbs3
本版专家分:558
Bbs5
本版专家分:4753
Bbs6
本版专家分:6134
Bbs3
本版专家分:781
Bbs4
本版专家分:1749
Bbs4
本版专家分:1749
Bbs3
本版专家分:558
Bbs4
本版专家分:1749
Analyzing Computer System Performance with Perl
"Analyzing computer system performance is often regarded by most system administrators, IT professionals and software engineers as a black art that is too time consuming to learn and apply. Finally, this book by acclaimed performance analyst Dr. Neil Gunther makes this subject understandable and applicable through programmatic examples. The means to this end is the open-source performance analyzer Pretty Damn Quick (PDQ) written in Perl and available for download from the author’s Website: www.perfdynamics.com. As the epigraph in this book points out, Common sense is the pitfall of performance analysis. The performance analysis framework that replaces common sense is revealed in the first few chapters of Part I. The important queueing concepts embedded in PDQ are explained in a very simple style that does not require any knowledge of formal probability theory. Part II begins with a full specification of how to set up and use PDQ replete with examples written in Perl. Subsequent chapters present applications of PDQ to the performance analysis of multicomputer architectures, benchmark results, client/server scalability, and Web-based applications. The examples are not mere academic toys but are based on the author's experience analyzing the performance of large-scale systems over the past 20 years. By following his lead, you will quickly be able to set up your own Perl scripts for collecting data and exploring performance-by-design alternatives without inflating your manager’s schedule."
[美剧赏析] 权力的游戏完全赏析 (9-10)
最近阿伟看多了五毛动画,突然想看看那些成熟的动画是怎样的,于是决定看几部美剧。 GoT是阿伟选择的第一站,由于这部作品的亮点非常的多,所以会进行全面的解析,这已 经不单纯是剧透的级别了。所以如果诸位朋友没有完整的看过这部片,先去看一看吧。 You've seen better days, My Lord. Another visit? It seems you're
WCF & WPF 聊天程序源码
WCF & WPF 聊天程序源码For those that have read some of my other CodeProject articles you will probably know, that I am not shy about trying out new technologies. But one good thing about that is that I generally share what I learn right here, and this article is one of the hardest ones I've done IMHO. This article is about how to create a peer-to-peer chat application using Windows Communication Foundation (WCF) and also how to make it look nice using Windows Presentation Foundation (WPF).When I first started reading about WCF, the first place I looked was the MSDN WCF Samples (which I read a lot), but they weren't that great. I also found lots of chat apps based on the MSDN versions, which were no good as they could not return the list of users within the chat application. So I wanted to create a nice WPF styled app with the list of connected chatters. So I hunted around a bit more and eventually came across a <em>damn</em> fine/brilliant article by Nikola Paljetak, which I have tailored for this article. I have OK'd this with Nikola, and the original article content is here. To be honest the original article was pure brilliance (it should be mentioned Nikola is a Professor), but it took a while for me to get what was going on, as the code wasn't commented. I have now commented all code, so I think it will still make a very nice discussion/article for those that are new to WCF/WPF. I was totally new to WCF before this article, so if I can do it, so can all of you.So that's what this article is all about. At the end of the article, I would hope you understand at least some of the key WCF areas, and possibly be inspired enough to look at the WPF side of this article also.
敏捷软件开发实践-英文版
practices of an agile developer 1 Agile Software Development 1 2 Beginning Agility 10 1. Work for Outcome . . . . . . . . . . . . . . . . . . . . . . 12 2. Quick Fixes Become Quicksand . . . . . . . . . . . . . . 15 3. Criticize Ideas, Not People . . . . . . . . . . . . . . . . . . 18 4. Damn the Torpedoes, Go Ahead . . . . . . . . . . . . . . 23 3 Feeding Agility 26 5. Keep Up with Change . . . . . . . . . . . . . . . . . . . . 28 6. Invest in Your Team . . . . . . . . . . . . . . . . . . . . . 31 7. Know When to Unlearn . . . . . . . . . . . . . . . . . . . 34 8. Question Until You Understand . . . . . . . . . . . . . . 37 9. Feel the Rhythm . . . . . . . . . . . . . . . . . . . . . . . 40 4 Delivering What Users Want 43 10. Let Customers Make Decisions . . . . . . . . . . . . . . . 45 11. Let Design Guide, Not Dictate . . . . . . . . . . . . . . . 48 12. Justify Technology Use . . . . . . . . . . . . . . . . . . . 52 13. Keep It Releasable . . . . . . . . . . . . . . . . . . . . . . 55 14. Integrate Early, Integrate Often . . . . . . . . . . . . . . 58 15. Automate Deployment Early . . . . . . . . . . . . . . . . 61 16. Get Frequent Feedback Using Demos . . . . . . . . . . . 64 17. Use Short Iterations, Release in Increments . . . . . . . 69 18. Fixed Prices Are Broken Promises . . . . . . . . . . . . . 73 5 Agile Feedback 76 19. Put Angels on Your Shoulders . . . . . . . . . . . . . . . 78 20. Use It Before You Build It . . . . . . . . . . . . . . . . . . 82 21. Different Makes a Difference . . . . . . . . . . . . . . . . 87 22. Automate Acceptance Testing . . . . . . . . . . . . . . . 90 23. Measure Real Progress . . . . . . . . . . . . . . . . . . . 93 24. Listen to Users . . . . . . . . . . . . . . . . . . . . . . . . 96 CONTENTS xiv 6 AgileCoding 98 25. Program Intently and Expressively . . . . . . . . . . . . . 100 26. Communicate in Code . . . . . . . . . . . . . . . . . . . . 105 27. Actively Evaluate Trade-Offs . . . . . . . . . . . . . . . . 110 28. Code in Increments . . . . . . . . . . . . . . . . . . . . . 113 29. Keep It Simple . . . . . . . . . . . . . . . . . . . . . . . . 115 30. Write Cohesive Code . . . . . . . . . . . . . . . . . . . . . 117 31. Tell, Don’t Ask . . . . . . . . . . . . . . . . . . . . . . . . 121 32. Substitute by Contract . . . . . . . . . . . . . . . . . . . 124 7 Agile Debugging 128 33. Keep a Solutions Log . . . . . . . . . . . . . . . . . . . . . 129 34. Warnings Are Really Errors . . . . . . . . . . . . . . . . . 132 35. Attack Problems in Isolation . . . . . . . . . . . . . . . . 136 36. Report All Exceptions . . . . . . . . . . . . . . . . . . . . 139 37. Provide Useful Error Messages . . . . . . . . . . . . . . . 141 8 Agile Collaboration 146 38. Schedule Regular Face Time . . . . . . . . . . . . . . . . 148 39. Architects Must Write Code . . . . . . . . . . . . . . . . . 152 40. Practice Collective Ownership . . . . . . . . . . . . . . . 155 41. Be a Mentor . . . . . . . . . . . . . . . . . . . . . . . . . . 157 42. Allow People to Figure It Out . . . . . . . . . . . . . . . . 160 43. Share Code Only When Ready . . . . . . . . . . . . . . . 162 44. Review Code . . . . . . . . . . . . . . . . . . . . . . . . . . 165 45. Keep Others Informed . . . . . . . . . . . . . . . . . . . . 168 9 Epilogue: Moving to Agility 170 9.1 Just One New Practice . . . . . . . . . . . . . . . . . . . . 170 9.2 Rescuing a Failing Project . . . . . . . . . . . . . . . . . . 171 9.3 Introducing Agility: The Manager’s Guide . . . . . . . . 172 9.4 Introducing Agility: The Programmer’s Guide . . . . . . 174 9.5 The End? . . . . . . . . . . . . . . . . . . . . . . . . . . . 175 A Resources 176 A.1 On the Web . . . . . . . . . . . . . . . . . . . . . . . . . . 176 A.2 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . 179
UDF.Reader.v2.5.WindowsXP-BluePrint
"BluePrint Presents" The Scoop: The same day the XBOX360 HD-DVDROM Addon was released to the public in USA, we at blueprint figured out how to use it in windows, now as of this moment, officially, the movie that came with the hardware "King Kong" is currently a Dual Layer (30GB) disc so it would appear the studios are aiming for that size minimally for the majority of movies to start off with at least, this of course mean's you will not be directly copying any hd-dvd's as of yet. However, the most important thing is were now able to read the UDF (Universal Disc Filesystem) v2.5 which is currently used by the Toshiba Corp with there first generation HD-DVDRom drives. You can see the entire contents of the HD-DVD Media when in the drive. You can see the Label of the movie title next to the drive letter, you can copy the entire contents of the disc to your hdd, we have thus far only tested this in windows explorer, were anxious to hear about how folks take things from here, better methods of ripping the movies will come in the future, were also looking at the drives since there toshiba/samsung to possibly rip games in the future, of course thats not something were personally working on, but were pretty <em>damn</em> sure it will be possible. in any event, onto the direction's for installation/recongizing your drives contents in windows xp sp2. The Install: Right click on "thdudf.inf" and choose Install from the list of menu options. once this is complete, you should reboot your machine for a full installation of the new UDF 2.5 File system recognition. From here your drive should no longer just say CD-ROM when examining it in windows. ** Notes ** Again, these are litterally Toshiba Corp drivers for the file system used with HD-DVD. We did not create these drivers ourselves, so we cannot modify them, however there availability is limited to specific machines which were familiar with from our places of business, and we will continue to get the latest updates of these drivers and make them available to you as they're released to us. If you would like to contact us about possibily contributing to the cause you can find us at pilgram@gmail.com please label the subject matter very specificly or your email will likely be over looked or even disreguarded due to the volume of questions we will recieve. we do not offer you any files via email. and you are on your own as far as getting these movies are concerned. Good luck to all of you who will take it from here and write some nice applications to use these methods more efficiently we anxiously await your mail. This would be possible with our Mosb3rg and Watchy thanks very much guys your speed on cracking this was pretty amazing and also thanks for spending the money upfront so everyone else could enjoy there addon much more than if they just purchased before hand without this information.
323个小工具合集
323个小工具合集 E:. ├─文件 │ │ 文件后缀名解释器.rar │ │ 文件内容替换程序.zip │ │ 文件校验工具.rar │ │ 微软内码转换.rar │ │ 文件属性日期更改.rar │ │ 汉化新世纪去3721的工具.zip │ │ Ghost explorer 8.0.rar │ │ TextPro5.zip │ │ XCell_SC.zip │ │ 文件分割.rar │ │ 批量文件更名器.rar │ │ 图标更换器(ExeIco).rar │ │ 批量解压缩工具.rar │ │ Pdf文件阅读器.rar │ │ 文件属性修改器.rar │ │ LookPDB.zip │ │ hex编辑器.rar │ │ MDB 数据库浏览器.zip │ │ HEdit.zip │ │ 删除无法删除文件的小工具.rar │ │ 文件库管员.rar │ │ Doc Repair.rar │ │ Access数据库表结构打印程序.zip │ │ hd-copy.rar │ │ REPLALL 文件批处理工具.rar │ │ Unique Filer 查找重复文件.zip │ │ Splasher_exe加上启动退出时图片.zip │ │ FMR_博奥文件管理员.zip │ │ FindDuplicate.rar │ │ │ ├─Filemon6.07 │ │ 汉化说明.txt │ │ Filemon.exe │ │ FILEMON.HLP │ │ README.TXT │ │ Filemon6.07.rar │ │ │ ├─kingcopy │ │ KP2000.EXE │ │ DISKID.DAT │ │ ARJ.EXE │ │ RAR.EXE │ │ Read.txt │ │ READ31.EXE │ │ READCP.EXE │ │ READMK.EXE │ │ READULM.EXE │ │ SCANFD.EXE │ │ WORK.DAT │ │ │ └─windiff │ windiff.exe │ windiff.hlp │ gutils.dll │ ├─注册表 │ │ regshot.exe │ │ 注册表搜索软件.zip │ │ RegSnap.rar │ │ regcompact 注册表压缩工具.zip │ │ │ ├─P_Regmon v6.06 │ │ readme.txt │ │ Regmon.exe │ │ REGMON.HLP │ │ 注册破解说明.txt │ │ │ └─RegSeeker │ │ exclude.ini │ │ FixAddRemove.reg │ │ license.rtf │ │ mycookies.ini │ │ README.txt │ │ RegSeeker.exe │ │ shortarrow.ico │ │ history.txt │ │ regfav.ini │ │ lang.ini │ │ │ └─Languages │ Chinese.bmp │ Chinese.lng │ Czech.bmp │ Czech.lng │ Deutsch.bmp │ Deutsch.lng │ Dutch.bmp │ Dutch.lng │ English.bmp │ English.lng │ Espal.bmp │ Espal.lng │ French.bmp │ French.lng │ Galego.bmp │ Galego.lng │ Hungarian.bmp │ Hungarian.lng │ Indonesian.bmp │ Indonesian.lng │ Italiano.bmp │ Italiano.lng │ Korean.bmp │ Korean.lng │ Polish.bmp │ Polish.lng │ ├─网络 │ │ flashfxppasswordck0.1.zip │ │ MAC扫描器.rar │ │ wininfo.rar │ │ FlashFXP帐号密码.rar │ │ Ip 地址翻译.rar │ │ 应用程序正常使用权限限恢复脚本 2.0beta.vbs │ │ Mini_Ftp.rar │ │ abilitywebserver.zip │ │ VBSFileLock.zip │ │ IP 地址翻译软件-pubfuscate.rar │ │ Net tools.rar │ │ 查看网络计算机端口.rar │ │ 修改网卡的IP地址.rar │ │ Magic.Mail.Monitor绿色版.rar │ │ FtpList1.13 CN.rar │ │ Network Statistics.rar │ │ ACTIVEX MANAGER.rar │ │ ftptree.rar │ │ 子网掩码换算工具.rar │ │ 修改指定网卡MAC.rar │ │ cookies浏览.rar │ │ 网络及常用工具集.rar │ │ 远程桌面连接器.rar │ │ Tping.rar │ │ AdMuncher 广告过滤.rar │ │ Http debug.rar │ │ PIXIE.ZIP │ │ XML HTTP微型探针V081B.rar │ │ 转换网上在线播放的文件.rar │ │ 检查收藏夹中的链接是否依然有效.zip │ │ HTTP 方式的文件共享.zip │ │ windows终端登陆客户端.rar │ │ IE Resizer.rar │ │ ASP 批量反编码工具特别版.rar │ │ 网络小管理器.1.rar │ │ 网络连接和状态监视器.rar │ │ WinVNC 远程控制软件.zip │ │ 月影特快专递 v1.7.rar │ │ HTML to AnyCode Converter.rar │ │ SHED 共享扫描器.rar │ │ HTTP File Server文件共享工具.zip │ │ Proxy Check.rar │ │ Super Chat.rar │ │ putty telnet软件.rar │ │ 显自己IP.rar │ │ NetStat Live_显示网路连接状态.rar │ │ KillTCP_tcp连接显示和杀除器.rar │ │ ffxpview_FlashFXP站点信息察看器.zip │ │ │ ├─局域网共享密码破解 │ │ config.ini │ │ EXAMPLE.XML │ │ LanHelperV0.91.exe │ │ NetPass.exe │ │ README.HTM │ │ STYLE.XSL │ │ │ ├─扫描工具 │ │ ├─twwwscan12 │ │ │ 谢谢.htm │ │ │ trans.pl │ │ │ anti-sn.uxe │ │ │ bof_dos.uxe │ │ │ firewall.uxe │ │ │ idstest.uxe │ │ │ iis.uxe │ │ │ inject.uxe │ │ │ nes.uxe │ │ │ rule.uxe │ │ │ server.uxe │ │ │ advertising_information.txt │ │ │ bugs.txt │ │ │ readme.txt │ │ │ tcrypto.exe │ │ │ tuxe.exe │ │ │ twwwscan.exe │ │ │ │ │ ├─superscan3.0 │ │ │ superscan3.0.txt │ │ │ superscan3.0.exe │ │ │ 谢谢.htm │ │ │ │ │ ├─Ipscan │ │ │ IPSCAN.EXE │ │ │ Ipscan.txt │ │ │ │ │ ├─TaskInfo2000 3.0 │ │ │ FILE_ID.DIZ │ │ │ Readme.txt │ │ │ setup-1.bin │ │ │ setup.0 │ │ │ setup.exe │ │ │ setup.msg │ │ │ │ │ └─追捕! V1.70 Build 1001 Beta │ │ 追捕! V1.70.zip │ │ │ └─pubdown16 │ │ Lang_Chs.ini │ │ Lang_Cht.ini │ │ Lang_Eng.ini │ │ PUBDL.exe │ │ │ └─SOUNDS │ ADDED.WAV │ ALL_DONE.WAV │ DONE.WAV │ ├─系统 │ │ ucdos.rar │ │ HijackThis.exe │ │ Tweak ui.1.33.rar │ │ prcview.zip │ │ PassWord Keeper.zip │ │ PCGHOST键盘记录木马破解版.zip │ │ remove hotfix backup files 2.0.zip │ │ 控制系统启动项目.rar │ │ windows xp 激活信息备份器 v1.00.rar │ │ windows信使服务控制程序下载.zip │ │ 强大的windows设置工具.rar │ │ Font map.zip │ │ 隐藏你的程序.zip │ │ shutdown.rar │ │ getwin2kpw.rar │ │ 按键精灵2.22.zip │ │ PowerMenu.rar │ │ 控件激活专家.rar │ │ 查看DLL使用情况的软件.rar │ │ hide_it.zip │ │ services.zip │ │ DBPort.zip │ │ Active Ports V1.4.rar │ │ Right_Jump.rar │ │ 桌面图标背景透明的小工具_15.rar │ │ 键盘映射.rar │ │ 内存模拟硬盘.zip │ │ 系统服务管理专家.rar │ │ Pstools.zip │ │ 还原精灵移除器.rar │ │ 转当前路径的dos窗口.rar │ │ Task98.rar │ │ 剪贴板增强程序.zip │ │ 乱码察看器.rar │ │ 查看端口和线程 v2.33.zip │ │ 拷贝增强.rar │ │ Work&Server切换.rar │ │ A盘扩容器.zip │ │ DOS汉字系统.rar │ │ PowerOff.rar │ │ 超强进程查看器.rar │ │ 窗口可调工具.zip │ │ ActiveKeys.rar │ │ 输入法小管家.rar │ │ 内存整理.rar │ │ 查看_注册_ 取消注册 ocx&dll 组件.zip │ │ 热键工具.zip │ │ 袖珍龙DOS汉字系统.rar │ │ Add Remove Plus!.rar │ │ 桌面标签工具.rar │ │ 灰色按钮克星2.1.rar │ │ FontViewer3_功能强大的字体管理工具.zip │ │ Wperf 系统监视器.rar │ │ pctools50.rar │ │ 自动启动程序.rar │ │ 配置 Windows2003.rar │ │ Delpart 随意删除分区.rar │ │ NoteXPad 记事本软件.rar │ │ FONT NAV 字体管理工具.rar │ │ ClockAlign 绿色校时工具.rar │ │ EGHOST.rar │ │ 个人珍藏版之Cleand.rar │ │ WST Win2k安全设置.rar │ │ StartupCPL 启动管理工具.zip │ │ 任务管理器2003.rar │ │ R-Studio 数据恢复.zip │ │ WUN_解压Wise安装包的小工具.rar │ │ MSWINERR_Win错误代码.ZIP │ │ SpyIt_获得窗口相关信息.zip │ │ │ ├─Antiyports │ │ antiyports.exe │ │ psapi.dll │ │ APorts.hlp │ │ APorts.cnt │ │ 打印目录.rar │ │ │ ├─已存在编码查寻与控制 │ │ mmcompview.exe │ │ │ ├─SysTrayX_v3.51 │ │ SETUP_SYSTRAYX_351K.EXE │ │ ssg.nfo │ │ │ ├─文件夹隐藏专家 │ │ │ fhe_setup.exe │ │ │ │ │ └─Crack │ │ FheMain.exe │ │ 使用说明.txt │ │ │ └─Ram Stress Test _专业内存检测工具 │ readme.txt │ RST442.IMZ │ RST442.nrg │ RST442.img │ RST442.ima │ ├─趣味 │ 2000下图标透明工具.zip │ 查阴阳历的软件.zip │ 大陆身份证生成器.rar │ 全国邮编列表.zip │ 透明化你的窗口.rar │ 网络对时软件.rar │ 序列号复制粘贴利器.rar │ 序列号输入机.rar │ 桌面写字板.zip │ sreen_record2.0.zip │ glass2k.rar │ Calendar.rar │ 农历手册.rar │ clock.rar │ Powermenu.rar │ 手机号码定位器-2.0.0308.zip │ 校准时钟软件.rar │ 右键小精灵.rar │ TT 打字程序.rar │ bosskey.分屏.zip │ mybase.rar │ 剪切板增强工具.rar │ 身体节律周期查询.zip │ wt.rar │ 实用计算器及计算工厂.rar │ Cd oc.rar │ 时可通.rar │ 绿色小软-放大镜 .zip │ Pic 2 html.zip │ 中国古历日速查工具 3.0.rar │ 公章制作.rar │ Count Folders.rar │ zerofile 生成0字节的文件.zip │ JOCSC Dos的Ascii画图工具.ZIP │ Neutron 时钟校对工具.zip │ 字符放大器 0.1.rar │ Close Monitor 立即关闭显示器.rar │ 五笔编码查询绿色软件.rar │ 替换正在使用的文件.rar │ CHMunpacker 从chm文件中提取文件.rar │ saying 报时器.rar │ Hide 隐藏器.rar │ World Time 世界各地的时间.rar │ 台湾韩国身份证号码生成器.zip │ 方便的调整音量的小程序.zip │ 对时程序.rar │ 定时器.zip │ Biromsoft Calculator_好用的计算器.rar │ Code.rar │ ├─密码安全 │ │ CRC.EXE │ │ EXE加壳器.zip │ │ 看星星(密码)的工具.zip │ │ 本地保存密码读取专家.zip │ │ 查看WIN2000登陆密码.rar │ │ pwsView.zip │ │ AsciiArtViewer.zip │ │ 查看密码的软件 3.0.zip │ │ Magic SFV & MD5.v1.3.rar │ │ FireSFV.rar │ │ 静态反汇编工具W32Dasm .rar │ │ Installshield EXE密码工具.rar │ │ 随机密码生成12.rar │ │ Duba_RegSolve 注册表恢复器.rar │ │ XDF 的SWF处理工具.zip │ │ SpySharp 密码神探.rar │ │ 偷天换日2.0.rar │ │ Stimulant 系统漏洞扫描.rar │ │ Peid 检测exe文件是否被加壳.rar │ │ View password.rar │ │ │ ├─md5 │ │ index.html │ │ main.c │ │ Makefile │ │ md5.c │ │ md5.exe │ │ md5.gif │ │ md5.h │ │ rfc1321.html │ │ rfc1321.txt │ │ WinMD5.exe │ │ │ ├─flashsfv2.3 │ │ FlashSfv.exe │ │ │ └─DAMN NFO Viewer │ │ DAMN NFO Viewer.exe │ │ │ └─LangDLLs │ DAMN_NFO_Viewer_CHI.dll │ DAMN_NFO_Viewer_ENG.dll │ ├─磁盘光驱 │ │ 光驱开关.rar │ │ 光盘管理.rar │ │ 鼻屎兔超级无敌旋风屁屁拷 v2003.6.13 .rar │ │ 硬盘出厂读取软件.rar │ │ 启动扇区提取工具.zip │ │ nero_test v2.5.5.rar │ │ 光盘信息.rar │ │ Virtual driver.rar │ │ img的专用工具.rar │ │ Ndd.zip │ │ MS VCdControlTool 虚拟光驱软件.zip │ │ FillCD 计算目录组合可以达到最大的光盘使用率.rar │ │ │ └─IsoBuster │ │ vfloppy 虚拟软盘.rar │ │ │ ├─Setup │ │ isobuster_14_0515_alllang.exe │ │ │ └─Keygen │ cr_ib13.exe │ CORE.NFO │ ├─媒体 │ │ rma伴侣.zip │ │ srecord20.zip │ │ 破解加密的flash文件.rar │ │ 破解微软音乐wma版权保护.rar │ │ Rm2Mp3.rar │ │ 极方便地从swf文件中取声音文件为MP3文件.rar │ │ 取色工具.rar │ │ 调色器.rar │ │ Swf 2 Video Pro v1.0.1.2.HH.rar │ │ 查看影片用的编码.rar │ │ GGG.rar │ │ RGB颜色代码和抓屏幕颜色的小工具.rar │ │ DAT 2 MPG.rar │ │ Dos 截屏.zip │ │ 查看MP3编码质量.rar │ │ GIF Movie Gear.rar │ │ Avi code.rar │ │ Real 工具.rar │ │ ape 2 mp3.rar │ │ 切图工具.rar │ │ Avi_preview.zip │ │ 图片加数字水印工具.rar │ │ 图片克隆放大器-无日期限制版.rar │ │ Namo GIF 编辑器.rar │ │ HAP_mp3Trim MP3修整截取工具.rar │ │ StreamBoxRipper2009.rar │ │ ColorSPY 1.1.zip │ │ tol.rar │ │ │ └─视频修复器(VideoFixer) │ videofixer.exe │ key.dat │ runme.reg │ tsrh.nfo │ └─硬件 N卡刷新率锁定工具 2.2.rar Intel英特尔芯片组.rar CPUINFO.rar 断针测试工具.rar Disk大小查看工具.rar cpu-z.rar 硬盘测温.zip ReForce 刷新率锁定工具.rar wpcrset NF2主板修改.rar AMD PR Calculator 计算AMD CPU的PR值.rar prime95 极其BT的拷机程序.rar ArtifactTester 测试显卡显存.rar CMOS模拟程序.rar vSubst 目录虚拟成盘符.zip
YUMI – Multiboot USB Creator (Windows)
一个可以制作usb启动盘的工具,非常好用,可以直接把很多的linux live 光盘直接制作在usb上启动。目前支持下列系统: — Debian Live 32/64 Bit — Debian Live 7 Gnome 32bit Debian Live 7 Gnome 64bit Debian Live 7 KDE 32bit Debian Live 7 KDE 64bit Debian Live 7 LXDE 32bit Debian Live 7 LXDE 64bit Debian Live 7 XFCE 32bit Debian Live 7 XFCE 64bit — Fedora 32/64 Bit — Fedora 17/18/19 GNOME 32bit Fedora 17/18/19 GNOME 64bit Fedora 17/18/19 KDE 32bit Fedora 17/18/19 KDE 64bit Fedora 17/18/19 LXDE 32bit Fedora 17/18/19 LXDE 64bit Fedora 17/18/19 XFCE 32bit Fedora 17/18/19 XFCE 64bit Fedora 16 GNOME 32bit Fedora 16 GNOME 64bit Fedora 16 KDE 32bit Fedora 16 KDE 64bit Fedora 16 LXDE 32bit Fedora 16 LXDE 64bit Fedora 16 XFCE 32bit Fedora 16 XFCE 64bit Fedora 15 GNOME 32bit Fedora 15 GNOME 64bit Fedora 15 KDE 32bit Fedora 15 KDE 64bit Fedora 15 LXDE 32bit Fedora 15 LXDE 64bit Fedora 15 XFCE 32bit Fedora 15 XFCE 64bit — Linux Mint 32/64 Bit — Linux Mint 15 Mate 32bit Linux Mint 15 Mate 64bit Linux Mint 15 Cinnamon 32bit Linux Mint 15 Cinnamon 64bit Linux Mint 14 Mate 32bit Linux Mint 14 Mate 64bit Linux Mint 14 Cinnamon 32bit Linux Mint 14 Cinnamon 64bit Linux Mint 14 KDE 32bit Linux Mint 14 KDE 64bit Linux Mint 14 XFCE 32bit Linux Mint 14 XFCE 64bit LMDE 201303 Mate 32bit LMDE 201303 Mate 64bit LMDE 201303 Cinnamon 32bit LMDE 201303 Cinnamon 64bit LMDE 201204 Mate/Cinnamon 32bit LMDE 201204 Mate/Cinnamon 64bit LMDE 201204 XFCE 32bit LMDE 201204 XFCE 64bit Linux Mint 13 Cinnamon 32bit Linux Mint 13 Cinnamon 64bit Linux Mint 13 KDE 32bit Linux Mint 13 KDE 64bit Linux Mint 13 Mate 32bit Linux Mint 13 Mate 64bit Linux Mint 13 XFCE 32bit Linux Mint 13 XFCE 64bit Linux Mint 12 Gnome 32bit Linux Mint 12 Gnome 64bit Linux Mint 12 KDE 32bit Linux Mint 12 KDE 64bit Linux Mint 12 LXDE 32bit Linux Mint 11 32bit Linux Mint 11 64bit — OpenSUSE Live 32/64 Bit — OpenSUSE 12.1 GNOME i686 OpenSUSE 12.1 GNOME x64 OpenSUSE 12.1 KDE i686 OpenSUSE 12.1 KDE x64 OpenSUSE 11.4 GNOME i686 OpenSUSE 11.4 GNOME x64 OpenSUSE 11.4 KDE i686 OpenSUSE 11.4 KDE x64 — Puppy Linux 32/64 Bit — DPup Exprimo Fatdog64 (Firefox) Fatdog64 (Seamonkey) Lucid Puppy Linux Precise Puppy Linux Racy Puppy Linux Slacko Puppy Wary Puppy Linux — Ubuntu 32/64 Bit — Ubuntu 13.10 Ubuntu 13.10 amd64 Ubuntu Server 13.10 Ubuntu Server 13.10 amd64 Ubuntu 13.04 Ubuntu 13.04 amd64 Ubuntu Server 13.04 Ubuntu Server 13.04 amd64 Ubuntu 12.10 Ubuntu 12.10 amd64 Ubuntu Secure Remix 12.10 Ubuntu Secure Remix 12.10 amd64 Ubuntu Server 12.10 Ubuntu Server 12.10 amd64 Ubuntu Studio 12.10 Ubuntu Studio 12.10 amd64 Edubuntu 12.10 Edubuntu 12.10 amd64 Kubuntu 12.10 Kubuntu 12.10 amd64 Lubuntu 12.10 Lubuntu 12.10 amd64 Xubuntu 12.10 Xubuntu 12.10 amd64 Ubuntu 12.04 Ubuntu 12.04 amd64 Ubuntu 12.04 DVD Ubuntu 12.04 DVD amd64 Ubuntu Server 12.04 Ubuntu Server 12.04 amd64 Ubuntu Studio 12.04 Ubuntu Studio 12.04 amd64 Edubuntu 12.04 Edubuntu 12.04 amd64 Kubuntu 12.04 Kubuntu 12.04 amd64 Kubuntu 12.04 DVD Kubuntu 12.04 DVD amd64 Lubuntu 12.04 Lubuntu 12.04 amd64 Mythbuntu 12.04 Mythbuntu 12.04 amd64 Xubuntu 12.04 Xubuntu 12.04 amd64 Ubuntu 11.10 Ubuntu 11.10 amd64 Ubuntu Server 11.10 Edubuntu 11.10 Kubuntu 11.10 Kubuntu 11.10 amd64 Lubuntu 11.10 Lubuntu 11.10 amd64 Xubuntu 11.10 Xubuntu 11.10 amd64 Ubuntu 11.04 Ubuntu 11.04 x64 Edubuntu 11.04 Kubuntu 11.04 Kubuntu 11.04 x64 Lubuntu 11.04 Xubuntu 11.04 Xubuntu 11.04 x64 Ubuntu 10.10 Edubuntu 10.10 Kubuntu 10.10 Lubuntu 10.10 Xubuntu 10.10 Ubuntu 10.04 Ubuntu 10.04 x64 Kubuntu 10.04 Kubuntu 10.04 x64 Xubuntu 10.04 Xubuntu 10.04 x64 — Other Distros Alphabetical — AntiX Archlinux Bodhi CAELinux (Computer Aided Engineering) CentOS CentOS 64bit Crunchbang Damn Small Linux (DSL) Fuduntu gpxe (Net Bootable Distros) KNOPPIX 6.7.1 CD KNOPPIX 7 KXStudio 12.04 Mandriva 2011 Netrunner OSGeo Live PCLinuxOS Peppermint Three Peppermint Three 64bit Pear Linux 6 Pinguy OS 11 Pinguy OS 12.04 Porteus SalineOS Scientific Linux CERN 6.3 Semplice Linux SLAX (Tiny Slackware Based Distro) SLAX 64bit Slitaz (Another Tiny Distro) Sn0wL1nuX 11 Sn0wL1nuX 11 64bit Sugar on a Stick System Rescue CD Tails 0.15 (Anonymous Browsing) Liberte (Anonymous Browsing) Terralinux TinyCore (A Tiny Linux Distribution) Ultimate Edition 3 WifiSlax wifislax\boot\vmlinuz WifiWay 3.4 WifiWay 2 XBMCbuntu Zorin OS Core Zorin OS Core 64bit ———— NetBook Distributions ———— EasyPeasy (NetBook Distro) Jolicloud (NetBook Distro) Ubuntu Netbook Remix 10.10 xPUD (Netbook Distro) ————— Antivirus Tools ————— Acronis Antimalware CD AOSS (Malware Scanner) system\stage1 AVG Rescue CD (Antivirus Scanner) AVIRA AntiVir Rescue CD (Virus Scanner) ; does install to root of drive Bitdefender Rescue Disk (Antivirus Scanner) Comodo Rescue Disk (Antivirus Scanner) Dr.Web Live CD boot\module\drweb_bases.dwm F-Secure Rescue CD GDATA Rescue CD Kaspersky Rescue Disk (Antivirus Scanner) Panda SafeCD Windows Defender Offline —————– System Tools —————- BackBox (Penetration Testing) BackTrack5 (Penetration Testing) Boot Repair Disk Clonezilla (Backup + Clone Tool) DBAN (Hard Drive Nuker) Deft (Forensics) DRBL (Diskless Remote Boot in Linux) EASEUS Disk Copy (Disk Cloning Tool) FreeDOS (Balder img) GParted (Partition Tools) GRML (system rescue) HDT (Hardware Detection Tool) Kali (Penetration Testing) Memtest86+ (Memory Testing Tool) Matriux (Penetration Testing) Offline NT Password & Registry Editor Ophcrack (no tables) Ophcrack XP (Password Finder) Ophcrack Vista/7 (Password Finder) Parted Magic (Partition Tools) PING (Partimg Is Not Ghost) Partition Wizard (Partition Tools) Rescatux Redo Backup And Recovery (Recovery Tools) Rip Linux (Recovery Distro) Trinity Rescue Kit TRK\initrd.trk ; does install to root of drive Ultimate Boot CD (Diagnostics Tools) Web Converger (Web Kiosk) —————– Other OS/Tools —————- Linux Live Tools for OCZ HP SmartStart 8.60 x32 HP SmartStart 8.70 x32 HP SmartStart 8.60 x64 HP SmartStart 8.70 x64 HP Firmware Maintenance 8.70 (CD) HP Automatic Firmware Update 9.30 (DVD) HP Automatic Firmware Update 10.10 (DVD) Hiren's Boot CD 15.X HBCD\menu.lst ; does install to root of drive Kon-Boot Floppy Image Windows Vista/7/8 Installer bootmgr ; does install to root of drive Windows XP Installer —————– Bootable ISOs —————- Try an Unlisted ISO Try an Unlisted ISO (Run from RAM)
Springer Analyzing Computer Systems Performance with Perl
Springer Analyzing Computer Systems Performance with Perl Preface ........................................................ vii Part I Theory of System Performance Analysis 1 Time—The Zeroth Performance Metric.................... 3 1.1 Introduction.......................................... 3 1.2 WhatIsTime?........................................ 4 1.2.1 PhysicalTime................................. 5 1.2.2 SynchronizationandCausality .................. 5 1.2.3 DiscreteandContinuousTime .................. 6 1.2.4 TimeScales................................... 6 1.3 WhatIsaClock?...................................... 8 1.3.1 PhysicalClocks ............................... 8 1.3.2 DistributedPhysicalClocks..................... 9 1.3.3 DistributedProcessing ......................... 9 1.3.4 Binary Precedence. ............................ 10 1.3.5 LogicalClocks ................................ 10 1.3.6 ClockTicks................................... 12 1.3.7 VirtualClocks ................................ 13 1.4 RepresentationsofTime................................ 14 1.4.1 IntheBeginning .............................. 14 1.4.2 MakingaDateWithPerl....................... 15 1.4.3 High-ResolutionTiming........................ 17 1.4.4 BenchmarkTimers ............................ 18 1.4.5 CrossingTimeZones........................... 19 1.5 TimeDistributions .................................... 21 1.5.1 GammaDistribution........................... 22 1.5.2 ExponentialDistribution....................... 22 1.5.3 PoissonDistribution........................... 24 1.5.4 ServerResponseTimeDistribution .............. 25 xvi Contents 1.5.5 NetworkResponseTimeDistribution ............ 26 1.6 TimingChainsandBottlenecks ......................... 28 1.6.1 BottlenecksandQueues........................ 30 1.6.2 DistributedInstrumentation .................... 30 1.6.3 DiskTimingChains ........................... 31 1.6.4 LifeandTimesofanNFSOperation............. 32 1.7 Failing Big Time ...................................... 33 1.7.1 Hardware Availability.......................... 34 1.7.2 TyrannyoftheNines .......................... 34 1.7.3 Hardware Reliability........................... 35 1.7.4 MeanTimeBetweenFailures ................... 36 1.7.5 DistributedHardware.......................... 38 1.7.6 ComponentsinSeries .......................... 38 1.7.7 ComponentsinParallel ........................ 38 1.7.8 Software Reliability ............................ 39 1.8 MetastableLifetimes................................... 39 1.8.1 Microscopic Metastability ...................... 40 1.8.2 Macroscopic Metastability ...................... 43 1.8.3 Metastability in Networks ...................... 43 1.8.4 QuantumlikePhaseTransitions ................. 45 1.9 Review............................................... 45 Exercises................................................... 46 2 Getting the Jump on Queueing ............................ 47 2.1 Introduction.......................................... 47 2.2 WhatIsaQueue? ..................................... 48 2.3 TheGroceryStore—CheckingItOut .................... 48 2.3.1 QueueingAnalysisView........................ 49 2.3.2 Perceptions and Deceptions . .................... 50 2.3.3 ThePostO?ce—SnailMail .................... 51 2.4 Fundamental Metric Relationships ....................... 51 2.4.1 PerformanceMeasures ......................... 52 2.4.2 ArrivalRate.................................. 53 2.4.3 System Throughput ........................... 55 2.4.4 Nodal Throughput............................. 56 2.4.5 Relative Throughput........................... 56 2.4.6 ServiceTime.................................. 57 2.4.7 ServiceDemand............................... 58 2.4.8 Utilization.................................... 58 2.4.9 ResidenceTime ............................... 59 2.5 Little’sLawMeansaLot............................... 59 2.5.1 ALittleIntuition.............................. 60 2.5.2 AVisualProof................................ 61 2.5.3 Little’sMicroscopicLaw........................ 66 2.5.4 Little’sMacroscopicLaw ....................... 66 Contents xvii 2.6 UnlimitedRequest(Open)Queues....................... 67 2.6.1 SingleServerQueue ........................... 67 2.6.2 MeasuredServiceDemand...................... 68 2.6.3 QueueingDelays .............................. 68 2.6.4 TwinQueueingCenter ......................... 73 2.6.5 ParallelQueues ............................... 74 2.6.6 DualServerQueue—HeuristicAnalysis........... 76 2.7 MultiserverQueue..................................... 79 2.7.1 Erlang’s C Formula............................ 80 2.7.2 AccuracyoftheHeuristicFormula............... 82 2.7.3 Erlang’s B Formula............................ 83 2.7.4 ErlangAlgorithmsinPerl ...................... 84 2.7.5 DualServerQueue—ExactAnalysis ............. 86 2.8 LimitedRequest(Closed)Queues........................ 88 2.8.1 ClosedQueueingCenter........................ 88 2.8.2 InteractiveResponseTimeLaw ................. 89 2.8.3 RepairmanAlgorithminPerl ................... 90 2.8.4 ResponseTimeCharacteristic................... 92 2.8.5 Throughput Characteristic...................... 93 2.8.6 FiniteResponseTimes......................... 94 2.8.7 ApproximatingaClosedQueues................. 95 2.9 ShorthandforQueues.................................. 99 2.9.1 QueueSchematics ............................. 99 2.9.2 KendallNotation..............................100 2.10 ComparativePerformance ..............................101 2.10.1 MultiserverVersusUniserver....................102 2.10.2 MultiqueueVersusMultiserver ..................102 2.10.3 TheEnvelopePlease! ..........................104 2.11 GeneralizedServers....................................105 2.11.1 Infinite Capacity (IS) Server ....................106 2.11.2 Exponential(M)Server ........................107 2.11.3 Deterministic(D)Server .......................108 2.11.4 Uniform(U)Server............................108 2.11.5 Erlang-k (Ek)Server...........................108 2.11.6 Hypoexponential (Hypo–k)Server...............109 2.11.7 Hyperexponential (Hk)Server...................109 2.11.8 Coxian (Cox–k)Server.........................110 2.11.9 General(G)Server ............................111 2.11.10 Pollaczek–Khintchine Formula ..................112 2.11.11 Polling Systems ...............................113 2.12 Review...............................................115 Exercises...................................................116 xviii Contents 3 Queueing Systems for Computer Systems..................119 3.1 Introduction..........................................119 3.2 TypesofCircuits......................................120 3.3 PoissonProperties.....................................122 3.3.1 PoissonMerging...............................122 3.3.2 PoissonBranching.............................123 3.3.3 PoissonPasta.................................123 3.4 Open-CircuitQueues ..................................124 3.4.1 SeriesCircuits ................................125 3.4.2 FeedforwardCircuits...........................125 3.4.3 FeedbackCircuits .............................126 3.4.4 Jackson’sTheorem ............................129 3.4.5 ParallelQueuesinSeries .......................131 3.4.6 MultipleWorkloadsinOpenCircuits ............135 3.5 Closed-CircuitQueues .................................136 3.5.1 ArrivalTheorem ..............................136 3.5.2 IterativeMVAAlgorithm.......................138 3.5.3 ApproximateSolution..........................139 3.6 Visit Ratios and Routing Probabilities ...................140 3.6.1 VisitRatiosandOpenCircuits..................142 3.6.2 VisitRatiosandClosedCircuits.................143 3.7 MultipleWorkloadsinClosedCircuits ...................144 3.7.1 WorkloadClasses..............................144 3.7.2 BaselineAnalysis..............................145 3.7.3 AggregateAnalysis ............................146 3.7.4 ComponentAnalysis...........................150 3.8 WhenIsaQueueingCircuitSolvable?....................151 3.8.1 MVAIsaStyleofThinking.....................152 3.8.2 BCMPRules .................................153 3.8.3 ServiceClasses................................154 3.9 ClassicComputerSystems..............................155 3.9.1 Time-ShareScheduler..........................155 3.9.2 Fair-ShareScheduler...........................157 3.9.3 PriorityScheduling ............................158 3.9.4 ThreadsScheduler.............................160 3.10 WhatQueueingModelsCannotDo......................161 3.11 Review...............................................163 Exercises...................................................164 4 Linux Load Average—Take a Load O?! ....................167 4.1 Introduction..........................................167 4.1.1 LoadAverageReporting .......................168 4.1.2 WhatIsan“Average”Load? ...................169 4.2 ASimpleExperiment ..................................170 4.2.1 ExperimentalResults ..........................172 Contents xix 4.2.2 Submerging Into the Kernel. ....................173 4.3 LoadCalculation......................................174 4.3.1 Fixed-PointArithmetic.........................175 4.3.2 MagicNumbers ...............................176 4.3.3 EmptyRun-Queue ............................178 4.3.4 OccupiedRun-Queue ..........................179 4.3.5 ExponentialDamping..........................180 4.4 Steady-StateAverages .................................183 4.4.1 Time-AveragedQueueLength...................184 4.4.2 LinuxSchedulerModel.........................184 4.5 LoadAveragesandTrendVisualization ..................187 4.5.1 WhatIsWrongwithLoadAverages .............187 4.5.2 NewVisualParadigm..........................187 4.5.3 ApplicationtoWorkloadManagement ...........189 4.6 Review...............................................190 Exercises...................................................190 5 Performance Bounds and Log Jams........................191 5.1 Introduction..........................................191 5.2 Out of Bounds in Florida...............................191 5.2.1 LoadTestResults .............................192 5.2.2 Bottlenecks and Bounds ........................192 5.3 Throughput Bounds ...................................193 5.3.1 Saturation Throughput.........................193 5.3.2 Uncontended Throughput ......................194 5.3.3 OptimalLoad.................................195 5.4 Response Time Bounds ................................196 5.4.1 UncontendedResponseTime....................196 5.4.2 SaturationResponseTime......................196 5.4.3 Worst–CaseResponseBound ...................197 5.5 Meanwhile, Back in Florida ... ..........................198 5.5.1 Balanced Bounds ..............................199 5.5.2 BalancedDemand.............................199 5.5.3 Balanced Throughput ..........................199 5.6 TheX–Files:EncounterswithPerformanceAliens.........201 5.6.1 X-WindowsArchitecture .......................201 5.6.2 ProductionEnvironment .......................202 5.7 CloseEncountersofthePerformanceKind................202 5.7.1 CloseEncountersI:Rumors ....................202 5.7.2 CloseEncountersII:Measurements ..............203 5.7.3 CloseEncountersIII:Analysis ..................203 5.8 PerformanceAliensRevealed............................205 5.8.1 OutofSight,OutofMind......................205 5.8.2 Log–Jammed Performance . .....................207 5.8.3 ToGetaLogYouNeedaTree..................208 xx Contents 5.9 X-Windows Scalability .................................210 5.9.1 MeasuringSiblingX-Events.....................210 5.9.2 SuperlinearResponse ..........................211 5.10 Review...............................................212 Exercises...................................................212 Part II Practice of System Performance Analysis 6 Pretty Damn Quick (PDQ)—A Slow Introduction .........215 6.1 Introduction..........................................215 6.2 HowtoBuildPDQCircuits.............................215 6.3 Inputs and Outputs....................................215 6.3.1 SettingUpPDQ ..............................216 6.3.2 SomeGeneralGuidelines.......................218 6.4 SimpleAnnotatedExample.............................219 6.4.1 CreatingthePDQModel.......................219 6.4.2 ReadingthePDQReport.......................221 6.4.3 ValidatingthePDQModel .....................222 6.5 PerlPDQModule .....................................223 6.5.1 PDQDataTypes..............................223 6.5.2 PDQGlobalVariables .........................224 6.5.3 PDQFunctions ...............................225 6.6 FunctionSynopses.....................................225 6.6.1 PDQ::CreateClosed............................225 6.6.2 PDQ::CreateMultiNode ........................226 6.6.3 PDQ::CreateNode .............................226 6.6.4 PDQ::CreateOpen.............................227 6.6.5 PDQ::CreateSingleNode........................228 6.6.6 PDQ::GetLoadOpt ............................228 6.6.7 PDQ::GetQueueLength.........................229 6.6.8 PDQ::GetResidenceTime.......................229 6.6.9 PDQ::GetResponse ............................230 6.6.10 PDQ::GetThruMax............................231 6.6.11 PDQ::GetThruput. ............................231 6.6.12 PDQ::GetUtilization ...........................232 6.6.13 PDQ::Init ....................................232 6.6.14 PDQ::Report .................................233 6.6.15 PDQ::SetDebug...............................234 6.6.16 PDQ::SetDemand .............................235 6.6.17 PDQ::SetTUnit ...............................236 6.6.18 PDQ::SetVisits................................236 6.6.19 PDQ::SetWUnit...............................237 6.6.20 PDQ::Solve...................................237 6.7 ClassicQueuesinPDQ.................................238 Contents xxi 6.7.1 DelayNodeinPDQ ...........................238 6.7.2 M/M/1inPDQ...............................238 6.7.3 M/M/m inPDQ..............................239 6.7.4 M/M/1//N inPDQ...........................239 6.7.5 M/M/m//N inPDQ ..........................240 6.7.6 FeedforwardCircuitsinPDQ ...................240 6.7.7 FeedbackCircuitsinPDQ......................242 6.7.8 ParallelQueuesinSeries .......................244 6.7.9 MultipleWorkloadsinPDQ ....................246 6.7.10 PriorityQueueinginPDQ......................252 6.7.11 Load-DependentServersinPDQ ................258 6.7.12 Bounds Analysis with PDQ .....................263 6.8 Review...............................................264 Exercises...................................................264 7 Multicomputer Analysis with PDQ ........................267 7.1 Introduction..........................................267 7.2 MultiprocessorArchitectures............................268 7.2.1 SymmetricMultiprocessors .....................269 7.2.2 MultiprocessorCaches .........................270 7.2.3 CacheBashing ................................271 7.3 MultiprocessorModels .................................272 7.3.1 Single-BusModels.............................273 7.3.2 ProcessingPower..............................274 7.3.3 Multiple-BusModels...........................276 7.3.4 CacheProtocols...............................278 7.3.5 IronLawofPerformance .......................287 7.4 MulticomputerModels.................................289 7.4.1 ParallelQueryCluster .........................290 7.4.2 QuerySaturationMethod ......................294 7.5 Review...............................................298 Exercises...................................................299 8 How to Scale an Elephant with PDQ ......................301 8.1 AnElephantStory ....................................301 8.1.1 What Is Scalability? ...........................302 8.1.2 SPECMultiuserBenchmark ....................303 8.1.3 Steady-stateMeasurements .....................305 8.2 PartsoftheElephant..................................306 8.2.1 ServiceDemandPart ..........................307 8.2.2 ThinkTimePart..............................307 8.2.3 UserLoadPart ...............................308 8.3 PDQ Scalability Model. ................................308 8.3.1 Interpretation.................................311 8.3.2 Amdahl’sLaw ................................312 xxii Contents 8.3.3 TheElephant’sDimensions.....................314 8.4 Review...............................................315 Exercises...................................................315 9 Client/Server Analysis with PDQ..........................317 9.1 Introduction..........................................317 9.2 Client/ServerArchitectures.............................318 9.2.1 MultitierEnvironments ........................319 9.2.2 Three–TierOptions............................319 9.3 BenchmarkEnvironment ...............................321 9.3.1 PerformanceScenarios .........................322 9.3.2 WorkloadCharacterization .....................322 9.3.3 DistributedWorkflow..........................324 9.4 Scalability Analysis with PDQ ..........................325 9.4.1 BenchmarkBaseline ...........................326 9.4.2 ClientScaleup ................................333 9.4.3 LoadBalancerBottleneck ......................334 9.4.4 DatabaseServerBottleneck.....................334 9.4.5 ProductionClientLoad ........................335 9.4.6 SaturationClientLoad.........................336 9.4.7 Per-ProcessAnalysis...........................338 9.5 Review...............................................339 Exercises...................................................339 10 Web Application Analysis with PDQ ......................341 10.1 Introduction..........................................341 10.2 HTTPProtocol .......................................341 10.2.1 HTTPPerformance............................346 10.2.2 HTTPAnalysisUsingPDQ ....................347 10.2.3 Fork-on-DemandAnalysis ......................348 10.2.4 PreforkAnalysis ..............................349 10.3 Two-TierPDQModel..................................355 10.3.1 DataandInformationAreNottheSame .........355 10.3.2 HTTPdPerformanceMeasurements .............355 10.3.3 JavaPerformanceMeasurements ................357 10.4 MiddlewareAnalysisUsingPDQ ........................357 10.4.1 ActiveClientThreads..........................359 10.4.2 LoadTestResults .............................359 10.4.3 DerivedServiceDemands.......................360 10.4.4 NaivePDQModel.............................360 10.4.5 AddingHiddenLatenciesinPDQ ...............365 10.4.6 Adding Overdriven Throughput in PDQ..........366 10.5 Review...............................................370 Exercises...................................................370 Contents xxiii Part III Appendices A Glossary of Terms .........................................373 B A Short History of Bu?ers.................................385 C Thanks for No Memories ..................................391 C.1 LifeintheMarkovLane................................391 C.2 ExponentialInvariance.................................392 C.3 ShapePreservation ....................................394 C.4 ACounterexample.....................................394 D Performance Measurements and Tools .....................397 D.1 PerformanceCountersandObjects ......................397 D.2 JavaBytecodeInstrumentation..........................397 D.3 GenericPerformanceTools .............................398 D.4 DisplayingPerformanceMetrics.........................398 D.5 StoringPerformanceMetrics............................401 D.6 PerformancePredictionTools...........................401 D.7 HowAccurateareYourData? ..........................402 D.8 AreYourDataPoissonian? .............................402 D.9 PerformanceMeasurementStandards ....................407 E Compendium of Queueing Equations ......................409 E.1 Fundamental Metrics ..................................409 E.2 QueueingDelays ......................................410 F Installing PDQ and PerlPrograms .........................411 F.1 PerlScripts...........................................411 F.2 PDQScripts..........................................412 F.3 Installing the PDQ Module .............................412 G Units and Abbreviations...................................415 G.1 SIPrefixes............................................415 G.2 TimeSu?xes .........................................415 G.3 CapacitySu?xes......................................415 H Solutions to Selected Exercises ............................417 Bibliography...................................................421 Index ..........................................................427
王小平版遗传算法的光盘源代码
王小平版遗传算法的光盘源代码 SGPC: Simple Genetic Programming in C by Walter Alden Tackett and Aviram Carmi (gpc@ipld01.hac.com) Version 1.1 (c) 1993 by Walter Alden Tackett and Aviram Carmi This code and documentation is copyrighted and is not in the public domain. All rights reserved. Genetic Programming is a method of "Adaptive Automatic Program Induction" originally created by John Koza and James Rice of Stanford University. SGPC is a C implementation of Genetic Programming: it is a C program which writes LISP programs. These programs are tailored by the system to solve a problem specified by the user. Koza and Rice have provided to the public a version of Genetic Programming which is written in LISP. SGPC offers greater portability and about 25-50 times improvement in execution speed due to a highly optimized C implementation. For further information on Genetic Programming See: _Genetic_Programming_ by John R. Koza, MIT Press 1992 "Genetic Programming for Feature Discovery and Image Discrimination" by Walter Alden Tackett in _Genetic_Algorithms:_Proceedings_of_the_ Fifth_International_Conference_ (GA93), S. Forrest Ed., Morgan- Kaufman 1993 To participate in our on-line Internet e-mail forum send your subscription request to: genetic-programming-request@cs.stanford.edu Basically, the code does the same things that Koza & Rice s simple LISP does and is set up to handle multiple populations as well (e.g., for co-evolution). You need to provide three modules, setup.c, fitness.c, and prob.h, in a subdirectory named PROBNAME, where PROBNAME is some descriptive name of the problem. E.G., in the version we ship we include REGRESSION/setup.c and REGRESSION/fitness.c, Which do Koza s simple regression problem. setup.c contains functions to setup the function table, the terminals table, and code for the functions in the function table. prob.h contains prototypes for the user defined functions. fitness.c contains functions to evaluate and validate populations and trees, early termination, and definition of the fitness (training and test) cases. As a second example, for your enlightenment, we include the ADF problem which shows you how to build a simple 2-class "dendritic" classifier (see my paper in the sfi account). You should not need to modify any of the other myriad files. COMPILING Source code for the kernel system is in the sub-directory `lib . Source code for problem depended modules are in sub-directories named after the problem. There is a Makefile in the top level directory which invokes the Makefile in the problem specific directory, which invokes the Makefile in the `lib directory (if needed). The source in the lib directory is compiled into an object library file, which is then linked with the problem specific objects. Read the notes in the Makefiles in all the sub-directories, make any necessary changes to fit your system, and then type: make depend PROBLEM=PROBNAME make PROBLEM=PROBNAME where PROBNAME is the name of the subdirectory where the problem specific setup.c and fitness.c files are. EXECUTING the executable is called gpcPROBNAME and will be in the PROBNAME directory. gpcPROBNAME [-d nrow ncol] npops ngen (pop0_pfile|`none )... [seed] NOTE: you must have a parameters file name for each population. EXAMPLE gpcREGRESSION 2 100 none pop1_file 1234 will run gpcREGRESSION with 2 pops 100 gens with pop0 using the default values, pop1 using values from pop1_file, and 12345 as the initial random seed. On startup default values for the runtime parameters are assigned from hard-coded values, then if a file called "default.in" exists in the current directory, values are read from it and override the hard-coded values. If a parameters file name for a population is present on the command line, values from this file override the previous values for that population, else if `none is specified on the command line, the parameters will retain the default values. Remember you must specify either a population params file or `none on the command line for each population. Note: since the random seed value is not a population parameter but it can be specified in the population parameters file, if there are multiple populations, and no seed value was specified on the command line, the value read from the last population parameters file will be used. Some salient points about the modules which are provided for you: The main() is located in lib/gpc.c The top-level loop which iterates over the generations is in generations.c The data structures which you must work with are in the file gpc.h Expressions (trees) are evaluated via calls to eval(tree *t) in eval.c. Trees are operated on using routines in treeops.c and can be read/written using operations in treeio.c. You will get some tutorial feel for using the data structures involved by examining the initializations which take place in populations.c and generations.c. In general, the modules are descriptively named: e.g., selection.c, crossover.c, mutation.c. CREATING YOUR OWN PROBLEMS First create a sub-directory under the top-level sgpc directory and name it a descriptive name. Copy the Makefile and optionally the fitness.c setup.c and prob.h files to the new directory. FITNESS.C Here are the functions you must include in the fitness.c module: /* assigns standardized fitness values to all members of each population pop[0]...pop[numpops-1] */ void evaluate_fitness_of_populations ( int numpops, /* number of populations */ int numgens, /* number of generations */ pop_struct *pop /* the population array */ ); /* returning != 0 from this routine halts SGPC at the end of the generation, eg, if a "perfect" (ha!) individual is found */ int terminate_early ( int numpops, int numgens, pop_struct *pop ); /* creates the array of fitness cases, or does other startup peculiar to your problem */ void define_fitness_cases ( int numpops, int numgens, pop_struct *pop ); /* this routine is used to test the best-of-generation individual against a separate set of test cases which were not used in training (i.e., in generating the fitness values which drive selection). The best-of-run individual is determined using the figure returned from this function */ float validate_fitness_of_tree( int numpops, int numgens, pop_struct *pop, tree *t ) SETUP.C Here are the functions you must include in the setup.c module: /* assigns function pointers, print names, arity, macro-flag, etc, to function table entries for all populations */ void make_function_table ( pop_struct *pop ); /* assigns function pointers, print names, arity, macro-flag, etc, to terminal table entries for all populations */ void make_terminal_table ( pop_struct *pop ); In addition, you declare all of the actual function code for you function set in setup.c. A declared function can either be a function or a macro: a function has an array of values (eg float *args;) passed into it as arguments, whereas a macro has an array of unevaluated expressions passed in, so that some of them may remain unevaluated to prevent side-effects. Here is how the properties of a function are assigned in make_function_table(pop_struct *pop): pop[0].function_table[0].arity = 2; pop[0].function_table[0].macro = FALSE; pop[0].function_table[0].enabled = TRUE; pop[0].function_table[0].printname = "+"; pop[0].function_table[0].code = plus; Here is the assignment of a macro: pop[0].function_table[4].arity = 4; pop[0].function_table[4].macro = TRUE; pop[0].function_table[4].enabled = TRUE; pop[0].function_table[4].printname = "IFLTE"; pop[0].function_table[4].code = iflte; Here is how the functions they point to are declared: For the function plus: GENERIC plus(GENERIC *args) { return args[0]+args[1]; } For the macro iflte: /* note that args are unevaluated trees, not GENERIC values */ GENERIC iflte(tree **args) { return ((eval(args[0]) < eval(args[1])) ? eval(args[2]) : eval(args[3])); } Note that in the code above, the type generic can be set by the TYPE definition set to the make file: default is #define GENERIC float. TERMINAL TABLE: We play some games here. Here is the definition of a terminal from make_terminal_set(pop_struct *pop): pop[0].terminal_table[0].val = 0; pop[0].terminal_table[0].printname = "X"; pop[0].terminal_table[0].constant_generator = random_constant; If we declare that there are N terminals in the terminal set, then there a total of N+1 entries 0...N, where entry N is the randomly generated constant, which should always be declared as follows: pop[0].terminal_table[pop[0].terminal_table_size].val = 0; pop[0].terminal_table[pop[0].terminal_table_size].printname = FORMAT; pop[0].terminal_table[pop[0].terminal_table_size].constant_generator = random_constant; Here, FORMAT is #defined to be the format string associated with the GENERIC type, eg if GENERIC == float then FORMAT == "%f". SAMPLE POPULATION PARAMETERS FILE: seed = 11287 # use this if no value for seed on command line population_size = 100 max_depth_for_new_trees = 6 max_depth_after_crossover = 17 max_mutant_depth = 4 grow_method = RAMPED # FULL GROW selection_method = FITNESSPROP # TOURNAMENT tournament_K = 6 # used only if TOURNAMENT is selected crossover_func_pt_fraction = 0.2 crossover_any_pt_fraction = 0.2 fitness_prop_repro_fraction = 0.1 parsimony_factor = 0.00000 CHECKPOINTING: To enable checkpointing, a non zero value for checkpoint_frequency must be specified in the default parameters file, e.g., checkpoint_frequency = 10 Remember that if you specify value in the population s parameters file, the value read from the last parameters file will be used as the checkpoint frequency for all the populations. The generated ckptfile is named gpc_`hostid _`pid .ckpt.Z, i.e. it is compressed using the compression utility specified in the makefile (Note: ignore ckpt files that are not compressed, the process could have crashed while writing the uncompressed file and it is probably corrupted. Of course, this is assuming that you have `compress on your system.) To recover from a crash, just uncompress the ckpt file and type in: gpc -r ckpt_file_name As a bonus you can now extend a run for more generations (only if checkpointing is enabled, i.e. checkpoint_frequency is greater than zero. Set it to a large value if you do not want checkpointing to slow you down, but do want a checkpoint file for the last generation). To do this, just edit the ckpt file and change the value ONLY for the following line (it should be the fourth line in the file): number_of_generations = 100 ^^^ to the new total number of generations, i.e. to extend the run by 10 gens replace 100 by 110. **************************************************************************** FAQ S FROM OUR EMAIL ARCHIVES: > First, do you use mutation? I couldnt find a mutation parameter that easily accessible... Yes. It is implicit, like in Koza & Rice s code: it is 1.0 - (crossover_func_pt_fraction + crossover_any_pt_fraction + fitness_prop_repro_fraction) > > Second, do you have a facilty for inserting pre-created individuals into the > population? Yes- the load_from_file keyword in the parameter file, e.g.: load_from_file = foo.lsp ...in your input parameter file will load the N lisp expressions in file foo.lsp as the first N elements of the population. Also, *don t* include the load_from_file keyword unless you are actually loading a file. > Thanks for the info...I was also curious how I could prohibit the > random constants from being terminals...ie I do not wish/need to use > random constants and I was wondering how best to remove them...The solution > is somewhat obvious maybe (dont include them in the terminal table) but then > I was a bit concerned given all of the warnings that there are N+1 > terminals.. > Yet another undocumented feature (YAUF :), in lib/gpc.h change: #define ALLOW_CONST 1 to: #define ALLOW_CONST 0 You will need to recompile the entire libgpc object library. i.e., you cannot have this set to different values for different problems w/o recompiling the whole <em>damn</em> thing. SGPC 1.0 is shipped with three makefiles: Makefile - sun-specific makefile: slick, cryptic, non-portable. gMakefile - gnu makefile: you can find gnu make for most machines. Ask your local systems hacker to help you find it on the net and install it. make.script - a shell script for compiling SGPC, may require some editing if you have changed directory names or the PROBLEM you are working on. Basically, if you can t run this you re not running Unix. The c-code itself should be portable to standard Unix systems. The only portability issues should surround the use of the system qsort routine (we provide one ourselves, anyway) the timing routines (you don t need this unless you re anal, anyway) and mallopt (you don t *have* to use mallopt, but it helps to ensure locality and reduce fragmentation). Of course this is only an estimate and your actual mileage may vary.
ImpREC 1.7c
=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~= ~ Import REConstructor v1.7c FINAL by MackT/uCF2000 in 2001-2008 ~ = = ~ - *for Windows 9x, ME, NT, 2K, XP, Vista32/64* - ~ =~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~= If you would like to help continue developing and bug fixing ImpREC and you have ideas, suggestions or bug fixes please visit Tuts 4 You forum in the following topic to share your ideas: http://www.tuts4you.com/forum/index.php?showtopic=6410 Thank you! v1.7c FINAL (PUBLIC VERSION) ---------------------------- - Misc - Fixed bug introduced in 1.7b when DLL's have discardable sections (jstorme) v1.7b FINAL (PUBLIC VERSION) ---------------------------- - Misc - Fixed invalid API bug in user32.dll on Windows 98 (jstorme) - Modified code to improve support for discardable/unreadable sections (jstorme) - Fixed ImageBase problem with DLL's when "Use PE Header from Disk" is checked (jstorme) - Added an "ImpREC Classic" looking version v1.7a FINAL (PUBLIC VERSION) ---------------------------- - Misc - Fixed Win2K crash, AllocConsole was replaced with ActivateActCtx (jstorme) v1.7 FINAL (PUBLIC VERSION) --------------------------- - Misc - Fixed RestoreLastError API set to SetLastError for WinXP/Vista compatibility (MaRKuS_TH-DJM) - user32.dll is always read from the system, prevents a crash from corrupted PE of user32.dll (MaRKuS_TH-DJM) - Latest version of psapi.dll (6.0.6000.16386) included - Fixed Vista64 crash bug (jstorme) - GUI modified and improved (based upon Fly's modification) - Updated/corrected plugins and deleted dups v1.6 FINAL (PUBLIC VERSION) --------------------------- - Misc - Finally fixed the bug in the check for adding section (Thanks to Christoph) v1.6 beta *PRIVATE* ------------------- - Tracers - Tracer Level3 - Added EIP Log - Misc - Finally, support relative calls rebuild (not with the loader yet) - Added a disassembler window for redirected code - Added colour to all known imports (Thanks to Jeff Schering) - Added a hex viewer (built with the disassembler) - Fixed blink in RichEdit control - Checkbox "OpCodes" is enable/disable depending on "Hex View" (Thanks to Muffin) - Removed the useless '/' when there's no name (ordinal only) - Disassembler is allowed on valid slot too now - Fixed HexView to show all printable chars - Added disasm comment for where - Added Right Click function on disasm code to ease the life (TRY IT!) - Added 'Get Imports Filter' in 'Advanced Commands' (Greetings to Titi) - Tooltips added in Options - Fixed bug in "Fix dump" renaming (with the char '_' before the ext) - Added Original First Thunks rebuilder (in Options) - Fixed bug on disabled editboxes (you could edit them.... erm) - Added checks in PEFile.cpp for invalid executables (Thanks to Snacker!) - Fixed some possible problems on sscanf and ordinals ("%X" with WORD type) v1.5.1 beta2 *PRIVATE* ---------------------- - Tracers - Error codes updated for the Tracers Level2 and 3 - Misc - Fixed bug from the 1.5.1 beta1 in the Import Editor (a string bug) - Fixed bug on validation check for the 'Congratulations' text (Thanks to LordByte) - Fixed bug in the (Thanks to LordByte) - New imports scheme added (NOT COMPLETE SO DO NOT USE IT) - Support relative calls rebuild => visible with a (R) tag in imports - Fixed a bug with "Create New IAT". It can now manage a thunk which has several apis of different module (Thanks to EOD) - Added 'Load PE Header'. It could be useful to force ImportREC to use your own PE Header (Thanks to EOD) v1.5.1 beta1 *PRIVATE* ---------------------- - Tracers - Tracer Level3 - New approach (Thanks to EliCZ) - Support SEH chain - No more FS instructions emulation - Dumb Mode (YES, it could be useful for redirected scheme which copies the start code of an API and jump later. It has the behaviour of the Tracer Level1 but it really executes the code) - Misc - Added 'Get API Calls' dialogbox to set addresses filter and heuristics - Added 'Mode Cloak' (for anti-imprec tricks) v1.5 *PRIVATE* -------------- - Loader - Clean up code (the injected loader) - Added an IRC log to explain how to use it (Greetings to LaBBa) - Tracers - Error codes updated for the Tracers Level2 and 3 - Plugin Tracer - Redesigned interface for good reasons (See ) - All examples have been updated for the new interface - Support 'Exact Call' feature - GUI switched into a Submenu (ala WorkerBee#2 by ZigD) - Misc - 'AutoTrace' will not use the Tracer Level2 anymore (play CAREFULLY with the TL2 because it's a global hook) - Windows 95 Support (Thanks to EliCZ, Unknown One and ZigD for testing) - Tested under NT4 (Thanks to Unknown One) - The Import Editor (double click on a function) will look for the nearest valid function in the thunk and will get its module name. => Much faster when editing each function by hand. - Improved 'Exact Call' (It will not retrace all exact calls from a slot if they have already been resolved) - New Module Loader (It should be faster) - Support function names which have more than 256 characters. ImportREC left when clicking on (Thanks to ToyBomB and shandi for reports) - added (Right click on the Log listbox) - Fixed Import Editor to look for the name first before looking for the ordinal - Added 'Skip Main Slot' in Options. It will allow you to trace *ONLY* on all Exact Calls. The main slot will be skipped by the tracer. - will stop any tracers (except 'Plugin' if you did not manage it) even when you have selected several slots to trace - ApiHooks Updated (Greetings to EliCZ) - Added an Exact Calls window (right click on the tree) - Added Remove buttons - Sort datas by column when clicking on it (Yop G-RoM! ;p) - will set the IAT RVA and Size in the PE Directories to 0 (Thanks to Crusader) - *ALL* docs have been updated v1.4.2+ ------- - Misc - Fixed wrong image base/size usage when disabling "Use PE Header From Disk" AGAIN! v1.4.2 ------ - Loader - Finally fixed the bug when rebuilding imports of ripped layers (sometimes, it produced an invalid PE file) - Tracers - Tracer Level3 - A little bit faster - Fixed wrong opcodes (Damn copy&paste! Erm)... (Thanks to necrotoad for his target so i could find that bug) => Should work for latest SD2 => The target should not quit anymore under XP - Misc - Added a filter to "Get API Calls" to get valid addresses only - Fixed wrong image base usage when disabling "Use PE Header From Disk" for reloc'ed target for example (Thanks to Thigo) v1.4.1a ------- - Tracers - Tracer Level1 - Fixed a little bug added from the previous version (It could trace into k32.dll... D'oh myself!) v1.4.1 ------ - Loader - Can handle Kernel32 Ordinal - Tracers - Tracer Level1 - It will not be fooled anymore by latest ASProtect Emulated API - Misc - Erratum: "Fix Damaged PDB" is for Win9x/ME only! - "Create New IAT" feature - "Select Code Section(s)" to precise where is the code in the target - Fixed bug when loading imports file which contains Exact Call with ordinal - Debug stub scheme added (for getting API from an executable which was compiled in debug mode) - Full Dump (can dump EXE & DLL and it should work for antidumping tricks) v1.4 ---- - Tracers - Tracer Level1 - Fixed a small bug on the stack emulator (D'oh! Tamus! :p) - Tracer Level3 - Recoded from scratch (Thanks a lot to G-RoM for his precious help and patience) - Plugin - Asprotect v1.2x Emulated API Plugin (Thanks to ZigD) - Misc - Use PE Header informations from dump or disk (in Options) - Debug privilege is now managed and damaged PDB can be repaired (Thanks to EliCZ) - Renormalized exports (for Win9x/ME only) - Fixed a GPF when using the wheel mouse (or arrows keys) just after selecting a process - "Stick" current imports with new added ones correctly (when you do GetImports with several contigous regions) - "Get API Calls" feature - "Exact Call" for Safecast/Safedisc 2 redirections - Load & Save "Exact Call" Imports - Updated to APIHooks 5.6 v1.3 ---- - Import Editor - An editbox for entering the name of the API (MSDN-like when using Index) - Loader - Layers Auto Finder (with recursion) - Layers editor (add/modify/remove) - Improved relocations - Multiple modules can cohabit in a same thunk - Direct calls/jumps to any imports in all layers, are rebuilt (for portability) - Tracers - Tracer Level1 - A little stack emulator was implemented (very basic though) - Plugin Tracer - TRACERS LEVEL 2 AND 3 ARE STILL NOT COMPLETE AND THERE JUST FOR EXPERIMENTATION. THEY ARE LAME so use them if YOU ARE BORED AND NOT AFRAID TO CRASH your computer, YOU ARE WARNED. - Misc - Improved IAT scanner + Bug fixed on the invalid IAT size (negative) found by it - DLL's names are now based on their filename and not on their header structure - New ApiHooks and as usual it still is impressive how it gains speed each time! (Thanks to EliCZ again) - Check on overlapped IAT by new imports (when not adding a new section) v1.2 *Final* ------------ - Fixed a little bug when there is only one invalid pointer and loader is activated, the dialogbox for entering interval of ripped data/code didn't appear. - Fixed a bug in showing new import size when it is empty (0x100 instead of 0) - Added error managing in the loader if it can't find a dll or an api. (So its size has grown up a little bit) - Fixed a bug on wrong section table location when loading PE files (YODAAAAA!!!!!! ;-)) (and for all my PE related code too...) - ApiHooks updated again!! Thanks to EliCZ, it's really faster than before... Wow! ;-) - Autotrace (do not expect a miracle from its part). Moreover prepare to crash if you manage to use it because it uses the tracer level2... you are warned!! :-) - Improved Ripper analyzer v1.2 RC1 PRE Release -------------------- - Added a loader against faked APIs in thunks. - Fixed a little bug when loading a tree for the last parameter if it has only one character - Get the invalid pointers in the running process when reloading a tree which contains some - Added a flag for loader in tree text files (still is compatible with v1.2b3 version though) - ApiHooks updated - You can rebuild DLL now by clicking on "Pick DLL" button - I decided to retire my Tracer L3 for the moment because it's too buggy v1.2b3 ------ - Useless but funny, changed icon... thanks to Avl!s :-) - Function is correctly selected when double clicking on it for Editing. - Oops! Where was the and file on previous versions???! :-) - Don't use anymore GetCurrentDirectory for looking for - A little note when launching the first time - TimeOut option for Tracer Level2 and 3 - Fix EP to OEP option when fixing a dump - Options are saved in an INI file - Maintaining "Shift" key for Tracer Level1 shows the Module name in the MessageBox title instead of "huhu" :-) and moreover it shows VA correctly now. - Correct ImageSize in PE Header when adding a new section (Windows 98SE and 2k do it automatically but it is better to do it ourselves though) - Added the old good Dennison's uCF logo (i mean the logo, not you Denni! ;-P) in 'About' dialog box - Replace all "between" by "by the way" in all txt files... :-x - Stastistics are shown regularly (thx to Pal) - 'Show Suspect' button (thx to Pal) - Fixed a GPF when closing the running target and continuing to rebuild it (thx to Pal) - Load & Save Tree in text format. (You can still load old binary ".rec" files) (Pal, you can edit them manually now! :-)) - Fixed a bug in my module loader when the module image base is different to its pe header one (ie when it has been moved by windows). (BIG THX TO PAL! ;-)) - Module loading log is more precise now - First prebeta version of tracer l3 (still is VERY BUGGY! You are WARNED!) v1.2b2 ------ - Argh!!!! Export ordinals were fixed now! Sorry, i have forgotten to add the Base for all ordinals!! Marf! That's why my "Import all by ordinal" option didn't work under NT/2000... It's now reactivated under those systems (even if your exe will not be portable to another system) - Fixed a GPF (oops! :-P) when invalidate some particular APIs - Load and Save Tree Models - Enable and Disable controls (buttons and editboxes) when necessary - Tracer level2 is slower (not under Win2000! ;-)) but less buggy than previous version - "Cut thunk" action in right click popup menu. Thanks to my best beta tester Thigo (normal, he's alone ;-P) for reporting me tELock tricks. (Greetz to tE! by the way) ;-) (Read Tips.txt for further details) - Current directory will be the path of your selected process for browsing files - Statistics after clicking on "Get Import" were fixed - Readme.txt was updated. :-) v1.2b1 ------ - Fixed a lame bug on my original IAT finder (a pb on computing its size... thx Chris ;-)) - Multiple Tree Selection - Right Click on Tree (invalidate functions, delete thunk...) - Tracer Level1 (Disasm) was improved (with magic 'Shift" key... look at Tips.txt) - *New* Tracer Level2 (Hook) uses ApiHooks. And big thanks to Yoda for advising me it ;-) - Import module name is auto updated depending on all its functions v1.1 ---- - I have forgotten to considerate the max recursion of the tracer in the options! Now it's fixed. Shame on me, yeah! ;-) - Give up the method to the start address (image base) bounds of the target too (not reliable). Unreal Tournament has shown me that ;-)... BY THE WAY, WHAT A GAME! :-D - Improved tracer again - Improved Original-IAT Auto Finder - GUI : Tree view for import - Default parameter is 'Add new section' DLL v1.0 -------- - DLL was released for GUW32 (by Christoph/UG2000) with its open source code ;-) v1.0 ---- - Give up the method with the limit address of the target (not reliable). Need to reput it in an option - "Auto-IAT Search" button added - "Ultra Arrange" button added - Modify entry point to given OEP into the dump file when fixing it v0.7 ---- - Reorganized code to export it in a dll v0.6a ----- - Show first (or second) invalid element in the 'Imported Function Found' list if it detects a problem in a thunk array - You can change the module of any import functions with the Import Editor - Disable "Import all by ordinal" under NT/2000... It does definitively not work :-( v0.6 ---- - No more leaked memory... I swear! :-) - Support NT/2K by fixing all forwarding export functions (thanks to +The Owl+ AGAIN! ;-)) (Tested on an ASProtected game with total success under win2000 (i mean portable on another system)) - Icedump v6.0.2.2 was released!!! ImportREC will be able to rebuild a 100% portable executable (or very close) with it. (ONLY UNDER WIN9x BY THE WAY) Icedump tries to solve 4 main windows dll which have export functions which point to the same address... => Check it out NOW!!! -> http://icedump.tsx.org v0.5 ---- - Added 2 buttons "Previous ????" and "Next ????" for looking at unresolved pointers quickly - Improved tracer engine... test it and you will see ;-) - Some errors messages are more comprehensible (for Lutin Noir especially ;-D) - GUI has changed a little bit - 'About' diabogbox finally added v0.4 ---- - A memory bug fixed when freeing export infos - "Add new section" in the dump file for the new import datas v0.3a ----- - Bug fixed on hint value which was always set to 0... erm :-) - Import ASCII name address is now aligned on WORD and not DWORD (more smaller size again) - Little filter on all Editboxes - Getting the size of the memory used by the process for memory bounds testing and the tracer v0.3 ---- - First public release - Tested on win2000 and it can not rebuild correctly because of module which contains some API from kernel32.dll of win95/98! :-( (like RltDeleteCriticalSection, ...). If anyone has a solution, please mail me!!!!! - Added a real tracer engine (from Borg disasm of Cronos) but still need to improve its use - Added a function editor (for fixing Asprotect 'GetProcAddress'-like redirected function by yourself for example) ** Double-click on the function in the "Import Functions Found" list and choose the good API. - Bug fixed : you can fix a dump which does not have RVA=RAW addresses and sizes - Import all by ordinal for smaller import datas v0.2 ---- - Not yet tested on NT/2000 - Fixed a lot of bugs - Added a poor tracer for redirected functions Feb/01/2001 ----------- v0.1 - First release
jquery/js实现一个网页同时调用多个倒计时(最新的)
jquery/js实现一个网页同时调用多个倒计时(最新的) 最近需要网页添加多个倒计时. 查阅网络,基本上都是千遍一律的不好用. 自己按需写了个.希望对大家有用. 有用请赞一个哦!
关于SpringBoot bean无法注入的问题(与文件包位置有关)
问题场景描述整个项目通过Maven构建,大致结构如下: 核心Spring框架一个module spring-boot-base service和dao一个module server-core 提供系统后台数据管理一个module server-platform-app 给移动端提供rest数据接口一个module server-mobile-api 其中server-platform-app 与
将Excel文件导入数据库(POI+Excel+MySQL+jsp页面导入)第一次优化
本篇文章是根据我的上篇博客,给出的改进版,由于时间有限,仅做了一个简单的优化。相关文章:将excel导入数据库2018年4月1日,新增下载地址链接:点击打开源码下载地址十分抱歉,这个链接地址没有在这篇文章上公布出来。希望不是很晚。上篇文章的是这样的一个数据流向:浏览器端打开上传页面,选择文件,上传,将excel上传到服务器,在服务器生成一个excel的文件,并写入Excel,再把excel文件读取...
编译PTAM与PTAMM-记
编译PTAM,弄了一天,终于搞定了。记录一下。  平台说明:Windows XP, VS2008 首先编译libCVD库: 1、依赖toon库,toon作为一个头文件包包含进工程include目录即可;2、toon/internal/config.hh 只保留#define TOON_USE_LAPACK 1这一项即可;(使用lapack和Blas的/MT选项的库,^_^)3、删除l
OPC UA 官网
http://opcfoundation.cn/  中国官网 基金会 http://external.informer.com/s/opcfoundation.org/developer-tools%2Fdeveloper-kits-unified-architecture%2Fsample-applications
VirtualBox COM获取对象失败
错误详情 1. 先来看看错误详情 获取 VirtualBox COM 对象失败.应用程序将被中断.Failed to instantiate CLSID_VirtualBox w/ IVirtualBox, CLSID_VirtualBox w/ IUnknown works.PSDispatch looks broken by some installer featuri
VS2015+Qt5+OpenCV3开发环境配置
本文介绍如何使用VS2015作为编译开发环境,调用OpenCV3.31和Qt5.9.1写图像处理的GUI。 1.目录结构 假设我们要创建一个名为VideoZoom的工程,那么首先按下图构建目录结构,在bin文件夹中存放可执行文件,lib文件夹中放入opencv_world331d.lib,include文件夹下粘贴opencv与opencv2两个文件夹。   2.打开VS2015开始新建工
Ubuntu 14.04, 16.04 安装迅雷
转载地址: http://blog.csdn.net/zhuyucheng123/article/details/51147550
Linux open系统调用流程(2)
1. 书结上文,继续分析do_filp_open函数,其传入4个参数: dfd:相对目录 tmp:文件路径名,例如要打开/usr/src/kernels/linux-2.6.30 flags:打开标志 mode:打开模式 /* * Note that while the flag value (low two bits) for sys_open means: * 00 -
魔兽争霸3冰封王座1.24e 多开联机补丁 信息发布与收集点
畅所欲言!
两个重叠模型模拟双pass,顺便解决透明乱序问题
虚幻4除了能用rendertarget模拟双pass行为,还可以用两个模型来模拟双pass。用两个一模一样的模型,第一个模型渲染customdepth 然后disable rendering in main pass 并且enable dinamic shadow,这样就能有第一层深度和光照信息。然后将第二个模型使用第一个模型在prepass中遗留下来的一些渲染信息,就可以做到上图所示的效果。在卡
spring加载bean实例化顺序
问题来源: 有一个bean为A,一个bean为B。想要A在容器实例化的时候的一个属性name赋值为B的一个方法funB的返回值。 如果只是在A里单纯的写着: private B b; private String name = b.funb(); 会报错说nullpointException,因为这个时候b还没被set进来,所以为null。 解决办法为如下代码,同时
ELF Hook原理
Android ELF HOOK 原理, 修改PLT/GOT表数据实现对导入函数的HOOK
Android(cacerts.bks)添加根证书
Android(cacerts.bks)添加根证书Android系统中CA证书文件的位置在:/system/etc/security/cacerts.bks注意:Android 2.2官方系统中是没有CNNIC SSL这个证书的,这是因为中国网络环境原因而没有内置的。如果是你是使用国行版的Android手机,可访问https://www.enum.cn 检查是否内置了CNNIC的CA,如果有的话,你可以使用原版cacerts.bks,这个文件所有android系统通用。以下是导入CA文件到cacerts.b
麻将查胡算法 数据结构设计与实现
根据前面一片博客传送门,算法介绍,这里来实现核心部分 中间用到的一些功能函数,大家自己搞定吧,我把核心算法po出来大家参考 一、数据结构设计c# 算法流程:轮流判断每一张牌是否符合要求 找出所有可以当将的牌 while(将牌没遍历完) {     去除将牌,提取数组byte[] cardgroup     while(数组不为空)     {           取
利用AccessibilityService实现“微信红包”插件
利用AccessibilityService实现“微信红包”插件。 AccessibilityService是android的一个辅助服务抽象类,它是继承Service类,可以用于监听通知栏的变化、窗体改变、窗体内容改变、EditText光标移动、TextView内容改变等事件。
强连通分量及缩点tarjan算法解析
强连通分量: 简言之 就是找环(每条边只走一次,两两可达) 孤立的一个点也是一个连通分量   使用tarjan算法 在嵌套的多个环中优先得到最大环( 最小环就是每个孤立点)   定义: int Time, DFN[N], Low[N]; DFN[i]表示 遍历到 i 点时是第几次dfs Low[u] 表示 以u点为父节点的 子树 能连接到 [栈中] 最上端的点   int
搭建图片服务器《二》-linux安装nginx
nginx是个好东西,Nginx (engine x) 是一个高性能的HTTP和反向代理服务器,也是一个IMAP/POP3/SMTP服务器。Nginx是由伊戈尔·赛索耶夫为俄罗斯访问量第二的Rambler.ru站点(俄文:Рамблер)开发的。 Nginx是一款轻量级的Web 服务器/反向代理服务器及电子邮件(IMAP/POP3)代理服务器,并在一个BSD-like 协议下发行。其特点是占
VM+CentOS+hadoop2.7搭建hadoop完全分布式集群
写在前边的话:        最近找了一个云计算开发实习生的工作,本以为来了会直接做一些敲代码,处理数据的活,没想到师父给了我一个课题“基于质量数据的大数据分析”,NameNode问题来了首先要做的就是搭建这样一个平台,毫无疑问,底层采用hadoop集群,在此之上,进行一些其他组件的安装和二次开发,整体架构如下:          一:安装VM 12.x      下载地址:http://
使用NASM和CL(或LINK)写HelloWorld
原文地址:http://www.tech-juice.org/2011/02/26/assembler-tutorial-hello-world-with-nasm-and-cl-exe-or-link-exe/ 前言 ... 编译汇编代码 我们来编译链接这个名为helloworld.asm的汇编代码 ; This is a Win32 console prog
文章热词 机器学习 机器学习课程 机器学习教程 深度学习视频教程 深度学习学习
相关热词 c# 投屏 c#好看的音乐控件 c# string 转码 c# iis配置 python教程+chm python教程百家号
我们是很有底线的