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

BACK-propagation

  • OXCC is a multipass, interpreting C compiler with several language extensions. It generates an Archi

    OXCC is a multipass, interpreting C compiler with several language extensions. It generates an Architecture Neutral Format (ANF) output and comes with a couple of example back ends. Programmers are expected to write additional back ends for their specific needs.

    标签: interpreting extensions generates multipass

    上传时间: 2015-04-12

    上传用户:大三三

  • 呵呵

    呵呵,交大网络作业;可靠的数据传输,go back to N;呵呵,错过了就可惜了

    标签:

    上传时间: 2015-04-19

    上传用户:zhuoying119

  • 刚才兴起试用了一下opera的语音控制功能

    刚才兴起试用了一下opera的语音控制功能,插上mic,在opera的语音控制里面选择性别,点确定就可以用了。 对着mic,并按下语音控制键,说出back,opera果然后退了一页,哈哈!以后连手都不用了。靠嘴就成。 不过这E文的发音可要好好锻炼一下了。

    标签: opera 语音 控制功能

    上传时间: 2015-05-10

    上传用户:tonyshao

  • The module LSQ is for unconstrained linear least-squares fitting. It is based upon Applied Statisti

    The module LSQ is for unconstrained linear least-squares fitting. It is based upon Applied Statistics algorithm AS 274 (see comments at the start of the module). A planar-rotation algorithm is used to update the QR- factorization. This makes it suitable for updating regressions as more data become available. The module contains a test for singularities which is simpler and quicker than calculating the singular-value decomposition. An important feature of the algorithm is that it does not square the condition number. The matrix X X is not formed. Hence it is suitable for ill- conditioned problems, such as fitting polynomials. By taking advantage of the MODULE facility, it has been possible to remove many of the arguments to routines. Apart from the new function VARPRD, and a back-substitution routine BKSUB2 which it calls, the routines behave as in AS 274.

    标签: least-squares unconstrained Statisti Applied

    上传时间: 2015-05-14

    上传用户:aig85

  • Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to w

    Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.

    标签: available libraries Although nearly

    上传时间: 2014-01-22

    上传用户:zhoujunzhen

  • 解决时钟问题

    解决时钟问题,acm竞赛题 A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.

    标签: 时钟

    上传时间: 2015-05-21

    上传用户:rishian

  • Create a time protocol over Client/Server Environment by sending request about time to server from c

    Create a time protocol over Client/Server Environment by sending request about time to server from client and the server will response to give the correct time back to the client.

    标签: time Environment protocol sending

    上传时间: 2015-05-23

    上传用户:guanliya

  • This a two node test, requires a Coordinator and an RFD. The coordinator and node simply ping-pong

    This a two node test, requires a Coordinator and an RFD. The coordinator and node simply ping-pong a packet back and forth, and print out the RSSI byte. The RFD waits before bouncing it back, while the coordinator responds immediately.

    标签: node Coordinator coordinator and

    上传时间: 2013-12-24

    上传用户:ardager

  • These files are for testing the ADC (AD9240) and DAC THS8133 (DAC1). The ADC and DAC are tested i

    These files are for testing the ADC (AD9240) and DAC THS8133 (DAC1). The ADC and DAC are tested in loop back.

    标签: ADC DAC are and

    上传时间: 2014-08-15

    上传用户:lnnn30

  • hese files are for testing the Video ADC (TLV5734) and DAC THS8133 (DAC0). The ADC and DAC are te

    hese files are for testing the Video ADC (TLV5734) and DAC THS8133 (DAC0). The ADC and DAC are tested in loop back.

    标签: are ADC DAC and

    上传时间: 2015-09-28

    上传用户:youlongjian0