BNB20 Finds the constrained minimum of a function of several possibly integer variables. ％ Usage: [errmsg,Z,X,t,c,fail] = ％ BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...) ％ ％ BNB solves problems of the Form: ％ Minimize F(x) subject to: xlb <= x0 <=xub ％ A*x <= B Aeq*x=Beq ％ C(x)<=0 Ceq(x)=0 ％ x(i) is continuous for xstatus(i)=0 ％ x(i) integer for xstatus(i)= 1 ％ x(i) fixed for xstatus(i)=2 ％
標(biāo)簽： constrained variables function possibly
上傳時(shí)間： 2014-01-13
上傳用戶：youth25
This lab exercise will introduce you to the AccelWare IP generators. AccelWare is a library of over fifty IP generators, available in the Form of three toolkits that produce synthesizable MATLAB for common MATLAB built in and toolbox functions. Each generator offers macro and micro-architecture selections that allow full customization of the generated model to the target application requirements.
標(biāo)簽： AccelWare generators introduce exercise
上傳時(shí)間： 2013-12-16
上傳用戶：2467478207
BmpRgn is a *FREEWARE* unit that allows you to create Forms with transparent areas based on a bitmap that you provide. The bitmap is converted to a Form region, where only the interior pixels are displayed. The transparent border remains transparent.
標(biāo)簽： transparent FREEWARE BmpRgn allows
上傳時(shí)間： 2015-10-04
上傳用戶：himbly
J2ME高級(jí)用戶界面的學(xué)習(xí)代碼，在ktoolbar下運(yùn)行,是學(xué)習(xí)J2ME的好助手.這里包括 ExpandThread,Form,FormN,Gauge,ImageItemAnimation,ImageItem,ItemStateListener
上傳時(shí)間： 2015-10-08
上傳用戶：wff
Do your applications look a little boring? Would you like to get spectacular yet easy to use visual effects? Billenium Effects will give your applications a different touch without interfering with your existing code. For example, just by dropping two components to your Splash Screen or About Form they will be shown with a professional transition effect that will delight your customers. First impressions count!
標(biāo)簽： applications spectacular little boring
上傳時(shí)間： 2015-10-09
上傳用戶：dreamboy36
適用于將離散點(diǎn)云數(shù)據(jù)（.txt），轉(zhuǎn)換為IGS格式- This procedure will be suitable for is separated the cloud data (txt), the transFormation will be the IGS Form
標(biāo)簽： txt 離散 云數(shù)據(jù)
上傳時(shí)間： 2014-11-08
上傳用戶：AbuGe
Abstract：Noise frequency modulation(FM)jamming。which belongs to blanket jamming。is already become the main Form ofnoise jamming at present。because the wideband was gained by it．Tne spectnlnl ofnoise FM jamming is analyzed by time domain autocorrelation method in this paper．It’S jamm g peculiarity and幾o(hù)ut— putting signal’S jamming peculiarity ale explained．At last，these time series models ofnoise FM jalllIIling sig— nal and幾o(hù)utputting signal ale built．
標(biāo)簽： jamming modulation frequency Abstract
上傳時(shí)間： 2015-10-17
上傳用戶：lijinchuan
每種程序設(shè)計(jì)語(yǔ)言都有描述程序語(yǔ)法結(jié)構(gòu)的規(guī)則。例如，Pascal程序由程序塊（又叫分程序）構(gòu)成，程序塊由語(yǔ)句組成，語(yǔ)句由表達(dá)式組成，表達(dá)式由記號(hào)組成等等。這些規(guī)則可以用上下文無(wú)關(guān)文法或BNF范式（Backus-Naur Form）描述。 編譯器常用的文法分析方法有自上而下和自下而上兩種。正如它們的名字所示，自上而下分析器建立分析樹(shù)是從根結(jié)點(diǎn)到葉結(jié)點(diǎn)，而自下而上分析器恰好反過(guò)來(lái)。它們的共同點(diǎn)是從左向右地掃描輸入，每次一個(gè)符號(hào)。 最有效的自上而下和自下而上的分析法都只能處理上下文無(wú)關(guān)文法的子類(lèi)。這些子類(lèi)足以描述程序設(shè)計(jì)語(yǔ)言的大多數(shù)語(yǔ)法結(jié)構(gòu)，其中LL文法的分析器通常用手工實(shí)現(xiàn)，而LR文法的分析器通常利用自動(dòng)工具構(gòu)造。 本章致力于編譯器采用的典型語(yǔ)法分析方法。我們首先提出有關(guān)上下文無(wú)關(guān)文法的基本概念，然后介紹適合于手工實(shí)現(xiàn)的預(yù)測(cè)分析技術(shù)，最后給出自動(dòng)工具用的LR分析算法。由于程序員準(zhǔn)備的代碼經(jīng)常會(huì)出現(xiàn)一些語(yǔ)法錯(cuò)誤，因此我們還擴(kuò)展所介紹的分析方法，使之能從常見(jiàn)的錯(cuò)誤中恢復(fù)過(guò)來(lái)。 3.1 上下文無(wú)關(guān)文法 ..... 3.4 自下而上分析 3.6 二義文法的應(yīng)用
標(biāo)簽： 程序設(shè)計(jì)語(yǔ)言 程序
上傳時(shí)間： 2013-12-25
上傳用戶：hanli8870
功能∶ 用于UNIX上做畫(huà)面、菜單、查詢、輸入、修改；可操作數(shù)據(jù)庫(kù)。 設(shè)計(jì)思路∶ 將人機(jī)對(duì)話，可分為基本的輸入與輸出兩大類(lèi)，在此前提下，為了不同的需要把域分作 多種類(lèi)型；對(duì)涉及數(shù)據(jù)庫(kù)的域指明有關(guān)的表名、字段名，以進(jìn)行數(shù)據(jù)庫(kù)的讀寫(xiě)。將這些 不同功能的域有機(jī)的組合在一個(gè)Form中，來(lái)實(shí)現(xiàn)一個(gè)功能模塊。將Form編號(hào)，按一定的 結(jié)構(gòu)以二進(jìn)制的形式存入文件，在使用時(shí)，系統(tǒng)按編號(hào)讀入Form的數(shù)據(jù)，按步實(shí)現(xiàn)預(yù)定 的功能。
上傳時(shí)間： 2014-01-06
上傳用戶：ynsnjs
Given an positive integer A (1 <= A <= 109), output the lowest bit of A. For example, given A = 26, we can write A in binary Form as 11010, so the lowest bit of A is 10, so the output should be 2. Another example goes like this: given A = 88, we can write A in binary Form as 1011000, so the lowest bit of A is 1000, so the output should be 8.
標(biāo)簽： A. positive integer example
上傳時(shí)間： 2014-01-22
上傳用戶：rocketrevenge
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
