The Microsoft® Windows Vista® Developer Story includes content for developers, and other technology experts and managers, interested in an in-depth exploration of some of the new and extended features in Windows Vista. Top 10 Ways to Light Up Your Windows Vista Apps provides an overview of these features
標簽： developers Microsoft Developer reg
上傳時間： 2014-11-18
上傳用戶：王者A
實現升級一臺機子上的程序,所有其它機子的程序自動升級. 1.支持多個模塊,支持一個模塊多個文件. 2.文件位置可不為當前目錄. 3.可自動壓縮文件,然后上傳,提高上傳與下載速度. 4.update.exe可自動升級(注:僅隨新系統升級時升級!!!) 使用說明: 1.先創建表,見Table.txt 2.工程所包含的文件,可在uo_updown.uf_check()中定義. (參看原有的!) 3.創建工程時, 請不要把update.pbl生成PBD,這樣保證在同一目錄,可以多個 工程能正確自動升級.
上傳時間： 2014-01-13
上傳用戶：alan-ee
In just 24 lessons of one hour or less, you will be able to build dynamic Web sites using JavaServer Pages. Using a straightforward, step-by-step approach, each lesson builds on the previous ones, enabling you to learn the essentials of JavaServer Pages 2.0 from the ground up. The book includes Apache Tomcat, Sun s reference implementation of JSP, so you can start developing applications immediately.
標簽： JavaServer dynamic lessons build
上傳時間： 2014-11-25
上傳用戶：TRIFCT
本文檔提供JSR120無線消息API規范的說明，也描述Sum的RI的API.
上傳時間： 2014-12-07
上傳用戶：baitouyu
ead file "YD.DOC". Who is the intended user Beginners in assembly and programmers. Features of the program: Yilmaz Disassembler:is an interactive disassembler which lets the user be a part of the disassembling process,is flexible, the user can disassemble in different formats,has user friendly interface, mouse support, pop-up menu commands, short cut key commands, context-sensitive on-line help,and it is cheap. Program s capacity and limitations: Max executable file size is 64 KB. Can not disassemble program of EXE-format.Only 8086/8088 CPU instructions can be disassembled. Disassemble 8087 Math Co-processor s instructions.
標簽： programmers Beginners Features assembly
上傳時間： 2014-06-21
上傳用戶：皇族傳媒
Samples are artificially generated and in no way represent particular individuals. Human names, company names, colleges, software product names are intentionally made up.
標簽： artificially individuals particular generated
上傳時間： 2016-04-13
上傳用戶：無聊來刷下
Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute: pi = (mu*ai - bi)^+ sum(pi) = Pt By Daniel Perez Palomar (last revision: May 10, 2004).
標簽： Waterfilling Fonollosa algorithm Trans-SP
上傳時間： 2014-01-10
上傳用戶：liansi
The second volume in the Write Great Code series supplies the critical information that today s computer science students don t often get from college and university courses: How to carefully choose their high-level language statements to produce efficient code. Write Great Code, Volume 2: Thinking Low-Level, Writing High-Level, teaches software engineers how compilers translate high-level language statements and data structures into machine code. Armed with this knowledge, a software engineer can make an informed choice concerning the use of those high-level structures to help the compiler produce far better machine code--all without having to give up the productivity and portability benefits of using a high-level language
標簽： information the critical supplies
上傳時間： 2014-02-21
上傳用戶：luke5347
These listed libraries are written in WTL. But it s really hard to mix both MFC & WTL together. Obviously, it s not reasonable to ask a developer or a team to giving up MFC and move to the WTL world just because there were some great controls or visual Frameworks written in WTL (there are many things that should be considered especially in a company with hundreds of developers like the company I work for). Unfortunately, there was no such good and free visual Framework in MFC until now. Whatever difficulties there are, I still desire to be able to use them and now my effort is here to be shared with you. Under the Hood
標簽： libraries WTL together written
上傳時間： 2013-12-18
上傳用戶：wcl168881111111
北京大學ACM比賽題目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime numbers. 20 = 3 + 17 = 7 + 13. 42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23. Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.) Anyway, your task is now to verify Goldbach s conjecture for all even numbers less than a million.
標簽： mathematician Christian Goldbach Leonhard
上傳時間： 2016-04-22
上傳用戶：wangchong
