/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */
标签： APPROXIMATE ALGORITHM THE SOLUTION
上传时间： 2015-08-20
上传用户：zhangliming420
ACM试题An Easy Problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".
标签： Description computers Problem binary
上传时间： 2013-12-11
上传用户：libenshu01
Reducer: Given a dataset and a file containing a reduct, this program outputs a new dataset containing only the attributes appearing in the reduct file.
标签： dataset containing containi Reducer
上传时间： 2014-01-25
上传用户：牛津鞋
The code, images and designs for this book are released under a Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License. http://creativecommons.org/licenses/by-nc-sa/2.5/ You are free: * to copy, distribute, display, and perform the work * to make derivative works Under the following conditions: *Attribution. You must attribute the work in the manner specified by the author or licensor. *Noncommercial. You may not use this work for commercial purposes. *Share Alike. If you alter, transform, or build upon this work, you may distribute the resulting work only under a license identical to this one. *For any reuse or distribution, you must make clear to others the license terms of this work. *Any of these conditions can be waived if you get permission from the copyright holder. CONTACT ME Please address any questions to info@andybudd.com.
标签： Attribution-NonComm Creative released Commons
上传时间： 2014-01-19
上传用户：chfanjiang
USB海量存储设备类规范包括四个独立的子类规范：(ATA command的那个没有) ①USB Mass Storgage Class Control/Bulk/Interrupt(CBI)Transport ②USB Mass Storage Class Bulk-Only Transport ③USB Mass Storage Class ATA Command Block ④USB Mass Stroage Class UFI Command Specification。 前两个子规范定义了数据/命令/状态在USB上的传输方法。 Bulk-Only传输规范仅仅使用Bulk端点传送数据/命令/状态， CBI传输规范则使用Control/Bulk/Interrupt三种类型的端点进行数据/命令/状态传送。 后两个子规范定义了对存储介质的操作命令。 ATA 命令规范用于硬盘。 UFI命令规范是针对USB移动存储而制定的，实际上UFI命令格式是基于SFF-8070i和SCSI-2规范，总共定义了19个12字节长度的操作命令。
标签： USB Interrupt Storgage Control
上传时间： 2015-08-29
上传用户：aysyzxzm
为你的MFC程序添加宏脚本语言。AppWizard has created this ScriptDemo application for you. This application not only demonstrates the basics of using the Microsoft Foundation classes but is also a starting point for writing your application.
标签： application ScriptDemo AppWizard created
上传时间： 2014-01-27
上传用户：彭玖华
A complete set of bit banged, software driven I2C routines I created for any PIC device - and they work!! These functions are single master only functions, and are ideal for communicating with things like EEPROMs, LCD Drivers, ADC Converters etc
标签： complete routines software created
上传时间： 2013-12-17
上传用户：王小奇
LemonSMS is a component developed in Java that provides a turnkey solution for application developers to incorporate into their Java applications the functionality of sending and processing of incoming SMS messages. LemonSMS acts as a middleware between a Java application and a GSM Modem or Data enabled phone. Because LemonSMS only provides an interface to the added SMS functionality, your application still handles access to data and business logic tier. With the easy-to-use LemonSMS API, developers can easily utilize SMS functionalities provided by LemonSMS.
标签： application component developed developer
上传时间： 2013-12-29
上传用户：大融融rr
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
it is used for initializing stack and c environment .you can open it with ADS 1.2，It is only experiment plan for your study!
标签： initializing environment stack it
上传时间： 2014-01-05
上传用户：xuanjie
