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
