ISO/IEC13239,Information technology-Telecommunications and information exchange between systems-High level data link control(HDLC) procedures
標(biāo)簽： technology-Telecommunications systems-High Information information
上傳時(shí)間： 2013-12-28
上傳用戶：zhaiyanzhong
這是初學(xué)者學(xué)習(xí)匯編語言的必備編譯鏈接工具！ 先要設(shè)置一下環(huán)境變量，下載此壓縮包后，解壓縮到一個(gè)路徑，然后將此路徑添加到系統(tǒng)變量的path下，然后在命令行鍵入masm進(jìn)行編譯，鍵入link進(jìn)行鏈接
上傳時(shí)間： 2014-01-11
上傳用戶：yzhl1988
GPS 接收程序 DEMO。 HsGpsDll Library 1.1 A GPS Control/Component for C/C++ HsGpsDll is a Windows Dynamic Link Library which provides access to any NMEA-183 compliant GPS receiver via a serial communications port. HsGpsDll is designed for use from Visual C, Visual Basic or other languages, capable of calling DLL functions. HsGpsDll allows a user application to read from a GPS device the current GPS position fix, velocity over ground (speed in kilometers per hour), plus number of of sattelites in view, current altitude (against mean sea level) and UTC date and time
標(biāo)簽： HsGpsDll GPS Component Control
上傳時(shí)間： 2014-07-17
上傳用戶：thuyenvinh
CAN1.c and CAN2.c are a simple example of configuring a CAN network to transmit and receive data on a CAN network, and how to move information to and from CAN RAM message objects. Each C8051F040-TB CAN node is configured to send a message when it s P3.7 button is depressed/released, with a 0x11 to indicate the button is pushed, and 0x00 when released. Each node also has a message object configured to receive messages. The C8051 tests the received data and will turn on/off the target board s LED. When one target is loaded with CAN2.c and the other is loaded with CAN1.c, one target board s push-button will control the other target board s LED, establishing a simple control link via the CAN bus and can be observed directly on the target boards.
標(biāo)簽： CAN configuring and transmit
上傳時(shí)間： 2013-12-11
上傳用戶：weiwolkt
1、 有n個(gè)學(xué)生，每個(gè)學(xué)生有m門成績，每個(gè)學(xué)生的m門成績用一單鏈表實(shí)現(xiàn)，n個(gè)學(xué)生所對應(yīng)n個(gè)單鏈表的頭指針用一指針數(shù)組統(tǒng)一存放。 1) 建立該存貯結(jié)構(gòu)。 2) 查找第i個(gè)學(xué)生的某門課成績。 鏈表中結(jié)點(diǎn)結(jié)構(gòu)： struct node {char *nam；/*nam為課程名*/ float sco；/*sco為該門課程的成績*/ struct node *link；/*link為指向下一課程結(jié)點(diǎn)的指針*/
標(biāo)簽：
上傳時(shí)間： 2013-12-14
上傳用戶：TF2015
粒子效果演示(附代碼) 利用C++所提供的一些標(biāo)準(zhǔn)容器很容易實(shí)現(xiàn)粒子效果. 簡單的說就是,將粒子數(shù)據(jù)寫在一個(gè)類里面,有一個(gè)粒子源,不停地生成粒子,然后放入一個(gè)stl::list中(push_back()方法), 然后在一個(gè)循環(huán)中遍例粒子鏈表,并渲染粒子,粒子的參數(shù)并不斷更新,如果粒子的ALPHA值小于0,即不可見了,即代表粒子已經(jīng)死亡, 即從list中刪去(erase()方法), 銷毀死去的粒子很重要, 如果搞忘了這一步, 你的內(nèi)存很快就會(huì)被吃掉干凈了. 第一個(gè)版本是用交錯(cuò)平面畫的粒子. 第二個(gè)版本是用Point Spirit(點(diǎn)精靈)畫的粒子, 可以看看效果上面的區(qū)別 SPACE - 暫停粒子源發(fā)射粒子 LINK中忘記去掉cg.lib cgGL.lib 了, 此程序不需要CG, 如果要編譯請去掉.
上傳時(shí)間： 2013-12-15
上傳用戶：jing911003
EE小站，詳細(xì)介紹，J-Link GDB Server + Eclipse CDT進(jìn)行ARM程序調(diào)試
標(biāo)簽：
上傳時(shí)間： 2017-02-16
上傳用戶：heart520beat
安裝說明: 一:將程序上傳至空間 二:運(yùn)行配置文件 Install.ASP 進(jìn)行配置安裝 三:安裝完畢,自動(dòng)跳轉(zhuǎn)至后臺管理 后臺地址:http://你的域名/Admin/Index.ASP 后臺帳號:admin 密碼:admin 認(rèn)證碼:soyici ************************************************** 官方論壇:http://www.soyici.cn 流量聯(lián)盟:http://www.soyici.com/Link/ **************************************************
標(biāo)簽： Install Admin http ASP
上傳時(shí)間： 2013-12-19
上傳用戶：sxdtlqqjl
Windows applications using C++ and the Microsoft Foundation Class (MFC) library. The text builds from the ground up, first describing the Windows architecture and showing how MFC works with that architecture next covering the document/view framework that simplifies the creation of industrial-strength programs and finally illustrating advanced concepts like the usage of dynamic link libraries (DLL), creating Internet clients, and building form-based applications.
標(biāo)簽： applications Foundation Microsoft Windows
上傳時(shí)間： 2013-12-19
上傳用戶：wpt
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
標(biāo)簽： optimizing different the shortest
上傳時(shí)間： 2014-10-25
上傳用戶：1159797854
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
