Search - D-I - CodeBus

[Other resource] HS12864

Description: hs12864 液晶显示程序端口说明： 1 vss GND 2 VDD VCC(5v) 3 V0 VCC(5v) 4 D/I PC4 5 R/W PC5 6 E PC3 7 DB0 PA0 ... 14 DB7 PA7 15 CS1 PC1 16 CS2 PC2 17 RST PC0-hs12864 LCD procedures ports : a VSS GND 2 VDD VCC (5v) 3 V0 VCC (5v) 4 D / I PC4 5 R / W E PC3 recurring 6 7 DB0 PA0 DB7 PA7 ... 14 15 16 CS2 CS1 PC1 PC2 17 RST PC0
Platform: | Size: 2521 | Author: 崔敬军 | Hits:

[FlashMX] 有趣的文字鼠标跟随

Description: 有趣的文字鼠标跟随,l　o　a　d　i　n　g字母组成，在打开页面等待的时候可以用-interesting characters with a mouse, a l o d i n g letters in the opening pages awaiting can use
Platform: | Size: 2915 | Author: 彭静 | Hits:

[WinSock-NDIS] windows_ndis_packet_capture

Description: N D I S协议驱动程序源代码用C语言完成，包括四个C语言源文件，分别为p a c k e t . c、o p e n c l o s . c、 r e a d . c和w r i t e . c。C语言头文件p a c k e t . h和资源文件p a c k e t . r c通过D D K提供的b u i l d工具编译生成驱动程序可执行文件p a c k e t . s y s。-S I N D agreements driver source code using C language completed, including four C language source documents for a p c k e t. C, n o p c l e s o. C, a r e d. W r c and i t e. c. C-language header file a p c k e t. H and a resource document p c k e t. R c through D D K for the b u l d i compiler generation tools driver executable file a p c k e t. S y s.
Platform: | Size: 64502 | Author: 张敏 | Hits:

[Other resource] graphic_algorithm

Description: 每对节点间最短路径 Floyd-Warshall 算法 D[i,j]表示从i到j的最短距离； P[i,j]表示从i到j的最短路径上j 的父节点-between each pair of nodes Shortest Path Floyd-Warshall algorithm D [i, j] said from i to j is the shortest distance; P [i, j] said from i to j the shortest path on the parent node j
Platform: | Size: 9430 | Author: changxia | Hits:

[TreeView] verticaltree

Description: While studying electronic engineering and computer science, I participated in a compiler workshop where we had to write our own programming language. To view and analyse the syntax tree for a given program, I wrote a custom drawn tree component those days. The original component was written in Java and I thought it might be useful to have it as a CTreeCtrl derivate. In contrast to some other custom drawn tree controls at CodeProject, this one does not has its own data structure for representing the tree. This means that you do not have to write different code for inserting the tree items when you want to switch from CTreeCtrl. Because this control inherits from CTreeCtrl, it is very easy to activate the stock-functionality which draws the tree in the traditional way.-While studying an electronic engineering d computer science. I participated in a workshop where we compiler h ad to write our own programming language. To vie w and analyze the syntax tree for a given program , I wrote a custom drawn tree component those da ys. The original component was written in Java an d I thought it might be useful to have it as a CTre eCtrl derivate. In contrast to some other custom drawn tree controls at CodeProject. this one does not has its own data structure for r epresenting the tree. This means that you do not have to write different code for inserting the t ree items when you want to switch from CTreeCtrl . Because this control inherits from CTreeCtrl , it is very easy to activate the stock-functio nality which draws the tree in the traditional w ay.
Platform: | Size: 19175 | Author: gaowen | Hits:

[Other resource] EmbeddingDimension_FNN

Description: 假近邻法(False Nearest Neighbor, FNN)计算嵌入维的Matlab程序文件夹说明： Main_FNN.m - 程序主函数，直接运行此文件即可 LorenzData.dll - 产生Lorenz时间序列 PhaSpaRecon.m - 相空间重构 fnn_luzhenbo.dll - 假近邻计算主函数 SearchNN.dll - 近邻点搜索 buffer_SearchNN_1.dll - 近邻点搜索缓存1 buffer_SearchNN_2.dll - 近邻点搜索缓存2 参考文献： M.B.Kennel, R.Brown, H.D.I.Abarbanel. Determining embedding dimension for phase-space reconstruction using a geometrical construction[J]. Phys. Rev. A 1992,45:3403. -false neighbors (False Nearest Neighbor, FNN) calculation embedding dimension of the Matlab program folder : Main_FNN.m-procedure main function, Direct operating this document can be LorenzData.dll-time series produced Lorenz PhaS paRecon.m-phase space reconstruction fnn_luzhenbo.dll-calculated at the main function neighbors SearchNN.dll-point search buffer_SearchNN_1.dll neighbor - Search neighbor point a buffer_SearchNN_2.dll Cache-Cache Search neighbors point two reference Literature : M. B. Kennel, R. Brown, H. D. I. Abarbanel. Determining embedding dime nsion for phase-space reconstruction using a g eometrical construction [J]. Phys. Rev. A 1992 , 45:3403.
Platform: | Size: 100029 | Author: 呆雁 | Hits:

[Anti-virus] Sub7_R.A.I.D

