@article {20295,
	title = {Biofilms Comprise a Component of the Annual Cycle of <i>Vibrio cholerae</i> in the Bay of Bengal Estuary},
	journal = {mBio},
	year = {2018},
	month = {Feb-05-2018},
	pages = {e00483-18},
	abstract = {<em>Vibrio cholerae</em>, an estuarine bacterium, is the causative agent of cholera, a severe diarrheal disease that demonstrates seasonal incidence in Bangladesh. In an extensive study of V. cholerae occurrence in a natural aquatic environment, water and plankton samples were collected biweekly between December 2005 and November 2006 from Mathbaria, an estuarine village of Bangladesh near the mangrove forests of the Sundarbans. Toxigenic V. cholerae exhibited two seasonal growth peaks, one in spring (March to May) and another in autumn (September to November), corresponding to the two annual seasonal outbreaks of cholera in this region. The total numbers of bacteria determined by heterotrophic plate count (HPC), representing culturable bacteria, accounted for 1\% to 2.7\% of the total numbers obtained using acridine orange direct counting (AODC). The highest bacterial culture counts, including toxigenic V. cholerae, were recorded in the spring. The direct fluorescent antibody (DFA) assay was used to detect V. cholerae O1 cells throughout the year, as free-living cells, within clusters, or in association with plankton. V. cholerae O1 varied significantly in morphology, appearing as distinctly rod-shaped cells in the spring months, while small coccoid cells within thick clusters of biofilm were observed during interepidemic periods of the year, notably during the winter months. Toxigenic V. cholerae O1 was culturable in natural water during the spring when the temperature rose sharply. The results of this study confirmed biofilms to be a means of persistence for bacteria and an integral component of the annual life cycle of toxigenic V. cholerae in the estuarine environment of Bangladesh.},
	doi = {10.1128/mBio.00483-18},
	url = {https://mbio.asm.org/content/9/2/e00483-18},
	author = {Sultana, Marzia and Nusrin, Suraia and Hasan, Nur A. and Sadique, Abdus and Ahmed, Kabir U. and Islam, Atiqul and Hossain, Anwar and Longini, Ira and Nizam, Azhar and Huq, Anwar and Siddique, Abul K. and Sack, David A. and Sack, Richard B. and Rita R Colwell and Alam, Munirul},
	editor = {Vidaver, Anne K.}
}
@article {20314,
	title = {Beyond cost-effectiveness: Using systems analysis for infectious disease preparedness},
	journal = {Vaccine},
	volume = {35},
	year = {2017},
	month = {Jan-01-2017},
	pages = {A46 - A49},
	abstract = {Until the recent outbreaks, Ebola vaccines ranked low in decision makers{\textquoteright} priority lists based on cost-effectiveness analysis and (or) corporate profitability. Despite a relatively small number of Ebola-related cases and deaths (compared to other causes), Ebola vaccines suddenly leapt to highest priority among international health agencies and vaccine developers. Clearly, earlier cost-effectiveness analyses badly missed some factors affecting real world decisions. Multi-criteria systems analysis can improve evaluation and prioritization of vaccine development and also of many other health policy and investment decisions. Neither cost-effectiveness nor cost-benefit analysis can capture important aspects of problems such as Ebola or the emerging threat of Zika, especially issues of inequality and disparity{\textemdash}issues that dominate the planning of many global health and economic organizations. Cost-benefit analysis requires assumptions about the specific value of life{\textemdash}an idea objectionable to many analysts and policy makers. Additionally, standard cost-effectiveness calculations cannot generally capture effects on people uninfected with Ebola for example, but nevertheless affected through such factors as contagion, herd immunity, and fear of dread disease, reduction of travel and commerce, and even the hope of disease eradication. Using SMART Vaccines, we demonstrate how systems analysis can visibly include important {\textquotedblleft}other factors{\textquotedblright} and more usefully guide decision making and beneficially alter priority setting processes.},
	issn = {0264410X},
	doi = {10.1016/j.vaccine.2016.08.090},
	url = {https://linkinghub.elsevier.com/retrieve/pii/S0264410X16309501},
	author = {Phelps, Charles and Madhavan, Guruprasad and Rappuoli, Rino and Rita R Colwell and Fineberg, Harvey}
}
@article {20448,
	title = {A Bioinformatics 3D Cellular Morphotyping Strategy for Assessing Biomaterial Scaffold Niches},
	journal = {ACS Biomaterials Science \& Engineering},
	volume = {3},
	year = {2017},
	month = {Sep-10-2017},
	pages = {2302 - 2313},
	issn = {2373-9878},
	doi = {10.1021/acsbiomaterials.7b00473},
	url = {http://pubs.acs.org/doi/10.1021/acsbiomaterials.7b00473http://pubs.acs.org/doi/pdf/10.1021/acsbiomaterials.7b00473},
	author = {Florczyk, Stephen J. and Simon, Mylene and Juba, Derek and Pine, P. Scott and Sarkar, Sumona and Chen, Desu and Baker, Paula J. and Bodhak, Subhadip and Cardone, Antonio and Brady, Mary C. and Bajcsy, Peter and Simon, Carl G.}
}
@article {20341,
	title = {Building Infectious Disease Research Programs to Promote Security and Enhance Collaborations with Countries of the Former Soviet Union},
	journal = {Frontiers in Public Health},
	volume = {35361632},
	year = {2015},
	month = {Feb-11-2017},
	doi = {10.3389/fpubh.2015.00271},
	url = {http://journal.frontiersin.org/Article/10.3389/fpubh.2015.00271/abstract},
	author = {Bartholomew, James C. and Pearson, Andrew D. and Stenseth, Nils C. and LeDuc, James W. and Hirschberg, David L. and Rita R Colwell}
}
@article {19704,
	title = {Bear-with-me: an embodied prototype to explore tangible two-way exchanges of emotional language},
	journal = {CHI{\textquoteright}13 Extended Abstracts on Human Factors in Computing Systems},
	year = {2013},
	month = {2013/00/01},
	abstract = {Abstract Given the busy day-to-day schedule of families and couples, communication between loved ones is often limited to text-messaging, email, or phone calls. These forms of communication do not allow for more tangible modes of intimate expression like hugging. ...},
	url = {http://dl.acm.org/citation.cfm?id=2468537},
	author = {Fong, A and Ashktorab, Z and Jon Froehlich}
}
@article {19685,
	title = {Binary to Bushy: Bayesian Hierarchical Clustering with the Beta Coalescent},
	year = {2013},
	month = {2013/00/01},
	pages = {1079 - 1087},
	abstract = {Abstract Discovering hierarchical regularities in data is a key problem in interacting with large datasets, modeling cognition, and encoding knowledge. A previous Bayesian solution-- -Kingman{\textquoteright}s coalescent---provides a convenient probabilistic model for data represented ...},
	url = {http://papers.nips.cc/paper/5161-binary-to-bushy-bayesian-hierarchical-clustering-with-the-beta-coalescent},
	author = {Hu, Yuening and Jordan Boyd-Graber and Daume III, Hal and Ying, Z Irene}
}
@article {19654,
	title = {BclAF1 restriction factor is neutralized by proteasomal degradation and microRNA repression during human cytomegalovirus infection},
	journal = {Proceedings of the National Academy of Sciences},
	volume = {109},
	year = {2012},
	month = {2012/06/12/},
	pages = {9575 - 9580},
	abstract = {Cell proteins can restrict the replication of viruses. Here, we identify the cellular BclAF1 protein as a human cytomegalovirus restriction factor and describe two independent mechanisms the virus uses to decrease its steady-state levels. Immediately following infection, the viral pp71 and UL35 proteins, which are delivered to cells within virions, direct the proteasomal degradation of BclAF1. Although BclAF1 reaccumulates through the middle stages of infection, it is subsequently down-regulated at late times by miR-UL112-1, a virus-encoded microRNA. In the absence of BclAF1 neutralization, viral gene expression and replication are inhibited. These data identify two temporally and mechanistically distinct functions used by human cytomegalovirus to down-regulate a cellular antiviral protein.},
	keywords = {innate immunity, intrinsic immunity, miRNA, Proteasome, UL82},
	isbn = {0027-8424, 1091-6490},
	url = {http://www.pnas.org/content/109/24/9575},
	author = {Lee, Song Hee and Kalejta, Robert F. and Kerry, Julie and Semmes, Oliver John and O{\textquoteright}Connor, Christine M. and Zia Khan and Garcia, Benjamin A. and Shenk, Thomas and Murphy, Eain}
}
@article {12980,
	title = {BEAGLE: An Application Programming Interface and High-Performance Computing Library for Statistical Phylogenetics},
	journal = {Systematic BiologySyst Biol},
	volume = {61},
	year = {2012},
	month = {2012/01/01/},
	pages = {170 - 173},
	abstract = {Phylogenetic inference is fundamental to our understanding of most aspects of the origin and evolution of life, and in recent years, there has been a concentration of interest in statistical approaches such as Bayesian inference and maximum likelihood estimation. Yet, for large data sets and realistic or interesting models of evolution, these approaches remain computationally demanding. High-throughput sequencing can yield data for thousands of taxa, but scaling to such problems using serial computing often necessitates the use of nonstatistical or approximate approaches. The recent emergence of graphics processing units (GPUs) provides an opportunity to leverage their excellent floating-point computational performance to accelerate statistical phylogenetic inference. A specialized library for phylogenetic calculation would allow existing software packages to make more effective use of available computer hardware, including GPUs. Adoption of a common library would also make it easier for other emerging computing architectures, such as field programmable gate arrays, to be used in the future. We present BEAGLE, an application programming interface (API) and library for high-performance statistical phylogenetic inference. The API provides a uniform interface for performing phylogenetic likelihood calculations on a variety of compute hardware platforms. The library includes a set of efficient implementations and can currently exploit hardware including GPUs using NVIDIA CUDA, central processing units (CPUs) with Streaming SIMD Extensions and related processor supplementary instruction sets, and multicore CPUs via OpenMP. To demonstrate the advantages of a common API, we have incorporated the library into several popular phylogenetic software packages. The BEAGLE library is free open source software licensed under the Lesser GPL and available from http://beagle-lib.googlecode.com. An example client program is available as public domain software.},
	keywords = {Bayesian phylogenetics, gpu, maximum likelihood, parallel computing},
	isbn = {1063-5157, 1076-836X},
	doi = {10.1093/sysbio/syr100},
	url = {http://sysbio.oxfordjournals.org/content/61/1/170},
	author = {Ayres,Daniel L and Darling,Aaron and Zwickl,Derrick J and Beerli,Peter and Holder,Mark T and Lewis,Paul O and Huelsenbeck,John P and Ronquist,Fredrik and Swofford,David L and Cummings, Michael P. and Rambaut,Andrew and Suchard,Marc A}
}
@conference {19488,
	title = {Before We Knew It: An Empirical Study of Zero-day Attacks in the Real World},
	booktitle = {CCS {\textquoteright}12 Proceedings of the 2012 ACM conference on Computer and Communications Security},
	series = {CCS {\textquoteright}12},
	year = {2012},
	month = {2012///},
	pages = {833 - 844},
	publisher = {ACM},
	organization = {ACM},
	abstract = {Little is known about the duration and prevalence of zero-day attacks, which exploit vulnerabilities that have not been disclosed publicly. Knowledge of new vulnerabilities gives cyber criminals a free pass to attack any target of their choosing, while remaining undetected. Unfortunately, these serious threats are difficult to analyze, because, in general, data is not available until after an attack is discovered. Moreover, zero-day attacks are rare events that are unlikely to be observed in honeypots or in lab experiments. In this paper, we describe a method for automatically identifying zero-day attacks from field-gathered data that records when benign and malicious binaries are downloaded on 11 million real hosts around the world. Searching this data set for malicious files that exploit known vulnerabilities indicates which files appeared on the Internet before the corresponding vulnerabilities were disclosed. We identify 18 vulnerabilities exploited before disclosure, of which 11 were not previously known to have been employed in zero-day attacks. We also find that a typical zero-day attack lasts 312 days on average and that, after vulnerabilities are disclosed publicly, the volume of attacks exploiting them increases by up to 5 orders of magnitude.},
	keywords = {full disclosure, vulnerabilities, zero-day attacks},
	isbn = {978-1-4503-1651-4},
	url = {http://doi.acm.org/10.1145/2382196.2382284},
	author = {Bilge, Leyla and Tudor Dumitras}
}
@article {12424,
	title = {Besting the Quiz Master: Crowdsourcing Incremental Classification Games},
	journal = {Empirical Methods in Natural Language Processing},
	year = {2012},
	month = {2012///},
	abstract = {Cost-sensitive classification, where the features used in machine learning tasks have a cost, has been explored as a means of balancing knowl- edge against the expense of obtaining new fea- tures. We introduce a setting where humans engage in classification with incrementally re- vealed features: the collegiate trivia circuit. By providing the community with a web-based system to practice, we collected tens of thou- sands of implicit word-by-word ratings of how useful features are for eliciting correct answers. Observing humans{\textquoteright} classification process, we improve the performance of a state-of-the art classifier. We also use the dataset to evaluate a system to compete in the incremental classifica- tion task through a reduction of reinforcement learning to classification. Our system learns when to answer a question, performing better than baselines and most human players.},
	author = {Satinoff,Brianna and Jordan Boyd-Graber}
}
@conference {18541,
	title = {$\#$bias: Measuring the Tweeting Behavior of Propagandists},
	booktitle = {Sixth International AAAI Conference on Weblogs and Social Media},
	year = {2012},
	month = {2012/05/20/},
	abstract = {$\#$bias: Measuring the Tweeting Behavior of Propagandists},
	url = {http://www.aaai.org/ocs/index.php/ICWSM/ICWSM12/paper/view/4588},
	author = {Lumezanu,Cristian and Feamster, Nick and Klein,Hans}
}
@article {20063,
	title = {Biases from model assumptions in texture sub-cellular image segmentation},
	journal = {SPIE Newsroom},
	volume = {13},
	year = {2012},
	author = {Cardone, Antonio and Amelot, Julien and Li-Baboud, Ya-Shian and Brady, Mary and Bajcsy, Peter}
}
@article {19135,
	title = {Bioinformatics for the Human Microbiome Project},
	journal = {PLoS Computational Biology},
	volume = {8},
	year = {2012},
	month = {11/2012},
	pages = {e1002779},
	doi = {10.1371/journal.pcbi.1002779},
	author = {Gevers, Dirk and Pop, Mihai and Schloss, Patrick D. and Huttenhower, Curtis}
}
@article {12433,
	title = {A Blur-robust Descriptor with Applications to Face Recognition},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {PP},
	year = {2012},
	month = {2012/01/10/},
	pages = {1 - 1},
	abstract = {Understanding the effect of blur is an important problem in unconstrained visual analysis. We address this problem in the context of image-based recognition, by a fusion of image-formation models, and differential geometric tools. First, we discuss the space spanned by blurred versions of an image and then under certain assumptions, provide a differential geometric analysis of that space. More specifically, we create a subspace resulting from convolution of an image with a complete set of orthonormal basis functions of a pre-specified maximum size (that can represent an arbitrary blur kernel within that size), and show that the corresponding subspaces created from a clean image and its blurred versions are equal under the ideal case of zero noise, and some assumptions on the properties of blur kernels. We then study the practical utility of this subspace representation for the problem of direct recognition of blurred faces, by viewing the subspaces as points on the Grassmann manifold and present methods to perform recognition for cases where the blur is both homogenous and spatially varying. We empirically analyze the effect of noise, as well as the presence of other facial variations between the gallery and probe images, and provide comparisons with existing approaches on standard datasets.},
	keywords = {Blur, convolution, Face, face recognition, Grassmann manifold, Kernel, Manifolds, NOISE, PROBES},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2012.15},
	author = {Gopalan,R. and Taheri, S. and Turaga,P. and Chellapa, Rama}
}
@article {16247,
	title = {Bacillus Anthracis Comparative Genome Analysis in Support of the Amerithrax Investigation},
	journal = {Proceedings of the National Academy of SciencesPNAS},
	volume = {108},
	year = {2011},
	month = {2011/03/22/},
	pages = {5027 - 5032},
	abstract = {Before the anthrax letter attacks of 2001, the developing field of microbial forensics relied on microbial genotyping schemes based on a small portion of a genome sequence. Amerithrax, the investigation into the anthrax letter attacks, applied high-resolution whole-genome sequencing and comparative genomics to identify key genetic features of the letters{\textquoteright} Bacillus anthracis Ames strain. During systematic microbiological analysis of the spore material from the letters, we identified a number of morphological variants based on phenotypic characteristics and the ability to sporulate. The genomes of these morphological variants were sequenced and compared with that of the B. anthracis Ames ancestor, the progenitor of all B. anthracis Ames strains. Through comparative genomics, we identified four distinct loci with verifiable genetic mutations. Three of the four mutations could be directly linked to sporulation pathways in B. anthracis and more specifically to the regulation of the phosphorylation state of Spo0F, a key regulatory protein in the initiation of the sporulation cascade, thus linking phenotype to genotype. None of these variant genotypes were identified in single-colony environmental B. anthracis Ames isolates associated with the investigation. These genotypes were identified only in B. anthracis morphotypes isolated from the letters, indicating that the variants were not prevalent in the environment, not even the environments associated with the investigation. This study demonstrates the forensic value of systematic microbiological analysis combined with whole-genome sequencing and comparative genomics.},
	isbn = {0027-8424, 1091-6490},
	doi = {10.1073/pnas.1016657108},
	url = {http://www.pnas.org/content/108/12/5027},
	author = {Rasko,David A and Worsham,Patricia L and Abshire,Terry G and Stanley,Scott T and Bannan,Jason D and Wilson,Mark R and Langham,Richard J and Decker,R. Scott and Jiang,Lingxia and Read,Timothy D. and Phillippy,Adam M and Salzberg,Steven L. and Pop, Mihai and Van Ert,Matthew N and Kenefic,Leo J and Keim,Paul S and Fraser-Liggett,Claire M and Ravel,Jacques}
}
@article {19114,
	title = {Bambus 2: scaffolding metagenomes},
	journal = {Bioinformatics},
	volume = {27},
	year = {2011},
	month = {2011},
	pages = {2964 - 2971},
	author = {Koren, S. and Treangen, T.J. and Pop, Mihai}
}
@conference {12398,
	title = {Believe Me{\textemdash}We Can Do This! Annotating Persuasive Acts in Blog Text},
	booktitle = {Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence},
	year = {2011},
	month = {2011///},
	author = {Anand,P. and King,J. and Jordan Boyd-Graber and Wagner,E. and Martell,C. and Oard, Douglas and Resnik, Philip}
}
@conference {13067,
	title = {Birdlets: Subordinate categorization using volumetric primitives and pose-normalized appearance},
	booktitle = {Computer Vision (ICCV), 2011 IEEE International Conference on},
	year = {2011},
	month = {2011/11//},
	pages = {161 - 168},
	abstract = {Subordinate-level categorization typically rests on establishing salient distinctions between part-level characteristics of objects, in contrast to basic-level categorization, where the presence or absence of parts is determinative. We develop an approach for subordinate categorization in vision, focusing on an avian domain due to the fine-grained structure of the category taxonomy for this domain. We explore a pose-normalized appearance model based on a volumetric poselet scheme. The variation in shape and appearance properties of these parts across a taxonomy provides the cues needed for subordinate categorization. Training pose detectors requires a relatively large amount of training data per category when done from scratch; using a subordinate-level approach, we exploit a pose classifier trained at the basic-level, and extract part appearance and shape information to build subordinate-level models. Our model associates the underlying image pattern parameters used for detection with corresponding volumetric part location, scale and orientation parameters. These parameters implicitly define a mapping from the image pixels into a pose-normalized appearance space, removing view and pose dependencies, facilitating fine-grained categorization from relatively few training examples.},
	keywords = {appearance, Birdlets;category, categorization;subordinate-level, detection;pose, detectors;pose-normalized, distinctions;shape, estimation;, extraction;pose, extraction;subordinate-level, information, model;salient, models;volumetric, pixels;part, poselet, primitives;computer, resolution;information, retrieval;object, scheme;volumetric, taxonomy;computer, vision;image},
	doi = {10.1109/ICCV.2011.6126238},
	author = {Farrell,R. and Oza,O. and Zhang,Ning and Morariu,V.I. and Darrell,T. and Davis, Larry S.}
}
@inbook {19640,
	title = {On the Black-Box Complexity of Optimally-Fair Coin Tossing},
	booktitle = {Theory of Cryptography},
	series = {Lecture Notes in Computer Science},
	year = {2011},
	month = {2011/01/01/},
	pages = {450 - 467},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {A fair two-party coin tossing protocol is one in which both parties output the same bit that is almost uniformly distributed (i.e., it equals 0 and 1 with probability that is at most negligibly far from one half). It is well known that it is impossible to achieve fair coin tossing even in the presence of fail-stop adversaries (Cleve, FOCS 1986). In fact, Cleve showed that for every coin tossing protocol running for r rounds, an efficient fail-stop adversary can bias the output by Ω(1/r). Since this is the best possible, a protocol that limits the bias of any adversary to O(1/r) is called optimally-fair. The only optimally-fair protocol that is known to exist relies on the existence of oblivious transfer, because it uses general secure computation (Moran, Naor and Segev, TCC 2009). However, it is possible to achieve a bias of O(1/r√)O(1/\sqrt{r}) in r rounds relying only on the assumption that there exist one-way functions. In this paper we show that it is impossible to achieve optimally-fair coin tossing via a black-box construction from one-way functions for r that is less than O(n/logn), where n is the input/output length of the one-way function used. An important corollary of this is that it is impossible to construct an optimally-fair coin tossing protocol via a black-box construction from one-way functions whose round complexity is independent of the security parameter n determining the security of the one-way function being used. Informally speaking, the main ingredient of our proof is to eliminate the random-oracle from {\textquotedblleft}secure{\textquotedblright} protocols with {\textquotedblleft}low round-complexity{\textquotedblright} and simulate the protocol securely against semi-honest adversaries in the plain model. We believe our simulation lemma to be of broader interest.},
	keywords = {Algorithm Analysis and Problem Complexity, black-box separations, Coding and Information Theory, coin tossing, Computer Communication Networks, Data Encryption, lower-bound, Math Applications in Computer Science, optimally-fair coin tossing, round-complexity, Systems and Data Security},
	isbn = {978-3-642-19570-9, 978-3-642-19571-6},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-19571-6_27},
	author = {Dana Dachman-Soled and Lindell, Yehuda and Mahmoody, Mohammad and Malkin, Tal},
	editor = {Ishai, Yuval}
}
@conference {12435,
	title = {Blurring-invariant Riemannian metrics for comparing signals and images},
	booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)},
	year = {2011},
	month = {2011/11/06/13},
	pages = {1770 - 1775},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We propose a novel Riemannian framework for comparing signals and images in a manner that is invariant to their levels of blur. This framework uses a log-Fourier representation of signals/images in which the set of all possible Gaussian blurs of a signal, i.e. its orbits under semigroup action of Gaussian blur functions, is a straight line. Using a set of Riemannian metrics under which the group actions are by isometries, the orbits are compared via distances between orbits. We demonstrate this framework using a number of experimental results involving 1D signals and 2D images.},
	keywords = {blurring-invariant Riemannian metrics, Estimation, Fourier transforms, Gaussian blur function, Gaussian processes, image representation, log-Fourier representation, measurement, Orbits, Polynomials, signal representation, Space vehicles, vectors},
	isbn = {978-1-4577-1101-5},
	doi = {10.1109/ICCV.2011.6126442},
	author = {Zhengwu Zhang and Klassen, E. and Srivastava, A. and Turaga,P. and Chellapa, Rama}
}
@conference {18551,
	title = {Boosting the scalability of botnet detection using adaptive traffic sampling},
	booktitle = {Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security},
	series = {ASIACCS {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {124 - 134},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Botnets pose a serious threat to the health of the Internet. Most current network-based botnet detection systems require deep packet inspection (DPI) to detect bots. Because DPI is a computational costly process, such detection systems cannot handle large volumes of traffic typical of large enterprise and ISP networks. In this paper we propose a system that aims to efficiently and effectively identify a small number of suspicious hosts that are likely bots. Their traffic can then be forwarded to DPI-based botnet detection systems for fine-grained inspection and accurate botnet detection. By using a novel adaptive packet sampling algorithm and a scalable spatial-temporal flow correlation approach, our system is able to substantially reduce the volume of network traffic that goes through DPI, thereby boosting the scalability of existing botnet detection systems. We implemented a proof-of-concept version of our system, and evaluated it using real-world legitimate and botnet-related network traces. Our experimental results are very promising and suggest that our approach can enable the deployment of botnet-detection systems in large, high-speed networks.},
	keywords = {adaptive sampling, botnet, intrusion detection, NETWORK SECURITY},
	isbn = {978-1-4503-0564-8},
	doi = {10.1145/1966913.1966930},
	url = {http://doi.acm.org/10.1145/1966913.1966930},
	author = {Zhang,Junjie and Luo,Xiapu and Perdisci,Roberto and Gu,Guofei and Lee,Wenke and Feamster, Nick}
}
@conference {17982,
	title = {Brief announcement: better speedups for parallel max-flow},
	booktitle = {Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures},
	year = {2011},
	month = {2011///},
	pages = {131 - 134},
	abstract = {We present a parallel solution to the Maximum-Flow (Max-Flow) problem, suitable for a modern many-core architec-
ture. We show that by starting from a PRAM algorithm,
following an established {\textquotedblleft}programmer{\textquoteright}s workflow{\textquotedblright} and tar-
geting XMT, a PRAM-inspired many-core architecture, we
achieve significantly higher speed-ups than previous approaches.
Comparison with the fastest known serial max-flow imple-
mentation on a modern CPU demonstrates for the first time
potential for orders-of-magnitude performance improvement
for Max-Flow. Using XMT, the PRAM Max-Flow algorithm
is also much easier to program than for other parallel plat-
forms, contributing a powerful example toward dual valida-
tion of both PRAM algorithmics and XMT.
},
	author = {Caragea,G.C. and Vishkin, Uzi}
}
@article {18510,
	title = {Broadband internet performance: A view from the gateway},
	journal = {SIGCOMM-Computer Communication Review},
	volume = {41},
	year = {2011},
	month = {2011///},
	pages = {134 - 134},
	abstract = {We present the first study of network access link performance mea-sured directly from home gateway devices. Policymakers, ISPs,
and users are increasingly interested in studying the performance
of Internet access links. Because of many confounding factors in a
home network or on end hosts, however, thoroughly understanding
access network performance requires deploying measurement in-
frastructure in users{\textquoteright} homes as gateway devices. In conjunction
with the Federal Communication Commission{\textquoteright}s study of broad-
band Internet access in the United States, we study the throughput
and latency of network access links using longitudinal measure-
ments from nearly 4,000 gateway devices across 8 ISPs from a de-
ployment of over 4,200 devices. We study the performance users
achieve and how various factors ranging from the user{\textquoteright}s choice of
modem to the ISP{\textquoteright}s traffic shaping policies can affect performance.
Our study yields many important findings about the characteristics
of existing access networks. Our findings also provide insights into
the ways that access network performance should be measured and
presented to users, which can help inform ongoing broader efforts
to benchmark the performance of access networks.
},
	author = {Sundaresan,S. and de Donato,W. and Feamster, Nick and Teixeira,R. and Crawford,S. and Pescap{\`e},A.}
}
@conference {14834,
	title = {Bypassing synthesis: PLS for face recognition with pose, low-resolution and sketch},
	booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on},
	year = {2011},
	month = {2011/06//},
	pages = {593 - 600},
	abstract = {This paper presents a novel way to perform multi-modal face recognition. We use Partial Least Squares (PLS) to linearly map images in different modalities to a common linear subspace in which they are highly correlated. PLS has been previously used effectively for feature selection in face recognition. We show both theoretically and experimentally that PLS can be used effectively across modalities. We also formulate a generic intermediate subspace comparison framework for multi-modal recognition. Surprisingly, we achieve high performance using only pixel intensities as features. We experimentally demonstrate the highest published recognition rates on the pose variations in the PIE data set, and also show that PLS can be used to compare sketches to photos, and to compare images taken at different resolutions.},
	keywords = {approximations;pose, COMPARISON, estimation;, extraction;image, framework;face, intensities;subspace, least, PLS;bypassing, recognition;feature, recognition;partial, resolution;least, selection;multimodal, squares, squares;pixel, synthesis;face},
	doi = {10.1109/CVPR.2011.5995350},
	author = {Sharma,A. and Jacobs, David W.}
}
@conference {18550,
	title = {Behavioral clustering of HTTP-based malware and signature generation using malicious network traces},
	booktitle = {Proceedings of the 7th USENIX conference on Networked systems design and implementation},
	series = {NSDI{\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {26 - 26},
	publisher = {USENIX Association},
	organization = {USENIX Association},
	address = {Berkeley, CA, USA},
	abstract = {We present a novel network-level behavioral malware clustering system. We focus on analyzing the structural similarities among malicious HTTP traffic traces generated by executing HTTP-based malware. Our work is motivated by the need to provide quality input to algorithms that automatically generate network signatures. Accordingly, we define similarity metrics among HTTP traces and develop our system so that the resulting clusters can yield high-quality malware signatures. We implemented a proof-of-concept version of our network-level malware clustering system and performed experiments with more than 25,000 distinct malware samples. Results from our evaluation, which includes real-world deployment, confirm the effectiveness of the proposed clustering system and show that our approach can aid the process of automatically extracting network signatures for detecting HTTP traffic generated by malware-compromised machines.},
	url = {http://dl.acm.org/citation.cfm?id=1855711.1855737},
	author = {Perdisci,Roberto and Lee,Wenke and Feamster, Nick}
}
@article {14201,
	title = {Better Flow Estimation from Color Images-Volume 2007, Article ID 53912, 9 pages},
	journal = {EURASIP Journal on Advances in Signal Processing},
	volume = {2007},
	year = {2010},
	month = {2010///},
	author = {Ji,H. and Ferm{\"u}ller, Cornelia}
}
@article {16459,
	title = {BioNav: An Ontology-Based Framework to Discover Semantic Links in the Cloud of Linked Data},
	journal = {The Semantic Web: Research and Applications},
	year = {2010},
	month = {2010///},
	pages = {441 - 445},
	author = {Vidal,M. E and Raschid, Louiqa and M{\'a}rquez,N. and Rivera,J. and Ruckhaus,E.}
}
@article {15165,
	title = {Bounds on the efficiency of black-box commitment schemes},
	journal = {Theoretical Computer Science},
	volume = {411},
	year = {2010},
	month = {2010/03/04/},
	pages = {1251 - 1260},
	abstract = {Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theoretic) assumptions. This has prompted a recent line of research aimed at investigating the best possible efficiency of (black-box) cryptographic constructions based on general assumptions. Here, we present bounds on the efficiency of statistically-binding commitment schemes constructed using black-box access to one-way permutations; our bounds are tight for the case of perfectly-binding schemes. Our bounds hold in an extension of the Impagliazzo{\textendash}Rudich model: we show that any construction beating our bounds would imply the unconditional existence of a one-way function (from which a statistically-binding commitment scheme could be constructed {\textquotedblleft}from scratch{\textquotedblright}).},
	keywords = {Commitment schemes, cryptography},
	isbn = {0304-3975},
	doi = {10.1016/j.tcs.2009.10.021},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397509007737},
	author = {Horvitz,Omer and Katz, Jonathan}
}
@article {12220,
	title = {Brief announcement: decentralized network bandwidth prediction},
	journal = {Distributed Computing},
	year = {2010},
	month = {2010///},
	pages = {198 - 200},
	abstract = {Distributed applications can often benefit from knowledge of the bandwidth between hosts, without performing measurements between all host pairs. For example, if a peer-to-peer (P2P) computational grid system predicts pairwise bandwidth between all nodes in the system, that information could increase overall system performance by finding high-bandwidth nodes to store large scientific input or output datasets. Another possible beneficiary is a P2P online game, which can provide users a seamless gaming experience by selecting a coordinator node that has high-bandwidth connections to the players in a game region.},
	author = {Song,S. and Keleher,P. and Bhattacharjee, Bobby and Sussman, Alan}
}
@article {15259,
	title = {Broadcasting on networks of workstations},
	journal = {Algorithmica},
	volume = {57},
	year = {2010},
	month = {2010///},
	pages = {848 - 868},
	abstract = {Broadcasting and multicasting are fundamental operations. In this work we develop algorithms for performing broadcast and multicast in clusters of workstations. In this model, sending a message to a machine in the same cluster takes 1 time unit, and sending a message to a machine in a different cluster takes C(>=1) time units. The clusters may have arbitrary sizes. Lowekamp and Beguelin proposed heuristics for this model, but their algorithms may produce broadcast times that are arbitrarily worse than optimal. We develop the first constant factor approximation algorithms for this model. Algorithm LCF (Largest Cluster First) for the basic model is simple, efficient and has a worst case approximation guarantee of 2. We then extend these models to more complex models where we remove the assumption that an unbounded amount of communication may happen using the global network. The algorithms for these models build on the LCF method developed for the basic problem. Finally, we develop broadcasting algorithms for the postal model where the sending node does not block for C time units when the message is in transit.},
	doi = {10.1007/s00453-008-9249-0},
	author = {Khuller, Samir and Kim,Y. A and Wan,Y. C.J}
}
@conference {13425,
	title = {Broadening student enthusiasm for computer science with a great insights course},
	booktitle = {Proceedings of the 41st ACM technical symposium on Computer science education},
	series = {SIGCSE {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {157 - 161},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We describe the "Great Insights in Computer Science" courses that are taught at Rutgers and UMBC. These courses were designed independently, but have in common a broad, engaging introduction to computing for non-majors. Both courses include a programming component to help the students gain an intuition for computational concepts, but neither is primarily programming focused. We present data to show that these courses attract a diverse group of students; are rated positively; and increase students{\textquoteright} understanding of, and attitudes towards, computing and computational issues.},
	keywords = {attitudes towards computing, introductory courses},
	isbn = {978-1-4503-0006-3},
	doi = {10.1145/1734263.1734317},
	url = {http://doi.acm.org/10.1145/1734263.1734317},
	author = {desJardins, Marie and Littman,Michael}
}
@article {12983,
	title = {Broader incorporation of bioinformatics in education: opportunities and challenges},
	journal = {Brief Bioinform},
	volume = {11},
	year = {2010},
	month = {2010///},
	abstract = {The major opportunities for broader incorporation of bioinformatics in education can be placed into three general categories: general applicability of bioinformatics in life science and related curricula; inherent fit of bioinformatics for promoting student learning in most biology programs; and the general experience and associated comfort students have with computers and technology. Conversely, the major challenges for broader incorporation of bioinformatics in education can be placed into three general categories: required infrastructure and logistics; instructor knowledge of bioinformatics and continuing education; and the breadth of bioinformatics, and the diversity of students and educational objectives. Broader incorporation of bioinformatics at all education levels requires overcoming the challenges to using transformative computer- requiring learning activities, assisting faculty in collecting assessment data on mastery of student learning outcomes, as well as creating more faculty development opportunities that span diverse skill levels, with an emphasis placed on providing resource materials that are kept up-to-date as the field and tools change.},
	author = {Cummings, Michael P. and Temple,GG}
}
@conference {19295,
	title = {Buffer management for multi-application image processing on multi-core platforms: Analysis and case study},
	booktitle = {2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)},
	year = {2010},
	month = {2010},
	pages = {1662 - 1665},
	abstract = {Due to the limited amounts of on-chip memory, large volumes of data, and performance and power consumption overhead associated with interprocessor communication, efficient management of buffer memory is critical to multi-core image processing. To address this problem, this paper develops new modeling and analysis techniques based on dataflow representations, and demonstrates these techniques on a multi-core implementation case study involving multiple, concurrently-executing image processing applications. Our techniques are based on careful representation and exploitation of frame- or block-based operations, which involve repeated invocations of the same computations across regularly- arranged subsets of data. Using these new approaches to manage block-based image data, this paper demonstrates methods to analyze synchronization overhead and FIFO buffer sizes when mapping image processing applications onto heterogeneous, multi core architectures.},
	keywords = {block-based image data, buffer memory management, buffer storage, concurrently-executing image processing application, data flow computing, data flow representation, data subset, Dataflow, Digital signal processing, Energy consumption, Energy management, Engineering management, FIFO buffer sizes, Hardware, Image analysis, IMAGE PROCESSING, image processing application, image representation, interprocessor communication, memory architecture, Memory management, multiapplication image processing, multicore image processing, multiprocessing, on-chip memory, power consumption, power consumption overhead, Runtime, scheduling, set theory, shared memory, storage management chips, synchronization overhead},
	author = {Ko,Dong-Ik and Won, N. and Bhattacharyya, Shuvra S.}
}
@article {18499,
	title = {Building a dynamic reputation system for DNS},
	journal = {19th Usenix Security Symposium},
	year = {2010},
	month = {2010///},
	abstract = {The Domain Name System (DNS) is an essential protocolused by both legitimate Internet applications and cyber at-
tacks. For example, botnets rely on DNS to support agile com-
mand and control infrastructures. An effective way to disrupt
these attacks is to place malicious domains on a {\textquotedblleft}blocklist{\textquotedblright}
(or {\textquotedblleft}blacklist{\textquotedblright}) or to add a filtering rule in a firewall or net-
work intrusion detection system. To evade such security coun-
termeasures, attackers have used DNS agility, e.g., by using
new domains daily to evade static blacklists and firewalls. In
this paper we propose Notos, a dynamic reputation system for
DNS. The premise of this system is that malicious, agile use
of DNS has unique characteristics and can be distinguished
from legitimate, professionally provisioned DNS services. No-
tos uses passive DNS query data and analyzes the network
and zone features of domains. It builds models of known legit-
imate domains and malicious domains, and uses these models
to compute a reputation score for a new domain indicative of
whether the domain is malicious or legitimate. We have eval-
uated Notos in a large ISP{\textquoteright}s network with DNS traffic from
1.4 million users. Our results show that Notos can identify
malicious domains with high accuracy (true positive rate of
96.8\%) and low false positive rate (0.38\%), and can identify
these domains weeks or even months before they appear in
public blacklists.
},
	author = {Antonakakis,M. and Perdisci,R. and Dagon,D. and Lee,W. and Feamster, Nick}
}
@article {18553,
	title = {Building a fast, virtualized data plane with programmable hardware},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {40},
	year = {2010},
	month = {2010/01//},
	pages = {75 - 82},
	abstract = {Network virtualization allows many networks to share the same underlying physical topology; this technology has offered promise both for experimentation and for hosting multiple networks on a single shared physical infrastructure. Much attention has focused on virtualizing the network control plane, but, ultimately, a limiting factor in the deployment of these virtual networks is data-plane performance: Virtual networks must ultimately forward packets at rates that are comparable to native, hardware-based approaches. Aside from proprietary solutions from vendors, hardware support for virtualized data planes is limited. The advent of open, programmable network hardware promises flexibility, speed, and resource isolation, but, unfortunately, hardware does not naturally lend itself to virtualization. We leverage emerging trends in programmable hardware to design a flexible, hardware-based data plane for virtual networks. We present the design, implementation, and preliminary evaluation of this hardware-based data plane and show how the proposed design can support many virtual networks without compromising performance or isolation.},
	keywords = {netfpga, network virtualization},
	isbn = {0146-4833},
	doi = {10.1145/1672308.1672323},
	url = {http://doi.acm.org/10.1145/1672308.1672323},
	author = {Anwer,Muhammad Bilal and Feamster, Nick}
}
@conference {18932,
	title = {Building an IT Taxonomy with Co-occurrence Analysis, Hierarchical Clustering, and Multidimensional Scaling},
	year = {2010},
	month = {2010///},
	abstract = {Different information technologies (ITs) are related in complex ways. How can the relationships among a large number of ITs be described and analyzed in a representative, dynamic, and scalable way? In this study, we employed co-occurrence analysis to explore the relationships among 50 information technologies discussed in six magazines over ten years (1998-2007). Using hierarchical clustering and multidimensional scaling, we have found that the similarities of the technologies can be depicted in hierarchies and two-dimensional plots, and that similar technologies can be classified into meaningful categories. The results imply reasonable validity of our approach for understanding technology relationships and building an IT taxonomy. The methodology that we offer not only helps IT practitioners and researchers make sense of numerous technologies in the iField but also bridges two related but thus far largely separate research streams in iSchools - information management and IT management.},
	url = {https://www.ideals.illinois.edu/handle/2142/14918},
	author = {Tsui,C. and Wang,P. and Fleischmann,K.R. and Sayeed,A. B. and Weinberg, Amy}
}
@conference {13043,
	title = {Bayesian multitask learning with latent hierarchies},
	booktitle = {Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence},
	year = {2009},
	month = {2009///},
	pages = {135 - 142},
	author = {Daum{\'e}, Hal}
}
@conference {12399,
	title = {Better vocabularies for assistive communication aids: connecting terms using semantic networks and untrained annotators},
	booktitle = {Proceedings of the 11th international ACM SIGACCESS conference on Computers and accessibility},
	series = {Assets {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {171 - 178},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The difficulties of navigating vocabulary in an assistive communication device are exacerbated for individuals with lexical access disorders like those due to aphasia. We present the design and implementation of a vocabulary network based on WordNet, a resource that attempts to model human semantic memory, that enables users to find words easily. To correct for the sparsity of links among words, we augment WordNet with additional connections derived from human judgments of semantic similarity collected in an online experiment. We evaluate the resulting system, the visual vocabulary for aphasia (ViVA), and describe its potential to adapt to a user{\textquoteright}s profile and enable faster search and improved navigation.},
	keywords = {adaptive tools, aphasia, assistive communication, semantic networks, visual vocabularies},
	isbn = {978-1-60558-558-1},
	doi = {10.1145/1639642.1639673},
	url = {http://doi.acm.org/10.1145/1639642.1639673},
	author = {Nikolova,Sonya and Jordan Boyd-Graber and Fellbaum,Christiane and Cook,Perry}
}
@article {12889,
	title = {Biological agent detection technologies},
	journal = {Molecular Ecology Resources},
	volume = {9},
	year = {2009},
	month = {2009/04/21/},
	pages = {51 - 57},
	abstract = {The challenge for first responders, physicians in the emergency room, public health personnel, as well as for food manufacturers, distributors and retailers is accurate and reliable identification of pathogenic agents and their corresponding diseases. This is the weakest point in biological agent detection capability today.There is intense research for new molecular detection technologies that could be used for very accurate detection of pathogens that would be a concern to first responders. These include the need for sensors for multiple applications as varied as understanding the ecology of pathogenic micro-organisms, forensics, environmental sampling for detect-to-treat applications, biological sensors for {\textquoteleft}detect to warn{\textquoteright} in infrastructure protection, responses to reports of {\textquoteleft}suspicious powders{\textquoteright}, and customs and borders enforcement, to cite a few examples.
The benefits of accurate detection include saving millions of dollars annually by reducing disruption of the workforce and the national economy and improving delivery of correct countermeasures to those who are most in need of the information to provide protective and/or response measures.
},
	keywords = {barcoding, biological agent, DETECTION, identification, sequencing},
	isbn = {1755-0998},
	doi = {10.1111/j.1755-0998.2009.02632.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1755-0998.2009.02632.x/full},
	author = {Jakupciak,John P. and Rita R Colwell}
}
@conference {13358,
	title = {Bisimulation-based approximate lifted inference},
	booktitle = {Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence},
	series = {UAI {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {496 - 505},
	publisher = {AUAI Press},
	organization = {AUAI Press},
	address = {Arlington, Virginia, United States},
	abstract = {There has been a great deal of recent interest in methods for performing lifted inference; however, most of this work assumes that the first-order model is given as input to the system. Here, we describe lifted inference algorithms that determine symmetries and automatically lift the probabilistic model to speedup inference. In particular, we describe approximate lifted inference techniques that allow the user to trade off inference accuracy for computational efficiency by using a handful of tunable parameters, while keeping the error bounded. Our algorithms are closely related to the graph-theoretic concept of bisimulation. We report experiments on both synthetic and real data to show that in the presence of symmetries, run-times for inference can be improved significantly, with approximate lifted inference providing orders of magnitude speedup over ground inference.},
	isbn = {978-0-9749039-5-8},
	url = {http://dl.acm.org/citation.cfm?id=1795114.1795172},
	author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise}
}
@article {15084,
	title = {On black-box constructions of predicate encryption from trapdoor permutations},
	journal = {Advances in Cryptology{\textendash}ASIACRYPT 2009},
	year = {2009},
	month = {2009///},
	pages = {197 - 213},
	abstract = {Predicate encryption is a recent generalization of identity-based encryption (IBE), broadcast encryption, attribute-based encryption, and more. A natural question is whether there exist black-box constructions of predicate encryption based on generic building blocks, e.g., trapdoor permutations. Boneh et al. (FOCS 2008) recently gave a negative answer for the specific case of IBE.We show both negative and positive results. First, we identify a combinatorial property on the sets of predicates/attributes and show that, for any sets having this property, no black-box construction of predicate encryption from trapdoor permutations (or even CCA-secure encryption) is possible. Our framework implies the result of Boneh et al. as a special case, and also rules out, e.g., black-box constructions of forward-secure encryption and broadcast encryption (with many excluded users). On the positive side, we identify conditions under which predicate encryption schemes can be constructed based on any CPA-secure (standard) encryption scheme.
},
	doi = {10.1007/978-3-642-10366-7_12},
	author = {Katz, Jonathan and Yerukhimovich,A.}
}
@article {14139,
	title = {Block-diagonal preconditioning for spectral stochastic finite-element systems},
	journal = {IMA Journal of Numerical Analysis},
	volume = {29},
	year = {2009},
	month = {2009///},
	pages = {350 - 350},
	author = {Powell, C. E and Elman, Howard}
}
@conference {17994,
	title = {Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor},
	booktitle = {Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures},
	year = {2009},
	month = {2009///},
	pages = {163 - 165},
	author = {Caragea,G.C. and Saybasili,A. B and Wen,X. and Vishkin, Uzi}
}
@article {13975,
	title = {A broadband fast multipole accelerated boundary element method for the three dimensional Helmholtz equation},
	journal = {The Journal of the Acoustical Society of America},
	volume = {125},
	year = {2009},
	month = {2009///},
	pages = {191 - 205},
	abstract = {The development of a fast multipole method (FMM) accelerated iterative solution of the boundary element method (BEM) for the Helmholtz equations in three dimensions is described. The FMM for the Helmholtz equation is significantly different for problems with low and high kD (where k is the wavenumber and D the domain size), and for large problems the method must be switched between levels of the hierarchy. The BEM requires several approximate computations (numerical quadrature, approximations of the boundary shapes using elements), and these errors must be balanced against approximations introduced by the FMM and the convergence criterion for iterative solution. These different errors must all be chosen in a way that, on the one hand, excess work is not done and, on the other, that the error achieved by the overall computation is acceptable. Details of translation operators for low and high kD, choice of representations, and BEM quadrature schemes, all consistent with these approximations, are described. A novel preconditioner using a low accuracy FMM accelerated solver as a right preconditioner is also described. Results of the developed solvers for large boundary value problems with 0.0001≲kD≲500 are presented and shown to perform close to theoretical expectations.},
	keywords = {acoustic wave scattering, boundary-elements methods, boundary-value problems, Helmholtz equations, iterative methods},
	doi = {10.1121/1.3021297},
	url = {http://link.aip.org/link/?JAS/125/191/1},
	author = {Gumerov, Nail A. and Duraiswami, Ramani}
}
@conference {15309,
	title = {Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce},
	booktitle = {Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval},
	series = {SIGIR {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {155 - 162},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of "more like this" queries in the life sciences domain. Three MapReduce algorithms are introduced: one based on brute force, a second where the problem is treated as large-scale ad hoc retrieval, and a third based on the Cartesian product of postings lists. Each algorithm supports one or more approximations that trade effectiveness for efficiency, the characteristics of which are studied experimentally. Results show that the brute force algorithm is the most efficient of the three when exact similarity is desired. However, the other two algorithms support approximations that yield large efficiency gains without significant loss of effectiveness.},
	keywords = {distributed algorithms, hadoop},
	isbn = {978-1-60558-483-6},
	doi = {10.1145/1571941.1571970},
	url = {http://doi.acm.org/10.1145/1571941.1571970},
	author = {Jimmy Lin}
}
@article {16790,
	title = {Bandwidth-constrained queries in sensor networks},
	journal = {The VLDB Journal},
	volume = {17},
	year = {2008},
	month = {2008///},
	pages = {443 - 467},
	author = {Deligiannakis,A. and Kotidis,Y. and Roussopoulos, Nick}
}
@article {13052,
	title = {A Bayesian statistics approach to multiscale coarse graining},
	journal = {The Journal of chemical physics},
	volume = {129},
	year = {2008},
	month = {2008///},
	pages = {214114 - 214114},
	author = {Liu,P. and Shi,Q. and Daum{\'e}, Hal and Voth,G. A}
}
@conference {16073,
	title = {BELIV{\textquoteright}08: Beyond time and errors: novel evaluation methods for information visualization},
	booktitle = {CHI {\textquoteright}08 extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {3913 - 3916},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Information visualization systems allow users to produce insights, innovations and discoveries. Evaluating such tools is a challenging task and the goal of BELIV{\textquoteright}08 is to make a step ahead in the comprehension of such a complex activity. Current evaluation methods exhibit noticeable limitations and researchers in the area experiment some frustration with evaluation processes that are time consuming and too often leading to unsatisfactory results. The most used evaluation metrics such as task time completion and number of errors appear insufficient to quantify the quality of an information visualization system; thus the name of the workshop: "beyond time and errors".},
	keywords = {Evaluation, Information Visualization},
	isbn = {978-1-60558-012-8},
	doi = {10.1145/1358628.1358955},
	url = {http://doi.acm.org/10.1145/1358628.1358955},
	author = {Bertini,Enrico and Perer,Adam and Plaisant, Catherine and Santucci,Giuseppe}
}
@article {13135,
	title = {Beyond nouns: Exploiting prepositions and comparative adjectives for learning visual classifiers},
	journal = {Computer Vision{\textendash}ECCV 2008},
	year = {2008},
	month = {2008///},
	pages = {16 - 29},
	abstract = {Learning visual classifiers for object recognition from weakly labeled data requires determining correspondence between image regions and semantic object classes. Most approaches use co-occurrence of {\textquotedblleft}nouns{\textquotedblright} and image features over large datasets to determine the correspondence, but many correspondence ambiguities remain. We further constrain the correspondence problem by exploiting additional language constructs to improve the learning process from weakly labeled data. We consider both {\textquotedblleft}prepositions{\textquotedblright} and {\textquotedblleft}comparative adjectives{\textquotedblright} which are used to express relationships between objects. If the models of such relationships can be determined, they help resolve correspondence ambiguities. However, learning models of these relationships requires solving the correspondence problem. We simultaneously learn the visual features defining {\textquotedblleft}nouns{\textquotedblright} and the differential visual features defining such {\textquotedblleft}binary-relationships{\textquotedblright} using an EM-based approach.},
	author = {Gupta,A. and Davis, Larry S.}
}
@conference {14205,
	title = {Bilateral symmetry of object silhouettes under perspective projection},
	booktitle = {19th International Conference on Pattern Recognition, 2008. ICPR 2008},
	year = {2008},
	month = {2008/12/08/11},
	pages = {1 - 4},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Symmetry is an important property of objects and is exhibited in different forms e.g., bilateral, rotational, etc. This paper presents an algorithm for computing the bilateral symmetry of silhouettes of shallow objects under perspective distortion, exploiting the invariance of the cross ratio to projective transformations. The basic idea is to use the cross ratio to compute a number of midpoints of cross sections and then fit a straight line through them. The goodness-of-fit determines the likelihood of the line to be the axis of symmetry. We analytically estimate the midpointpsilas location as a function of the vanishing point for a given object silhouette. Hence finding the symmetry axis amounts to a 2D search in the space of vanishing points. We present experiments on two datasets as well as Internet images of symmetric objects that validate our approach.},
	keywords = {Automation, bilateral symmetry, Computer vision, Frequency, Image analysis, Image coding, Image reconstruction, Internet, Internet images, Object detection, object silhouettes, perspective distortion, perspective projection, SHAPE, symmetric objects},
	isbn = {978-1-4244-2174-9},
	doi = {10.1109/ICPR.2008.4761501},
	author = {Bitsakos,K. and Yi,H. and Yi,L. and Ferm{\"u}ller, Cornelia}
}
@article {12905,
	title = {Biofilms in water, its role and impact in human disease transmission},
	journal = {Current Opinion in Biotechnology},
	volume = {19},
	year = {2008},
	month = {2008/06//},
	pages = {244 - 247},
	abstract = {Understanding the mechanism of biofilm formation is the first step in determining its function and, thereby, its impact and role in the environment. Extensive studies accomplished during the past few years have elucidated the genetics and biochemistry of biofilm formation. Cell-to-cell communication, that is, quorum sensing, is a key factor in the initiation of biofilm. Occurrence of viable but nonculturable bacteria, including Vibrio cholerae in biofilms has been reported and most likely such cells were overlooked previously because appropriate methods of detection were not employed. For this reason discovery and investigation of this important bacterial ecological niche in the environment were impeded.},
	isbn = {0958-1669},
	doi = {10.1016/j.copbio.2008.04.005},
	url = {http://www.sciencedirect.com/science/article/pii/S0958166908000505},
	author = {Huq,Anwar and Whitehouse,Chris A. and Grim,Christopher J. and Alam,Munirul and Rita R Colwell}
}
@article {16240,
	title = {Bioinformatics challenges of new sequencing technology},
	journal = {Trends in Genetics},
	volume = {24},
	year = {2008},
	month = {2008/03//},
	pages = {142 - 149},
	abstract = {New DNA sequencing technologies can sequence up to one billion bases in a single day at low cost, putting large-scale sequencing within the reach of many scientists. Many researchers are forging ahead with projects to sequence a range of species using the new technologies. However, these new technologies produce read lengths as short as 35{\^a}{\texteuro}{\textquotedblleft}40 nucleotides, posing challenges for genome assembly and annotation. Here we review the challenges and describe some of the bioinformatics systems that are being proposed to solve them. We specifically address issues arising from using these technologies in assembly projects, both de novo and for resequencing purposes, as well as efforts to improve genome annotation in the fragmented assemblies produced by short read lengths.},
	isbn = {0168-9525},
	doi = {10.1016/j.tig.2007.12.006},
	url = {http://www.sciencedirect.com/science/article/pii/S016895250800022X},
	author = {Pop, Mihai and Salzberg,Steven L.}
}
@conference {12246,
	title = {Bittorrent is an auction: analyzing and improving bittorrent{\textquoteright}s incentives},
	booktitle = {Proceedings of the ACM SIGCOMM 2008 conference on Data communication},
	series = {SIGCOMM {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {243 - 254},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Incentives play a crucial role in BitTorrent, motivating users to upload to others to achieve fast download times for all peers. Though long believed to be robust to strategic manipulation, recent work has empirically shown that BitTorrent does not provide its users incentive to follow the protocol. We propose an auction-based model to study and improve upon BitTorrent{\textquoteright}s incentives. The insight behind our model is that BitTorrent uses, not tit-for-tat as widely believed, but an auction to decide which peers to serve. Our model not only captures known, performance-improving strategies, it shapes our thinking toward new, effective strategies. For example, our analysis demonstrates, counter-intuitively, that BitTorrent peers have incentive to intelligently under-report what pieces of the file they have to their neighbors. We implement and evaluate a modification to BitTorrent in which peers reward one another with proportional shares of bandwidth. Within our game-theoretic model, we prove that a proportional-share client is strategy-proof. With experiments on PlanetLab, a local cluster, and live downloads, we show that a proportional-share unchoker yields faster downloads against BitTorrent and BitTyrant clients, and that under-reporting pieces yields prolonged neighbor interest.},
	keywords = {auctions, bittorrent, incentive systems, proportional share, tit-for-tat},
	isbn = {978-1-60558-175-0},
	doi = {10.1145/1402958.1402987},
	url = {http://doi.acm.org/10.1145/1402958.1402987},
	author = {Levin,Dave and LaCurts,Katrina and Spring, Neil and Bhattacharjee, Bobby}
}
@inbook {19630,
	title = {Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One},
	booktitle = {Theory of Cryptography},
	series = {Lecture Notes in Computer Science},
	year = {2008},
	month = {2008/01/01/},
	pages = {427 - 444},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We show how to transform any semantically secure encryption scheme into a non-malleable one, with a black-box construction that achieves a quasi-linear blow-up in the size of the ciphertext. This improves upon the previous non-black-box construction of Pass, Shelat and Vaikuntanathan (Crypto {\textquoteright}06). Our construction also extends readily to guarantee non-malleability under a bounded-CCA2 attack, thereby simultaneously improving on both results in the work of Cramer et al. (Asiacrypt {\textquoteright}07). Our construction departs from the oft-used paradigm of re-encrypting the same message with different keys and then proving consistency of encryptions; instead, we encrypt an encoding of the message with certain locally testable and self-correcting properties. We exploit the fact that low-degree polynomials are simultaneously good error-correcting codes and a secret-sharing scheme.},
	keywords = {Algorithm Analysis and Problem Complexity, black-box constructions, computers and society, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, non-malleability, public-key encryption, semantic security, Systems and Data Security},
	isbn = {978-3-540-78523-1, 978-3-540-78524-8},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-78524-8_24},
	author = {Choi, Seung Geol and Dana Dachman-Soled and Malkin, Tal and Wee, Hoeteck},
	editor = {Canetti, Ran}
}
@article {17693,
	title = {Block Gram{\textendash}Schmidt Orthogonalization},
	journal = {SIAM Journal on Scientific Computing},
	volume = {31},
	year = {2008},
	month = {2008///},
	pages = {761 - 775},
	abstract = {The classical Gram{\textendash}Schmidt algorithm for computing the QR factorization of a matrix $X$ requires at least one pass over the current orthogonalized matrix $Q$ as each column of $X$ is added to the factorization. When $Q$ becomes so large that it must be maintained on a backing store, each pass involves the costly transfer of data from the backing store to main memory. However, if one orthogonalizes the columns of $X$ in blocks of $m$ columns, the number of passes is reduced by a factor of $1/m$. Moreover, matrix-vector products are converted into matrix-matrix products, allowing level-3 BLAS cache performance. In this paper we derive such a block algorithm and give some experimental results that suggest it can be quite effective for large scale problems, even when the matrix $X$ is rank degenerate.},
	keywords = {blocked algorithm, GramSchmidt algorithm, orthogonalization, QR factorization},
	doi = {10.1137/070682563},
	url = {http://link.aip.org/link/?SCE/31/761/1},
	author = {Stewart, G.W.}
}
@conference {15144,
	title = {Bridging game theory and cryptography: recent results and future directions},
	booktitle = {Proceedings of the 5th conference on Theory of cryptography},
	series = {TCC{\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {251 - 272},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Berlin, Heidelberg},
	abstract = {Motivated by the desire to develop more realistic models of, and protocols for, interactions between mutually distrusting parties, there has recently been significant interest in combining the approaches and techniques of game theory with those of cryptographic protocol design. Broadly speaking, two directions are currently being pursued: Applying cryptography to game theory: Certain game-theoretic equilibria are achievable if a trusted mediator is available. The question here is: to what extent can this mediator be replaced by a distributed cryptographic protocol run by the parties themselves? Applying game-theory to cryptography: Traditional cryptographic models assume some honest parties who faithfully follow the protocol, and some arbitrarily malicious players against whom the honest players must be protected. Game-theoretic models propose instead that all players are simply self-interested (i.e., rational), and the question then is: how can we model and design meaningful protocols for such a setting? In addition to surveying known results in each of the above areas, I suggest some new definitions along with avenues for future research.},
	isbn = {3-540-78523-X, 978-3-540-78523-1},
	url = {http://dl.acm.org/citation.cfm?id=1802614.1802635},
	author = {Katz, Jonathan}
}
@inbook {17569,
	title = {Budgeted Allocations in the Full-Information Setting},
	booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques},
	series = {Lecture Notes in Computer Science},
	volume = {5171},
	year = {2008},
	month = {2008///},
	pages = {247 - 253},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We build on the work of Andelman \& Mansour and Azar, Birnbaum, Karlin, Mathieu \& Thach Nguyen to show that the full-information (i.e., offline) budgeted-allocation problem can be approximated to within 4/3: we conduct a rounding of the natural LP relaxation, for which our algorithm matches the known lower-bound on the integrality gap.},
	isbn = {978-3-540-85362-6},
	url = {http://dx.doi.org/10.1007/978-3-540-85363-3_20},
	author = {Srinivasan, Aravind},
	editor = {Goel,Ashish and Jansen,Klaus and Rolim,Jos{\'e} and Rubinfeld,Ronitt}
}
@conference {12258,
	title = {Backbone construction in selfish wireless networks},
	booktitle = {Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems},
	series = {SIGMETRICS {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {121 - 132},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We present a protocol to construct routing backbones in wireless networks composed of selfish participants. Backbones are inherently cooperative, so constructing them in selfish environments is particularly difficult; participants want a backbone to exist (soothers relay their packets) but do not want to join the backbone (so they do not have to relay packets for others). We model the wireless backbone as a public good and use impatience as an incentive for cooperation. To determine if and when to donate to this public good, each participant calculates how patient it should be in obtaining the public good. We quantify patience using the Volunteer{\textquoteright}s Timing Dilemma (VTD), which we extend to general multihop network settings. Using our generalized VTD analysis, each node individually computes as its dominant strategy the amount of time to wait before joining the backbone. We evaluate our protocol using both simulations and an implementation. Our results show that, even though participants in our system deliberately wait before volunteering, a backbone is formed quickly. Further, the quality of the backbone (such as the size and resulting network lifetime) is comparable to that of existing backbone protocols that assume altruistic behavior.},
	keywords = {incentives, public good, selfish network, volunteer{\textquoteright}s dilemma, wireless backbone},
	isbn = {978-1-59593-639-4},
	doi = {10.1145/1254882.1254896},
	url = {http://doi.acm.org/10.1145/1254882.1254896},
	author = {Lee,Seungjoon and Levin,Dave and Gopalakrishnan,Vijay and Bhattacharjee, Bobby}
}
@conference {14318,
	title = {Barrier pointing: using physical edges to assist target acquisition on mobile device touch screens},
	booktitle = {Proceedings of the 9th international ACM SIGACCESS conference on Computers and accessibility, October},
	year = {2007},
	month = {2007///},
	pages = {15 - 17},
	author = {Jon Froehlich and Wobbrock,J.O. and Kane,S.K.}
}
@conference {13034,
	title = {A Bayesian model for discovering typological implications},
	booktitle = {ANNUAL MEETING-ASSOCIATION FOR COMPUTATIONAL LINGUISTICS},
	volume = {45},
	year = {2007},
	month = {2007///},
	pages = {65 - 65},
	author = {Daum{\'e}, Hal and Campbell,L.}
}
@article {16076,
	title = {BELIV{\textquoteright}06: beyond time and errors: novel evaluation methods for information visualization},
	journal = {interactions},
	volume = {14},
	year = {2007},
	month = {2007/05//},
	pages = {59 - 60},
	isbn = {1072-5520},
	doi = {10.1145/1242421.1242460},
	url = {http://doi.acm.org/10.1145/1242421.1242460},
	author = {Bertini,Enrico and Plaisant, Catherine and Santucci,Giuseppe}
}
@article {14200,
	title = {Better flow estimation from color images},
	journal = {EURASIP Journal on Advances in Signal Processing},
	volume = {2007},
	year = {2007},
	month = {2007/01//},
	pages = {133 - 133},
	abstract = {One of the difficulties in estimating optical flow is bias. Correcting the bias using the classical techniques is very difficult. The reason is that knowledge of the error statistics is required, which usually cannot be obtained because of lack of data. In this paper, we present an approach which utilizes color information. Color images do not provide more geometric information than monochromatic images to the estimation of optic flow. They do, however, contain additional statistical information. By utilizing the technique of instrumental variables, bias from multiple noise sources can be robustly corrected without computing the parameters of the noise distribution. Experiments on synthesized and real data demonstrate the efficiency of the algorithm.},
	isbn = {1110-8657},
	doi = {10.1155/2007/53912},
	url = {http://dx.doi.org/10.1155/2007/53912},
	author = {Hui Ji and Ferm{\"u}ller, Cornelia}
}
@article {12345,
	title = {Beyond single-appearance schedules: Efficient DSP software synthesis using nested procedure calls},
	journal = {ACM Transactions on Embedded Computing Systems (TECS)},
	volume = {6},
	year = {2007},
	month = {2007///},
	pages = {14{\textendash}es - 14{\textendash}es},
	author = {Ko,M. Y and Murthy,P. K and Bhattacharyya, Shuvra S.}
}
@article {12981,
	title = {Biased data reduce efficiency and effectiveness of conservation reserve networks},
	journal = {Ecology Letters},
	volume = {10},
	year = {2007},
	month = {2007/05/01/},
	pages = {364 - 374},
	abstract = {Complementarity-based reserve selection algorithms efficiently prioritize sites for biodiversity conservation, but they are data-intensive and most regions lack accurate distribution maps for the majority of species. We explored implications of basing conservation planning decisions on incomplete and biased data using occurrence records of the plant family Proteaceae in South Africa. Treating this high-quality database as {\textquoteleft}complete{\textquoteright}, we introduced three realistic sampling biases characteristic of biodiversity databases: a detectability sampling bias and two forms of roads sampling bias. We then compared reserve networks constructed using complete, biased, and randomly sampled data. All forms of biased sampling performed worse than both the complete data set and equal-effort random sampling. Biased sampling failed to detect a median of 1{\textendash}5\% of species, and resulted in reserve networks that were 9{\textendash}17\% larger than those designed with complete data. Spatial congruence and the correlation of irreplaceability scores between reserve networks selected with biased and complete data were low. Thus, reserve networks based on biased data require more area to protect fewer species and identify different locations than those selected with randomly sampled or complete data.},
	keywords = {Bias, biodiversity conservation, complementarity, efficiency, marxan, rarity, reserve networks, reserve selection algorithms, species detection},
	isbn = {1461-0248},
	doi = {10.1111/j.1461-0248.2007.01025.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1461-0248.2007.01025.x/abstract},
	author = {Grand,Joanna and Cummings, Michael P. and Rebelo,Tony G and Ricketts,Taylor H and Neel,Maile C}
}
@conference {16448,
	title = {Bid based scheduler with backfilling for a multiprocessor system},
	booktitle = {Proceedings of the ninth international conference on Electronic commerce},
	year = {2007},
	month = {2007///},
	pages = {459 - 468},
	author = {Yahav,I. and Raschid, Louiqa and Andrade,H.}
}
@conference {13146,
	title = {Bilattice-based Logical Reasoning for Human Detection},
	booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on},
	year = {2007},
	month = {2007/06//},
	pages = {1 - 8},
	abstract = {The capacity to robustly detect humans in video is a critical component of automated visual surveillance systems. This paper describes a bilattice based logical reasoning approach that exploits contextual information and knowledge about interactions between humans, and augments it with the output of different low level detectors for human detection. Detections from low level parts-based detectors are treated as logical facts and used to reason explicitly about the presence or absence of humans in the scene. Positive and negative information from different sources, as well as uncertainties from detections and logical rules, are integrated within the bilattice framework. This approach also generates proofs or justifications for each hypothesis it proposes. These justifications (or lack thereof) are further employed by the system to explain and validate, or reject potential hypotheses. This allows the system to explicitly reason about complex interactions between humans and handle occlusions. These proofs are also available to the end user as an explanation of why the system thinks a particular hypothesis is actually a human. We employ a boosted cascade of gradient histograms based detector to detect individual body parts. We have applied this framework to analyze the presence of humans in static images from different datasets.},
	keywords = {automated, detection;parts-based, detectors;static, histograms;human, images;formal, interactions;gradient, logic;image, logical, mechanisms;surveillance;video, processing;, reasoning;complex, recognition;inference, signal, Surveillance, systems;bilattice-based, visual},
	doi = {10.1109/CVPR.2007.383133},
	author = {Shet,V. D and Neumann, J. and Ramesh,V. and Davis, Larry S.}
}
@article {12982,
	title = {Bio-STEER: A Semantic Web workflow tool for Grid computing in the life sciences},
	journal = {Future Generation Comp Syst},
	volume = {23},
	year = {2007},
	month = {2007/03//},
	pages = {497 - 509},
	abstract = {Life science research is becoming evermore computationally intensive. Hence, from a computational resource perspective, Grid computing provides a logical approach to meeting many of the computational needs of life science research. However, there are several barriers to the widespread use of Grid computing in life sciences. In this paper, we attempt to address one particular barrier: the difficulty of using Grid computing by life scientists. Life science research often involves connecting multiple applications together to form a workflow. This process of constructing a workflow is complex. When combined with the difficulty of using Grid services, composing a meaningful workflow using Grid services can present a challenge to life scientists. Our proposed solution is a Semantic Web-enabled computing environment, called Bio-STEER. In BioSTEER, bioinformatics Grid services are mapped to Semantic Web services, described in OWL-S. We also defined an ontology in OWL to model bioinformatics applications. A graphical user interface helps to construct a scientific workflow by showing a list of services that are semantically sound: that is, the output of one service is semantically compatible with the input of the connecting service. Bio-STEER can help users take full advantaue of Grid services through a user-friendly graphical user interface (GUI), which allows them to easily construct the workflows they need. (c) 2006 Elsevier B.V. All rights reserved.},
	keywords = {client/server;, distributed, environments;, integrated, interface, management;, semantics;, services;, systems;, user, web-base, workflow},
	doi = {DOI 10.1016/j.future.2006.07.011},
	author = {Lee,S. and Wang,T. D and Hashmi,N. and Cummings, Michael P.}
}
@article {16439,
	title = {BIPASS: BioInformatics Pipeline Alternative Splicing Services},
	journal = {Nucleic Acids Research},
	volume = {35},
	year = {2007},
	month = {2007///},
	pages = {W292 - W292},
	author = {Legendre,C. and Raschid, Louiqa and Snyder,B.}
}
@article {18497,
	title = {Bitstore: An incentive-compatible solution for blocked downloads in bittorrent},
	journal = {Proc. Joint Workshop on The Economics of Networked Systems and Incentive-Based Computing (NetEcon)},
	year = {2007},
	month = {2007///},
	abstract = {As many as 30\% of all files shared on public BitTorrentnetworks suffer from the lack of {\textquotedblleft}seeders{\textquotedblright} (peers that have
complete copies of the file being shared); peers attempting
to download such a file ({\textquotedblleft}leechers{\textquotedblright}) may have to wait indef-
initely to obtain certain file chunks that are not distributed in
the file{\textquoteright}s network of peers (the {\textquotedblleft}swarm{\textquotedblright}). We call this the
Blocked Leecher Problem (BLP).
To alleviate BLP, we propose BitStore, a larger, secure
network of BitTorrent users (not necessarily all sharing the
same content) where nodes offer their resources (such as
disk space and bandwidth) for public use. Peers sharing any
file can use the storage network to maintain replicas for each
chunk of the file. Any leecher seeking chunks that are absent
from in its own swarm can query the public network, locate
the node storing the said chunks, and retrieve them. BitStore
also provides robust incentives for nodes contributing re-
sources: In return for storing and serving chunks, such nodes
can negotiate micropayments using a second-price auction.
Peers who receive these credits may later use them to re-
trieve blocks they need from the storage network.
This paper quantifies the BLP, presents an overview of the
BitStore design, and discusses various challenges related to
storage management and incentives.
},
	author = {Ramachandran,A. and Sarma,A.D. and Feamster, Nick}
}
@article {12257,
	title = {Boycotting and extorting nodes in an internetwork},
	journal = {NetE-con+ IBC},
	year = {2007},
	month = {2007///},
	author = {Levin,D. and Bender,A. and Lumezanu,C. and Spring, Neil and Bhattacharjee, Bobby}
}
@conference {12921,
	title = {Bridging art and science with creativity support tools},
	booktitle = {Proceedings of the 6th ACM SIGCHI conference on Creativity \& cognition},
	series = {C\&amp;C {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {309 - 309},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {978-1-59593-712-4},
	doi = {10.1145/1254960.1255044},
	url = {http://doi.acm.org/10.1145/1254960.1255044},
	author = {Shneiderman, Ben and Rita R Colwell and Diamond,Sara and Greenhalgh,Paul and Wulf,William}
}
@inbook {15722,
	title = {Bridging the ROUGE/Human Evaluation Gap in Multi-Document Summarization},
	booktitle = {Document Understanding Conference DUC 2007Document Understanding Conference DUC 2007},
	year = {2007},
	month = {2007/04/26/},
	publisher = {HLT-NAACL},
	organization = {HLT-NAACL},
	address = {Rochester, NY},
	author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P.}
}
@article {16998,
	title = {Browsing large online data tables using generalized query previews},
	journal = {Information Systems},
	volume = {32},
	year = {2007},
	month = {2007/05//},
	pages = {402 - 423},
	abstract = {Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purpose. Users query such tables with front-ends that typically use menus or form fillin interfaces, but these interfaces rarely give users information about the contents and distribution of the data. Such a situation leads users to waste time and network/server resources posing queries that have zero- or mega-hit results. Generalized query previews enable efficient browsing of large online data tables by supplying data distribution information to users. The data distribution information provides continuous feedback about the size of the result set as the query is being formed. Our paper presents a new user interface architecture and discusses three controlled experiments (with 12, 16, and 48 participants). Our prototype systems provide flexible user interfaces for research and testing of the ideas. The user studies show that for exploratory querying tasks, generalized query previews can speed user performance for certain user domains and can reduce network/server load.},
	keywords = {Information Visualization, Internet, Online querying, World-wide web},
	isbn = {0306-4379},
	doi = {10.1016/j.is.2005.12.006},
	url = {http://www.sciencedirect.com/science/article/pii/S0306437905001213},
	author = {Tanin,Egemen and Shneiderman, Ben and Xie,Hairuo}
}
@article {18507,
	title = {Building a Better Mousetrap},
	volume = {GIT-CSS-07-01},
	year = {2007},
	month = {2007///},
	institution = {Georgia Institute of Technology. College of Computing},
	abstract = {Routers in the network core are unable to maintain detailed statistics for every packet; thus, traffic statistics are often based on packet sampling, which reduces accuracy. Because tracking large ("heavy-hitter") traffic flows is important both for pricing and for traffic engineering, much attention has focused on maintaining accurate statistics for such flows, often at the expense of small-volume flows. Eradicating these smaller flows makes it difficult to observe communication structure, which is sometimes more important than maintaining statistics about flow sizes. This paper presents FlexSample, a sampling framework that allows network operators to get the best of both worlds: For a fixed sampling budget, FlexSample can capture significantly more small-volume flows for only a small increase in relative error of large traffic flows. FlexSample uses a fast, lightweight counter array that provides a coarse estimate of the size ("class") of each traffic flow; a router then can sample at different rates according to the class of the traffic using any existing sampling strategy. Given a fixed sampling rate and a target fraction of sampled packets to allocate across traffic classes, FlexSample computes packet sampling rates for each class that achieve these allocations online. Through analysis and trace-based experiments, we find that FlexSample captures at least 50\% more mouse flows than strategies that do not perform class-dependent packet sampling. We also show how FlexSample can be used to capture unique flows for specific applications.},
	url = {http://hdl.handle.net/1853/14350},
	author = {Ramachandran,A. and Seetharaman,S. and Feamster, Nick and Vazirani,V.}
}
@inbook {15719,
	title = {Back to Basics: CLASSY 2006},
	booktitle = {DUC 06 Conference ProceedingsDUC 06 Conference Proceedings},
	year = {2006},
	month = {2006///},
	publisher = {U.S. National Inst. of Standards and Technology},
	organization = {U.S. National Inst. of Standards and Technology},
	abstract = {The IDA/CCS summarization system, CLASSY, underwent significant change for this year{\textquoteright}sDUC. Two changes made processing simpler and faster: 1) we eliminated the use of a POS (part
of speech) tagger for sentence splitting and to assist sentence trimming, and 2) we simplified the
scoring of sentences for inclusion in the summary by introducing a new {\textquotedblleft}approximate oracle{\textquotedblright} score.
An additional change introduced a modest amount of extra computation: we ordered sentences
in the summary using a new Traveling Salesperson (TSP) formulation. These changes improved
ROUGE scores on the DUC 2005 data from last year and gave strong performance in the DUC 2006
competition.
},
	url = {\tt http://duc.nist.gov/},
	author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P. and Goldstein,Jade}
}
@article {16983,
	title = {Balancing Systematic and Flexible Exploration of Social Networks},
	journal = {IEEE Transactions on Visualization and Computer Graphics},
	volume = {12},
	year = {2006},
	month = {2006/10//Sept},
	pages = {693 - 700},
	abstract = {Social network analysis (SNA) has emerged as a powerful method for understanding the importance of relationships in networks. However, interactive exploration of networks is currently challenging because: (1) it is difficult to find patterns and comprehend the structure of networks with many nodes and links, and (2) current systems are often a medley of statistical methods and overwhelming visual output which leaves many analysts uncertain about how to explore in an orderly manner. This results in exploration that is largely opportunistic. Our contributions are techniques to help structural analysts understand social networks more effectively. We present SocialAction, a system that uses attribute ranking and coordinated views to help users systematically examine numerous SNA measures. Users can (1) flexibly iterate through visualizations of measures to gain an overview, filter nodes, and find outliers, (2) aggregate networks using link structure, find cohesive subgroups, and focus on communities of interest, and (3) untangle networks by viewing different link types separately, or find patterns across different link types using a matrix overview. For each operation, a stable node layout is maintained in the network visualization so users can make comparisons. SocialAction offers analysts a strategy beyond opportunism, as it provides systematic, yet flexible, techniques for exploring social networks},
	keywords = {Aggregates, algorithms, attribute ranking, Cluster Analysis, Computer Graphics, Computer simulation, Coordinate measuring machines, coordinated views, Data analysis, data visualisation, Data visualization, exploratory data analysis, Filters, Gain measurement, graph theory, Graphical user interfaces, Information Storage and Retrieval, interactive graph visualization, matrix algebra, matrix overview, Models, Biological, Navigation, network visualization, Pattern analysis, Population Dynamics, Social Behavior, social network analysis, Social network services, social networks, social sciences computing, Social Support, SocialAction, software, statistical analysis, statistical methods, User-Computer Interface},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2006.122},
	author = {Perer,A. and Shneiderman, Ben}
}
@article {13175,
	title = {Ballistic hand movements},
	journal = {Articulated Motion and Deformable Objects},
	year = {2006},
	month = {2006///},
	pages = {153 - 164},
	abstract = {Common movements like reaching, striking, etc. observed during surveillance have highly variable target locations. This puts appearance-based techniques at a disadvantage for modelling and recognizing them. Psychological studies indicate that these actions are ballistic in nature. Their trajectories have simple structures and are determined to a great degree by the starting and ending positions. We present an approach for movement recognition that explicitly considers their ballistic nature. This enables the decoupling of recognition from the movement{\textquoteright}s trajectory, allowing generalization over a range of target-positions. A given movement is first analyzed to determine if it is ballistic. Ballistic movements are further classified into reaching, striking, etc. The proposed approach was tested with motion capture data obtained from the CMU MoCap database.},
	author = {Prasad,V. and Kellokumpu,V. and Davis, Larry S.}
}
@article {13037,
	title = {A Bayesian model for supervised clustering with the Dirichlet process prior},
	journal = {Journal of Machine Learning Research},
	volume = {6},
	year = {2006},
	month = {2006///},
	pages = {1551 - 1551},
	author = {Daum{\'e}, Hal and Marcu,D.}
}
@conference {13063,
	title = {Bayesian query-focused summarization},
	booktitle = {Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics},
	series = {ACL-44},
	year = {2006},
	month = {2006///},
	pages = {305 - 312},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {We present BAYESUM (for "Bayesian summarization"), a model for sentence extraction in query-focused summarization. BAYESUM leverages the common case in which multiple documents are relevant to a single query. Using these documents as reinforcement for query terms, BAYESUM is not afflicted by the paucity of information in short queries. We show that approximate inference in BAYESUM is possible on large data sets and results in a state-of-the-art summarization system. Furthermore, we show how BAYESUM can be understood as a justified query expansion technique in the language modeling for IR framework.},
	doi = {10.3115/1220175.1220214},
	url = {http://dx.doi.org/10.3115/1220175.1220214},
	author = {Daum{\'e}, Hal and Marcu,Daniel}
}
@conference {18767,
	title = {Bio-inspired, Modular, and Multifunctional Thermal and Impact Protected (TIPed) Embedded Sensing Controls Actuation Power Element (ESCAPE) Structures},
	year = {2006},
	month = {2006///},
	abstract = {There is a great deal of interest in creating new structural concepts, such as snake robots, from analogousbiological systems. These biological systems are typically composed of materials that serve multiple functions.
For example, the skin of a snake is a system consisting of a soft, hyperelastic covering, with nerves providing
thermal and pressure sensitivity, and a hard, scaly coating to resist wear and tear from hard particles such as
sand. Therefore, bio-inspired structures can also be composed of multifunctional materials. There are currently
many approaches to fabricating bio-inspired structures with conventional materials. These concepts typically
utilize a system-of-systems design approach where the structure will be composed of a structural framework, an
actuation system, a power source for the actuation system, controllers, and external sensors. The drawbacks to
these structures include the need to assemble all of the components, interfaces between components that can
compromise reliability, constraints on scaling down the structure, and very high power consumption and power
generation requirements. These problems have been addressed by developing a new scalable approach to
creating multifunctional materials for bio-inspired structures where the controllers, actuators, and sensors are
integrated into a modular, multifunctional structure. This approach is facilitated by using multi-material multi-stage
molding processes with fully embedded electronic systems, and has resulted in new Thermal and Impact
Protected (TIPed) Embedded Sensing Controls Actuation Power Element (ESCAPE) Structures for compact and
rugged robotic applications.
},
	url = {http://sem-proceedings.com/06s/sem.org-2006-SEM-Ann-Conf-s89p07-Bio-inspired-Modular-Multifunctional-Thermal-Impact-Protected-TIPed.pdf},
	author = {Gyger Jr,L. S. and Spranklin,B. W. and Gupta,S.K. and Bruck,H. A.}
}
@article {14140,
	title = {Block preconditioners based on approximate commutators},
	journal = {SIAM Journal on Scientific Computing},
	volume = {27},
	year = {2006},
	month = {2006///},
	pages = {1651 - 1668},
	author = {Elman, Howard and Howle, V. E and Shadid, J. and Shuttleworth, R. and Tuminaro, R.}
}
@article {18008,
	title = {Bootstrapping free-space optical networks},
	journal = {Selected Areas in Communications, IEEE Journal on},
	volume = {24},
	year = {2006},
	month = {2006/12//},
	pages = {13 - 22},
	abstract = {We introduce a challenging problem in establishing and initially configuring or bootstrapping a Free Space Optical (FSO) network. In such networks, it is assumed that each communication node is a base station, including a router and wireless optical communications hardware, and its number of transceivers is limited. In addition, the FSO networks are characterized by narrow beam, directional links (e.g., operating at 1550 nm) and support up to Gbps data rates. The problem of initially configuring the transceivers to form a connected topology is NP-complete because of the transceiver limitation. What makes this problem even more challenging is the need to configure the transceiver in a "distributed" fashion, because a node can have only direct knowledge of its neighbors. We have developed a fully distributed approximation algorithm, which constructs a spanning tree with maximal node degree at most one larger than that in the optimal solution. Due to its distributed nature, this algorithm outperforms known serial algorithms. For a graph with 200 nodes generated in some randomized model, speed-ups greater than 6 have been demonstrated.},
	keywords = {algorithm;free-space, algorithms;optical, approximation, communication;telecommunication, communications, configuration;randomized, FSO;base, hardware;distributed, model;spanning, network, network;network, node;connected, optical, router;optical, routing;telecommunication, searching;, station;bootstrapping;communication, topology;distributed, topology;transceivers;tree, transceiver, tree;wireless},
	isbn = {0733-8716},
	doi = {10.1109/JSAC.2006.258219},
	author = {Liu,F. and Vishkin, Uzi and Milner,S.}
}
@article {18007,
	title = {A bootstrapping model for directional wireless networks},
	journal = {Communications Letters, IEEE},
	volume = {10},
	year = {2006},
	month = {2006/12//},
	pages = {840 - 842},
	abstract = {Initially configuring or bootstrapping a connected topology in directional wireless networks is a challenging problem, especially when nodes only have local connectivity information and a limited number of transceivers. This paper presents a scalable bootstrapping model which integrates: 1) a distributed bottom-up algorithm that constructs a spanning tree with degree at most one larger than the optimal 2) a resource discovery algorithm for efficient dissemination of local connectivity information, and 3) synchronization protocols to guarantee the efficient emergence of overall network connectivity from local interactions. We investigate the feasibility and scalability of the proposed model. Results are presented for different network systems, with varying size and signaling data rates.},
	keywords = {(mathematics);, algorithm;resource, algorithm;spanning, bootstrapping, bottom-up, discovery, model;directional, network;distributed, networks;trees, protocols;protocols;radio, tree;synchronization, wireless},
	isbn = {1089-7798},
	doi = {10.1109/LCOMM.2006.060808},
	author = {Milner,S. and Llorca,J. and Anibha,A. and Vishkin, Uzi}
}
@article {16866,
	title = {Building and querying a P2P virtual world},
	journal = {Geoinformatica},
	volume = {10},
	year = {2006},
	month = {2006///},
	pages = {91 - 116},
	abstract = {Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment. One peer is introduced to the system by each participant. However current P2P applications can only provide file sharing and other forms of relatively simple data communications, and, in this paper, we demonstrate how this limitation can be bridged by indexing and querying a 3D virtual-world on a dynamic distributed network. We present an algorithm for 3D range queries as well as an algorithm for nearest neighbor queries. We also show how to build such a complex application from the ground level of a P2P routing algorithm.},
	doi = {10.1007/s10707-005-4887-8},
	author = {Tanin,E. and Harwood,A. and Samet, Hanan and Nayar,D. and Nutanong,S.}
}
@article {17862,
	title = {Building complex coupled physical simulations on the grid with InterComm},
	journal = {Engineering with Computers},
	volume = {22},
	year = {2006},
	month = {2006///},
	pages = {311 - 323},
	author = {Sussman, Alan}
}
@article {12656,
	title = {Background learning for robust face recognition with PCA in the presence of clutter},
	journal = {Image Processing, IEEE Transactions on},
	volume = {14},
	year = {2005},
	month = {2005/06//},
	pages = {832 - 843},
	abstract = {We propose a new method within the framework of principal component analysis (PCA) to robustly recognize faces in the presence of clutter. The traditional eigenface recognition (EFR) method, which is based on PCA, works quite well when the input test patterns are faces. However, when confronted with the more general task of recognizing faces appearing against a background, the performance of the EFR method can be quite poor. It may miss faces completely or may wrongly associate many of the background image patterns to faces in the training set. In order to improve performance in the presence of background, we argue in favor of learning the distribution of background patterns and show how this can be done for a given test image. An eigenbackground space is constructed corresponding to the given test image and this space in conjunction with the eigenface space is used to impart robustness. A suitable classifier is derived to distinguish nonface patterns from faces. When tested on images depicting face recognition in real situations against cluttered background, the performance of the proposed method is quite good with fewer false alarms.},
	keywords = {Automated;Principal Component Analysis;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Biological;Models, Computer-Assisted;Information Storage and Retrieval;Models, Computer-Assisted;Subtraction Technique;, PCA;background learning;clutter;eigenface recognition method;face recognition;linear discriminant;principal component analysis;clutter;eigenvalues and eigenfunctions;face recognition;learning (artificial intelligence);principal component analysis;Algorith, Statistical;Pattern Recognition},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2005.847288},
	author = {Rajagopalan, AN and Chellapa, Rama and Koterba, N.T.}
}
@article {13205,
	title = {Background updating for visual surveillance},
	journal = {Advances in Visual Computing},
	year = {2005},
	month = {2005///},
	pages = {337 - 346},
	abstract = {Scene changes such as moved objects, parked vehicles, or opened/closed doors need to be carefully handled so that interesting foreground targets can be detected along with the short-term background layers created by those changes. A simple layered modeling technique is embedded into a codebook-based background subtraction algorithm to update a background model. In addition, important issues related to background updating for visual surveillance are discussed. Experimental results on surveillance examples, such as unloaded packages and unattended objects, are presented by showing those objects as short-term background layers.},
	author = {Kim,K. and Harwood,D. and Davis, Larry S.}
}
@article {12661,
	title = {Bayesian algorithms for simultaneous structure from motion estimation of multiple independently moving objects},
	journal = {Image Processing, IEEE Transactions on},
	volume = {14},
	year = {2005},
	month = {2005/01//},
	pages = {94 - 109},
	abstract = {The problem of simultaneous structure from motion estimation for multiple independently moving objects from a monocular image sequence is addressed. Two Bayesian algorithms are presented for solving this problem using the sequential importance sampling (SIS) technique. The empirical posterior distribution of object motion and feature separation parameters is approximated by weighted samples. The first algorithm addresses the problem when only two moving objects are present. A singular value decomposition (SVD)-based sample clustering algorithm is shown to be capable of separating samples related to different objects. A pair of SIS procedures is used to track the posterior distribution of the motion parameters. In the second algorithm, a balancing step is added into the SIS procedure to preserve samples of low weights so that all objects have enough samples to propagate empirical motion distributions. By using the proposed algorithms, the relative motions of all the moving objects with respect to the camera can be simultaneously estimated. Both algorithms have been tested on synthetic and real- image sequences. Improved results have been achieved.},
	keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Bayesian algorithm;clustering algorithm;empirical posterior distribution;feature separation parameter;monocular image sequence;motion estimation;multiple independently moving object;object motion;real-image sequence;sequential importance sampling techniqu, Biological;Models, Computer-Assisted;Imaging, Computer-Assisted;Pattern Recognition, Computer-Assisted;Subtraction Technique;Video Recording;Walking;, Statistical;Movement;Numerical Analysis, Three-Dimensional;Information Storage and Retrieval;Models},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2004.837551},
	author = {Qian,Gang and Chellapa, Rama and Qinfen Zheng}
}
@article {14029,
	title = {Bayesian filtering and integral image for visual tracking},
	journal = {Proceedings of the Worshop on Image Analysis for Multimedia Interactive Services (WIAMIS{\textquoteright}05)},
	year = {2005},
	month = {2005///},
	abstract = {This paper describes contributions to two problems related tovisual tracking: control model design and observation process
design. We describe the use of kernel-based Bayesian filtering
for the tracking control procedure, and feature-based tracking
to improve the observation process of tracking. In the kernel-
based Bayesian filtering framework, the analytical represen-
tation of density functions by density interpolation and density
approximation for the likelihood and the posterior contributes
to efficient sampling. Feature-based tracking combines rec-
tangular features with edge oriented histogram so that the
combined features are robust to illumination changes, partial
occlusion, and clutter while capturing the spatial information
of the target. The use of integral image allows the features to
be efficiently evaluated. The effectiveness of both algorithms
are demonstrated by object tracking results on real videos.
},
	author = {Han,B. and Yang,C. and Duraiswami, Ramani and Davis, Larry S.}
}
@article {14423,
	title = {Bayesian network learning with abstraction hierarchies and context-specific independence},
	journal = {Machine Learning: ECML 2005},
	year = {2005},
	month = {2005///},
	pages = {485 - 496},
	abstract = {Context-specific independence representations, such as tree-structured conditional probability tables (TCPTs), reduce the number of parameters in Bayesian networks by capturing local independence relationships and improve the quality of learned Bayesian networks. We previously presented Abstraction-Based Search (ABS), a technique for using attribute value hierarchies during Bayesian network learning to remove unimportant distinctions within the CPTs. In this paper, we introduce TCPT ABS (TABS), which integrates ABS with TCPT learning. Since expert-provided hierarchies may not be available, we provide a clustering technique for deriving hierarchies from data. We present empirical results for three real-world domains, finding that (1) combining TCPTs and ABS provides a significant increase in the quality of learned Bayesian networks (2) combining TCPTs and ABS provides a dramatic reduction in the number of parameters in the learned networks, and (3) data-derived hierarchies perform as well or better than expert-provided hierarchies.},
	doi = {10.1007/11564096_46},
	author = {desJardins, Marie and Rathod,P. and Getoor, Lise}
}
@conference {13056,
	title = {Bayesian summarization at DUC and a suggestion for extrinsic evaluation},
	booktitle = {Document understanding conference},
	year = {2005},
	month = {2005///},
	author = {Daum{\'e}, Hal and Marcu,D.}
}
@inbook {12669,
	title = {Beyond one still image: Face recognition from multiple still images or a video sequence},
	booktitle = {Face ProcessingFace Processing},
	year = {2005},
	month = {2005///},
	pages = {547 - 575},
	publisher = {Academic Press},
	organization = {Academic Press},
	address = {Burlington},
	abstract = {While face recognition (FR) from a single still image has been extensively studied over a decade, FR based on a group of still images (also referred to as multiple still images) or a video sequence is an emerging topic. This is mainly evidenced by the growing increase in the literature. For instance, a research initiative called Face Recognition Grand Challenge [1] has been organized. One specific challenge directly addresses the use of multiple still images to improve the recognition accuracy significantly [3]. Recently a workshop jointly held with CVPR 2004 was devoted to face processing in video [2]. It is predictable that, with the ubiquity of video sequences, face recognition based on video sequences will become more and more popular.},
	isbn = {978-0-12-088452-0},
	url = {http://www.sciencedirect.com/science/article/pii/B9780120884520500182},
	editor = {Zhao,Wenyi and Chellapa, Rama}
}
@article {16696,
	title = {The Bible and multilingual optical character recognition},
	journal = {Communications of the ACM},
	volume = {48},
	year = {2005},
	month = {2005///},
	pages = {124 - 130},
	author = {Kanungo,T. and Resnik, Philip and Mao,S. and Kim,D.W. and Zheng,Q.}
}
@article {16990,
	title = {Bi-Level Hierarchical Layouts for Photo Libraries: Algorithms for Design Optimization with Quantum Content},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {A frequently-used layout for a collection of two-dimensional, fixed aspect-ratio objects, such as photo thumbnails, is the grid, in which rows and columns are configured to match the allowed space. However, in cases where these objects have some group relationship among them, it can be advantageous to show this relationship in the layout, rather than in textual captions. We use an annotated digital photo collection as a case study of an auto-layout technique in which a two-level hierarchy is generated, consisting of a primary, central region with secondary regions (typically 2-12 regions) surrounding it. We show that given specific requirements, this technique is also optimal, in the sense that it will generate the largest size for the objects. Since all objects are the same size we refer to them as quantum content. These algorithms are designed to be real-time, enabling a compelling interactive display as users resize the canvas, or move and resize the primary region. The interactive redisplay also occurs as users add regions or objects to a secondary region.},
	keywords = {Societal Infrastructure Systems},
	url = {http://drum.lib.umd.edu/handle/1903/6567},
	author = {Kustanowitz,Jack and Shneiderman, Ben}
}
@conference {19027,
	title = {BIND: a fine-grained attestation service for secure distributed systems},
	year = {2005},
	month = {2005},
	pages = {154 - 168},
	abstract = {In this paper we propose BIND (binding instructions and data), a fine-grained attestation service for securing distributed systems. Code attestation has recently received considerable attention in trusted computing. However, current code attestation technology is relatively immature. First, due to the great variability in software versions and configurations, verification of the hash is difficult. Second, the time-of-use and time-of-attestation discrepancy remains to be addressed, since the code may be correct at the time of the attestation, but it may be compromised by the time of use. The goal of BIND is to address these issues and make code attestation more usable in securing distributed systems. BIND offers the following properties: (1) BIND performs fine-grained attestation. Instead of attesting to the entire memory content, BIND attests only to the piece of code we are concerned about. This greatly simplifies verification. (2) BIND narrows the gap between time-of-attestation and time-of-use. BIND measures a piece of code immediately before it is executed and uses a sandboxing mechanism to protect the execution of the attested code. (3) BIND ties the code attestation with the data that the code produces, such that we can pinpoint what code has been run to generate that data. In addition, by incorporating the verification of input data integrity into the attestation, BIND offers transitive integrity verification, i.e., through one signature, we can vouch for the entire chain of processes that have performed transformations over a piece of data. BIND offers a general solution toward establishing a trusted environment for distributed system designers.},
	keywords = {BIND, binding instructions and data, code attestation, data integrity, digital signatures, distributed processing, fine-grained attestation service, input data integrity, program verification, sandboxing mechanism, secure distributed systems, signature, time-of-attestation, time-of-use, transitive integrity verification, trusted computing},
	author = {Elaine Shi and Perrig, A. and Van Doorn, L.}
}
@article {18939,
	title = {Bootstrapping parsers via syntactic projection across parallel texts},
	journal = {Nat. Lang. Eng.},
	volume = {11},
	year = {2005},
	month = {2005/09//},
	pages = {311 - 325},
	abstract = {Broad coverage, high quality parsers are available for only a handful of languages. A prerequisite for developing broad coverage parsers for more languages is the annotation of text with the desired linguistic representations (also known as {\textquotedblleft}treebanking{\textquotedblright}). However, syntactic annotation is a labor intensive and time-consuming process, and it is difficult to find linguistically annotated text in sufficient quantities. In this article, we explore using parallel text to help solving the problem of creating syntactic annotation in more languages. The central idea is to annotate the English side of a parallel corpus, project the analysis to the second language, and then train a stochastic analyzer on the resulting noisy annotations. We discuss our background assumptions, describe an initial study on the {\textquotedblleft}projectability{\textquotedblright} of syntactic relations, and then present two experiments in which stochastic parsers are developed with minimal human intervention via projection from English.},
	isbn = {1351-3249},
	doi = {10.1017/S1351324905003840},
	url = {http://dx.doi.org/10.1017/S1351324905003840},
	author = {Hwa,Rebecca and Resnik, Philip and Weinberg, Amy and Cabezas,Clara and Kolak,Okan}
}
@article {15099,
	title = {Bounds on the efficiency of black-box commitment schemes},
	journal = {Automata, Languages and Programming},
	year = {2005},
	month = {2005///},
	pages = {62 - 62},
	abstract = {Constructions of cryptographic primitives based on general assumptions (e.g., the existence of one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theoretic) assumptions. This has prompted a recent line of research aimed at investigating the best possible efficiency of (black-box) constructions based on general assumptions. Here, we present bounds on the efficiency of statistically-binding commitment schemes constructed using black-box access to one-way permutations; our bounds are tight for the case of perfectly-binding schemes. We present the bounds in an extension of the Impagliazzo-Rudich model; that is, we show that any construction beating our bounds would imply the unconditional existence of a one-way function (from which a commitment scheme could be constructed {\textquotedblleft}from scratch{\textquotedblright}). Our analysis is the first in the area to pertain directly to an information-theoretic component of the security notion.},
	doi = {10.1007/11523468_11},
	author = {Horvitz,O. and Katz, Jonathan}
}
@article {15157,
	title = {Bounds on the efficiency of generic cryptographic constructions},
	journal = {SIAM Journal on Computing},
	volume = {35},
	year = {2005},
	month = {2005///},
	pages = {217 - 217},
	abstract = {A central focus of modern cryptography is the construction of efficient, {\textquotedblleft}high-level{\textquotedblright}cryptographic tools (e.g., encryption schemes) from weaker, {\textquotedblleft}low-level{\textquotedblright} cryptographic
primitives (e.g., one-way functions). Of interest are both the existence of such construc-
tions, and their efficiency.
Here, we show essentially-tight lower bounds on the best possible efficiency of any
black-box construction of some fundamental cryptographic tools from the most basic
and widely-used cryptographic primitives. Our results hold in an extension of the
model introduced by Impagliazzo and Rudich, and improve and extend earlier results
of Kim, Simon, and Tetali. We focus on constructions of pseudorandom generators,
universal one-way hash functions, and digital signatures based on one-way permutations,
as well as constructions of public- and private-key encryption schemes based on trapdoor
permutations. In each case, we show that any black-box construction beating our
efficiency bound would yield the unconditional existence of a one-way function and
thus, in particular, prove P \= NP
},
	author = {Gennaro,R. and Gertner,Y. and Katz, Jonathan and Trevisan,L.}
}
@article {18928,
	title = {Breaking the resource bottleneck for multilingual parsing},
	year = {2005},
	month = {2005///},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {We propose a framework that enables the acquisition of annotation-heavy resources such as syntacfic dependency tree corpora for low-resource languages by importing linguistic annotations from high-quality English resources. We present a large-scale experiment showing that Chinese dependency trees can be induced by using an English parser, a word alignment package, and a large corpus of sentence-aligned bilingual text. As a part of the experiment, we evaluate the quality of a Chinese parser trained on the induced dependency treebank. We find that a parser trained in this manner out-performs some simple baselines inspite of the noise in the induced treebank. The results suggest that projecting syntactic structures from English is a viable option for acquiring annotated syntactic structures quickly and cheaply. We expect the quality of the induced treebank to improve when more sophisticated filtering and error-correction techniques are applied.},
	url = {http://oai.dtic.mil/oai/oai?verb=getRecord\&metadataPrefix=html\&identifier=ADA440432},
	author = {Hwa,R. and Resnik, Philip and Weinberg, Amy}
}
@article {16995,
	title = {Bridging the Digital Divide with Universal Usability (2001)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {How do you explain a trashcan to a culture that doesn have one? How do you describe a top loss limit orderto retirees managing their funds? Can you design a text-only interface that conveys the contents and experience of an animated Flash presentation? <p>These puzzles emerged during the first ACM Conference on Universal Usability (http://www.acm.org/sigchi/cuu/), held on November 15-17, 2000 near Washington, DC. The international group of organizers, presenters, and attendees of this conference shared an unusual commitment and passion for making information and communications services accessible, usable, and useful. They want to see effective healthcare services and appealing distance education. They want to create successful e-commerce and accessible government services for all. Realizing these possibilities requires more than low-cost hardware or broadband networks. These mass- market services are often too complex, unusable, or irrelevant for too many users; usability and design become the keys to success. <p>The source of these problems was often attributed to designers who make incorrect assumptions about user knowledge. This leads to difficulties with technical terminology and advanced concepts that are not balanced by adequate online help or live assistance. Unfortunately, most designers never see the pain they inflict on novice and even expert users. These problems have contributed to the growing digital divide in internet technology adoption levels between lowincome poorly-educated and high-income well-educated users [2]. Even as the gap between men and women internet users has been eliminated and the gap between young and old is shrinking, the slow adoption rates by poor and poorly educated users remains a problem. Low-cost equipment is needed, but progress in design will help make internet services more accessible to more people.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6478},
	author = {Shneiderman, Ben}
}
@conference {15243,
	title = {Broadcasting on networks of workstations},
	booktitle = {Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures},
	series = {SPAA {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {279 - 288},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Broadcasting and multicasting are fundamental operations. In this work we develop algorithms for performing broadcast and multicast in clusters of workstations. In this model, sending a message from one machine to another machine in the same cluster takes 1 time unit, and sending a message to a machine in a different cluster takes C time units. Lowekamp and Beguelin proposed heuristics for this model, but their algorithms may produce broadcast times that are arbitrarily worse than optimal. We develop the first constant factor approximation algorithms for this model. Algorithm LCF (Largest Cluster First) for the basic model is simple, efficient and has a worst case approximation guarantee of 2. We then extend these models to more complex models where we remove the assumption that an unbounded amount of simultaneous communication may happen using the global network. The algorithms for these models build on the LCF method developed for the basic problem. Finally, we develop broadcasting algorithms for the postal model where the sending processor does not block for C time units when the message is in transit. Moreover, we assume that the messages are small and so the bottleneck is the latency.},
	keywords = {Approximation algorithms, Broadcasting, multicasting},
	isbn = {1-58113-986-1},
	doi = {10.1145/1073970.1074017},
	url = {http://doi.acm.org/10.1145/1073970.1074017},
	author = {Khuller, Samir and Kim,Yoo-Ah and Wan,Yung-Chun Justin}
}
@article {16100,
	title = {Broadening Access to Large Online Databases by Generalizing Query Previews (2000)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {Companies, government agencies, and other types of organizations are making their large databases available to the world over the Internet. Current database front-ends do not give users information about the distribution of data. This leads many users to waste time and network resources posing queries that have either zero-hit or mega-hit result sets. Query previews form a novel visual approach for browsing large databases. Query previews supply data distribution information about the database that is being searched and give continuous feedback about the size of the result set for the query as it is being formed. On the other hand, query previews use only a few pre-selected attributes of the database. The distribution information is displayed only on these attributes. Unfortunately, many databases are formed of numerous relations and attributes. This paper introduces a generalization of query previews. We allow users to browse all of the relations and attributes of a database using a hierarchical browser. Any of the attributes can be used to display the distribution information, making query previews applicable to many public online databases.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6474},
	author = {Tanin,Egemen and Plaisant, Catherine and Shneiderman, Ben}
}
@article {16999,
	title = {Browsing Large Online Data Tables Using Generalized Query Previews (2001)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purpose. Users query such tables with front-ends that typically use menus or form fillin interfaces, but these interfaces rarely give users information about the contents and distribution of the data. Such a situation leads users to waste time and network resources posing queries that have zero-hit or mega-hit results. Generalized query previews enable efficient browsing of large online databases by supplying data distribution information to the users. The data distribution information provides continuous feedback about the size of the result set as the query is being formed. Our paper presents a user interface architecture and discusses recent experimental findings. Our prototype system, ExpO, provides a flexible user interface for research and testing. The user study shows that for exploratory querying tasks, generalized query previews speed user performance and reduce network load.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6483},
	author = {Tanin,Egemen and Shneiderman, Ben}
}
@article {17002,
	title = {Building a Coherent Data Pipeline in Microarray Data Analyses: Optimization of Signal/Noise Ratios Using an Interactive Visualization Tool and a Novel Noise Filtering Method (2003)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {Motivation: Sources of uncontrolled noise strongly influence data analysis in microarray studies, yet signal/noise ratios are rarely considered in microarray data analyses. We hypothesized that different research projects would have different sources and levels of confounding noise, and built an interactive visual analysis tool to test and define parameters in Affymetrix analyses that optimize the ratio of signal (desired biological variable) versus noise (confounding uncontrolled variables). Results: Five probe set algorithms were studied with and without statistical weighting of probe sets using Microarray Suite (MAS) 5.0 probe set detection p values. The signal/noise optimization method was tested in two large novel microarray datasets with different levels of confounding noise; a 105 sample U133A human muscle biopsy data set (11 groups) (extensive noise), and a 40 sample U74A inbred mouse lung data set (8 groups) (little noise). Success was measured using F-measure value of success of unsupervised clustering into appropriate biological groups (signal). We show that both probe set signal algorithm and probe set detection p-value weighting have a strong effect on signal/noise ratios, and that the different methods performed quite differently in the two data sets. Among the signal algorithms tested, dChip difference model with p-value weighting was the most consistent at maximizing the effect of the target biological variables on data interpretation of the two data sets. Availability: The Hierarchical Clustering Explorer 2.0 is [url=http://www.cs.umd.edu/hcil/hce/]available[/url] online and the improved version of the Hierarchical Clustering Explorer 2.0 with p-value weighting and Fmeasure is available upon request to the first author. Murine arrays (40 samples) are publicly available at the [url=http://microarray.cnmcresearch.org/pgadatatable.asp]PEPR resource.[/url] (Chen et al., 2004).},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6511},
	author = {Seo,Jinwook and Bakay,Marina and Chen,Yi-Wen and Hilmer,Sara and Shneiderman, Ben and Hoffman,Eric P}
}
@conference {18171,
	title = {Building efficient and effective multimedia fingerprints via joint coding and embedding},
	booktitle = {Proceedings of the 7th workshop on Multimedia and security},
	series = {MM\&$\#$38;Sec {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {127 - 136},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Digital fingerprinting protects multimedia content from illegal redistribution by uniquely marking every copy of the content distributed to each user. One major category of collusion-resistant fingerprinting employs an explicit step of coding. Most existing works on coded fingerprinting mainly focus on the code-level issues and treat the embedding issues through abstract assumptions without examining the overall performance. In this paper, we jointly consider the coding and embedding issues for coded fingerprinting systems and examine their performance in terms of collusion resistance, detection computational complexity, and distribution efficiency. Our studies show that coded fingerprinting has efficient detection but rather low collusion resistance. Taking advantage of joint coding and embedding, we propose two new techniques, namely, a Permuted Subsegment Embedding technique and a Group-based Joint Coding and Embedding (GRACE) technique, to improve the collusion resistance of coded fingerprinting while maintaining its efficient detection. Experimental results show that the number of colluders that the proposed methods can resist is more than three times as many as that of the conventional coded fingerprinting approaches.},
	keywords = {collusion resistance, error correcting code, multimedia fingerprinting},
	isbn = {1-59593-032-9},
	doi = {10.1145/1073170.1073194},
	url = {http://doi.acm.org/10.1145/1073170.1073194},
	author = {He,Shan and M. Wu}
}
@conference {13213,
	title = {Background modeling and subtraction by codebook construction},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/10//},
	pages = {3061 - 3064 Vol. 5 - 3061 - 3064 Vol. 5},
	abstract = {We present a new fast algorithm for background modeling and subtraction. Sample background values at each pixel are quantized into codebooks which represent a compressed form of background model for a long image sequence. This allows us to capture structural background variation due to periodic-like motion over a long period of time under limited memory. Our method can handle scenes containing moving backgrounds or illumination variations (shadows and highlights), and it achieves robust detection for compressed videos. We compared our method with other multimode modeling techniques.},
	keywords = {(signal);, analysis;, background, codebook, coding;, colour, compression;, construction;, data, image, modeling, modeling;, MOTION, multimode, quantisation, representation;, sequence;, sequences;, subtraction;, technique;, video},
	doi = {10.1109/ICIP.2004.1421759},
	author = {Kim,Kyungnam and Chalidabhongse,T.H. and Harwood,D. and Davis, Larry S.}
}
@article {12689,
	title = {Bayesian self-calibration of a moving camera},
	journal = {Computer Vision and Image Understanding},
	volume = {95},
	year = {2004},
	month = {2004/09//},
	pages = {287 - 316},
	abstract = {In this paper, a Bayesian self-calibration approach using sequential importance sampling (SIS) is proposed. Given a set of feature correspondences tracked through an image sequence, the joint posterior distributions of both camera extrinsic and intrinsic parameters as well as the scene structure are approximated by a set of samples and their corresponding weights. The critical motion sequences are explicitly considered in the design of the algorithm. The probability of the existence of the critical motion sequence is inferred from the sample and weight set obtained from the SIS procedure. No initial guess for the calibration parameters is required. The proposed approach has been extensively tested on both synthetic and real image sequences and satisfactory performance has been observed.},
	keywords = {self-calibration, Sequential Monte Carlo methods, structure from motion, video analysis},
	isbn = {1077-3142},
	doi = {10.1016/j.cviu.2004.03.009},
	url = {http://www.sciencedirect.com/science/article/pii/S1077314204000396},
	author = {Qian,Gang and Chellapa, Rama}
}
@article {13730,
	title = {Bbn/umd at duc-2004: Topiary},
	journal = {Proceedings of the HLT-NAACL 2004 Document Understanding Workshop, Boston},
	year = {2004},
	month = {2004///},
	pages = {112 - 119},
	abstract = {This paper reports our results at DUC-2004 and describes our approach, im-
plemented in a system called Topiary.
We will show that the combination of
linguistically motivated sentence com-
pression with statistically selected topic
terms performs better than either alone,
according to some automatic summary
evaluation measures.
},
	author = {Zajic, David and Dorr, Bonnie J and Schwartz,R.}
}
@conference {18020,
	title = {Bending light for multi-chip virtual PRAMs?},
	booktitle = {Proc. 3rd Workshop on Non-Slicon Computation, held in conjunction with the 31st International Symposium on Computer Architecture (ISCA 2004)},
	year = {2004},
	month = {2004///},
	pages = {19 - 23},
	abstract = {A new paradigm for an all-to-alloptical interconnection network is presented.
An interesting modeling aspect is that (limited)
bending of optical communication channels is
allowed. In a computer system, the paradigm
could provide part of an interconnection fabric
between several tens (e.g., 64) of chips
comprising parallel processing elements and the
first level of the cache. An optical
interconnection network raises an intriguing
possibility: obtain both improved performance
and significant cost reduction with respect to
standard serial computer system models.
},
	author = {Vishkin, Uzi and Smolyaninov,I.}
}
@inbook {14203,
	title = {Bias in Shape Estimation},
	booktitle = {Computer Vision - ECCV 2004Computer Vision - ECCV 2004},
	series = {Lecture Notes in Computer Science},
	volume = {3023},
	year = {2004},
	month = {2004///},
	pages = {405 - 416},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This paper analyses the uncertainty in the estimation of shape from motion and stereo. It is shown that there are computational limitations of a statistical nature that previously have not been recognized. Because there is noise in all the input parameters, we cannot avoid bias. The analysis rests on a new constraint which relates image lines and rotation to shape. Because the human visual system has to cope with bias as well, it makes errors. This explains the underestimation of slant found in computational and psychophysical experiments, and demonstrated here for an illusory display. We discuss properties of the best known estimators with regard to the problem, as well as possible avenues for visual systems to deal with the bias.},
	isbn = {978-3-540-21982-8},
	url = {http://dx.doi.org/10.1007/978-3-540-24672-5_32},
	author = {Hui Ji and Ferm{\"u}ller, Cornelia},
	editor = {Pajdla,Tom{\'a}{\v s} and Matas,Jir{\'\i}}
}
@conference {14550,
	title = {Bidimensional Parameters and Local Treewidth},
	booktitle = {Latin 2004: Theoretical Informatics: 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004: Proceedings},
	year = {2004},
	month = {2004///},
	pages = {109 - 109},
	author = {Fomin,E. D.D.F.V and Hajiaghayi, Mohammad T. and Thilikos,D. M}
}
@article {15112,
	title = {Binary tree encryption: Constructions and applications},
	journal = {Information Security and Cryptology-ICISC 2003},
	year = {2004},
	month = {2004///},
	pages = {1 - 11},
	doi = {10.1007/978-3-540-24691-6_1},
	author = {Katz, Jonathan}
}
@article {12973,
	title = {A book like its cover},
	journal = {Heredity},
	volume = {93},
	year = {2004},
	month = {2004/08/01/},
	pages = {234 - 235},
	abstract = {An official journal of the Genetics Society, Heredity publishes high-quality articles describing original research and theoretical insights in all areas of genetics. Research papers are complimented by News \& Commentary articles and reviews, keeping researchers and students abreast of hot topics in the field.},
	keywords = {animal and plant breeding, biometrical and statistical genetics, cytogenetics, ecological, eukaryotes, Genetics, Genomics, human population genetics, population and evolutionary genetics, post-genomics},
	isbn = {0018-067X},
	doi = {10.1038/sj.hdy.6800475},
	url = {http://www.nature.com/hdy/journal/v93/n2/full/6800475a.html},
	author = {Cummings, Michael P.}
}
@conference {18552,
	title = {BorderGuard: detecting cold potatoes from peers},
	booktitle = {Proceedings of the 4th ACM SIGCOMM conference on Internet measurement},
	series = {IMC {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {213 - 218},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Internet Service Providers often establish contractual "peering" agreements, where they agree to forward traffic to each other{\textquoteright}s customers at no cost. <i>Consistent route advertisement at all peering points</i> is a common provision in these agreements, because it gives an AS the flexibility to select egress points for the traffic (e.g., performing "hot potato" routing). Verifying "consistent export" is challenging because route advertisements are exchanged at multiple peering points and may be modified by routing policies. In this paper, we propose two algorithms to detect inconsistent routes using routing and configuration data from an AS{\textquoteright}s border routers. The first algorithm requires access to all eBGP routes advertised by a peer. Because this data is often unavailable, we propose another algorithm that detects inconsistencies using readily available data. We have applied our algorithms to the routes advertised by the peers of AT\&T{\textquoteright}s commercial IP backbone. Although a peer may intentionally send inconsistent advertisements to prevent its neighbor from performing hot-potato routing, we also discuss several configuration scenarios where a peer may <i>inadvertently</i> advertise inconsistent routes, despite having consistent export policies. Finally, we explain how simple modifications to the routers could make detection of inconsistent advertisements much easier than it is today.},
	keywords = {anomalies, BGP, inconsistent advertisement, peering},
	isbn = {1-58113-821-0},
	doi = {10.1145/1028788.1028815},
	url = {http://doi.acm.org/10.1145/1028788.1028815},
	author = {Feamster, Nick and Mao,Zhuoqing Morley and Rexford,Jennifer}
}
@article {13935,
	title = {Bringing together children and books: An initial descriptive study of children{\textquoteright}s book searching and selection behavior in a digital library},
	journal = {Proceedings of the American Society for Information science and Technology},
	volume = {41},
	year = {2004},
	month = {2004///},
	pages = {339 - 348},
	author = {Reuter,K. and Druin, Allison}
}
@article {12349,
	title = {Buffer merging{\textemdash}a powerful technique for reducing memory requirements of synchronous dataflow specifications},
	journal = {ACM Transactions on Design Automation of Electronic Systems (TODAES)},
	volume = {9},
	year = {2004},
	month = {2004///},
	pages = {212 - 237},
	author = {Murthy,P. K and Bhattacharyya, Shuvra S.}
}
@conference {14782,
	title = {Bug driven bug finders},
	booktitle = {Proceedings of the International Workshop on Mining Software Repositories},
	year = {2004},
	month = {2004///},
	pages = {70 - 74},
	author = {Williams, C. C and Hollingsworth, Jeffrey K}
}
@conference {15901,
	title = {Building an information retrieval test collection for spontaneous conversational speech},
	booktitle = {Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval},
	series = {SIGIR {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {41 - 48},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Test collections model use cases in ways that facilitate evaluation of information retrieval systems. This paper describes the use of search-guided relevance assessment to create a test collection for retrieval of spontaneous conversational speech. Approximately 10,000 thematically coherent segments were manually identified in 625 hours of oral history interviews with 246 individuals. Automatic speech recognition results, manually prepared summaries, controlled vocabulary indexing, and name authority control are available for every segment. Those features were leveraged by a team of four relevance assessors to identify topically relevant segments for 28 topics developed from actual user requests. Search-guided assessment yielded sufficient inter-annotator agreement to support formative evaluation during system development. Baseline results for ranked retrieval are presented to illustrate use of the collection.},
	keywords = {assessment, Automatic speech recognition, oral history, search-guided relevance},
	isbn = {1-58113-881-4},
	doi = {10.1145/1008992.1009002},
	url = {http://doi.acm.org/10.1145/1008992.1009002},
	author = {Oard, Douglas and Soergel,Dagobert and David Doermann and Huang,Xiaoli and Murray,G. Craig and Wang,Jianqiang and Ramabhadran,Bhuvana and Franz,Martin and Gustman,Samuel and Mayfield,James and Kharevych,Liliya and Strassel,Stephanie}
}
@article {13933,
	title = {Building KidPad: an application for children{\textquoteright}s collaborative storytelling},
	journal = {Software: Practice and Experience},
	volume = {34},
	year = {2004},
	month = {2004///},
	pages = {895 - 914},
	author = {Hourcade,J. P and Bederson, Benjamin B. and Druin, Allison}
}
@conference {16784,
	title = {Balancing performance and data freshness in web database servers},
	booktitle = {Proceedings of the 29th international conference on Very large data bases-Volume 29},
	year = {2003},
	month = {2003///},
	pages = {393 - 404},
	author = {Labrinidis,A. and Roussopoulos, Nick}
}
@article {14878,
	title = {BAYESIAN AND STATISTICAL APPROACHES TO VISION-Natural Image Statistics and Perceptual Inference-What makes viewpoint-invariant properties perceptually salient?},
	journal = {Journal of the Optical Society of America-A-Optics Image Science and Vision},
	volume = {20},
	year = {2003},
	month = {2003///},
	pages = {1304 - 1320},
	author = {Jacobs, David W.}
}
@article {16899,
	title = {Bistro: a scalable and secure data transfer service for digital government applications},
	journal = {Commun. ACM},
	volume = {46},
	year = {2003},
	month = {2003/01//},
	pages = {50 - 51},
	abstract = {Government at all levels is a major collector and provider of data.Our project focuses on the collection of data over wide-area networks (WANs) and addresses the scalability issues that arise in the context of Internet-based massive data collection applications. Furthermore, security, due to the need for privacy and integrity of the data, is a central issue for data collection applications that use a public infrastructure such as the Internet. Numerous digital government applications require data collection over WANs [5].One compelling example of such an application is the Internal Revenue Service{\textquoteright}s electronic submission of income tax forms. Other digital government applications include collecting census data, federal statistics, and surveys; gathering and tallying of electronic votes; collecting crime data for the U.S. Justice department; collecting data from sensors for disaster response applications; collecting data from geological surveys; collecting electronic filings of patents, permits, and securities (for SEC) applications; grant proposals and contract bids submissions; and so on. All these applications have scalability and security needs in common.The poor performance that may be experienced by current digital government users, given the existing state of technology (as in Figure 1a), is largely due to how (independent) data transfers using TCP/IP work over the Internet. TCP/IP is good at equally sharing bandwidth between data streams, which in large-scale applications can lead to poor performance for individual clients (as they receive only a very small share of this bandwidth). Given that TCP/IP is here to stay for the foreseeable future, what is needed is a scalable yet cost- effective solution that can be easily deployed over the existing Internet technology.We are designing and developing a system called Bistro, which addresses the scalability needs of digital government data collection applications while allowing them to share the same infrastructure and resources efficiently, cost-effectively, and securely [1]. Bistro{\textquoteright}s basic approach is to introduce intermediate hosts---bistros---which allow replacement of a traditionally "synchronized client push" approach with a "nonsynchronized combination of client-push and server-pull" approach (as depicted in Figure 1b). This in turn allows spreading of the workload on the destination server and the network over time, with subsequent elimination of hot spots as well as significant improvements in performance for both clients and servers. Our ongoing research [2, 4] indicates that orders of magnitude of improvement can be achieved with the Bistro architecture and the corresponding data collection algorithms it affords.Bistro{\textquoteright}s design allows for a gradual deployment and experimentation over the Internet (by simply downloading Bistro server software and installing it on public servers). Bistro{\textquoteright}s security protocol and trust structure [3] are designed such that only encrypted data travels through (not necessarily trusted) bistros. This means a government agency does not need to trust bistros installed by other agencies or commercial institutions. At the same time, these (untrusted) bistros can significantly improve the agency{\textquoteright}s data collection performance. Each application (within each agency) can have its own scalability, security, fault tolerance, and other data collection needs, and these applications and agencies can still share available resources, if so desired, across all Bistro servers.We believe an appropriately designed single infrastructure such as Bistro can address all digital government wide-area data collection needs in a scalable, secure, and cost-effective manner. (For more information, see bourbon.usc.edu/iml/bistro/.},
	isbn = {0001-0782},
	doi = {10.1145/602421.602448},
	url = {http://doi.acm.org/10.1145/602421.602448},
	author = {Golubchik,Leana and Cheng,William C. and Chou,Cheng-Fu and Khuller, Samir and Samet, Hanan and Wan,C. Justin}
}
@article {15239,
	title = {Bistro: a scalable and secure data transfer service for digital government applications},
	journal = {Communications of the ACM},
	volume = {46},
	year = {2003},
	month = {2003/01//},
	pages = {50 - 51},
	abstract = {Government at all levels is a major collector and provider of data.Our project focuses on the collection of data over wide-area networks (WANs) and addresses the scalability issues that arise in the context of Internet-based massive data collection applications. Furthermore, security, due to the need for privacy and integrity of the data, is a central issue for data collection applications that use a public infrastructure such as the Internet. Numerous digital government applications require data collection over WANs [5].One compelling example of such an application is the Internal Revenue Service{\textquoteright}s electronic submission of income tax forms. Other digital government applications include collecting census data, federal statistics, and surveys; gathering and tallying of electronic votes; collecting crime data for the U.S. Justice department; collecting data from sensors for disaster response applications; collecting data from geological surveys; collecting electronic filings of patents, permits, and securities (for SEC) applications; grant proposals and contract bids submissions; and so on. All these applications have scalability and security needs in common.The poor performance that may be experienced by current digital government users, given the existing state of technology (as in Figure 1a), is largely due to how (independent) data transfers using TCP/IP work over the Internet. TCP/IP is good at equally sharing bandwidth between data streams, which in large-scale applications can lead to poor performance for individual clients (as they receive only a very small share of this bandwidth). Given that TCP/IP is here to stay for the foreseeable future, what is needed is a scalable yet cost- effective solution that can be easily deployed over the existing Internet technology.We are designing and developing a system called Bistro, which addresses the scalability needs of digital government data collection applications while allowing them to share the same infrastructure and resources efficiently, cost-effectively, and securely [1]. Bistro{\textquoteright}s basic approach is to introduce intermediate hosts---bistros---which allow replacement of a traditionally "synchronized client push" approach with a "nonsynchronized combination of client-push and server-pull" approach (as depicted in Figure 1b). This in turn allows spreading of the workload on the destination server and the network over time, with subsequent elimination of hot spots as well as significant improvements in performance for both clients and servers. Our ongoing research [2, 4] indicates that orders of magnitude of improvement can be achieved with the Bistro architecture and the corresponding data collection algorithms it affords.Bistro{\textquoteright}s design allows for a gradual deployment and experimentation over the Internet (by simply downloading Bistro server software and installing it on public servers). Bistro{\textquoteright}s security protocol and trust structure [3] are designed such that only encrypted data travels through (not necessarily trusted) bistros. This means a government agency does not need to trust bistros installed by other agencies or commercial institutions. At the same time, these (untrusted) bistros can significantly improve the agency{\textquoteright}s data collection performance. Each application (within each agency) can have its own scalability, security, fault tolerance, and other data collection needs, and these applications and agencies can still share available resources, if so desired, across all Bistro servers.We believe an appropriately designed single infrastructure such as Bistro can address all digital government wide-area data collection needs in a scalable, secure, and cost-effective manner. (For more information, see bourbon.usc.edu/iml/bistro/.},
	isbn = {0001-0782},
	doi = {10.1145/602421.602448},
	url = {http://doi.acm.org/10.1145/602421.602448},
	author = {Golubchik,Leana and Cheng,William C. and Chou,Cheng-Fu and Khuller, Samir and Samet, Hanan and Wan,C. Justin}
}
@article {15721,
	title = {Blind Deconvolution Using a Regularized Structured Total Least Norm Approach},
	journal = {SIAM J. on Matrix Analysis and Applications},
	volume = {24},
	year = {2003},
	month = {2003///},
	pages = {1018 - 1037},
	url = {http://epubs.siam.org/sam-bin/dbq/article/39544http://epubs.siam.org/sam-bin/dbq/article/39544},
	author = {Pruessner,Armin and O{\textquoteright}Leary, Dianne P.}
}
@conference {12076,
	title = {Bootstrapping security associations for routing in mobile ad-hoc networks},
	booktitle = {IEEE Global Telecommunications Conference, 2003. GLOBECOM {\textquoteright}03},
	volume = {3},
	year = {2003},
	month = {2003/12/01/5},
	pages = {1511- 1515 vol.3 - 1511- 1515 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {To date, most solutions proposed for secure routing in mobile ad-hoc networks (MANETs), assume that secure associations between pairs of nodes can be established on-line; e.g., by a trusted third party, by distributed trust establishment. However, establishing such security associations, with or without trusted third parties, requires reliance on routing layer security. In this paper, we eliminate this apparent cyclic dependency between security services and secure routing in MANETs and show how to bootstrap security for the routing layer. We use the notion of statistically unique and cryptographically verifiable (SUCV) identifiers to implement a secure binding between IP addresses and keys that is independent of any trusted security service. We illustrate our solution with the dynamic source routing (DSR) protocol and compare it with other solutions for secure routing.},
	keywords = {ad hoc networks, bootstrapping security association, Cryptographic protocols, dynamic source routing protocol, Fabrics, Intelligent networks, IP address, IP key, IP networks, Message authentication, mobile ad-hoc network, mobile radio, Protection, Public key, public key cryptography, routing layer security reliability, routing protocols, secure routing, Security, security service, statistically unique cryptographically verification, telecommunication security},
	isbn = {0-7803-7974-8},
	doi = {10.1109/GLOCOM.2003.1258490},
	author = {Bobba,R. B and Eschenauer,L. and Gligor,V. and Arbaugh, William A.}
}
@conference {14054,
	title = {A boundary element method for electromagnetic scattering by multiple cylinders},
	booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE},
	volume = {3},
	year = {2003},
	month = {2003/06//},
	pages = {516 - 519 vol.3 - 516 - 519 vol.3},
	abstract = {An integral equation approach is derived for an electromagnetic scattering from M multiple cylinders. The problem is two-dimensional and the integral equation is solved using the Nystrom method. We give numerical examples that illustrate the algorithm.},
	keywords = {algorithm;, boundary, boundary-elements, cylinders;, electromagnetic, element, equations;, Fredholm, integral, method;, methods;, multiple, Nystrom, scattering;, two-dimensional, type, wave},
	doi = {10.1109/APS.2003.1219899},
	author = {Seydou,F. and Duraiswami, Ramani and Seppanen,T.}
}
@article {16996,
	title = {Bringing Treasures to the Surface: Previews and Overviews in a Prototype for the Library of Congress National Digital Library},
	journal = {The craft of information visualization: readings and reflections},
	year = {2003},
	month = {2003///},
	pages = {388 - 388},
	author = {Marchionini,A.S. and Nation,D. and Karasik,S. and Cronnell,T. and Shneiderman, Ben and Spotfire,V.D.M.U. and Bederson, Benjamin B. and Data,T.S. and Hochheiser,H. and Shneiderman, Ben and others}
}
@inbook {16128,
	title = {Broadening Access to Large Online Databases by Generalizing Query Previews},
	booktitle = {The Craft of Information VisualizationThe Craft of Information Visualization},
	year = {2003},
	month = {2003///},
	pages = {31 - 37},
	publisher = {Morgan Kaufmann},
	organization = {Morgan Kaufmann},
	address = {San Francisco},
	abstract = {Companies, government agencies, and other types of organizations are making their large databases available to the world over the Internet. Current database front-ends do not give users information about the distribution of data. This leads many users to waste time and network resources posing queries that have either zero-hit or mega-hit result sets. Query previews form a novel visual approach for browsing large databases. Query previews supply data distribution information about the database that is being searched and give continuous feedback about the size of the result set for the query as it is being formed. On the other hand, query previews use only a few pre-selected attributes of the database. The distribution information is displayed only on these attributes. Unfortunately, many databases are formed of numerous relations and attributes. This paper introduces a generalization of query previews. We allow users to browse all of the relations and attributes of a database using a hierarchical browser. Any of the attributes can be used to display the distribution information, making query previews applicable to many public online databases.},
	isbn = {978-1-55860-915-0},
	url = {http://www.sciencedirect.com/science/article/pii/B978155860915050007X},
	author = {Tanin,Egemen and Plaisant, Catherine and Shneiderman, Ben},
	editor = {Bederson, Benjamin B. and Shneiderman, Ben}
}
@article {17694,
	title = {Building an Old-Fashioned Sparse Solver},
	volume = {UMIACS-TR-2003-95},
	year = {2003},
	month = {2003/09/25/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {A sparse matrix is a matrix with very few nonzero elements.  Manyapplications in diverse fields give rise to linear systems of the form
$Ax = b$, where $A$ is sparse.  The problem in solving these systems
is to take advantage of the preponderance of zero elements to reduce
both memory use and comutation time.  The purpose of this paper is to
introduce students (and perhaps their teachers) to sparse matrix
technology.  It is impossible to treat all the techniques developed
since the subject started in the 1960{\textquoteright}s.  Instead, this paper
constructs a sparse solver for positive definite systems that would
have been state of the art around 1980, emphasizing equally theory and
computational practice.  It is hoped that a mastery of this material
will allow the reader to study the subject independently.
(UMIACS-TR-2003-95)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1312},
	author = {Stewart, G.W.}
}
@article {12759,
	title = {A Bayesian Approach to Simultaneous Motion Estimation of Multiple Independently Moving Objects},
	journal = {INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION},
	volume = {16},
	year = {2002},
	month = {2002///},
	pages = {309 - 314},
	abstract = {In this paper, the problem of simultaneous motion estima-tion of multiple independently moving objects is addressed.
A novel Bayesian approach is designed for solving this prob-
lem using the sequential importance sampling (SIS) method.
In the proposed algorithm, a balancing step is added into the
SIS procedure to preserve samples of low weights so that all
objects have enough samples to propagate empirical motion
distributions. By using the proposed algorithm, the relative
motions of all moving objects with respect to camera can be
simultaneously estimated . This algorithm has been tested
on both synthetic and real image sequences. Improved re-
sults have been achieved.
},
	author = {Qian, G. and Chellapa, Rama and Zheng,Q.}
}
@conference {12753,
	title = {Bayesian methods for face recognition from video},
	booktitle = {Acoustics, Speech, and Signal Processing (ICASSP), 2002 IEEE International Conference on},
	volume = {4},
	year = {2002},
	month = {2002/05//},
	pages = {IV-4068 -IV-4071 - IV-4068 -IV-4071},
	abstract = {Face recognition (FR) from video necessitates simultaneously solving two asks, recognition and tracking. To accommodate the video, a time series state space model is introduced in a Bayesian approach. Given this model, the goal reduces to estimating the posterior distribution of the state vector given the observations up to the present. The Sequential Importance Sampling (SIS) technique is invoked to generate a numerical solution to this model. However, the ultimate goal is to estimate the posterior distribution of the identity of humans for recognition purposes. Presented here are two methods to approximate the above distribution under different experimental scenarios.},
	doi = {10.1109/ICASSP.2002.5745551},
	author = {Chellapa, Rama and Zhou,Shaohua and Li,Baoxin}
}
@conference {12758,
	title = {Bayesian structure from motion using inertial information},
	booktitle = {Image Processing. 2002. Proceedings. 2002 International Conference on},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {III-425 - III-428 vol.3 - III-425 - III-428 vol.3},
	abstract = {A novel approach to Bayesian structure from motion (SfM) using inertial information and sequential importance sampling (SIS) is presented. The inertial information is obtained from camera-mounted inertial sensors and is used in the Bayesian SfM approach as prior knowledge of the camera motion in the sampling algorithm. Experimental results using both synthetic and real images show that, when inertial information is used, more accurate results can be obtained or the same estimation accuracy can be obtained at a lower cost.},
	keywords = {3D, analysis;, Bayes, Bayesian, camera, estimation;, image, images;, importance, inertial, information;, methods;, MOTION, motion;, parameter, processing;, real, reconstruction;, sampling;, scene, sensors;, sequence;, sequences;, sequential, signal, structure-from-motion;, synthetic, systems;, video},
	doi = {10.1109/ICIP.2002.1038996},
	author = {Qian,Gang and Chellapa, Rama and Qinfen Zheng}
}
@conference {13513,
	title = {Beam Search for Feature Selection in Automatic SVMDefect Classification},
	booktitle = {International Conference on Pattern Recognition},
	year = {2002},
	month = {2002///},
	pages = {212 - 215},
	abstract = {Often in pattern classification problems, one tries to extract a large number of features and base the classifier decision on as much information as possible. This yields an array of features that are {\textquoteright}potentially{\textquoteright} useful. Most of the time however, large feature sets are sub-optimal in describing the samples since they tend to over-represent the data and model noise along with the useful information in the data. Selecting relevant features from the available set of features is, therefore, a challenging task. In this paper, we present an innovative feature selection algorithm called Smart Beam Search (SBS), which is used with a Support Vector Machine based classifier for automatic defect classification. This feature selection approach not only reduces the dimensionality of the feature space substantially, but also improves the classifier performance.},
	author = {Gupta,P. and David Doermann and DeMenthon,D.}
}
@article {14204,
	title = {Bias in visual motion processes: A theory predicting illusions},
	journal = {Statistical Methods in Video Processing.(in conjunction with European Conference on Computer Vision)},
	year = {2002},
	month = {2002///},
	abstract = {The first step in the interpretation of video sequences is theestimation of spatio-temporal image representations, that is
the image motion or the correspondence of points or lines.
Noise in the data, however, causes a serious problem for
their estimation; in particular, it causes bias. As a result the
location of image points, the orientation of image lines and
the length and orientation of image motion vectors are esti-
mated erroneously. It is suggested that machine vision sys-
tems processing video should include statistical procedures
to alleviate the bias. However, complete correction in gen-
eral does not appear to be feasible, and this provides an ex-
planation for most well-known geometrical optical illusions,
such as the caf{\'e} wall, the Z{\"o}llner, the Poggendorff illusion
and other recently discovered illusions of movement.
},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J. and Malm,H.}
}
@conference {13514,
	title = {Binarization of low quality text using a Markov random field model},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {160 - 163 vol.3 - 160 - 163 vol.3},
	abstract = {Binarization techniques have been developed in the document analysis community for over 30 years and many algorithms have been used successfully. On the other hand, document analysis tasks are more and more frequently being applied to multimedia documents such as video sequences. Due to low resolution and lossy compression, the binarization of text included in the frames is a non-trivial task. Existing techniques work without a model of the spatial relationships in the image, which makes them less powerful. We introduce a new technique based on a Markov random field model of the document. The model parameters (clique potentials) are learned from training data and the binary image is estimated in a Bayesian framework. The performance is evaluated using commercial OCR software.},
	keywords = {analysis;, annealing;, Bayes, Bayesian, binarization;, computing;, distributions;, document, documents;, field;, Gibbs, image, low, Markov, method;, methods;, multimedia, optimization;, probability;, processes;, processing;, QUALITY, random, simulated, text},
	doi = {10.1109/ICPR.2002.1047819},
	author = {Wolf,C. and David Doermann}
}
@article {14107,
	title = {Block preconditioners for the discrete incompressible Navier{\textendash}Stokes equations},
	journal = {International Journal for Numerical Methods in Fluids},
	volume = {40},
	year = {2002},
	month = {2002/09/30/},
	pages = {333 - 344},
	abstract = {We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear systems arising from discretization and linearization of the steady-state Navier{\textendash}Stokes equations. For steady-state problems, we show that the preconditioned problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. These characteristics are directly correlated with the convergence properties of iterative solvers, with convergence rates independent of mesh size and only mildly dependent on viscosity. For evolutionary problems, we show that implicit treatment of the time derivatives leads to systems for which convergence is essentially independent of viscosity. Copyright {\textcopyright} 2002 John Wiley \& Sons, Ltd.},
	keywords = {Iterative algorithms, Navier{\textendash}Stokes equations, preconditioning},
	isbn = {1097-0363},
	doi = {10.1002/fld.311},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/fld.311/abstract},
	author = {Elman, Howard and Silvester, David J and Wathen, Andrew J}
}
@article {16993,
	title = {Book Preview-Leonardo{\textquoteright}s Laptop: Human Needs and the New Computing Technologies},
	journal = {Interactions-New York},
	volume = {9},
	year = {2002},
	month = {2002///},
	pages = {43 - 43},
	author = {Shneiderman, Ben}
}
@article {15189,
	title = {Bounds on the efficiency of encryption and digital signatures},
	volume = {2002-22},
	year = {2002},
	month = {2002///},
	institution = {Rutgers University},
	abstract = {A central focus of modern cryptography is to investigate the weakest possible assumptionsunder which various cryptographic algorithms exist. Typically, a proof that a {\textquotedblleft}weak{\textquotedblright} prim-
itive (e.g., a one-way function) implies the existence of some {\textquotedblleft}strong{\textquotedblright} algorithm (e.g., a
private-key encryption scheme) proceeds by giving an explicit construction of the latter
from the former. Beyond merely showing such a construction, an equally important research
direction is to explore the efficiency of the construction. One might argue that this line
of research has become even more important now that minimal assumptions are known for
many (but not all) algorithms of interest.
Protocols for encryption (in both the public- and private-key setting) and for digital
signatures are fundamental to cryptography. In this work, we show the first lower bounds
on the efficiency of constructions of these protocols based on black-box access to one-way or
trapdoor one-way permutations. If S is the assumed security of the permutation π (i.e., no
adversary of size S can {\textquotedblleft}break{\textquotedblright} π in the appropriate sense on a fraction larger than 1/S of
its inputs), our results show that:
{\textbullet} Any public-key encryption algorithm for m-bit messages must query π at least {\textohm}(m/log S)
times. This matches the known upper bound.
{\textbullet} Any private-key encryption algorithm for m-bit messages which uses a k-bit key must
query π at least {\textohm}(m-k
logS
) times. This matches the known upper bound.
{\textbullet} Any signature verification algorithm for m-bit messages must query π at least {\textohm}(m/log S)
times.
We prove our results in an extension of the Impagliazzo-Rudich model. That is, we show
that any black-box construction beating our lower bounds would imply the unconditional
existence of a one-way function.
},
	author = {Gennaro,R. and Gertner,Y. and Katz, Jonathan}
}
@conference {18930,
	title = {Breaking the resource bottleneck for multilingual applications},
	year = {2002},
	month = {2002///},
	author = {Hwa,R. and Resnik, Philip and Weinberg, Amy}
}
@article {17691,
	title = {Backward Error Bounds for Approximate Krylov Subspaces},
	volume = {UMIACS-TR-2001-32},
	year = {2001},
	month = {2001/05/10/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {Let $A$ be a matrix of order $n$ and let $\clu\subset\comp^{n}$ be asubspace of dimension $k$.  In this note we determine a matrix $E$ of
minimal norm such that $\clu$ is a Krylov subspace of $A+E$.
(Cross-referenced as UMIACS-TR-2001-32)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1133},
	author = {Stewart, G.W.}
}
@book {16985,
	title = {Becoming a Scholar in the Digital Age},
	year = {2001},
	month = {2001///},
	publisher = {National Research Council},
	organization = {National Research Council},
	keywords = {bibtex-import, digital-library, dlbook},
	author = {Duderstadt,James and Arms,William and Messina,Paul and Ellisman,Mark and Atkins,Daniel and Fox,Edward and Shneiderman, Ben and Nissenbaum,Helen and Lederberg,Joshua}
}
@article {17568,
	title = {Better Approximation Guarantees for Job-Shop Scheduling},
	journal = {SIAM Journal on Discrete Mathematics},
	volume = {14},
	year = {2001},
	month = {2001///},
	pages = {67 - 67},
	abstract = {Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work and present further improvements for some important NP-hard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.},
	isbn = {08954801},
	doi = {10.1137/S0895480199326104},
	url = {http://link.aip.org/link/SJDMEC/v14/i1/p67/s1\&Agg=doi},
	author = {Goldberg,Leslie Ann and Paterson,Mike and Srinivasan, Aravind and Sweedyk,Elizabeth}
}
@article {12123,
	title = {Building an Experience Base for Software Engineering: A report on the first CeBASE eWorkshop},
	journal = {Product Focused Software Process Improvement},
	year = {2001},
	month = {2001///},
	pages = {110 - 125},
	abstract = {New information is obtained by research and disseminated by papers in conferences and journals. The synthesis of knowledge depends upon social discourse among the experts in a given domain to discuss the impact of this new information. Meetings among such experts are, however, expensive and time consuming. In this paper we discuss the organization of CeBASE, a center whose goal is the collection and dissemination of empirically-based software engineering knowledge, and the concept of the online workshop or eWorkshop as a way to use the Internet to minimize the needs of face-to-face meetings. We discuss the design of our eWorkshop and give the results of one eWorkshop that discussed the impact of defect reduction strategies.We want to thank Barry Boehm, Scott Henninger, Rayford Vaughn, Winsor Brown, Dan Port and Michael Frey as well as all participants for their contribution to the success of the eWorkshop. We also want to thank students at USC and UMD for their contribution in testing the system and Jennifer Dix for proof reading this paper.
},
	doi = {10.1007/3-540-44813-6_13},
	author = {Basili, Victor R. and Tesoriero,R. and Costa,P. and Lindvall,M. and Rus,I. and Shull, F. and Zelkowitz, Marvin V}
}
@article {14899,
	title = {Breakout Session Report: Principles and Methods},
	journal = {Perceptual Organization for Artificial Vision Systems},
	year = {2000},
	month = {2000///},
	pages = {17 - 28},
	abstract = {This report will present a summary of views presented during a discussion at the 1999 Workshop on Perceptual Organization in Computer Vision. Our goal is to present diverse views, informally expressed on principles and algorithms of perceptual organization. Naturally, such a discussion must be somewhat limited both by the time available and by the specific set of researchers who could be present. Still, we hope to describe some interesting ideas expressed and to note the number of areas of apparent consensus among a fairly broad group. In particular, we will describe views on the state of the art in perceptual grouping, and what seem to be key open questions and promising directions for addressing them.},
	doi = {10.1007/978-1-4615-4413-5_2},
	author = {Jacobs, David W. and Malik,J. and Nevatia, R.}
}
@inbook {13732,
	title = {Building a Chinese-English Mapping Between Verb Concepts for Multilingual Applications},
	booktitle = {Envisioning Machine Translation in the Information FutureEnvisioning Machine Translation in the Information Future},
	series = {Lecture Notes in Computer Science},
	volume = {1934},
	year = {2000},
	month = {2000///},
	pages = {345 - 363},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This paper addresses the problem of building conceptual resources for multilingual applications. We describe new techniques for large-scale construction of a Chinese-English lexicon for verbs, using thematic-role information to create links between Chinese and English conceptual information. We then present an approach to compensating for gaps in the existing resources. The resulting lexicon is used for multilingual applications such as machine translation and cross-language information retrieval.},
	isbn = {978-3-540-41117-8},
	url = {http://dx.doi.org/10.1007/3-540-39965-8_1},
	author = {Dorr, Bonnie J and Levow,Gina-Anne and Lin,Dekang},
	editor = {White,John}
}
@article {14596,
	title = {Bacterial Start Site Prediction},
	journal = {Nucleic Acids ResearchNucl. Acids Res.},
	volume = {27},
	year = {1999},
	month = {1999/09/01/},
	pages = {3577 - 3582},
	abstract = {With the growing number of completely sequenced bacterial genes, accurate gene prediction in bacterial genomes remains an important problem. Although the existing tools predict genes in bacterial genomes with high overall accuracy, their ability to pinpoint the translation start site remains unsatisfactory. In this paper, we present a novel approach to bacterial start site prediction that takes into account multiple features of a potential start site, viz., ribosome binding site (RBS) binding energy, distance of the RBS from the start codon, distance from the beginning of the maximal ORF to the start codon, the start codon itself and the coding/non-coding potential around the start site. Mixed integer programing was used to optimize the discriminatory system. The accuracy of this approach is up to 90\%, compared to 70\%, using the most common tools in fully automated mode (that is, without expert human post-processing of results). The approach is evaluated using Bacillus subtilis, Escherichia coli and Pyrococcus furiosus. These three genomes cover a broad spectrum of bacterial genomes, since B.subtilis is a Gram-positive bacterium, E.coli is a Gram-negative bacterium and P.furiosus is an archaebacterium. A significant problem is generating a set of {\textquoteleft}true{\textquoteright} start sites for algorithm training, in the absence of experimental work. We found that sequence conservation between P.furiosus and the related Pyrococcus horikoshii clearly delimited the gene start in many cases, providing a sufficient training set.},
	isbn = {0305-1048, 1362-4962},
	doi = {10.1093/nar/27.17.3577},
	url = {http://nar.oxfordjournals.org/content/27/17/3577},
	author = {Hannenhalli, Sridhar and Hayes,William S and Hatzigeorgiou,Artemis G and Fickett,James W}
}
@article {16659,
	title = {The Bible as a parallel corpus: Annotating the {\textquoteleft}Book of 2000 Tongues{\textquoteright}},
	journal = {Computers and the Humanities},
	volume = {33},
	year = {1999},
	month = {1999///},
	pages = {129 - 153},
	author = {Resnik, Philip and Olsen,M.B. and Diab,M.}
}
@article {16991,
	title = {Bifocal lens},
	journal = {Readings in information visualization},
	year = {1999},
	month = {1999///},
	pages = {331 - 332},
	author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben}
}
@article {15546,
	title = {Binary space parititions in pl{\"u}cker space},
	journal = {Algorithm Engineering and Experimentation},
	year = {1999},
	month = {1999///},
	pages = {663 - 663},
	abstract = {One of the important potential applications of computational geometry is in the field of computer graphics. One challenging computational problem in computer graphics is that of rendering scenes with nearly photographic realism. A major distinction in lighting and shading models in computer graphics is between local illumination models and global illumination models. Local illumination models are available with most commercial graphics software. In such a model the color of a point on an object is modeled as a function of the local surface properties of the object and its relation to a typically small number of point light sources. The other objects of scene have no effect. In contrast, in global illumination models, the color of a point is determined by considering illumination both from direct light sources as well as indirect lighting from other surfaces in the environment. In some sense, there is no longer a distinction between objects and light sources, since every surface is a potential emitter of (indirect) light. Two physical-based methods dominate the field of global illumination. They are ray tracing [8] and radiosity [3].},
	doi = {10.1007/3-540-48518-X_6},
	author = {Mount, Dave and Pu,F. T}
}
@article {14781,
	title = {Binary version management for computational grids},
	journal = {Parallel processing letters},
	volume = {9},
	year = {1999},
	month = {1999///},
	pages = {215 - 225},
	author = {Hollingsworth, Jeffrey K and Miller, E. L and Akala, K.}
}
@inbook {16170,
	title = {Browsing hierarchical data with multi-level dynamic queries},
	booktitle = {Readings in information visualizationReadings in information visualization},
	year = {1999},
	month = {1999///},
	pages = {295 - 305},
	publisher = {Morgan Kaufmann Publishers Inc.},
	organization = {Morgan Kaufmann Publishers Inc.},
	isbn = {9781558605336},
	author = {Kumar,H. P and Plaisant, Catherine and Shneiderman, Ben}
}
@article {15228,
	title = {The budgeted maximum coverage problem},
	journal = {Information Processing Letters},
	volume = {70},
	year = {1999},
	month = {1999///},
	pages = {39 - 45},
	author = {Khuller, Samir and Moss,A. and Naor,J. S}
}
@conference {18666,
	title = {Building dependable distributed applications using AQUA},
	year = {1999},
	month = {1999///},
	pages = {189 - 196},
	abstract = {Building dependable distributed systems using ad hoc methods is a challenging task. Without proper support, an application programmer must face the daunting requirement of having to provide fault tolerance at the application level, in addition to dealing with the complexities of the distributed application itself. This approach requires a deep knowledge of fault tolerance on the part of the application designer, and has a high implementation cost. What is needed is a systematic approach to providing dependability to distributed applications. Proteus, part of the AQuA architecture, fills this need and provides facilities to make a standard distributed CORBA application dependable, with minimal changes to an application. Furthermore, it permits applications to specify, either directly or via the Quality Objects (QuO) infrastructure, the level of dependability they expect of a remote object, and will attempt to configure the system to achieve the requested dependability level. Our previous papers have focused on the architecture and implementation of Proteus. This paper describes how to construct dependable applications using the AQuA architecture, by describing the interface that a programmer is presented with and the graphical monitoring facilities that it provides},
	keywords = {ad hoc methods, application programmer, AQuA, complexities, computational complexity, dependable distributed applications, distributed CORBA application, distributed object management, Fault tolerance, fault tolerant computing, proteus},
	doi = {10.1109/HASE.1999.809494},
	author = {Ren,J. and Michel Cukier and Rubel,P. and Sanders,W. H. and Bakken,D. E. and Karr,D. A.}
}
@conference {18639,
	title = {Building dependable distributed objects with the AQuA architecture},
	year = {1999},
	month = {1999///},
	pages = {17 - 18},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.16.2819\&rep=rep1\&type=pdf},
	author = {Michel Cukier and Ren,J. and Rubel,P. and Bakken,D. E. and Karr,D. A.}
}
@article {13515,
	title = {Building mosaics from video using MPEG motion vectors},
	volume = {LAMP-TR-035,CAR-TR-918,CS-TR-4034},
	year = {1999},
	month = {1999/07//},
	institution = {University of Maryland, College Park},
	abstract = {In this paper we present a novel way of creating mosaics from an MPEG video sequence. Two original aspects of our work are that (1) we explicitly compute camera motion between frames and (2) we deduce the camera motion directly from the motion vectors encoded in the MPEG video stream. This enables us to create mosaics more simply and quickly than with other methods.},
	author = {Jones,R. and DeMenthon,D. and David Doermann}
}
@conference {13516,
	title = {Building Mosaics from Video Using MPEG Motion Vectors},
	booktitle = {ACM Conference on Multimedia},
	year = {1999},
	month = {1999/11//},
	pages = {29 - 32},
	abstract = {In this paper we present a novel way of creating mosaics from an MPEG video sequence. Two original aspects of our work are that (1) we explicitly compute camera motion between frames and (2) we deduce the camera motion directly from the motion vectors encoded in the MPEG video stream{\"\i}{\textquestiondown}{\textonehalf}. This enables us to create mosaics more simply and quickly than with other methods.},
	author = {Jones,R. and DeMenthon,D. and Doermann, David}
}
@book {17692,
	title = {Basic decompositions},
	volume = {1},
	year = {1998},
	month = {1998///},
	publisher = {Soc. for Industrial and Applied Mathematics},
	organization = {Soc. for Industrial and Applied Mathematics},
	author = {Stewart, G.W.}
}
@conference {14762,
	title = {Benchmarking a network of PCs running parallel applications},
	booktitle = {Performance, Computing and Communications, 1998. IPCCC {\textquoteright}98., IEEE International},
	year = {1998},
	month = {1998/02/16/18},
	pages = {1 - 7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Presents a benchmarking study that compares the performance of a network of four PCs connected by a 100 Mbit/s fast Ethernet running three different system software configurations: TCP/IP on Windows NT, TCP/IP on Linux and a lightweight message-passing protocol (U-Net active messages) on Linux. For each configuration, we report results for communication micro-benchmarks and the NAS (Numerical Aerodynamics Simulation) parallel benchmarks. For the NAS benchmarks, the overall running time using Linux TCP/IP was 12-500\% less than the Windows NT TCP/IP configuration. Likewise, the Linux U-Net based message-passing protocol outperformed the Linux TCP/IP version by 5-200\%+. We also show that, by using Linux U-Net, we are able to achieve 125 μs latency between two processes using PVM. Finally, we report that the default mathematical libraries supplied with NT (for both gcc and Visual C++) are substantially slower than the one supplied with Linux},
	keywords = {100 Mbit/s, 125 mus, Aerodynamics, Application software, communication micro-benchmarks, default mathematical libraries, Delay, Ethernet, Ethernet networks, gcc, latency, lightweight message-passing protocol, Linux, Local area networks, mathematics computing, Message passing, microcomputer applications, Microsoft Windows NT, NAS parallel benchmarks, network operating systems, Numerical simulation, parallel applications, PARALLEL PROCESSING, PC network benchmarking, performance comparison, performance evaluation, Personal communication networks, Protocols, PVM, running time, software libraries, System software, system software configurations, TCP/IP, TCPIP, Transport protocols, U-Net active messages, Visual C++},
	isbn = {0-7803-4468-5},
	doi = {10.1109/PCCC.1998.659876},
	author = {Hollingsworth, Jeffrey K and Guven, E. and Akinlar, C.}
}
@inbook {14202,
	title = {Beyond the Epipolar Constraint: Integrating 3D Motion and Structure Estimation},
	booktitle = {3D Structure from Multiple Images of Large-Scale Environments3D Structure from Multiple Images of Large-Scale Environments},
	series = {Lecture Notes in Computer Science},
	volume = {1506},
	year = {1998},
	month = {1998///},
	pages = {109 - 123},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This paper develops a novel solution to the problem of recovering the structure of a scene given an uncalibrated video sequence depicting the scene. The essence of the technique lies in a method for recovering the rigid transformation between the different views in the image sequence. Knowledge of this 3D motion allows for self-calibration and for subsequent recovery of 3D structure. The introduced method breaks away from applying only the traditionally used epipolar constraint and introduces a new constraint based on the interaction between 3D motion and shape. Up to now, structure from motion algorithms proceeded in two well defined steps, where the first and most important step is recovering the rigid transformation between two views, and the subsequent step is using this transformation to compute the structure of the scene in view. Here both aforementioned steps are accomplished in a synergistic manner. Existing approaches to 3D motion estimation are mostly based on the use of optic flow which however poses a problem at the locations of depth discontinuities. If we knew where depth discontinuities were, we could (using a multitude of approaches based on smoothness constraints) estimate accurately flow values for image patches corresponding to smooth scene patches; but to know the discontinuities requires solving the structure from motion problem first. In the past this dilemma has been addressed by improving the estimation of flow through sophisticated optimization techniques, whose performance often depends on the scene in view. In this paper the main idea is based on the interaction between 3D motion and shape which allows us to estimate the 3D motion while at the same time segmenting the scene. If we use a wrong 3D motion estimate to compute depth, then we obtain a distorted version of the depth function. The distortion, however, is such that the worse the motion estimate, the more likely we are to obtain depth estimates that are locally unsmooth, i.e., they vary more than the correct ones. Since local variability of depth is due either to the existence of a discontinuity or to a wrong 3D motion estimate, being able to differentiate between these two cases provides the correct motion, which yields the {\textquotedblleft}smoothest{\textquotedblright} estimated depth as well as the image locations of scene discontinuities. Although no optic flow values are computed, we show that our algorithm is very much related to minimizing the epipolar constraint when the scene in view is smooth. When however the imaged scene is not smooth, the introduced constraint has in general different properties from the epipolar constraint and we present experimental results with real sequences where it performs better.},
	isbn = {978-3-540-65310-3},
	url = {http://dx.doi.org/10.1007/3-540-49437-5_8},
	author = {Brodsk{\'y},Tom{\'a}{\v s} and Ferm{\"u}ller, Cornelia and Aloimonos, J.},
	editor = {Koch,Reinhard and Van Gool,Luc}
}
@article {15720,
	title = {BFGS with Update Skipping and Varying Memory},
	journal = {SIAM Journal on Optimization},
	volume = {8},
	year = {1998},
	month = {1998///},
	pages = {1060 - 1083},
	abstract = {We give conditions under which limited-memory quasi-Newton methods with exact line searches will terminate in n steps when minimizing n-dimensional quadratic functions. We show that although all Broyden family methods terminate in n steps in their full-memory versions, only BFGS does so with limited-memory. Additionally, we show that full-memory Broyden family methods with exact line searches terminate in at most n + p steps when p matrix updates are skipped. We introduce new limited-memory BFGS variants and test them on nonquadratic minimization problems.},
	keywords = {bfgs, Broyden family, limited-memory, minimization, quasi-Newton, update skipping},
	doi = {10.1137/S1052623496306450},
	url = {http://link.aip.org/link/?SJE/8/1060/1},
	author = {Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P. and Nazareth,Larry}
}
@article {16718,
	title = {The Bible, Truth, and Multilingual OCR Evaluation},
	year = {1998},
	month = {1998/12//},
	institution = {University of Maryland, College Park},
	abstract = {Multilingual OCR has emerged as an important information technology, thanks to the increasing need for cross-language information access. While many research groups and companies have developed OCR algorithms for various languages, it is difficult to compare the performance of these OCR algorithms across languages. This difficulty arises because most evaluation methodologies rely on the use of a document image dataset in each of the languages and it is difficult to find document datasets in different languages that are similar in content and layout. In this paper we propose to use the Bible as a dataset for comparing OCR accuracy across languages. Besides being available in a wide range of languages, Bible translation are closely parallel in content, carefully translated, surprisingly relevant with respect to modern-day language, and quite inexpensive. A project at the University of Maryland is currently implementing this idea. We have created a scanned image dataset with groundtruth from an Arabic Bible. We have also used image degradation models to create synthetically degraded images of a French Bible. We hope to generate similar Bible datasets for other languages, and we are exploring alternative corpora such as the Koran and the Bhagavad Gita that have similar properties. Quantitative OCR evaluation based on the Arabic Bible dataset is currently in progress.},
	keywords = {*BIBLE, *CORPUS, *DATASETS, *GROUNDTRUTH, *OPTICAL CHARACTER RECOGNITION, *TEST SETS, *TRANSLATIONS, accuracy, algorithms, CYBERNETICS, DOCUMENT IMAGES, DOCUMENTS, IMAGES, INFORMATION SCIENCE, LANGUAGE, linguistics, MULTILINGUAL OCR(OPTICAL CHARACTER RECOGNITION), SYMPOSIA, TEST AND EVALUATION},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458666},
	author = {Kanungo,Tapas and Resnik, Philip}
}
@article {13731,
	title = {Bilingual Lexicon Construction Using Large Corpora},
	year = {1998},
	month = {1998/10/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This paper introduces a method for learning bilingual term and sentencelevel alignments for the purpose of building lexicons.  Combining
statistical techniques with linguistic knowledge, a general algorithm
is developed for learning term and sentence alignments from large
bilingual corpora with high accuracy.  This is achieved through the
use of filtered linguistic feedback between term and sentence alignment
processes.  An implementation of this algorithm, TAG-ALIGN, is evaluated
against approaches similar to [Brown et al. 1993] that apply Bayesian
techniques for term alignment, and [Gale and Church 1991] a dynamic
programming method for aligning sentences.  The ultimate goal is to
produce large bilingual lexicons with a high degree of accuracy from
potentially noisy corpora.
(Also cross-referenced as UMIACS-TR-97-50)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/832},
	author = {Shen,Wade and Dorr, Bonnie J}
}
@conference {16188,
	title = {Bringing treasures to the surface: previews and overviews in a prototype for the Library of Congress National Digital Library},
	booktitle = {CHI 98 conference summary on Human factors in computing systems},
	series = {CHI {\textquoteright}98},
	year = {1998},
	month = {1998///},
	pages = {187 - 188},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {Browsing, digital libraries, metadata, multimedia, overviews, previews, World Wide Web},
	isbn = {1-58113-028-7},
	doi = {10.1145/286498.286665},
	url = {http://doi.acm.org/10.1145/286498.286665},
	author = {Plaisant, Catherine and Marchionini,Gary and Komlodi,Anita}
}
@article {17001,
	title = {Browsing Unix Directories With Dynamic Queries: An Evaluation of Three Information Display Techniques},
	journal = {Technical Reports of the Computer Science Department},
	year = {1998},
	month = {1998/10/15/},
	abstract = {We designed, implemented, and evaluated an innovative concept fordynamic queries which involves the direct manipulation of small databases.  
Our domain was directories in a Unix file system.  Dynamic queries 
allow users to formulate queries and explore the databases with 
graphical widgets, such as sliders and buttons, without requiring them 
to have any knowledge about the underlying structure of the database 
query languages, or command language syntax.  Three interfaces for 
presenting directories were developed and tested with eighteen subjects in a 
within-subject design.  The results of the formative evaluation yielded 
some useful guidelines for software designers.
(Also cross-referenced as CAR-TR-605)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/379},
	author = {Liao,Holmes and Osada,Masakazu and Shneiderman, Ben}
}
@article {17005,
	title = {Buttons vs. menus: An exploratory study of pull-down menu selection as compared to button bars},
	journal = {Technical Reports of the Computer Science Department},
	year = {1998},
	month = {1998/10/15/},
	abstract = {Button bars are a relatively new interaction method intended to speedup application use as compared to pull-down menus.  This exploratory study
compares three command selection methods: pull-down menus, button bars,
and user choice of pull-down menus or button bars.  Effectiveness was
measured in two ways: speed of selection and error rate.  15 participants
performed 15 word processor related tasks.  Results show that in
frequently used functions, such as character attribute selection (bold,
italic, u nderline, etc.), button bars are faster.  There were no
statistically significant differences in error rates between the three
interaction methods. 
(Also cross-referenced as CAR-TR-764)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/428},
	author = {Ellis,Jason and Tran,Chi and Ryoo,Jake and Shneiderman, Ben}
}
@conference {17567,
	title = {Better approximation guarantees for job-shop scheduling},
	booktitle = {Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms},
	series = {SODA {\textquoteright}97},
	year = {1997},
	month = {1997///},
	pages = {599 - 608},
	publisher = {Society for Industrial and Applied Mathematics},
	organization = {Society for Industrial and Applied Mathematics},
	address = {Philadelphia, PA, USA},
	isbn = {0-89871-390-0},
	url = {http://dl.acm.org/citation.cfm?id=314161.314395},
	author = {Goldberg,Leslie Ann and Paterson,Mike and Srinivasan, Aravind and Sweedyk,Elizabeth}
}
@article {16986,
	title = {Between hope and fear},
	journal = {Communications of the ACM},
	volume = {40},
	year = {1997},
	month = {1997/02//},
	pages = {59 - 62},
	isbn = {0001-0782},
	doi = {10.1145/253671.253706},
	url = {http://doi.acm.org/10.1145/253671.253706},
	author = {Shneiderman, Ben}
}
@article {16992,
	title = {Book Preview-Designing the User Interface: Strategies for Effective Human-Computer Interaction},
	journal = {Interactions-New York},
	volume = {4},
	year = {1997},
	month = {1997///},
	pages = {61 - 61},
	author = {Shneiderman, Ben}
}
@conference {16195,
	title = {Bringing treasures to the surface: iterative design for the Library of Congress National Digital Library Program},
	booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems},
	series = {CHI {\textquoteright}97},
	year = {1997},
	month = {1997///},
	pages = {518 - 525},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {browse, design process, digital libraries, dynamic query, java, preview, search, web design},
	isbn = {0-89791-802-9},
	doi = {10.1145/258549.259009},
	url = {http://doi.acm.org/10.1145/258549.259009},
	author = {Plaisant, Catherine and Marchionini,Gary and Bruns,Tom and Komlodi,Anita and Campbell,Laura}
}
@article {16194,
	title = {Browsing hierarchical data with multi-level dynamic queries and pruning},
	journal = {International Journal of Human-Computer Studies},
	volume = {46},
	year = {1997},
	month = {1997/01//},
	pages = {103 - 124},
	abstract = {Users often must browse hierarchies with thousands of nodes in search of those that best match their information needs. ThePDQ Tree-browser(Pruning with Dynamic Queries) visualization tool was specified, designed and developed for this purpose. This tool presents trees in two tightly-coupled views, one a detailed view and the other an overview. Users can use dynamic queries, a method for rapidly filtering data, to filter nodes at each level of the tree. The dynamic query panels are user-customizable. Sub-trees of unselected nodes are pruned out, leading to compact views of relevant nodes. Usability testing of the PDQ Tree-browser, done with eight subjects, helped assess strengths and identify possible improvements. The PDQ Tree-browser was used in Network Management (600 nodes) and UniversityFinder (1100 nodes) applications. A controlled experiment, with 24 subjects, showed that pruning significantly improved performance speed and subjective user satisfaction. Future research directions are suggested.},
	isbn = {1071-5819},
	doi = {10.1006/ijhc.1996.0085},
	url = {http://www.sciencedirect.com/science/article/pii/S1071581996900853},
	author = {Kumar,Harsha P. and Plaisant, Catherine and Shneiderman, Ben}
}
@book {16719,
	title = {The Balancing Act: Combining Symbolic and Statistical Approaches to Language},
	year = {1996},
	month = {1996/12/06/},
	publisher = {MIT Press},
	organization = {MIT Press},
	abstract = {Symbolic and statistical approaches to language have historically been at odds{\textemdash}the former viewed as difficult to test and therefore perhaps impossible to define, and the latter as descriptive but possibly inadequate. At the heart of the debate are fundamental questions concerning the nature of language, the role of data in building a model or theory, and the impact of the competence-performance distinction on the field of computational linguistics. Currently, there is an increasing realization in both camps that the two approaches have something to offer in achieving common goals.The eight contributions in this book explore the inevitable "balancing act" that must take place when symbolic and statistical approaches are brought together{\textemdash}including basic choices about what knowledge will be represented symbolically and how it will be obtained, what assumptions underlie the statistical model, what principles motivate the symbolic model, and what the researcher gains by combining approaches.The topics covered include an examination of the relationship between traditional linguistics and statistical methods, qualitative and quantitative methods of speech translation, study and implementation of combined techniques for automatic extraction of terminology, comparative analysis of the contributions of linguistic cues to a statistical word grouping system, automatic construction of a symbolic parser via statistical techniques, combining linguistic with statistical methods in automatic speech understanding, exploring the nature of transformation-based learning, and a hybrid symbolic/statistical approach to recovering from parser failures.},
	keywords = {computational linguistics, Computational linguistics - Congresses, Computational linguistics/ Congresses, Computers / Intelligence (AI) \& Semantics, Foreign Language Study / General, Language Arts \& Disciplines / Linguistics / General, linguistics, Linguistics - Statistical methods - Congresses, Linguistics/ Statistical methods/ Congresses, Social Science / General},
	isbn = {9780262611220},
	author = {Klavans,Judith L. and Resnik, Philip}
}
@book {15378,
	title = {Basic Electric Circuit Theory: A One-Semester Text},
	year = {1996},
	month = {1996///},
	publisher = {Academic Press},
	organization = {Academic Press},
	abstract = {This is the only book on the market that has been conceived and deliberately written as a one-semester text on basic electric circuit theory. As such, this book employs a novel approach to the exposition of the material in which phasors and ac steady-state analysis are introduced at the beginning. This allows one to use phasors in the discussion of transients excited by ac sources, which makes the presentation of transients more comprehensive and meaningful. Furthermore, the machinery of phasors paves the road to the introduction of transfer functions, which are then used in the analysis of transients and the discussion of Bode plots and filters. Another salient feature of the text is the consolidation into one chapter of the material concerned with dependent sources and operational amplifiers. Dependent sources are introduced as linear models for transistors on the basis of small signal analysis. In the text, PSpice simulations are prominently featured to reinforce the basic material and understanding of circuit analysis.Key Features* Designed as a comprehensive one-semester text in basic circuit theory* Features early introduction of phasors and ac steady-state analysis* Covers the application of phasors and ac steady-state analysis* Consolidates the material on dependent sources and operational amplifiers* Places emphasis on connections between circuit theory and other areas in electrical engineering* Includes PSpice tutorials and examples* Introduces the design of active filters* Includes problems at the end of every chapter* Priced well below similar books designed for year-long courses},
	keywords = {Electric circuits, Technology \& Engineering / Electrical},
	isbn = {9780124808652},
	author = {Mayergoyz, Issak D and Lawson,Wes}
}
@article {15038,
	title = {The block distributed memory model},
	journal = {Parallel and Distributed Systems, IEEE Transactions on},
	volume = {7},
	year = {1996},
	month = {1996/08//},
	pages = {830 - 840},
	abstract = {We introduce a computation model for developing and analyzing parallel algorithms on distributed memory machines. The model allows the design of algorithms using a single address space and does not assume any particular interconnection topology. We capture performance by incorporating a cost measure for interprocessor communication induced by remote memory accesses. The cost measure includes parameters reflecting memory latency, communication bandwidth, and spatial locality. Our model allows the initial placement of the input data and pipelined prefetching. We use our model to develop parallel algorithms for various data rearrangement problems, load balancing, sorting, FFT, and matrix multiplication. We show that most of these algorithms achieve optimal or near optimal communication complexity while simultaneously guaranteeing an optimal speed-up in computational complexity. Ongoing experimental work in testing and evaluating these algorithms has thus far shown very promising results},
	keywords = {accesses;single, address, algorithms;performance, algorithms;performance;remote, allocation;sorting;, balancing;matrix, bandwidth;communication, communication;load, complexity;computation, complexity;computational, complexity;cost, complexity;distributed, distributed, evaluation;resource, FFT;block, Fourier, latency;parallel, locality;communication, machines;interconnection, measure;data, memory, model;communication, model;computational, multiplication;memory, multiplication;parallel, problems;distributed, rearrangement, space;sorting;spatial, systems;fast, topology;interprocessor, transforms;matrix},
	isbn = {1045-9219},
	doi = {10.1109/71.532114},
	author = {JaJa, Joseph F. and Ryu,Kwan Woo}
}
@article {15697,
	title = {A Block-GTH Algorithm for Finding the Stationary Vector of a Markov Chain},
	journal = {SIAM Journal on Matrix Applications},
	volume = {17},
	year = {1996},
	month = {1996///},
	pages = {470 - 488},
	url = {http://epubs.siam.org/sam-bin/dbq/article/26253http://epubs.siam.org/sam-bin/dbq/article/26253},
	author = {O{\textquoteright}Leary, Dianne P. and Wu,Yuan-Jye Jason}
}
@article {15217,
	title = {Balancing minimum spanning trees and shortest-path trees},
	journal = {Algorithmica},
	volume = {14},
	year = {1995},
	month = {1995///},
	pages = {305 - 321},
	abstract = {We give a simple algorithm to find a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous tradeoff: given the two trees and agamma>0, the algorithm returns a spanning tree in which the distance between any vertex and the root of the shortest-path tree is at most 1+radic2gamma times the shortest-path distance, and yet the total weight of the tree is at most 1+radic2/gamma times the weight of a minimum spanning tree. Our algorithm runs in linear time and obtains the best-possible tradeoff. It can be implemented on a CREW PRAM to run a logarithmic time using one processor per vertex.},
	doi = {10.1007/BF01294129},
	author = {Khuller, Samir and Raghavachari,B. and Young,N.}
}
@article {15539,
	title = {Bottom-up computation of perfect models for disjunctive theories},
	journal = {The Journal of logic programming},
	volume = {25},
	year = {1995},
	month = {1995///},
	pages = {33 - 51},
	author = {Fern{\'a}ndez,J. A. and Minker, Jack}
}
@article {13733,
	title = {Building a LCS-Based Lexicon in TAGs},
	journal = {Proceedings of the AAAI-95 Spring Symposium Series, Representation and Acquisition of Lexical Knowledge: Polysemy, Ambiguity, and Generativity, Stanford, CA, March},
	year = {1995},
	month = {1995///},
	pages = {27 - 29},
	author = {Dorr, Bonnie J and Palmer,M.}
}
@conference {16987,
	title = {Beyond accuracy, reliability, and efficiency: criteria for a good computer system},
	booktitle = {Conference companion on Human factors in computing systems},
	series = {CHI {\textquoteright}94},
	year = {1994},
	month = {1994///},
	pages = {195 - 198},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {0-89791-651-4},
	doi = {10.1145/259963.260253},
	url = {http://doi.acm.org/10.1145/259963.260253},
	author = {Friedman,Batya and Levenson,Nancy and Shneiderman, Ben and Suchman,Lucy and Winograd,Terry}
}
@article {15213,
	title = {Biconnectivity approximations and graph carvings},
	journal = {Journal of the ACM (JACM)},
	volume = {41},
	year = {1994},
	month = {1994/03//},
	pages = {214 - 235},
	abstract = {A spanning tree in a graph is the smallest connected spanning subgraph. Given a graph, how does one find the smallest (i.e., least number of edges) 2-connected spanning subgraph (connectivity refers to both edge and vertex connectivity, if not specified)? Unfortunately, the problem is known to be NP-hard.We consider the problem of finding a better approximation to the smallest 2-connected subgraph, by an efficient algorithm. For 2-edge connectivity, our algorithm guarantees a solution that is no more than 3/2 times the optimal. For 2-vertex connectivity, our algorithm guarantees a solution that is no more than 5/3 times the optimal. The previous best approximation factor is 2 for each of these problems. The new algorithms (and their analyses) depend upon a structure called a carving of a graph, which is of independent interest. We show that approximating the optimal solution to within an additive constant is NP-hard as well.
We also consider the case where the graph has edge weights. For this case, we show that an approximation factor of 2 is possible in polynomial time for finding a k-edge connected spanning subgraph. This improves an approximation factor of 3 for k = 2, due to Frederickson and Ja{\textasciiacute}Ja{\textasciiacute} [1981], and extends it for any k (with an increased running time though).
},
	keywords = {biconnectivity, connectivity, sparse subgraphs},
	isbn = {0004-5411},
	doi = {10.1145/174652.174654},
	url = {http://doi.acm.org/10.1145/174652.174654},
	author = {Khuller, Samir and Vishkin, Uzi}
}
@conference {15039,
	title = {The block distributed memory model for shared memory multiprocessors},
	booktitle = {Parallel Processing Symposium, 1994. Proceedings., Eighth International},
	year = {1994},
	month = {1994/04//},
	pages = {752 - 756},
	abstract = {Introduces a computation model for developing and analyzing parallel algorithms on distributed memory machines. The model allows the design of algorithms using a single address space and does not assume any particular interconnection topology. We capture performance by incorporating a cost measure for interprocessor communication induced by remote memory accesses. The cost measure includes parameters reflecting memory latency, communication bandwidth, and spatial locality. Our model allows the initial placement of the input data and pipelined prefetching. We use our model to develop parallel algorithms for various data rearrangement problems, load balancing, sorting, FFT, and matrix multiplication. We show that most of these algorithms achieve optimal or near optimal communication complexity while simultaneously guaranteeing an optimal speed-up in computational complexity},
	keywords = {accesses;shared, address, algebra;parallel, algorithms;performance, algorithms;performance;pipelined, allocation;shared, balancing;matrix, bandwidth;computation, block, Communication, communication;load, complexity;computational, complexity;cost, complexity;distributed, complexity;optimal, data, distributed, evaluation;resource, Fourier, latency;optimal, locality;communication, measure;data, memory, model;communication, model;computational, multiplication;memory, multiprocessors;single, placement;interprocessor, prefetching;remote, problems;fast, rearrangement, space;sorting;spatial, speedup;parallel, systems;fast, systems;sorting;, transforms;input, transforms;matrix},
	doi = {10.1109/IPPS.1994.288220},
	author = {JaJa, Joseph F. and Ryu,Kwan Woo}
}
@article {18821,
	title = {Building MRSEV models for CAM applications},
	journal = {Advances in Engineering Software},
	volume = {20},
	year = {1994},
	month = {1994///},
	pages = {121 - 139},
	abstract = {In integrating CAD and CAM applications, one major problem is how to interpret CAD information in a manner that makes sense for CAM. The goal is to develop a general approach that can be used with a variety of CAD and CAM applications for the manufacture of machined parts.In particular, a methodology is presented for taking a CAD model, extracting alternative interpretations of the model as collections of MRSEVs (material removal shape element volumes, a STEP-based library of machining features), and evaluating these interpretations to determine which one is optimal. The evaluation criteria may be defined by the user, in order to select the best interpretation for the particular application at hand.
},
	keywords = {CAD/CAM integration, design critiquing, feature recognition},
	isbn = {0965-9978},
	doi = {10.1016/0965-9978(94)90054-X},
	url = {http://www.sciencedirect.com/science/article/pii/096599789490054X},
	author = {Gupta, Satyandra K. and Kramer,Thomas R. and Nau, Dana S. and Regli,William C. and Zhang,Guangming}
}
@article {16988,
	title = {Beyond intelligent machines: just do it},
	journal = {IEEE Software},
	volume = {10},
	year = {1993},
	month = {1993/01//},
	pages = {100 - 103},
	abstract = {The author argues that users want a sense of direct and immediate control over computers that differs from how they interact with people. He presents several examples of these predictable and controllable interfaces developed in the lab. The examples include tree maps and dynamic queries.<>},
	keywords = {Artificial intelligence, Computer aided instruction, Computer errors, controllable interfaces, Displays, dynamic queries, Educational institutions, History, HUMANS, intelligent machines, learning systems, Machine intelligence, predictable interfaces, Speech recognition, tree maps, User interfaces},
	isbn = {0740-7459},
	doi = {10.1109/52.207235},
	author = {Shneiderman, Ben}
}
@conference {16989,
	title = {Beyond the graphical user interface (abstract)},
	booktitle = {Proceedings of the 1993 ACM conference on Computer science},
	series = {CSC {\textquoteright}93},
	year = {1993},
	month = {1993///},
	pages = {510{\textendash} - 510{\textendash}},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The wildly popular graphical user interfaces are a dramatic improvement over earlier interaction styles, but the next generation of user interfaces is already being fashioned. The future will be dynamic, spatial, gestural, colorful, ubiquitous, often auditory, and sometimes virtual. The dominance of visual information with hi-res images and full-motion video will push the hardware requirements, absorb network capacity, and challenge the algorithm designers. As human-computer interaction researchers accumulate experimental data and theory matures, novel input devices, information visualization displays, and interaction strategies will emerge.},
	isbn = {0-89791-558-5},
	doi = {10.1145/170791.171139},
	url = {http://doi.acm.org/10.1145/170791.171139},
	author = {Shneiderman, Ben}
}
@article {17978,
	title = {Bounding the number of neighbors in protein molecules},
	volume = {UNC-CS-TR-93-039},
	year = {1993},
	month = {1993///},
	institution = {Department of Computer Science, University of North Carolina at Chapel Hill},
	author = {Varshney, Amitabh and Wright,W. V and Brooks Jr,F. P}
}
@conference {17000,
	title = {Browsing Unix directories with dynamic queries: An analytical and experimental evaluation},
	booktitle = {Proc. Ninth Japanese Symp. Human Interface},
	year = {1993},
	month = {1993///},
	pages = {95 - 98},
	abstract = {We designed, implemented, and evaluated an innovative concept for dynamic queries which involves the direct manipulation of small databases. Our domain was directories in a Unix file system. Dynamic queries allow users to formulate queries and explore the databases with graphical widgets, such as sliders and buttons, without requiring them to have any knowledge about the underlying structure of the database query languages, or command language syntax. Three interfaces for presenting directories were developed and tested with eighteen subjects in a within-subject design. The results of the formative evaluation yielded some useful guidelines for software designers.},
	author = {Liao,H. and Osada,M. and Shneiderman, Ben}
}
@article {17003,
	title = {Building HCI partnerships and infrastructure},
	journal = {Behaviour \& Information Technology},
	volume = {12},
	year = {1993},
	month = {1993///},
	pages = {130 - 135},
	abstract = {As policymakers and technology planners respond to the growing activity in human?computer interaction, a broad perspective may be helpful. This article offers a top-down view of current activities and suggests opportunities and challenges for the continued growth of HCI. Partnerships among universities, corporations, government agencies, and professional societies are proposed. Infrastructure needs to support this new discipline are outlined.Abstract As policymakers and technology planners respond to the growing activity in human?computer interaction, a broad perspective may be helpful. This article offers a top-down view of current activities and suggests opportunities and challenges for the continued growth of HCI. Partnerships among universities, corporations, government agencies, and professional societies are proposed. Infrastructure needs to support this new discipline are outlined.
},
	isbn = {0144-929X},
	doi = {10.1080/01449299308924373},
	url = {http://www.tandfonline.com/doi/abs/10.1080/01449299308924373},
	author = {Shneiderman, Ben and LEWIS,CLAYTON}
}
@article {17004,
	title = {Building Partnerships and Infrastructure},
	journal = {Communications of the ACM},
	volume = {32},
	year = {1993},
	month = {1993///},
	pages = {9 - 23},
	abstract = {As policymakers and technology planners respond to the growingactivity in human-computer interaction, a broad perspective may
be helpful. This article offers a top-down view of current
activities and suggests opportunities and challenges for the
continued growth of HCI. Partnerships among universities,
corporations, government agencies, and professional societies
are proposed. Infrastructure needs to support this new discipline
are outlined.
},
	author = {Shneiderman, Ben and Lewis,C.}
}
@article {14199,
	title = {Behavioral Visual Motion Analysis,"},
	journal = {Proceedings, DARPA Image Understanding Workshop},
	year = {1992},
	month = {1992///},
	pages = {521 - 541},
	author = {Aloimonos, J. and Duri{\c c},Z. and Ferm{\"u}ller, Cornelia and Huang, L. and Rivlin,E. and Sharma, R.}
}
@conference {18070,
	title = {Biconnectivity Approximations and Graph Carvings},
	booktitle = {Proceedings of the Twenty-fourth Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada, May 4-6, 1992},
	year = {1992},
	month = {1992///},
	pages = {759 - 759},
	author = {Vishkin, Uzi}
}
@article {13734,
	title = {Building a lexicon for machine translation: use of corpora for aspectual classification of verbs},
	year = {1992},
	month = {1992///},
	institution = {University of Maryland at College Park},
	address = {College Park, MD, USA},
	author = {Dorr, Bonnie J and Lee,Ki}
}
@article {15776,
	title = {On bounds for scaled projections and pseudoinverses},
	journal = {Linear Algebra and its Applications},
	volume = {132},
	year = {1990},
	month = {1990/04/15/},
	pages = {115 - 117},
	abstract = {Let X be a matrix of full column rank, and let D be a positive definite diagonal matrix. In a recent paper, Stewart considered the weighted pseudoinverse X{\textdagger}D = (XTDX)-1XTD and the associated oblique projection PD = XX{\textdagger}D, and gave bounds, independent of D, for the norms of these matrices. In this note, we answer a question he raised by showing that the bounds are computable.},
	isbn = {0024-3795},
	doi = {10.1016/0024-3795(90)90056-I},
	url = {http://www.sciencedirect.com/science/article/pii/002437959090056I},
	author = {O{\textquoteright}Leary, Dianne P.}
}
@article {14118,
	title = {Block-Preconditioned Conjugate-Gradient-Like Methods for Numerical Reservoir Simulation},
	journal = {SPE Reservoir EngineeringSPERE},
	volume = {3},
	year = {1988},
	month = {1988/02//},
	isbn = {0885-9248},
	doi = {10.2118/13534-PA},
	url = {http://www.onepetro.org/mslib/servlet/onepetropreview?id=00013534\&soc=SPE},
	author = {Eisenstat, Stanley and Elman, Howard and Schlutz, Martin}
}
@article {17268,
	title = {Is Bigger Better?: The Effects of Display Size on Program Reading},
	journal = {Tech Report HCIL-86-08},
	year = {1986},
	month = {1986///},
	abstract = {An experiment was conducted in which four window sizes (10, 22, 60 and 120 lines) were compared for their effectiveness for program reading. The largest window, in which the entire program could be seen at one time, was found significantly better, in both time to complete the reading task and the number of correct answers in the reading task. Subjects also preferred the larger windows to the smaller windows.},
	author = {Reisel,J.F. and Shneiderman, Ben}
}
@conference {16635,
	title = {Bayesian classification in medicine: The transferability question},
	booktitle = {Proceedings of the Fifth Annual Symposium on Computer Applications in Medical Care},
	year = {1981},
	month = {1981///},
	pages = {250 - 252},
	author = {Zagoria,R. and Reggia, James A. and Price,T. and Banko,M.}
}
@article {15696,
	title = {A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems},
	journal = {SIAM Journal on Scientific and Statistical Computing},
	volume = {2},
	year = {1981},
	month = {1981///},
	pages = {474 - 489},
	abstract = {In this paper, we consider ill-posed problems which discretize to linear least squares problems with matrices $K$ of high dimensions. The algorithm proposed uses $K$ only as an operator and does not need to explicitly store or modify it. A method related to one of Lanczos is used to project the problem onto a subspace for which $K$ is bidiagonal. It is then an easy matter to solve the projected problem by standard regularization techniques. These ideas are illustrated with some integral equations of the first kind with convolution kernels, and sample numerical results are given.},
	keywords = {first kind integral equation, ill-posed problems, Lanczos algorithm, regularization},
	doi = {10.1137/0902037},
	url = {http://link.aip.org/link/?SCE/2/474/1},
	author = {O{\textquoteright}Leary, Dianne P. and Simmons,John A.}
}
@article {15816,
	title = {The block conjugate gradient algorithm and related methods},
	journal = {Linear Algebra and its Applications},
	volume = {29},
	year = {1980},
	month = {1980/02//},
	pages = {293 - 322},
	abstract = {The development of the Lanczos algorithm for finding eigenvalues of large sparse symmetric matrices was followed by that of block forms of the algorithm. In this paper, similar extensions are carried out for a relative of the Lanczos method, the conjugate gradient algorithm. The resulting block algorithms are useful for simultaneously solving multiple linear systems or for solving a single linear system in which the matrix has several separated eigenvalues or is not easily accessed on a computer. We develop a block biconjugate gradient algorithm for general matrices, and develop block conjugate gradient, minimum residual, and minimum error algorithms for symmetric semidefinite matrices. Bounds on the rate of convergence of the block conjugate gradient algorithm are presented, and issues related to computational implementation are discussed. Variants of the block conjugate gradient algorithm applicable to symmetric indefinite matrices are also developed.},
	isbn = {0024-3795},
	doi = {10.1016/0024-3795(80)90247-5},
	url = {http://www.sciencedirect.com/science/article/pii/0024379580902475},
	author = {O{\textquoteright}Leary, Dianne P.}
}
@article {16984,
	title = {Batched searching of sequential and tree structured files},
	journal = {ACM Trans. Database Syst.},
	volume = {1},
	year = {1976},
	month = {1976/09//},
	pages = {268 - 275},
	abstract = {The technique of batching searches has been ignored in the context of disk based online data retrieval systems. This paper suggests that batching be reconsidered for such systems since the potential reduction in processor demand may actually reduce response time. An analysis with sample numerical results and algorithms is presented.},
	keywords = {<italic>B</italic>-trees, batched searching, Data structures, Database systems, file management, Indexes, informational retrieval, sequential files, tree structures},
	isbn = {0362-5915},
	doi = {10.1145/320473.320487},
	url = {http://doi.acm.org/10.1145/320473.320487},
	author = {Shneiderman, Ben}
}
