Peng Wang

Learn More
By posing the problem of bandwidth allocation as a constrained maximization problem, it is possible to study various features of optimal bandwidth allocation, and hence the capacity of the network. However, since the typical approach to this problem requires optimizing over a space that is exponential in the number of links, the problem has appeared to be(More)
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Consequently, it is widely believed that optimal scheduling cannot be solved in practical networks. However , there are many cases where there is a significant difference between(More)
At present, the adjustment of train operation plans is undertaken generally before a comparatively long planning horizon such as 3 hours by the dispatchers via the workstation of train scheduling, which can not meet the requirements of optimization and real-time processing in the networked operation with medium- and high-speed trains. This paper establishes(More)
There has been extensive research focused on maximizing the throughput of wireless networks in general and mesh networks in particular. Recently, techniques have been developed that reliably compute the maximum throughput of mesh networks. However, different approaches to throughput optimization make different assumptions on the physical layer's abilities.(More)
Interference and collisions greatly limit the throughput of mesh networks that use contention-based MAC protocols such as IEEE 802.11. Significantly higher throughput is achievable if transmissions are scheduled. However, traditional methods to compute optimal schedules are computationally intractable (unless co-channel interference is neglected). This(More)
Interference and collisions greatly limited the throughput of mesh networks that used contention-based MAC protocols such as 802.11. Significantly higher throughput is achievable if transmissions are scheduled. However, traditional methods to compute such schedules are so computationally complex that they can only be used on relatively small networks. This(More)
—Interference and collisions greatly limit the through-put of mesh networks that use contention-based MAC protocols such as 802.11. Significantly higher throughput is achievable if transmissions are scheduled. However, traditional methods to compute optimal schedules are computationally intractable (unless co-channel interference is neglected). This paper(More)
In the networking research literature, the problem of network utility optimization is often converted to the dual problem which, due to nondifferentiability, is solved with a particular subgradient technique. This technique is not an ascent scheme, hence each iteration does not necessarily improve the value of the dual function. This paper examines the(More)
According to the slow speed of recognition, huge volume and other problems in the traditional character recognition system, we design an embedded character recognition system based on FPGA using DE2 development platform from Altera Company. This system takes the Programmable Logic Device FPGA embedded Nios II soft core as the controller, with software and(More)