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

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

ONE-dimensional_OPTIMIZATION

  • The subroutines glkern.f and lokern.f use an efficient and fast algorithm for automatically adapti

    The subroutines glkern.f and lokern.f use an efficient and fast algorithm for automatically adaptive nonparametric regression estimation with a kernel method. Roughly speaking, the method performs a local averaging of the observations when estimating the regression function. Analogously, one can estimate derivatives of small order of the regression function.

    標(biāo)簽: automatically subroutines and algorithm

    上傳時(shí)間: 2015-11-25

    上傳用戶:luke5347

  • 提供給JAVA入門者

    提供給JAVA入門者,免費(fèi)下載PPT和源碼 很多網(wǎng)友問(wèn)我學(xué)習(xí)Java有沒有什么捷徑,我說(shuō)“無(wú)他,唯手熟爾”。但是我卻很愿意將自己學(xué)習(xí)的一些經(jīng)驗(yàn)寫出來(lái),以便后來(lái)者少走彎路,幫助別人是最大的快樂(lè)嘛!   要想學(xué)好Java,首先要知道Java的大致分類。我們知道,自從Sun推出Java以來(lái),就力圖使之無(wú)所不包,所以Java發(fā)展到現(xiàn)在,按應(yīng)用來(lái)分主要分為三大塊:J2SE,J2ME和J2EE,這也就是Sun ONE(Open Net Environment)體系。J2SE就是Java2的標(biāo)準(zhǔn)版,主要用于桌面應(yīng)用軟件的編程;J2ME主要應(yīng)用于嵌入是系統(tǒng)開發(fā),如手機(jī)和PDA的編程;J2EE是Java2的企業(yè)版,主要用于分布式的網(wǎng)絡(luò)程序的開發(fā),如電子商務(wù)網(wǎng)站和ERP系統(tǒng)。J2SE開發(fā)桌面應(yīng)用軟件比起VC,VB,DELPHI這些傳統(tǒng)開發(fā)語(yǔ)言來(lái)說(shuō),優(yōu)勢(shì)好象并不明顯。J2ME對(duì)于初學(xué)者來(lái)說(shuō),好象又有點(diǎn)深?yuàn)W,而且一般開發(fā)者很難有開發(fā)環(huán)境。所以現(xiàn)在應(yīng)用最廣泛又最好學(xué)的就是J2EE了。J2EE又包括許多組件,如JSP,Servlet,JavaBean,EJB,JDBC,JavaMail等。要學(xué)習(xí)起來(lái)可不是一兩天的事。   那么又該如何學(xué)習(xí)J2EE呢?當(dāng)然Java語(yǔ)法得先看一看的,I/O包,Util包,Lang包你都熟悉了嗎?然后再?gòu)腏SP學(xué)起。如果你學(xué)過(guò)HTML,那么事情要好辦的多,如果沒有,那你快去補(bǔ)一補(bǔ)HTML基礎(chǔ)吧。其

    標(biāo)簽: JAVA

    上傳時(shí)間: 2015-11-26

    上傳用戶:lvzhr

  • This paper addresses a stochastic-#ow network in which each arc or node has several capacities and m

    This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.

    標(biāo)簽: capacities stochastic addresses network

    上傳時(shí)間: 2015-12-03

    上傳用戶:xfbs821

  • This paper addresses a stochastic-#ow network in which each arc or node has several capacities and m

    This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.

    標(biāo)簽: capacities stochastic addresses network

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

    上傳用戶:ggwz258

  • This paper addresses a stochastic-#ow network in which each arc or node has several capacities and m

    This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.

    標(biāo)簽: capacities stochastic addresses network

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

    上傳用戶:二驅(qū)蚊器

  • This paper addresses a stochastic-#ow network in which each arc or node has several capacities and m

    This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.

    標(biāo)簽: capacities stochastic addresses network

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

    上傳用戶:獨(dú)孤求源

  • In this talk we will consider two approaches in dealing with the risk of supplier bankruptcy. In the

    In this talk we will consider two approaches in dealing with the risk of supplier bankruptcy. In the first model, we study the effects of supply disruption risk in a supply chain where one buyer deals with competing risky suppliers who may default during their production lead-times.

    標(biāo)簽: approaches bankruptcy the consider

    上傳時(shí)間: 2014-08-04

    上傳用戶:lanjisu111

  • IO 驅(qū)動(dòng) LCD , *** *** *** *** *** *** *** *** FILE NAME: IO_LCD MCU: HT46R22 MASK OPTION: WAKE-U

    IO 驅(qū)動(dòng) LCD , *** *** *** *** *** *** *** *** FILE NAME: IO_LCD MCU: HT46R22 MASK OPTION: WAKE-UP: PA6,PA7 PULL-HIGH: PA,PB,PC IIC: DISABLE PFD: DISABLE PWM: DISABLE WDT: ENABLE CLRWDT: ONE WDT CLOCK SOURCE: T1 WDT TIME OUT SELECT: WDT CLOCK SOURCE/32768 LVR: DISABLE OSC: CRYSTAL SYSVOLT: 3.0V SYSFRAG: 4000KHZ AUTHOR: RADOME HISTORY: 2005.08.

    標(biāo)簽: IO_LCD OPTION WAKE-U FILE

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

    上傳用戶:watch100

  • Yet another Java implementation for the addictive Minesweeper game. This game comes with a number of

    Yet another Java implementation for the addictive Minesweeper game. This game comes with a number of options unavailable in Windows s version, such as allowing more than one mines in a square.

    標(biāo)簽: game implementation Minesweeper addictive

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

    上傳用戶:zhaiyanzhong

  • An AHB system is made of masters slaves and interconnections. A general approach to include all poss

    An AHB system is made of masters slaves and interconnections. A general approach to include all possible "muxed" implementation of multi layered AHB systems and arbitrated AHB ones can be thought as an acyclic graph where every source node is a master, every destination node is a slave and every internal node is an arbiter there must be one and only one arc exiting a master and one or more entering a slave (single slave verus multi-slave or arbitrated slave) an arbiter can have as many input and output connections as needed. A bridge is a special node that collapses one or more slave nodes and a master node in a new "complex" node.

    標(biāo)簽: interconnections approach general include

    上傳時(shí)間: 2015-12-12

    上傳用戶:lyy1234

主站蜘蛛池模板: 万荣县| 九寨沟县| 龙海市| 阳城县| 郧西县| 潜江市| 雅江县| 邓州市| 扎囊县| 永和县| 木兰县| 乐清市| 花莲市| 大关县| 长岛县| 如皋市| 秦皇岛市| 阿克| 抚宁县| 甘南县| 莲花县| 永城市| 五寨县| 甘谷县| 繁峙县| 文化| 香格里拉县| 万源市| 镇江市| 中江县| 义马市| 南和县| 大荔县| 剑阁县| 花莲县| 稷山县| 阿荣旗| 平罗县| 台北市| 噶尔县| 班戈县|