ACM试题An Easy Problem
Description
As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the numbe ...
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) ...
This is a little console mode utility program which is able to
(de-)compress single files with a static Arithmetic compression
algorithm. You could easily add the RLE/BWT/MFT data
transformation algorithms. Just rip the corresponding classes
out of my HuffComp source code. I won t add these ones ...
Address book helps you look up your addresses from the system tray.
It is quite useful in that way 慶ause it stays out of the way and is
easily accessible when needed. Double clicking on any URL will start
the default web browser and take you to that URL. Double clicking on
the phone number will ...
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCID ...
使用到的参数跟谈到弹性网络的那一章里头所讲的是一样的， ke 则是终止条件。如果 step 被打勾，则程式在每一步之间会暂停 100毫秒（或其他使用者输入的数值）。如果 Random 被打勾，则程式会以系统时间作为乱数产生器的种子数，否则，就以使用者输入的数（ Random 右边那一格）为种子数。
你可以利用 load 来载入推销员问 ...
There is an example of how to use the LDPC encode/decode with AWGN
channel model in files .\ldpc_decode.m and .\GFq\ldpc_decode.m.
There are a few parity check matrices available in the code but
you can use other matrices provided you have enough memory to load
them. I suggest checking out matri ...
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.
//Basic packet sending test at the MAC level, used for internal testing only.
//This packet test has one node sending out a variety of
//differently formatted packets to two assumed destination nodes.
