亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊(cè)

MIN-cut

  • 功能說明: 次組件提供的功能有二: 1、解析出數(shù)學(xué)表達(dá)式中的參數(shù) 2、計(jì)算數(shù)學(xué)表達(dá)式 此組件不但可以解析和計(jì)算數(shù)學(xué)表達(dá)式

    功能說明: 次組件提供的功能有二: 1、解析出數(shù)學(xué)表達(dá)式中的參數(shù) 2、計(jì)算數(shù)學(xué)表達(dá)式 此組件不但可以解析和計(jì)算數(shù)學(xué)表達(dá)式,還提供了一系列的數(shù)學(xué)基本函數(shù),可應(yīng)用于表達(dá)式中一塊處理。提供的數(shù)學(xué)基本函數(shù)有:將值舍入到最接近的整數(shù) rount(x)、向下取整函數(shù) int(x)、向上取整 ceiling(x)、求兩個(gè)數(shù)中最大數(shù)的函數(shù) max(a,b)、求兩個(gè)數(shù)中最小數(shù)的函數(shù) min(a,b)、冪函數(shù) pow(x,n)、求平方根的函數(shù) sqrt(x)。 下載地址:http://www.qiusuo365.com/qiusuo365/viewthread.php?tid=2422&extra=page%3D1

    標(biāo)簽: 表達(dá)式 計(jì)算 參數(shù)

    上傳時(shí)間: 2014-01-18

    上傳用戶:李夢(mèng)晗

  • 一個(gè)很好用的 lcd 時(shí)鐘程序 C語言 #include<reg51.h> #include<stdio.h> //定義計(jì)時(shí)器0 的重裝值 #define RELOAD

    一個(gè)很好用的 lcd 時(shí)鐘程序 C語言 #include<reg51.h> #include<stdio.h> //定義計(jì)時(shí)器0 的重裝值 #define RELOAD_HIGH 0x3C #define RELOAD_LOW 0xD2 //定義按鍵彈跳時(shí)間 #define DB_VAL //定義設(shè)置模式的最大時(shí)間間隔 #define TIMEOUT 200 //定義游標(biāo)位置常數(shù) #define HOME 0 #define HOUR 1 #define MIN 2 #define SEC 3

    標(biāo)簽: include define RELOAD stdio

    上傳時(shí)間: 2014-12-19

    上傳用戶:zukfu

  • C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods:

    C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bits, int confidence, Random rand) , genRandomBits(int bits, Random rand) , isProbablePrime(int confidence) , isProbablePrime() , Jacobi(BigInteger a, BigInteger b) , LucasSequence(BigInteger P, BigInteger Q, BigInteger k, BigInteger n) ,max(BigInteger bi) , min(BigInteger bi) , modInverse(BigInteger modulus) , RabinMillerTest(int confidence) ,

    標(biāo)簽: BigInteger class BIgInteger program

    上傳時(shí)間: 2013-12-23

    上傳用戶:ynzfm

  • C++, although a marvelous language, isn t perfect. Matthew Wilson has been working with it for over

    C++, although a marvelous language, isn t perfect. Matthew Wilson has been working with it for over a decade, and during that time he has found inherent limitations that require skillful workarounds. In this book, he doesn t just tell you what s wrong with C++, but offers practical techniques and tools for writing code that s more robust, flexible, efficient, and maintainable. He shows you how to tame C++ s complexity, cut through its vast array of paradigms, take back control over your code--and get far better results

    標(biāo)簽: marvelous although language Matthew

    上傳時(shí)間: 2014-01-22

    上傳用戶:妄想演繹師

  • Linux命令大全

    Linux命令大全,包括:cat、 cd 、chmod 、chown、cp、cut 、 find 、less、ln 、locate、 ls 、more 等命令的詳細(xì)用法

    標(biāo)簽: Linux 命令

    上傳時(shí)間: 2016-01-26

    上傳用戶:gaome

  • 圖像處理

    圖像處理,利用bilt 函數(shù) Description: This example shows how to edit (cut,paste,copy) a selection of a bitmap using BitBlt function just like Microsoft Photo Editor does. It s really EASY! Take a look to the sample if you don t believe me and don t forget to VOTE FOR ME! Note: comments are in italian...i hadn t enough time to translate them all. Sorry..(VOTE!)

    標(biāo)簽: 圖像處理

    上傳時(shí)間: 2013-12-18

    上傳用戶:851197153

  • 分治法解決最近對(duì)問題 畫一條垂直線x=c

    分治法解決最近對(duì)問題 畫一條垂直線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}。合并過程:在以垂線x=c為對(duì)稱軸,2d為寬度的區(qū)域內(nèi)求最近兩個(gè)點(diǎn)的距離,記為d3;求D=min{d,d3};

    標(biāo)簽: 分治法 垂直

    上傳時(shí)間: 2013-12-26

    上傳用戶:源碼3

  • MATLAB對(duì)11中調(diào)度算法進(jìn)行比較

    MATLAB對(duì)11中調(diào)度算法進(jìn)行比較,包括min-min、max-min、遺傳算法等等。

    標(biāo)簽: MATLAB 調(diào)度算法 比較

    上傳時(shí)間: 2014-01-06

    上傳用戶:lnnn30

  • The market for miniature computer programming is exploding. C++ Footprint and Performance Optimizati

    The market for miniature computer programming is exploding. C++ Footprint and Performance Optimization supplies programmers the knowledge they need to write code for the increasing number of hand-held devices, wearable computers, and intelligent appliances. This book gives readers valuable knowledge and programming techniques that are not currently part of traditional programming training. In the world of C++ programming, all other things being equal, programs that are smaller and faster are better. C++ Footprint and Performance Optimization contains case studies and sample code to give readers concrete examples and proven solutions to problems that don t have cut and paste solutions.

    標(biāo)簽: Performance programming Optimizati Footprint

    上傳時(shí)間: 2013-12-09

    上傳用戶:wfl_yy

  • 假設(shè)在一個(gè)ad hoc網(wǎng)絡(luò)中

    假設(shè)在一個(gè)ad hoc網(wǎng)絡(luò)中,移動(dòng)節(jié)點(diǎn)的發(fā)射功率PTx總是恒定的。要發(fā)送數(shù)據(jù)的移動(dòng)節(jié)點(diǎn)總是先監(jiān)聽信道,測(cè)量接收到的信號(hào)功率X,其中X= I + N, I為接收到的干擾,N是噪聲。移動(dòng)節(jié)點(diǎn)只有在X<INThre時(shí),才可以發(fā)射。式中,INThre為背景噪聲門限。 在仿真中,我們規(guī)定每個(gè)移動(dòng)節(jié)點(diǎn)的發(fā)射功率是常數(shù),PTx = 1W;接收節(jié)點(diǎn)接收機(jī)的靈敏度Smin = -80 dBm;信號(hào)質(zhì)量 min = 2 dB;系統(tǒng)的背景噪聲門限INThre = 1.2e-10。

    標(biāo)簽: hoc 網(wǎng)絡(luò)

    上傳時(shí)間: 2016-03-16

    上傳用戶:sevenbestfei

主站蜘蛛池模板: 丹江口市| 乐山市| 拉孜县| 盐池县| 泗水县| 丰县| 瑞昌市| 临潭县| 兴海县| 周宁县| 奉贤区| 广宗县| 射阳县| 安陆市| 谢通门县| 台南市| 大同市| 井研县| 永顺县| 泸水县| 将乐县| 阳曲县| 洛南县| 鲁甸县| 南充市| 卢氏县| 淮南市| 连平县| 左权县| 高阳县| 岚皋县| 沛县| 和硕县| 若尔盖县| 京山县| 康定县| 舟曲县| 屏山县| 武定县| 岑溪市| 漳平市|