Consider an arbitrarily connected broadcast network of N nodes that all wish to recover k desired packets. Each node begins with a subset of the desired packets and broadcasts messages to its neighbors. In a previous paper we established necessary and sufficient conditions on the number of transmissions from each node required for universal recovery (in which each node recovers all k packets). ...

In this paper a wind sensing lidar utilizing a Frequency Stepped Pulse Train (FSPT) is demonstrated. One of the advantages in the FSTP lidar is that it enables direct measurement of wind speed as a function of distance from the lidar. Theoretically the FSPT lidar continuously produces measurements as is the case with a CW lidar, but at the same time with a spatial resolution, and without the ra...

Complementing wireless radio networks with free-space optics (FSO) achieve high data rates by modulating radio subcarriers over an optical carrier without expensive optical fiber cabling, enabling a pervasive platform for reaching underserved areas. In this paper, we review the main features of Free Space Optical Communication. Keywords— Free space Optics, NRZ, RZ, PIN, APD etc.

Bagging and boosting are two general techniques for building predictors based on small samples from a dataset. We show that boosting can be parallelized, and then present performance results for parallelized bagging and boosting using OC1 decision trees and two standard datasets. The main results are that sample sizes limit achievable accuracy, regardless of computational time spent; that paral...

Decision tree induction has been has been widely studied and applied. In safety applications, such as determining whether a chemical process is safe, or whether a person has a medical condition, the cost of misclassification in one of the classes is significantly higher than the other class. Several authors have tackled this problem by developing cost-sensitive decision tree learning algorithms...

Exponentially growing routing tables create the need for increasingly storage-efficient lookup schemes that do not compromise on lookup performance and update rates. This paper evaluates the mechanisms that determine the storage efficiency of state-of-the-art IP lookup schemes. A novel scheme named BARTS (Balanced Routing Table Search) is proposed for searching large routing tables in wide embe...

To support real-time applications, for instance Voice-over-IP, network infrastructure has to provide high bandwidth as well as short endto-end latency. To cope with both, network processors (NP) are selected. Current NP support transmission rates of OC-48. However, due to sequential packet layer processing, processing delay is not optimized. To solve this problem, speculative packet processing ...