本人編寫的incremental 隨機神經元網絡算法，該算法最大的特點是可以保證approximation特性，而且速度快效果不錯，可以作為學術上的比較和分析。目前只適合benchmark的regression問題。
具體效果可參考
G.-B. Huang, L. Chen and C.-K. Siew, “Universal Approximation Using Incremental Constructive Feedforward Networks with Random Hidden nodes”, IEEE Transactions on Neural Networks, vol. 17, no. 4, pp. 879-892, 2006.
Trees are natural structures for representing certain kinds of hierarchical data. A (rooted) tree consists of a set of nodes (or vertices) and a set of arcs (or edges).
The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
assignment problem: Given an assignment, move the minimum number of
codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code assignment problem for which we derive several results
Very good Java Applet used to animate Inserting, Deleting and Searching (Preorder & Postorder algorithm) nodes in Binary Trees. This is a part of mine students project.
You can use and redistribute the source code absolutelly free!
This is a mutlicore and cluster(of single-core,multi-core systems) matrix inversion code.
Which uses the MPI(Message Passing Interface) for communication across the compute nodes of cluster and using thread-API based OpenMP(Open Multi Processing) between cores of intra-compute or head node.
Wireless range extenders or wireless repeaters can extend the range of an existing wireless network. Range extenders can be strategically placed to elongate a signal area or allow for the signal area to reach around barriers such as those created in L-shaped corridors. Wireless devices connected through repeaters will suffer from an increased latency for each hop. Additionally, a wireless device connected to any of the repeaters in the chain will have a throughput that is limited by the weakest link between the two nodes in the chain from which the connection originates to where the connection ends
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000.
Output:
The output is a single line for each case, with the corresponding minimum size cut.
Example:
Input:
7 11
1 2 3
1 4 3
2 3 4
3 1 3
3 4 1
3 5 2
4 6 6
4 5 2
5 2 1
5 7 1
6 7 9
Output:
5
Pattern-MAC (PMAC) protocol, instead of having fixed sleepwakeups,
the sleep-wakeup schedules of the sensor nodes are
adaptively determined. The schedules are decided based on a
node’s own traffic and that of its neighbors.
nesc language introduction. nesC is an extension to C [2] designed to embody the structuring concepts and execution model of
TinyOS [1]. TinyOS is an event-driven operating system designed for sensor network nodes that
have very limited resources (e.g., 8K bytes of program memory, 512 bytes of RAM). TinyOS has
been reimplemented in nesC. This manual describes v1.1 of nesC, changes from v1.0 are summarised
in Section 3.
