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

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

diffusion-limited-aggregation

  • STC89C58RD+ FROM AP-ISP

    STC89C58RD+ FROM AP-ISP,晶振為12M,International Limited

    標簽: AP-ISP FROM STC 89

    上傳時間: 2015-12-15

    上傳用戶:sssl

  • To increase simulation speed, ModelSim® can apply a variety of optimizations to your design. Thes

    To increase simulation speed, ModelSim® can apply a variety of optimizations to your design. These include, but are not limited to, mergingprocesses, pulling constants out of loops, clock suppression, and signal collapsing. You control the level of optimization by specifying certain switches when you invoke the compiler.

    標簽: optimizations simulation ModelSim increase

    上傳時間: 2013-12-25

    上傳用戶:pkkkkp

  • Abstract—Mobile devices performing video coding and streaming over wireless and pervasive communica

    Abstract—Mobile devices performing video coding and streaming over wireless and pervasive communication networks are limited in energy supply. To prolong the operational lifetime of these devices, an embedded video encoding system should be able to adjust its computational complexity and energy consumption as demanded by the situation and its environment.

    標簽: performing and communica streaming

    上傳時間: 2014-01-21

    上傳用戶:pompey

  • This m-file simulates MPSK (BPSK,QPSK,8PSK)with theoretical and simulated results using Gray coding.

    This m-file simulates MPSK (BPSK,QPSK,8PSK)with theoretical and simulated results using Gray coding. Numerical examples of a satellite link design are shown using QPSK and/or 8PSK when the bit rate(Rb)is greater than the channel bandwidth Wc (Band-limited channel).

    標簽: theoretical simulates simulated results

    上傳時間: 2016-01-19

    上傳用戶:pompey

  • TFIND searches for one or more strings (boolean AND) in a text file. TFIND reports all lines whe

    TFIND searches for one or more strings (boolean AND) in a text file. TFIND reports all lines where the string(s) were found (or NOT found by option). The search can be limited to a field in a fixed field (i.e. column oriented) list. An extended search mode is available, where only letters and digits are relevant. Other options: case sensitive search, alternative errorlevel with number of hits, header line with file name, LFN, custom prefix

    標簽: TFIND searches boolean reports

    上傳時間: 2016-01-24

    上傳用戶:lindor

  • // Copyright (c), Philips Semiconductors Gratkorn // (C)PHILIPS Electronics N.V.2000 // All rights

    // Copyright (c), Philips Semiconductors Gratkorn // (C)PHILIPS Electronics N.V.2000 // All rights are reserved. // Philips reserves the right to make changes without notice at any time. // Philips makes no warranty, expressed, implied or statutory, including but // not limited to any implied warranty of merchantibility or fitness for any //particular purpose, or that the use will not infringe any third party patent, // copyright or trademark. Philips must not be liable for any loss or damage // arising from its use.

    標簽: Semiconductors Electronics Copyright Gratkorn

    上傳時間: 2016-02-04

    上傳用戶:xuanjie

  • μC/OS-II Goals Probably the most important goal of μC/OS-II was to make it backward compatible with

    μC/OS-II Goals Probably the most important goal of μC/OS-II was to make it backward compatible with μC/OS (at least from an application’s standpoint). A μC/OS port might need to be modified to work with μC/OS-II but at least, the application code should require only minor changes (if any). Also, because μC/OS-II is based on the same core as μC/OS, it is just as reliable. I added conditional compilation to allow you to further reduce the amount of RAM (i.e. data space) needed by μC/OS-II. This is especially useful when you have resource limited products. I also added the feature described in the previous section and cleaned up the code. Where the book is concerned, I wanted to clarify some of the concepts described in the first edition and provide additional explanations about how μC/OS-II works. I had numerous requests about doing a chapter on how to port μC/OS and thus, such a chapter has been included in this book for μC/OS-II.

    標簽: OS-II compatible important Probably

    上傳時間: 2013-12-02

    上傳用戶:jkhjkh1982

  • The Funambol J2ME Mail Client aims to be a light, easy to use, free email client for J2ME devices.

    The Funambol J2ME Mail Client aims to be a light, easy to use, free email client for J2ME devices. The first release comes with a simple but effective UI, and a storage limited to the internal RMS only. This makes the application compatible with most of the phones around (minimum requirements are: MIDP2.0, CLDC 1.0, 512k of Storage). The mail synchronization using SyncML 1.2 over HTTP, thus removing any problem related to the access to IMAP or POP ports. The mail client synchonizes its address book with the one on the server, Its design is modular and can be extended in future with other mail protocols, a more sophisticated UI and access to the phone s AddressBook or filesystem for the devices allowing this. See the javadoc for more information on the structure of the library.

    標簽: J2ME Funambol devices Client

    上傳時間: 2014-01-05

    上傳用戶:gououo

  • Problem D:合唱隊形 Time Limit:1000MS Memory Limit:65536K Total Submit:1237 Accepted:437 Language

    Problem D:合唱隊形 Time Limit:1000MS Memory Limit:65536K Total Submit:1237 Accepted:437 Language: not limited Description N位同學站成一排,音樂老師要請其中的(N-K)位同學出列,使得剩下的K位同學排成合唱隊形。 合唱隊形是指這樣的一種隊形:設K位同學從左到右依次編號為1,2…,K,他們的身高分別為T1,T2,…,TK, 則他們的身高滿足T1 < T2 < ...< Ti > Ti+1 > … >TK(1<=i<=K)。 你的任務是,已知所有N位同學的身高,計算最少需要幾位同學出列,可以使得剩下的同學排成合唱隊形。 Input 輸入包含若干個測試用例。 對于每個測試用例,輸入第一行是一個整數N(2<=N<=100),表示同學的總數。第二行有N個整數,用空格分隔,第i個整數Ti(130<=Ti<=230)是第i位同學的身高(厘米)。當輸入同學總數N為0時表示輸入結束。 Output 對于每個測試案例,輸出包括一行,這一行只包含一個整數,就是最少需要幾位同學出列。 Sample Input 8 186 186 150 200 160 130 197 220 3 150 130 140 0 Sample Output 4 1

    標簽: Limit Accepted Language Problem

    上傳時間: 2014-01-13

    上傳用戶:aappkkee

  • Problem F:汽車加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language

    Problem F:汽車加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language: not limited Description 一輛汽車加滿油后可行駛n公里。旅途中有若干個加油站。設計一個有效算法,指出應在哪些加油站停靠加油,使沿途加油次數最少。 編程任務: 對于給定的n和k(k <= 10000)個加油站位置,編程計算最少加油次數。 Input 第一行有2 個正整數n和k,表示汽車加滿油后可行駛n公里,且旅途中有k個加油站。接下來的1 行中,有k+1 個整數,表示第k個加油站與第 k-1 個加油站之間的距離。第0 個加油站表示出發地,汽車已加滿油。第k+1 個加油站表示目的地。 Output 輸出最少加油次數。如果無法到達目的地,則輸出”No Solution”。 Sample Input 7 7 1 2 3 4 5 1 6 6 Sample Output 4

    標簽: Limit Accepted Language Problem

    上傳時間: 2016-04-12

    上傳用戶:youth25

主站蜘蛛池模板: 当涂县| 长子县| 富蕴县| 开封市| 柳州市| 韩城市| 河北省| 应城市| 马鞍山市| 策勒县| 新绛县| 伊通| 合川市| 黔西| 井冈山市| 额济纳旗| 甘泉县| 新津县| 西林县| 乳山市| 望都县| 泾源县| 盐边县| 孝昌县| 凤翔县| 拉孜县| 明溪县| 苍南县| 永嘉县| 论坛| 安康市| 神农架林区| 阳曲县| 达日县| 昌黎县| 咸阳市| 连山| 苏尼特左旗| 清新县| 庆安县| 巴楚县|