Learn More
The paper provides theoretical justification for the " 3-periodicity property " observed in protein coding regions within genomic DNA sequences. We propose a new classification criteria improving upon traditional frequency based approaches for identification of coding regions. Experimental studies indicate superior performance compared with other algorithms(More)
A fundamental problem in wireless sensor networks is localization -- the determination of the geographical locations of sensors. Most existing localization algorithms were designed to work well either in networks of static sensors or networks in which all sensors are mobile. In this paper, we propose two localization algorithms, MSL and MSL*, that work well(More)
While the well-known Transport Control Protocol (TCP) is a <i>de facto</i> standard for reliable communication on the Internet, and performs well in practice, the question "how good is the TCP/IP congestion control algorithm?" is not completely resolved. In this paper, we provide some answers to this question using the competitive analysis framework. First,(More)
Flow cytometry (FC) is a powerful technology for rapid multivariate analysis and functional discrimination of cells. Current FC platforms generate large, high-dimensional datasets which pose a significant challenge for traditional manual bivariate analysis. Automated multivariate clustering, though highly desirable, is also stymied by the critical(More)
Existing discrete Fourier transform (DFT)-based algorithms for identifying protein coding regions in DNA sequences (S. Tiwari et al., 1997, D. Anastassiou, 2001, D. Kotlar et al., 2003) exploit the empirical observation that the spectrum of protein coding regions of length N nucleotides has a peak at frequency k=N/3. In this paper, we prove the(More)
We present a model-based clustering method, SWIFT (Scalable Weighted Iterative Flow-clustering Technique), for digesting high-dimensional large-sized datasets obtained via modern flow cytometry into more compact representations that are well-suited for further automated or manual analysis. Key attributes of the method include the following: (a) the analysis(More)
— It is believed that in the near future, there will be a large-scale deployment of wireless sensor networks for sensing, collecting and transferring information about the environments the sensors are placed in. Due to their peculiar characteristics and goals, sensor networks differ sharply from traditional wired and wireless networks, and so many problems(More)
Sensor networks are expected to revolutionize information gathering, processing and dissemination in many diverse environments. In this paper, we address a fundamental problem in designing sensor networks: localization, or determining the locations of nodes. We assume that a small fraction of the sensor nodes (called seeds) know their locations. We propose(More)
P2P networks have been proposed as a scalable, inexpensive solution to the problem of distributing multimedia content over the Internet. Since real P2P systems exhibit considerable heterogeneity in hardware, software and network connections, the design of P2P streaming networks must factor in this variation. There are two different sources of heterogeneity(More)