Description: 这是一个类似Sub7的特洛伊木马R.A.I.D的源代码 -This is a similar Sub7 Trojan Horse of the source code R.A.I.D
Platform: | Size: 243876 | Author: 胡 | Hits:

[Other resource] msc1210_ad8input

Description: msc 1210 a/d口的使用，keil 编译-msc 1210 a / d I use, keil compiler
Platform: | Size: 5035 | Author: yangyabo | Hits:

[assembly language] sgj3

Description: 考察例1 4 - 8中的1 4个点。A中的最近点对为(b,h)，其距离约为0 . 3 1 6。B中最近点对为 (f, j)，其距离为0 . 3，因此= 0 . 3。当考察是否存在第三类点时，除d, g, i, l, m 以外的点均被淘汰，因为它们距分割线x= 1的距离≥ 。RA ={d, i, m}，RB= {g, l}，由于d 和m 的比较区中没有点，只需考察i 即可。i 的比较区中仅含点l。计算i 和l 的距离，发现它小于，因此(i, l) 是最近
Platform: | Size: 1686 | Author: 史桂金 | Hits:

[Other resource] sgj4

Description: 邻接矩阵类的根是A d j a c e n c y W D i g r a p h，因此从这个类开始。程序1 2 - 1给出了类的描述。程序中，先用程序1 - 1 3中函数Make2DArray 为二组数组a 分配空间，然后对数组a 初始化，以描述一个n 顶点、没有边的图的邻接矩阵，其复杂性为( n2 )。该代码没有捕获可能由M a k e 2 D A r r a y 引发的异常。在析构函数中调用了程序1 - 1 4中的二维数组释放函数D e l e t e 2 D -adjacency matrix type is the root A d j a c c e n y W D i g r a p h, the category from the start. Procedure 1 2 - 1 is a kind of description. Procedures, use procedures 1 - 1 3 Make2DArray Function of two arrays a group of space allocation, Then a pair of array initialization to describe a n vertices, there is no edge of the adjacency matrix, the complexity of (n2). The code may not caught by M a k e r 2 D. A. r y a trigger abnormal. The destructor method is called in the process 1 - 1 4 2-D array of release function D e l e t e 2 D
Platform: | Size: 1314 | Author: 史桂金 | Hits:

[Other] jiayouwenti

Description: 一个旅行家想驾驶汽车从城市A到城市B（设出发时油箱是空的）。给定两个城市之间的距离dis、汽车油箱的容量c、每升汽油能行驶的距离d、沿途油站数n、油站i离出发点的距离d[i]以及该站每升汽油的价格p[i],i=1,2,…,n。设d[1]=0<d[2]<…<d[n]。要花最少的油费从城市A到城市B，在每个加油站应加多少油，最少花费为多少？-travel home to a car driving from city A to city B (located starting at the fuel tank is empty). Given between the two cities from dis, automobile fuel tank capacity c per liter petrol traveling distance d, PFS along n, i PFS from the starting point of the distance d [i] and the station liter gasoline prices p [i] i = 1, 2, ..., n. Located d [1] = 0
Platform: | Size: 248619 | Author: 陈馨 | Hits:

[Other resource] Dijkstra

Description: Dijkstra算法求最短路径(C#版) using System using System.Collections using System.Text namespace Greedy { class Marx { private int[] distance private int row private ArrayList ways = new ArrayList() public Marx(int n,params int[] d) { this.row = n distance = new int[row * row] for (int i = 0 i < row * row i++) { this.distance[i] = d[i]
Platform: | Size: 210319 | Author: wwf | Hits:

[Remote Control] R.A.I.D

Description: R.A.I.D木马源代码供想学习远程控制编程的朋友阅读
Platform: | Size: 201660 | Author: 赵天 | Hits:

[Other resource] ag19264

Description: 汉字液晶子程液晶屏分为4行*12列汉字，全部使用模拟接口方式。 TGLCMLIMIT64A接口程序（模拟方式）连线图: *LCM---89C52* *LCM---89C52* *LCM-------89C52* *LCM----------89C52* * *DB0---P0.0* *DB4---P0.4* *D/I-------P2.6* *CS1----------P2.4* * *DB1---P0.1* *DB5---P0.5* *R/W-------P2.7* *CS2----------P2.5* * *DB2---P0.2* *DB6---P0.6* *RST--------VCC* *CS3----------P3.2* * *DB3---P0.3* *DB7---P0.7* *E---------P2.3* 注:89C52的晶振频率为12MHz
Platform: | Size: 6477 | Author: ljhy | Hits:

[Embeded-SCM Develop] 19264AVR-ASM

Description: TG19264A接口程序（AVR模拟方式）连线图连线图: LCM------S8515* *LCM----S8515* *LCM-------S8515* *LCM------S8515* * *DB0-------PA0* *DB4-----PA4* *D/I--------PC6* *CS1-------PC5* * *DB1-------PA1* *DB5-----PA5* *R/W--------PC7* *CS2-------PC4* * *DB2-------PA2* *DB6-----PA6* */RST-------VCC* *CS3-------PD2* * *DB3-------PA3* *DB7-----PA7* *E----------PC3* * 注:AT90S8515的晶振频率为8MHz
Platform: | Size: 6858 | Author: ljhy | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list