# Browse Research and Tech Reports - Computer Science by Issue Date

• (2004-01)
We describe an approach for answer selection in a free form question answering task. In order to go beyond a key-word based matching in selecting answers to questions, one would like to develop a principled way for the ...

application/pdf

PDF (343kB)
• (2004-02)
In this paper, we explore the fundamental limits of sensor network lifetime that all algorithms can possibly achieve. Specifically, under the assumptions that nodes are deployed as a Poisson point process with density ...

application/pdf

PDF (399kB)
• (2004-02)
GREEN is a stateless queue-management algorithm that removes TCP's bias against connections with longer round-trip times, resulting in a high degree of fairness while maintaining high link utilization, low packet loss, and ...

application/pdf

PDF (440kB)
• (2004-02)
Distinct from wireless ad hoc networks, wireless sensor networks are data-centric, application-oriented, collaborative, and energy-constrained in nature. In this paper, formulate the problem of data transport in sensor ...

application/pdf

PDF (397kB)
• (2004-02)
We examine the problem of providing useful feedback to users who are denied access to resources, while controlling the disclosure of the system security policies. High-quality feedback enhances the usability of a system, ...

application/pdf

PDF (2MB)
• (2004-02)
In this paper we present an online algorithm for pursuit-evasion in an unknown simply connected enviroment, for one pursuer that has minimal sensing and carries a set of stationary sentries that it can drop off and pick ...

application/pdf

PDF (159kB)
• (2004-02)
Mobile systems primarily processing multimedia data are expected to become important platforms for pervasive computing. These systems, however, must satisfy large, dynamic demands of multimedia applications subject to ...

application/pdf

PDF (141kB)
• (2004-03)
Recently, the Web has been rapidly deepened" with the prevalence of databases online and becomes an important frontier for data integration. On this deep Web, a significant amount of information can only be accessed as ...

application/pdf

PDF (217kB)
• (2004-03)
This paper presents a tool-supported methodological paradigm for object-oriented software development, called monitoring-oriented programming and abbreviated MOP, in which runtime monitoring is a basic software design ...

application/pdf

PDF (462kB)
• (2004-03)
Previous work on topology control usually assumes homogeneous wireless nodes with uniform transmission ranges. In this paper, we propose two localized topology control algorithms for heterogeneous wireless multi-hop networks ...

application/pdf

PDF (305kB)
• (2004-03)
The field of studies on complex systems is becoming one of the most active research areas in computer science. Among those systems, there is a type of system that has the following characteristics: comprising a large number ...

application/pdf

PDF (170kB)
• (2004-03)
Many problems in engineering and physics require the solution of a large sequence of linear systems. We can reduce the cost of solving subsequent systems in the sequence by recycling information from previous systems. We ...

application/pdf

PDF (625kB)
• (2004-04)
An important problem for agents in open multiagent systems is how to find agents that match certain criteria. A number of middle agent services, such as matchmaking and brokering services, have been proposed to address ...

application/pdf

PDF (6MB)
• (2004-04)
To contribute to systems that reason about human attention, our work empirically demonstrates how a user's mental workload changes during task execution. We conducted a study where users performed an interactive hierarchical ...

application/pdf

PDF (2MB)
• (2004-04)
In this paper, we present MPARC (Multi-Priority Admission and Rate Control), a novel joint admission control and rate policing protocol for multi-priority ad hoc networks. MPARC is based on our novel bandwidth allocation ...

application/pdf

PDF (321kB)
• (2004-04)
This paper presents a distributed contention window control control algorithm, GCA (General Contention window Adaptation), that achieves various bandwidth allocation policies and at same time efficient channel utilization. ...

application/pdf

PDF (391kB)
• (2004-04)
Existing retrieval models all attempt to optimize one single utility function, which is often based on the topical relevance of a document with respect to a query. In real applications, retrieval involves more complex ...

application/pdf

PDF (161kB)
• (2004-04)
Time attribute is one of the most important attributes of time series data generated in wireless sensor networks. Coupled with energy, bandwidth, computational constraints of wireless sensors, efficient mechanisms need to ...

application/pdf

PDF (382kB)
• (2004-04)
In this paper, we present a rescaling simulation methodology (RSM) to expedite simulation in large-scale TCP/IP networks without loss of fidelity of simulation results. Conceptually, we scale down the network to be simulated ...

application/pdf

PDF (796kB)
• (2004-04)
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split the traffic and feed them into multiple ...

application/pdf

PDF (953kB)