虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

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