LCS Algorithm以c#來(lái)實(shí)作，對(duì)於在學(xué)習(xí)algorithm的人們可以用這個(gè)程式來(lái)demo看看，是以VS2005開發(fā)。
上傳時(shí)間： 2013-12-18
上傳用戶：fxf126@126.com
自己用fuzzy實(shí)作開發(fā)之倒車入庫(kù)系統(tǒng)，程式不大，適合於剛進(jìn)入fuzzy控制的新手練習(xí)
上傳時(shí)間： 2015-12-23
上傳用戶：蠢蠢66
這是一個(gè)用keil C在8051上開發(fā)實(shí)作的UART程式，本人認(rèn)為很適合剛接觸8051的學(xué)習(xí)者，很有幫助的。
上傳時(shí)間： 2015-12-23
上傳用戶：comua
學(xué)會(huì)對(duì)文件的記錄鎖定，及解鎖。#include <stdio.h> #include <unistd.h> #include <fcntl.h> int main() { int fd int i struct { char name[20] uint ID int age } myrec fd =open("name", O_RDWR|O_CREAT, 0755) if (fd == -1) return -1 printf("Input your name:") scanf("％s", myrec.name) printf("Inpute your ID :") scanf("％d", &myrec.ID) printf("Input your age :") scanf("％d", &myrec.age) lseek(fd, 0,SEEK_END) lockf(fd, 1, 0) write(fd, (void *)&myrec, sizeof(myrec)) lockf(fd, 0 ,0) return 0 } 執(zhí)行命令cc lock.c –o lock.out Chmod +x lock.out ./lock.out
標(biāo)簽： 記錄
上傳時(shí)間： 2016-01-04
上傳用戶：亞亞娟娟123
問(wèn)題描述 序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相應(yīng)的遞增下標(biāo)序列為<2，3，5，7>。 一般地，給定一個(gè)序列X=<x1,x2,…,xm>，則另一個(gè)序列Z=<z1,z2,…,zk>是X的子序列，是指存在一個(gè)嚴(yán)格遞增的下標(biāo)序列〈i1,i2,…,ik〉使得對(duì)于所有j=1,2,…,k使Z中第j個(gè)元素zj與X中第ij個(gè)元素相同。 給定2個(gè)序列X和Y，當(dāng)另一序列Z既是X的子序列又是Y的子序列時(shí)，稱Z是序列X和Y的公共子序列。 你的任務(wù)是：給定2個(gè)序列X、Y，求X和Y的最長(zhǎng)公共子序列Z。
上傳時(shí)間： 2014-01-25
上傳用戶：netwolf
管理員手冊(cè),adsl培訓(xùn).docAgent技術(shù)文檔.docATM Sniffer網(wǎng)絡(luò)規(guī)程分析儀.docATM與千兆以太網(wǎng).docCC08 ISDN 2B+D 知識(shí).DOCIrix系統(tǒng)管理.docISP 管 理 員 維 護(hù) 指 南.docNetshow 系統(tǒng)管理員手冊(cè).doc...等等技術(shù)文章
標(biāo)簽： docATM docAgent Sniffer DOCIrix
上傳時(shí)間： 2016-01-25
上傳用戶：徐孺
gpio驅(qū)動(dòng) leddrv.c為驅(qū)動(dòng)源程序 writeled.c為應(yīng)用程序 writeled.c 編譯方式 arm-elf-gcc -Wall -O2 -Wl,-elf2flt -o writeled writeled.c leddrv.c 編譯方式 arm-elf-gcc -D__KERNEL__ -I你的uClinux目錄/linux-2.4.x/include-Wall -Wstrict-prototypes -Wno-trigraphs -O2 -fno-strict-aliasing -fno-common -fno-common -pipe -fno-builtin -D__linux__ -DNO_MM -mapcs-32 -march=armv4 -mtune=arm7tdmi -mshort-load-bytes -msoft-float -DMODULE -c -o leddrv.o leddrv.c
標(biāo)簽： writeled arm-elf-gcc leddrv gpio
上傳時(shí)間： 2013-12-13
上傳用戶：kytqcool
分治法解決最近對(duì)問(wèn)題 畫一條垂直線x=c，把這些給定點(diǎn)分為兩個(gè)包含n/2個(gè)點(diǎn)的子集S1和S2，使得n/2個(gè)點(diǎn)位于直線的左側(cè)或直線上，另外n/2個(gè)點(diǎn)位于直線的右側(cè)或直線上；遵循分治法的思想，遞歸地求出左子集S1和右子集S2中的最近對(duì)，分別為d1與d2；之后d=min{d1,d2}。合并過(guò)程：在以垂線x=c為對(duì)稱軸，2d為寬度的區(qū)域內(nèi)求最近兩個(gè)點(diǎn)的距離，記為d3；求D=min{d,d3}；
上傳時(shí)間： 2013-12-26
上傳用戶：源碼3
The PCI Local bus concept was developed to break the PC data I/O bottleneck and clearly opens the door to increasing system speed and expansion capabilities. The PCI Local bus moves high speed peripherals from the I/O bus and places them closer to the system’s processor bus, providing faster data transfers between the processor and peripherals. The PCI Local bus also addresses the industry’s need for a bus standard which is not directly dependent on the speed, size and type of system processor. It represents the first microprocessor independent bus offering performance more than adequate for the most demanding applications such as full-motion video.
標(biāo)簽： bottleneck developed the concept
上傳時(shí)間： 2014-12-03
上傳用戶：ikemada
The PCI Local bus concept was developed to break the PC data I/O bottleneck and clearly opens the door to increasing system speed and expansion capabilities. The PCI Local bus moves high speed peripherals from the I/O bus and places them closer to the system’s processor bus, providing faster data transfers between the processor and peripherals. The PCI Local bus also addresses the industry’s need for a bus standard which is not directly dependent on the speed, size and type of system processor. It represents the first microprocessor independent bus offering performance more than adequate for the most demanding applications such as full-motion video. Hardware reference
標(biāo)簽： bottleneck developed the concept
上傳時(shí)間： 2016-03-18
上傳用戶：極客
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
