The next generation access network should provide full service. In such a Full Service Access Network the users need only one physical access point and one set of cables (or radio access link) irrespective of the service required. This paper studies genetic algorithms for application in access network dimensioning. Genetic algorithms is not a special purpose optimization technique, but is very ...

Newspapers are rich records of U.S. history. Due to the deterioration of older newspapers, the National Endowment for the Humanities is archiving 19th century newspapers on microfilm. Although microfilm is a good preservation method, it provides limited access to researchers and the general public. We are building a system to provide universal access to digital images and full-text content of h...

There are two concurrent paths in a typical cache access — one through the data array and the other through the tag array. In most cases, the path through the tag array is significantly longer than that through the data array. In this paper, we propose a new scheme that exploits this imbalance in the tag and data paths to improve overall cache performance. Under this scheme, an additional tag d...

We address the issue of providing a topic driven access to full text documents. The methodology we propose is a combination of topic segmentation and information retrieval techniques. By segmenting the text into topic driven segments, we obtain small and coherent documents that can be used as a basis for the automatic generation of links, and as a visualization aid for the reader who is present...

A decision maker must divide a prize between multiple agents. The prize may be divisible (e.g., a budget, pork-barrel spending) in which case he prefers to award larger shares of the prize to relatively more-qualified agents, or it may be non-divisible (e.g., jobs, college admissions) in which case he prefers to award the limited number of prizes to the most-qualified agents. He is, however, ex...

Context and Structure in Automated Full-Text Information Access

For smooth and strongly convex optimizations, the optimal iteration complexity of the gradient-based algorithm is O( √ κ log 1/ǫ), where κ is the condition number. In the case that the optimization problem is ill-conditioned, we need to evaluate a large number of full gradients, which could be computationally expensive. In this paper, we propose to remove the dependence on the condition number ...