Learn More
—The problem of prescribing, reducing, or controlling the interaction forces between a robot and the environment during a noncontact-to-contact transition is intriguing because large interaction forces can damage both the robot and/or the environment or lead to degraded performance or instabilities. In this paper, we consider a two-link planar robotic arm(More)
In Electronic Commerce applications such as stock trading, there is a need to make decisions based on information collected from various sources. Many of these sources are accessible from the World Wide Web. Because the information such as stock prices keep changing, the web sources must be queried continually to maintain temporal coherency of the data in(More)
The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of any sponsoring institution, the US government or any other entity. Abstract The computation and storage capabilities of today's mobile devices are rapidly catching up with those of(More)
We present PEACE, a stand-alone tool for high-throughput ab initio clustering of transcript fragment sequences produced by Next Generation or Sanger Sequencing technologies. It is freely available from www.peace-tools.org. Installed and managed through a downloadable user-friendly graphical user interface (GUI), PEACE can process large data sets of(More)
Now a day's character Identification from films is a very challenging task due to the huge variation in the appearance of each & every character. It will lead significant research interests and may have many interesting applications in today's life. In this paper, we investigate the problem of identifying characters & annotating them with(More)
We analyze Coordinated Multi-Point (CoMP) transmission and reception over heterogeneous wireless networks (HetNets). Our focus is on the design of a practical algorithm for joint resource allocation (joint scheduling) in each HetNet cluster. We present one such algorithm together with its detailed analysis and evaluation under two different approaches for(More)
PEACE and EAST, together forming a pipeline for the clustering and assembly of EST transcript fragments, make use of a novel d<sup>2</sup>-based minimum spanning tree algorithm that results in quickly generated, high quality assemblies when applied to the results of Sanger sequencing. The tool is considerably more robust to sequencing error than competing(More)
  • 1