@article {20377,
	title = {A water marker monitored by satellites to predict seasonal endemic cholera},
	journal = {Remote Sensing Letters},
	volume = {4472741982394456},
	year = {2013},
	month = {Jan-08-2013},
	pages = {822 - 831},
	abstract = {The ability to predict an occurrence of cholera, a water-related disease, offers a significant public health advantage. Satellite-based estimates of chlorophyll, a surrogate for plankton abundance, have been linked to cholera incidence. However, cholera bacteria can survive under a variety of coastal ecological conditions, thus constraining the predictive ability of the chlorophyll, since it provides only an estimate of greenness of seawater. Here, a new remote-sensing-based index is proposed: Satellite Water Marker (SWM), which estimates the condition of coastal water, based on observed variability in the difference between blue (412 nm) and green (555 nm) wavelengths that can be related to seasonal cholera incidence. The index is bounded between physically separable wavelengths for relatively clear (blue) and turbid (green) water. Using SWM, prediction of cholera with reasonable accuracy, at least two months in advance, can potentially be achieved in the endemic coastal regions.

   
 
},
	issn = {2150-704X},
	doi = {10.1080/2150704X.2013.802097},
	url = {http://www.tandfonline.com/doi/abs/10.1080/2150704X.2013.802097},
	author = {Jutla, Antarpreet and Akanda, Ali Shafqat and Huq, Anwar and Faruque, Abu Syed Golam and Rita R Colwell and Islam, Shafiqul}
}
@inbook {19646,
	title = {Why {\textquotedblleft}Fiat-Shamir for Proofs{\textquotedblright} Lacks a Proof},
	booktitle = {Theory of Cryptography},
	series = {Lecture Notes in Computer Science},
	year = {2013},
	month = {2013/01/01/},
	pages = {182 - 201},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {The Fiat-Shamir heuristic [CRYPTO {\textquoteright}86] is used to convert any 3-message public-coin proof or argument system into a non-interactive argument, by hashing the prover{\textquoteright}s first message to select the verifier{\textquoteright}s challenge. It is known that this heuristic is sound when the hash function is modeled as a random oracle. On the other hand, the surprising result of Goldwasser and Kalai [FOCS {\textquoteright}03] shows that there exists a computationally sound argument on which the Fiat-Shamir heuristic is never sound, when instantiated with any actual efficient hash function. This leaves us with the following interesting possibility: perhaps we can securely instantiates the Fiat-Shamir heuristic for all 3-message public-coin statistically sound proofs, even if we must fail for some computationally sound arguments. Indeed, this has been conjectured to be the case by Barak, Lindell and Vadhan [FOCS {\textquoteright}03], but we do not have any provably secure instantiation under any {\textquotedblleft}standard assumption{\textquotedblright}. In this work, we give a broad black-box separation result showing that the security of the Fiat-Shamir heuristic for statistically sound proofs cannot be proved under virtually any standard assumption via a black-box reduction. More precisely: {\textendash}If we want to have a {\textquotedblleft}universal{\textquotedblright} instantiation of the Fiat-Shamir heuristic that works for all 3-message public-coin proofs, then we cannot prove its security via a black-box reduction from any assumption that has the format of a {\textquotedblleft}cryptographic game{\textquotedblright}. {\textendash}For many concrete proof systems, if we want to have a {\textquotedblleft}specific{\textquotedblright} instantiation of the Fiat-Shamir heuristic for that proof system, then we cannot prove its security via a black box reduction from any {\textquotedblleft}falsifiable assumption{\textquotedblright} that has the format of a cryptographic game with an efficient challenger.},
	keywords = {Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Data Encryption, Systems and Data Security},
	isbn = {978-3-642-36593-5, 978-3-642-36594-2},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-36594-2_11},
	author = {Bitansky, Nir and Dana Dachman-Soled and Garg, Sanjam and Jain, Abhishek and Kalai, Yael Tauman and L{\'o}pez-Alt, Adriana and Wichs, Daniel},
	editor = {Sahai, Amit}
}
@article {19127,
	title = {We are what we eat: how the diet of infants affects their gut microbiome},
	journal = {Genome Biology},
	volume = {13},
	year = {2012},
	month = {2012},
	abstract = {Simultaneous analysis of the gut microbiome and host gene expression in infants reveals the impact of diet (breastfeeding versus formula) on host-microbiome interactions.},
	author = {Pop, Mihai}
}
@article {18452,
	title = {What have we learned about software engineering?},
	journal = {Communications of the ACM},
	volume = {55},
	year = {2012},
	month = {2012/02//},
	pages = {38 - 39},
	abstract = {Upon closer examination, everything old appears to be new again in the realm of software engineering.},
	isbn = {0001-0782},
	doi = {10.1145/2076450.2076463},
	url = {http://doi.acm.org/10.1145/2076450.2076463},
	author = {Zelkowitz, Marvin V}
}
@conference {19169,
	title = {When Does Simulated Data Match Real Data? Comparing Model Calibration Functions using Genetic Algorithms},
	booktitle = {World Congress on Social Simulation (WCSS), Taipei, Taiwan},
	year = {2012},
	abstract = {Agent-based models can be manipulated to replicate real- world datasets, but choosing the best set of parameters to achieve this result can be difficult. To validate a model, the real-world dataset is often divided into a training and test set. The training set is used to calibrate the parameters and the test set is used to determine if the calibrated model represents the real-world data. The difference between the real-world data and the simulated data is determined using an error measure. When using an evolutionary computation technique to choose the parameters, this error measure becomes the fitness function, and choosing the appropriate measure becomes even more crucial for a successful calibration process. We survey the effect of five different error measures in the context of a toy problem and a real world problem (simulating on-line news consumption). We use each error measure in turn to calibrate on the training dataset, and then examine the results of all five error measures on both the training and testing datasets. For the toy problem, one measure was the Pareto-dominant choice for calibration, but no error measure dominated all the others for the real-world problem. },
	author = {Stonedahl,Forrest and Rand, William}
}
@article {15117,
	title = {Which Languages Have 4-Round Zero-Knowledge Proofs?},
	journal = {Journal of cryptology},
	volume = {25},
	year = {2012},
	month = {2012///},
	pages = {41 - 56},
	abstract = {We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then . Assuming the polynomial hierarchy does not collapse, this means in particular that NP-complete languages do not have 4-round zero-knowledge proofs with black-box simulation.},
	doi = {10.1007/s00145-010-9081-y},
	author = {Katz, Jonathan}
}
@article {19717,
	title = {Whole genome analysis of Leptospira licerasiae provides insight into leptospiral evolution and pathogenicity.},
	journal = {PLoS Negl Trop Dis},
	volume = {6},
	year = {2012},
	month = {2012},
	pages = {e1853},
	abstract = {<p>The whole genome analysis of two strains of the first intermediately pathogenic leptospiral species to be sequenced (Leptospira licerasiae strains VAR010 and MMD0835) provides insight into their pathogenic potential and deepens our understanding of leptospiral evolution. Comparative analysis of eight leptospiral genomes shows the existence of a core leptospiral genome comprising 1547 genes and 452 conserved genes restricted to infectious species (including L. licerasiae) that are likely to be pathogenicity-related. Comparisons of the functional content of the genomes suggests that L. licerasiae retains several proteins related to nitrogen, amino acid and carbohydrate metabolism which might help to explain why these Leptospira grow well in artificial media compared with pathogenic species. L. licerasiae strains VAR010(T) and MMD0835 possess two prophage elements. While one element is circular and shares homology with LE1 of L. biflexa, the second is cryptic and homologous to a previously identified but unnamed region in L. interrogans serovars Copenhageni and Lai. We also report a unique O-antigen locus in L. licerasiae comprised of a 6-gene cluster that is unexpectedly short compared with L. interrogans in which analogous regions may include >90 such genes. Sequence homology searches suggest that these genes were acquired by lateral gene transfer (LGT). Furthermore, seven putative genomic islands ranging in size from 5 to 36 kb are present also suggestive of antecedent LGT. How Leptospira become naturally competent remains to be determined, but considering the phylogenetic origins of the genes comprising the O-antigen cluster and other putative laterally transferred genes, L. licerasiae must be able to exchange genetic material with non-invasive environmental bacteria. The data presented here demonstrate that L. licerasiae is genetically more closely related to pathogenic than to saprophytic Leptospira and provide insight into the genomic bases for its infectiousness and its unique antigenic characteristics.</p>},
	keywords = {DNA, Bacterial, Evolution, Molecular, Gene Transfer, Horizontal, Genome, Bacterial, Genomic islands, HUMANS, Leptospira, Molecular Sequence Data, Multigene Family, Prophages, Sequence Analysis, DNA, Virulence factors},
	issn = {1935-2735},
	doi = {10.1371/journal.pntd.0001853},
	author = {Ricaldi, Jessica N and Fouts, Derrick E and Jeremy D Selengut and Harkins, Derek M and Patra, Kailash P and Moreno, Angelo and Lehmann, Jason S and Purushe, Janaki and Sanka, Ravi and Torres, Michael and Webster, Nicholas J and Vinetz, Joseph M and Matthias, Michael A}
}
@article {12862,
	title = {Warming Oceans, Phytoplankton, and River Discharge: Implications for Cholera Outbreaks},
	journal = {The American Journal of Tropical Medicine and Hygiene},
	volume = {85},
	year = {2011},
	month = {08/2011},
	pages = {303 - 308},
	abstract = {Phytoplankton abundance is inversely related to sea surface temperature (SST). However, a positive relationship is observed between SST and phytoplankton abundance in coastal waters of Bay of Bengal. This has led to an assertion that in a warming climate, rise in SST may increase phytoplankton blooms and, therefore, cholera outbreaks. Here, we explain why a positive SST-phytoplankton relationship exists in the Bay of Bengal and the implications of such a relationship on cholera dynamics. We found clear evidence of two independent physical drivers for phytoplankton abundance. The first one is the widely accepted phytoplankton blooming produced by the upwelling of cold, nutrient-rich deep ocean waters. The second, which explains the Bay of Bengal findings, is coastal phytoplankton blooming during high river discharges with terrestrial nutrients. Causal mechanisms should be understood when associating SST with phytoplankton and subsequent cholera outbreaks in regions where freshwater discharge are a predominant mechanism for phytoplankton production.},
	isbn = {0002-9637,},
	doi = {10.4269/ajtmh.2011.11-0181},
	url = {http://www.ajtmh.org/content/85/2/303},
	author = {Jutla,Antarpreet S. and Akanda,Ali S. and Griffiths,Jeffrey K. and Rita R Colwell and Islam,Shafiqul}
}
@conference {16417,
	title = {When does simulated data match real data?},
	booktitle = {Proceedings of the 13th annual conference companion on Genetic and evolutionary computation},
	series = {GECCO {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {231 - 232},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Agent-based models can replicate real-world patterns, but finding parameters that achieve the best match can be difficult. To validate a model, a real-world dataset is often divided into a training set (to calibrate the parameters) and a test set (to validate the calibrated model). The difference between the training and test data and the simulated data is determined using an error measure. In the context of evolutionary computation techniques, the error measure also serves as a fitness function, and thus affects evolutionary search dynamics. We survey the effect of five different error measures on both a toy problem and a real world problem of matching a model to empirical online news consumption behavior. We use each error measure separately for calibration on the training dataset, and then examine the results of all five error measures on both the training and testing datasets. We show that certain error measures sometimes serve as better fitness functions than others, and in fact using one error measure may result in better calibration (on a different measure) than using the different measure directly. For the toy problem, the Pearson{\textquoteright}s correlation measure dominated all other measures, but no single error measure was Pareto dominant for the real world problem.},
	keywords = {Agent-based modeling, business, Calibration, Genetic algorithms, information search, network analysis},
	isbn = {978-1-4503-0690-4},
	doi = {10.1145/2001858.2001988},
	url = {http://doi.acm.org/10.1145/2001858.2001988},
	author = {Stonedahl,Forrest and Anderson,David and Rand, William}
}
@conference {19464,
	title = {Why is My Internet Slow?: Making Network Speeds Visible},
	booktitle = {SIGCHI {\textquoteright}11},
	series = {CHI {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {1889 - 1898},
	publisher = {ACM},
	organization = {ACM},
	abstract = {With widespread broadband adoption, more households report experiencing sub-optimal speeds. Not only are slow speeds frustrating, they may indicate consumers are not receiving the services they are paying for from their internet service providers. Yet, determining the speed and source of slow-downs is difficult because few tools exist for broadband management. We report on results of a field trial with 10 households using a visual network probe designed to address these problems. We describe the results of the study and provide design implications for future tools. More importantly, we argue that tools like this can educate and empower consumers by making broadband speeds and sources of slow-downs more visible.},
	keywords = {broadband speed, broadband tools, home networks},
	isbn = {978-1-4503-0228-9},
	url = {http://doi.acm.org/10.1145/1978942.1979217},
	author = {Marshini Chetty and Haslem, David and Baird, Andrew and Ofoha, Ugochi and Sumner, Bethany and Grinter, Rebecca}
}
@conference {18614,
	title = {Wide-area routing dynamics of malicious networks},
	booktitle = {Proceedings of the ACM SIGCOMM 2011 conference},
	series = {SIGCOMM {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {432 - 433},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper studies the routing dynamics of malicious networks. We characterize the routing behavior of malicious networks on both short and long timescales. We find that malicious networks more consistently advertise prefixes with short durations and long inter- arrival times; over longer timescales, we find that malicious ASes connect with more upstream providers than legitimate ASes, and they also change upstream providers more frequently.},
	keywords = {BGP, Security, spam},
	isbn = {978-1-4503-0797-0},
	doi = {10.1145/2018436.2018505},
	url = {http://doi.acm.org/10.1145/2018436.2018505},
	author = {Konte,Maria and Feamster, Nick}
}
@conference {14831,
	title = {Wide-baseline stereo for face recognition with large pose variation},
	booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on},
	year = {2011},
	month = {2011/06//},
	pages = {537 - 544},
	abstract = {2-D face recognition in the presence of large pose variations presents a significant challenge. When comparing a frontal image of a face to a near profile image, one must cope with large occlusions, non-linear correspondences, and significant changes in appearance due to viewpoint. Stereo matching has been used to handle these problems, but performance of this approach degrades with large pose changes. We show that some of this difficulty is due to the effect that foreshortening of slanted surfaces has on window-based matching methods, which are needed to provide robustness to lighting change. We address this problem by designing a new, dynamic programming stereo algorithm that accounts for surface slant. We show that on the CMU PIE dataset this method results in significant improvements in recognition performance.},
	keywords = {2D, algorithm;frontal, dataset;dynamic, estimation;stereo, Face, image, image;near, image;pose, MATCHING, matching;pose, matching;surface, method;dynamic, performance;stereo, PIE, processing;, profile, Programming, programming;face, recognition;CMU, recognition;image, slant;wide-baseline, stereo, stereo;window-based, variation;recognition},
	doi = {10.1109/CVPR.2011.5995559},
	author = {Castillo,C. D and Jacobs, David W.}
}
@article {15832,
	title = {Windowed Spectral Regularization of Inverse Problems},
	journal = {SIAM Journal on Scientific Computing},
	volume = {33},
	year = {2011},
	month = {2011///},
	doi = {DOI: 10.1137/100809787},
	author = {Chung,Julianne M. and Easley,Glenn R and O{\textquoteright}Leary, Dianne P.}
}
@conference {14351,
	title = {WATTR: a method for self-powered wireless sensing of water activity in the home},
	booktitle = {Proceedings of the 12th ACM international conference on Ubiquitous computing},
	series = {Ubicomp {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {169 - 172},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {power harvesting, sensing, water conservation},
	isbn = {978-1-60558-843-8},
	doi = {10.1145/1864349.1864378},
	url = {http://doi.acm.org/10.1145/1864349.1864378},
	author = {Campbell,Tim and Larson,Eric and Cohn,Gabe and Jon Froehlich and Alcaide,Ramses and Patel,Shwetak N.}
}
@article {16820,
	title = {A Web Database for Computer-Aided Detection and Diagnosis of Medical Images},
	journal = {Digital Mammography},
	year = {2010},
	month = {2010///},
	pages = {265 - 272},
	author = {Tahmoush,D. and Samet, Hanan}
}
@conference {13086,
	title = {Web-scale computer vision using MapReduce for multimedia data mining},
	booktitle = {Proceedings of the Tenth International Workshop on Multimedia Data Mining},
	series = {MDMKDD {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {9:1{\textendash}9:10 - 9:1{\textendash}9:10},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This work explores computer vision applications of the MapReduce framework that are relevant to the data mining community. An overview of MapReduce and common design patterns are provided for those with limited MapReduce background. We discuss both the high level theory and the low level implementation for several computer vision algorithms: classifier training, sliding windows, clustering, bag-of-features, background subtraction, and image registration. Experimental results for the k-means clustering and single Gaussian background subtraction algorithms are performed on a 410 node Hadoop cluster.},
	keywords = {background subtraction, bag-of-features, Cloud computing, clustering, Computer vision, image registration, MapReduce},
	isbn = {978-1-4503-0220-3},
	doi = {10.1145/1814245.1814254},
	url = {http://doi.acm.org/10.1145/1814245.1814254},
	author = {White,Brandyn and Tom Yeh and Jimmy Lin and Davis, Larry S.}
}
@article {18925,
	title = {When is it better not to look ahead?},
	journal = {Artificial Intelligence},
	volume = {174},
	year = {2010},
	month = {2010/11//},
	pages = {1323 - 1338},
	abstract = {In situations where one needs to make a sequence of decisions, it is often believed that looking ahead will help produce better decisions. However, it was shown 30 years ago that there are {\textquotedblleft}pathological{\textquotedblright} situations in which looking ahead is counterproductive. Two long-standing open questions are (a) what combinations of factors have the biggest influence on whether lookahead pathology occurs, and (b) whether it occurs in real-world decision-making.This paper includes simulation results for several synthetic game-tree models, and experimental results for three well-known board games: two chess endgames, kalah (with some modifications to facilitate experimentation), and the 8-puzzle. The simulations show the interplay between lookahead pathology and several factors that affect it; and the experiments confirm the trends predicted by the simulation models. The experiments also show that lookahead pathology is more common than has been thought: all three games contain situations where it occurs.
},
	keywords = {Game-tree search, Lookahead pathology, minimax},
	isbn = {0004-3702},
	doi = {10.1016/j.artint.2010.08.002},
	url = {http://www.sciencedirect.com/science/article/pii/S0004370210001402},
	author = {Nau, Dana S. and Lu{\v s}trek,Mitja and Parker,Austin and Bratko,Ivan and Gams,Matja{\v z}}
}
@article {18524,
	title = {Which Factors Affect Access Network Performance?},
	volume = {GT-CS-10-04},
	year = {2010},
	month = {2010///},
	institution = {Georgia Institute of Technology},
	abstract = {This paper presents an analysis of the performance of residential access networks using over four months of round-trip, download, and upload measurements from more than 7,000 users across four ADSL and cable providers in France. Previous studies have characterized residential access network performance, but this paper presents the first study of how access network performance relates to other factors, such as choice of access provider, service-level agreement, and geographic location. We first explore the extent to which user performance matches the capacity advertised by an access provider, and whether the ability to achieve this capacity depends on the user{\textquoteright}s access network. We then analyze the extent to which various factors influence the performance that users experience. Finally, we explore how different groups of users experience simultaneous performance anomalies and analyze the common characteristics of users that share fate (e.g., whether users that experience simultaneous performance degradation share the same provider, city). Our analysis informs both users and designers of networked services who wish to improve the reliability and performance of access networks through multihoming and may also assist operators with troubleshooting network issues by narrowing down likely causes.},
	url = {http://hdl.handle.net/1853/37336},
	author = {Sundaresan,S. and Feamster, Nick and Dicioccio,L. and Teixeira,R.}
}
@conference {19463,
	title = {Who{\textquoteright}s Hogging the Bandwidth: The Consequences of Revealing the Invisible in the Home},
	booktitle = {SIGCHI {\textquoteright}10},
	series = {CHI {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {659 - 668},
	publisher = {ACM},
	organization = {ACM},
	abstract = {As more technologies enter the home, householders are burdened with the task of digital housekeeping-managing and sharing digital resources like bandwidth. In response to this, we created and evaluated a domestic tool for bandwidth management called Home Watcher. Our field trial showed that when resource contention amongst different household members is made visible, people{\textquoteright}s understanding of bandwidth changes and household politics are revealed. In this paper, we describe the consequences of showing real time resource usage in a home, and how this varies depending on the social make up of the household.},
	keywords = {bandwidth monitoring, home broadband, home networks},
	isbn = {978-1-60558-929-9},
	url = {http://doi.acm.org/10.1145/1753326.1753423},
	author = {Marshini Chetty and Banks, Richard and Harper, Richard and Regan, Tim and Sellen, Abigail and Gkantsidis, Christos and Karagiannis, Thomas and Key, Peter}
}
@inbook {18357,
	title = {Why Did the Person Cross the Road (There)? Scene Understanding Using Probabilistic Logic Models and Common Sense Reasoning},
	booktitle = {Computer Vision {\textendash} ECCV 2010},
	series = {Lecture Notes in Computer Science},
	volume = {6312},
	year = {2010},
	month = {2010///},
	pages = {693 - 706},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We develop a video understanding system for scene elements, such as bus stops, crosswalks, and intersections, that are characterized more by qualitative activities and geometry than by intrinsic appearance. The domain models for scene elements are not learned from a corpus of video, but instead, naturally elicited by humans, and represented as probabilistic logic rules within a Markov Logic Network framework. Human elicited models, however, represent object interactions as they occur in the 3D world rather than describing their appearance projection in some specific 2D image plane. We bridge this gap by recovering qualitative scene geometry to analyze object interactions in the 3D world and then reasoning about scene geometry, occlusions and common sense domain knowledge using a set of meta-rules. The effectiveness of this approach is demonstrated on a set of videos of public spaces.},
	isbn = {978-3-642-15551-2},
	url = {http://dx.doi.org/10.1007/978-3-642-15552-9_50},
	author = {Kembhavi,Aniruddha and Tom Yeh and Davis, Larry S.},
	editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos}
}
@conference {18613,
	title = {Wide-area route control for distributed services},
	booktitle = {Proceedings of the 2010 USENIX conference on USENIX annual technical conference},
	series = {USENIXATC{\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {2 - 2},
	publisher = {USENIX Association},
	organization = {USENIX Association},
	address = {Berkeley, CA, USA},
	abstract = {Many distributed services would benefit from control over the flow of traffic to and from their users, to offer better performance and higher reliability at a reasonable cost. Unfortunately, although today{\textquoteright}s cloud-computing platforms offer elastic computing and bandwidth resources, they do not give services control over wide-area routing. We propose replacing the data center{\textquoteright}s border router with a Transit Portal (TP) that gives each service the illusion of direct connectivity to upstream ISPs, without requiring each service to deploy hardware, acquire IP address space, or negotiate contracts with ISPs. Our TP prototype supports many layer-two connectivity mechanisms, amortizes memory and message overhead over multiple services, and protects the rest of the Internet from misconfigured and malicious applications. Our implementation extends and synthesizes open-source software components such as the Linux kernel and the Quagga routing daemon. We also implement a management plane based on the GENI control framework and couple this with our four-site TP deployment and Amazon EC2 facilities. Experiments with an anycast DNS application demonstrate the benefits the TP offers to distributed services.},
	url = {http://dl.acm.org/citation.cfm?id=1855840.1855842},
	author = {Valancius,Vytautas and Feamster, Nick and Rexford,Jennifer and Nakao,Akihiro}
}
@conference {15456,
	title = {Workshop on experimental evaluation of software and systems in computer science (Evaluate 2010)},
	booktitle = {Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion},
	series = {SPLASH {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {291 - 292},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We call ourselves {\textquoteright}computer scientists{\textquoteright}, but are we scientists? If we are scientists, then we must practice the scientific method. This includes a solid experimental evaluation. In our experience, our experimental methodology is ad hoc at best, and nonexistent at worst. This workshop brings together experts from different areas of computer science to discuss, explore, and attempt to identify the principles of sound experimental evaluation},
	keywords = {Evaluation, METHODOLOGY},
	isbn = {978-1-4503-0240-1},
	doi = {10.1145/1869542.1869618},
	url = {http://doi.acm.org/10.1145/1869542.1869618},
	author = {Blackburn,Steven M. and Diwan,Amer and Hauswirth,Matthias and Memon, Atif M. and Sweeney,Peter F.}
}
@conference {16503,
	title = {Web Monitoring 2.0: Crossing Streams to Satisfy Complex Data Needs},
	booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09},
	year = {2009},
	month = {2009/04/29/March},
	pages = {1215 - 1218},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Web monitoring 2.0 supports the complex information needs of clients who probe multiple information sources and generate mashups by integrating across these volatile streams. A proxy that aims at satisfying multiple customized client profiles will face a scalability challenge in trying to maximize the number of clients served while at the same time fully satisfying complex client needs. In this paper, we introduce an abstraction of complex execution intervals, a combination of time intervals and information streams, to capture complex client needs. Given some budgetary constraints (e.g., bandwidth), we present offline algorithmic solutions for the problem of maximizing completeness of capturing complex profiles.},
	keywords = {Bandwidth, complex client information need, Data Delivery, Data engineering, database management systems, Educational institutions, Internet, Mashups, mashups generation, Monitoring, multiple information source, offline algorithmic solution, Portals, PROBES, Profiles, Query processing, scalability, scheduling, volatile information stream, Web 2.0, Web Monitoring},
	isbn = {978-1-4244-3422-0},
	doi = {10.1109/ICDE.2009.204},
	author = {Roitman,H. and Gal,A. and Raschid, Louiqa}
}
@article {12225,
	title = {What a mesh: understanding the design tradeoffs for streaming multicast},
	journal = {SIGMETRICS Perform. Eval. Rev.},
	volume = {37},
	year = {2009},
	month = {2009/10//},
	pages = {85 - 86},
	abstract = {Cooperative end-system multicast (CEM) is a promising paradigm for Internet video distribution. Several CEM systems have been proposed and deployed, but the tradeoffs inherent in the different designs are not well understood. In this work, we provide a common framework in which different CEM design choices can be empirically and systematically evaluated. Based on our results, we conjecture that all CEM systems must abide by a set of fundamental design constraints, which we express in a simple model. By necessity, existing system implementations couple the data- and control-planes and often use different transport protocols.},
	isbn = {0163-5999},
	doi = {10.1145/1639562.1639598},
	url = {http://doi.acm.org/10.1145/1639562.1639598},
	author = {Nandi,Animesh and Bhattacharjee, Bobby and Druschel,Peter}
}
@article {15998,
	title = {What puts the {\textquotedblleft}meta{\textquotedblright} in metacognition?},
	journal = {Behavioral and Brain Sciences},
	volume = {32},
	year = {2009},
	month = {2009///},
	pages = {138 - 139},
	author = {Anderson,M. L and Perlis, Don}
}
@conference {16057,
	title = {What{\textquoteright}s being said near "Martha"? Exploring name entities in literary text collections},
	booktitle = {Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on},
	year = {2009},
	month = {2009/10//},
	pages = {107 - 114},
	abstract = {A common task in literary analysis is to study characters in a novel or collection. Automatic entity extraction, text analysis and effective user interfaces facilitate character analysis. Using our interface, called POSvis, the scholar uses word clouds and self-organizing graphs to review vocabulary, to filter by part of speech, and to explore the network of characters located near characters under review. Further, visualizations show word usages within an analysis window (i.e. a book chapter), which can be compared with a reference window (i.e. the whole book). We describe the interface and report on an early case study with a humanities scholar.},
	keywords = {analysis;humanities, analysis;literary, analysis;user, clouds;word, collection;name, entity, entity;part-of-speech, extraction;character, filtering;linguistics;text, filtering;self-organizing, graph;text, interface;vocabulary;word, interfaces;vocabulary;, POSvis;automatic, scholar;literary, text, usage;data, visualisation;information},
	doi = {10.1109/VAST.2009.5333248},
	author = {Vuillemot,R. and Clement,T. and Plaisant, Catherine and Kumar,A.}
}
@conference {19510,
	title = {Why Do Upgrades Fail and What Can We Do About It?: Toward Dependable, Online Upgrades in Enterprise System},
	booktitle = {Middleware{\textquoteright}09 Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware},
	series = {Middleware {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {18:1 - 18:20},
	publisher = {Springer-Verlag New York, Inc.},
	organization = {Springer-Verlag New York, Inc.},
	abstract = {Enterprise-system upgrades are unreliable and often produce downtime or data-loss. Errors in the upgrade procedure, such as broken dependencies, constitute the leading cause of upgrade failures. We propose a novel upgrade-centric fault model, based on data from three independent sources, which focuses on the impact of procedural errors rather than software defects. We show that current approaches for upgrading enterprise systems, such as rolling upgrades, are vulnerable to these faults because the upgrade is not an atomic operation and it risks breaking hidden dependencies among the distributed system-components. We also present a mechanism for tolerating complex procedural errors during an upgrade. Our system, called Imago, improves availability in the fault-free case, by performing an online upgrade, and in the faulty case, by reducing the risk of failure due to breaking hidden dependencies. Imago performs an end-to-end upgrade atomically and dependably, by dedicating separate resources to the new version and by isolating the old version from the upgrade procedure. Through fault injection, we show that Imago is more reliable than online-upgrade approaches that rely on dependency-tracking and that create system states with mixed versions.},
	url = {http://dl.acm.org/citation.cfm?id=1656980.1657005},
	author = {Tudor Dumitras and Narasimhan, Priya}
}
@article {13974,
	title = {Wideband fast multipole accelerated boundary element methods for the three-dimensional Helmholtz equation.},
	journal = {The Journal of the Acoustical Society of America},
	volume = {125},
	year = {2009},
	month = {2009///},
	pages = {2566 - 2566},
	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 wave number 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 and approximations of the boundary shapes using elements. These errors must be balanced against approximations introduced by the FMM and the convergence criterion for an 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.},
	url = {http://link.aip.org/link/?JAS/125/2566/4},
	author = {Gumerov, Nail A. and Duraiswami, Ramani}
}
@conference {18926,
	title = {Within epsilon of optimal play in the cultaptation social learning game},
	series = {AAMAS {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {1327 - 1328},
	publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
	organization = {International Foundation for Autonomous Agents and Multiagent Systems},
	address = {Richland, SC},
	abstract = {Social learning, in which members of a society learn by observing the behavior of others, is an important foundation for human culture, and is observed in many other species as well. It seems natural to assume that social learning evolved due to the inherent superiority of copying others{\textquoteright} success rather than learning on one{\textquoteright}s own via trial-and-error innovation. However, there has also been substantial work questioning this intuition [3, 5, 1, 6, 4]. For example, blindly copying information from others is not useful if the information is wrong---or if it once was right but has since become outdated. Under what conditions does social learning outperform trial-and-error learning, and what kinds of social-learning strategies are likely to perform well?},
	isbn = {978-0-9817381-7-8},
	url = {http://dl.acm.org/citation.cfm?id=1558109.1558276},
	author = {Carr,Ryan and Raboin,Eric and Parker,Austin and Nau, Dana S.}
}
@article {15706,
	title = {A Weighted GCV Method for Lanczos Hybrid Regularization},
	journal = {Electronic Transactions on Numerical Analysis},
	volume = {28},
	year = {2008},
	month = {2008///},
	pages = {149 - 167},
	url = {http://etna.mcs.kent.edu/vol.28.2007-2008/pp149-167.dir/pp149-167.pdfhttp://etna.mcs.kent.edu/vol.28.2007-2008/pp149-167.dir/pp149-167.pdf},
	author = {Chung,Julianne and Nagy,James G. and O{\textquoteright}Leary, Dianne P.}
}
@article {15272,
	title = {What are decision trees?},
	journal = {Nature biotechnology},
	volume = {26},
	year = {2008},
	month = {2008///},
	pages = {1011 - 1011},
	author = {Kingsford, Carl and Salzberg,S. L}
}
@article {15176,
	title = {Which languages have 4-round zero-knowledge proofs?},
	journal = {Theory of Cryptography},
	year = {2008},
	month = {2008///},
	pages = {73 - 88},
	abstract = {We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then . Assuming the polynomial hierarchy does not collapse, this means in particular that NP-complete languages do not have 4-round zero-knowledge proofs (at least with respect to black-box simulation).},
	doi = {10.1007/978-3-540-78524-8_5},
	author = {Katz, Jonathan}
}
@conference {12038,
	title = {Who killed the directed model?},
	booktitle = {Computer Vision and Pattern Recognition, IEEE Computer Society Conference on},
	year = {2008},
	month = {2008///},
	pages = {1 - 8},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {Prior distributions are useful for robust low-level vision, and undirected models (e.g. Markov Random Fields) have become a central tool for this purpose. Though sometimes these priors can be specified by hand, this becomes difficult in large models, which has motivated learning these models from data. However, maximum likelihood learning of undirected models is extremely difficult- essentially all known methods require approximations and/or high computational cost. Conversely, directed models are essentially trivial to learn from data, but have not received much attention for low-level vision. We compare the two formalisms of directed and undirected models, and conclude that there is no a priori reason to believe one better represents low-level vision quantities. We formulate two simple directed priors, for natural images and stereo disparity, to empirically test if the undirected formalism is superior. We find in both cases that a simple directed model can achieve results similar to the best learnt undirected models with significant speedups in training time, suggesting that directed models are an attractive choice for tractable learning.},
	isbn = {978-1-4244-2242-5},
	doi = {http://doi.ieeecomputersociety.org/10.1109/CVPR.2008.4587817},
	author = {Domke, Justin and Karapurkar, Alap and Aloimonos, J.}
}
@article {15831,
	title = {Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality},
	journal = {PLoS Comput BiolPLoS Comput Biol},
	volume = {4},
	year = {2008},
	month = {2008///},
	pages = {e1000140 - e1000140},
	abstract = {Analysis of protein interaction networks in the budding yeast Saccharomyces cerevisiae has revealed that a small number of proteins, the so-called hubs, interact with a disproportionately large number of other proteins. Furthermore, many hub proteins have been shown to be essential for survival of the cell{\textemdash}that is, in optimal conditions, yeast cannot grow and multiply without them. This relation between essentiality and the number of neighbors in the protein{\textendash}protein interaction network has been termed the centrality-lethality rule. However, why are such hubs essential? Jeong and colleagues [1] suggested that overrepresentation of essential proteins among high-degree nodes can be attributed to the central role that hubs play in mediating interactions among numerous, less connected proteins. Another view, proposed by He and Zhang, suggested that that the majority of proteins are essential due to their involvement in one or more essential protein{\textendash}protein interactions that are distributed uniformly at random along the network edges [2]. We find that none of the above reasons determines essentiality. Instead, the majority of hubs are essential due to their involvement in Essential Complex Biological Modules, a group of densely connected proteins with shared biological function that are enriched in essential proteins. This study sheds new light on the topological complexity of protein interaction networks.},
	doi = {10.1371/journal.pcbi.1000140},
	url = {http://dx.doi.org/10.1371/journal.pcbi.1000140},
	author = {Zotenko,Elena and Mestre,Julian and O{\textquoteright}Leary, Dianne P. and Przytycka,Teresa M.}
}
@article {19616,
	title = {Worst case examples of an exterior point algorithm for the assignment problem},
	journal = {Discrete Optimization},
	volume = {5},
	year = {2008},
	month = {2008/08//},
	pages = {605 - 614},
	abstract = {An efficient exterior point simplex type algorithm for the assignment problem has been developed by Paparrizos~[K. Paparrizos, An infeasible (exterior point) simplex algorithm for assignment problems, Math. Program. 51 (1991) 45{\textendash}54]. This algorithm belongs to the category of forest algorithms and solves an n {\texttimes} n assignment problem in at most n ( n - 1 ) 2 iterations and in at most O ( n 3 ) time. In this paper worst case examples are presented. Specifically, a systematic procedure to construct worst case assignment problems is presented for the exterior point algorithm. The algorithm applied to these examples executes exactly n ( n - 1 ) 2 iterations. This result verifies that the bound O ( n 3 ) is the best possible for the above-mentioned algorithm.},
	keywords = {Assignment problem, Exterior point algorithm, Worst case examples},
	isbn = {1572-5286},
	url = {http://www.sciencedirect.com/science/article/pii/S1572528608000030},
	author = {Charalampos Papamanthou and Paparrizos, Konstantinos and Samaras, Nikolaos and Stergiou, Konstantinos}
}
@article {15051,
	title = {Web Archiving: Organizing Web Objects into Web Containers to Optimize Access},
	volume = {UMIACS-TR-2007-42},
	year = {2007},
	month = {2007/10/09/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {The web is becoming the preferred medium for communicating and storinginformation pertaining to almost any human activity. However it is an
ephemeral medium whose contents are constantly changing, resulting in
a permanent loss of part of our cultural and scientific heritage on a
regular basis. Archiving important web contents is a very challenging
technical problem due to its tremendous scale and complex structure,
extremely dynamic nature, and its rich heterogeneous and deep
contents. In this paper, we consider the problem of archiving a linked
set of web objects into web containers in such a way as to minimize
the number of containers accessed during a typical browsing session.
We develop a method that makes use of the notion of PageRank and
optimized graph partitioning to enable faster browsing of archived web
contents. We include simulation results that illustrate the
performance of our scheme and compare it to the common scheme
currently used to organize web objects into web containers.
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/7426},
	author = {Song,Sangchul and JaJa, Joseph F.}
}
@conference {16852,
	title = {A web collaboration system for content-based image retrieval of medical images},
	booktitle = {Proceedings of SPIE{\textendash}Medical Imaging},
	volume = {6516},
	year = {2007},
	month = {2007///},
	abstract = {Building effective content-based image retrieval (CBIR) systemsinvolves the combination of image creation, storage, security,
transmission, analysis, evaluation feature extraction, and
feature combination in order to store and retrieve medical images
effectively. This requires the involvement of a large community
of experts across several fields. We have created a CBIR system
called Archimedes which integrates the community together without
requiring disclosure of sensitive details. Archimedes{\textquoteright} system
design enables researchers to upload their feature sets and
quickly compare the effectiveness of their methods against other
stored feature sets. Additionally, research into the techniques
used by radiologists is possible in Archimedes through double-
blind radiologist comparisons based on their annotations and
feature markups. This research archive contains the essential
technologies of secure transmission and storage, textual and
feature searches, spatial searches, annotation searching,
filtering of result sets, feature creation, and bulk loading of
features, while creating a repository and testbed for the
community.
},
	author = {Tahmoush,D. and Samet, Hanan}
}
@article {17506,
	title = {Web science: a provocative invitation to computer science},
	journal = {Communications of the ACM},
	volume = {50},
	year = {2007},
	month = {2007/06//},
	pages = {25 - 27},
	abstract = {Here{\textquoteright}s how it can awaken computer science to the interdisciplinary possibilities of the Web{\textquoteright}s socially embedded computing technology.},
	isbn = {0001-0782},
	doi = {10.1145/1247001.1247022},
	url = {http://doi.acm.org/10.1145/1247001.1247022},
	author = {Shneiderman, Ben}
}
@inbook {14276,
	title = {Wavelet-Based Super-Resolution Reconstruction: Theory and Algorithm},
	booktitle = {Computer Vision {\textendash} ECCV 2006Computer Vision {\textendash} ECCV 2006},
	series = {Lecture Notes in Computer Science},
	volume = {3954},
	year = {2006},
	month = {2006///},
	pages = {295 - 307},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We present a theoretical analysis and a new algorithm for the problem of super-resolution imaging: the reconstruction of HR (high-resolution) images from a sequence of LR (low-resolution) images. Super-resolution imaging entails solutions to two problems. One is the alignment of image frames. The other is the reconstruction of a HR image from multiple aligned LR images. Our analysis of the latter problem reveals insights into the theoretical limits of super-resolution reconstruction. We find that at best we can reconstruct a HR image blurred by a specific low-pass filter. Based on the analysis we present a new wavelet-based iterative reconstruction algorithm which is very robust to noise. Furthermore, it has a computationally efficient built-in denoising scheme with a nearly optimal risk bound. Roughly speaking, our method could be described as a better-conditioned iterative back-projection scheme with a fast and optimal regularization criteria in each iteration step. Experiments with both simulated and real data demonstrate that our approach has significantly better performance than existing super-resolution methods. It has the ability to remove even large amounts of mixed noise without creating smoothing artifacts.},
	isbn = {978-3-540-33838-3},
	url = {http://dx.doi.org/10.1007/11744085_23},
	author = {Hui Ji and Ferm{\"u}ller, Cornelia},
	editor = {Leonardis,Ale{\v s} and Bischof,Horst and Pinz,Axel}
}
@article {14363,
	title = {What are the grand challenges for data mining? - KDD-2006 panel report},
	journal = {ACM SIGKDD Explorations Newsletter},
	volume = {8},
	year = {2006},
	month = {2006///},
	pages = {70 - 77},
	abstract = {We discuss what makes exciting and motivating Grand Challenge problems for Data Mining, and propose criteria for a good Grand Challenge. We then consider possible GC problems from multimedia mining, link mining, large- scale modeling, text mining, and proteomics. This report is the result of a panel held at KDD-2006 conference.},
	author = {Piatetsky-Shapiro,G. and Djeraba,C. and Getoor, Lise and Grossman,R. and Feldman,R. and Zaki,M.}
}
@conference {16353,
	title = {What do high-level memory models mean for transactions?},
	booktitle = {Proceedings of the 2006 workshop on Memory system performance and correctness  - MSPC {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {62 - 62},
	address = {San Jose, California},
	doi = {10.1145/1178597.1178609},
	url = {http://dl.acm.org/citation.cfm?id=1178609},
	author = {Grossman,Dan and Manson,Jeremy and Pugh, William}
}
@inbook {12642,
	title = {What Is the Range of Surface Reconstructions from a Gradient Field?},
	booktitle = {Computer Vision {\textendash} ECCV 2006Computer Vision {\textendash} ECCV 2006},
	series = {Lecture Notes in Computer Science},
	volume = {3951},
	year = {2006},
	month = {2006///},
	pages = {578 - 591},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We propose a generalized equation to represent a continuum of surface reconstruction solutions of a given non-integrable gradient field. We show that common approaches such as Poisson solver and Frankot-Chellappa algorithm are special cases of this generalized equation. For a N {\texttimes} N pixel grid, the subspace of all integrable gradient fields is of dimension N 2 {\textendash} 1. Our framework can be applied to derive a range of meaningful surface reconstructions from this high dimensional space. The key observation is that the range of solutions is related to the degree of anisotropy in applying weights to the gradients in the integration process. While common approaches use isotropic weights, we show that by using a progression of spatially varying anisotropic weights, we can achieve significant improvement in reconstructions. We propose (a) α-surfaces using binary weights, where the parameter α allows trade off between smoothness and robustness, (b) M-estimators and edge preserving regularization using continuous weights and (c) Diffusion using affine transformation of gradients. We provide results on photometric stereo, compare with previous approaches and show that anisotropic treatment discounts noise while recovering salient features in reconstructions.},
	isbn = {978-3-540-33832-1},
	url = {http://dx.doi.org/10.1007/11744023_45},
	author = {Agrawal,Amit and Raskar,Ramesh and Chellapa, Rama},
	editor = {Leonardis,Ale{\v s} and Bischof,Horst and Pinz,Axel}
}
@article {16414,
	title = {Widgets, Planets, and Demons: the Case for the Integration of Human, Embedded, and Virtual Agents via Mediation},
	journal = {Proceedings of Swarmfest},
	year = {2006},
	month = {2006///},
	author = {Rand, William and Blikstein,P. and Wilensky,U.}
}
@conference {15315,
	title = {Will pyramids built of nuggets topple over?},
	booktitle = {Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics},
	series = {HLT-NAACL {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {383 - 390},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {The present methodology for evaluating complex questions at TREC analyzes answers in terms of facts called "nuggets". The official F-score metric represents the harmonic mean between recall and precision at the nugget level. There is an implicit assumption that some facts are more important than others, which is implemented in a binary split between "vital" and "okay" nuggets. This distinction holds important implications for the TREC scoring model---essentially, systems only receive credit for retrieving vital nuggets---and is a source of evaluation instability. The upshot is that for many questions in the TREC testsets, the median score across all submitted runs is zero. In this work, we introduce a scoring model based on judgments from multiple assessors that captures a more refined notion of nugget importance. We demonstrate on TREC 2003, 2004, and 2005 data that our "nugget pyramids" address many shortcomings of the present methodology, while introducing only minimal additional overhead on the evaluation flow.},
	doi = {10.3115/1220835.1220884},
	url = {http://dx.doi.org/10.3115/1220835.1220884},
	author = {Jimmy Lin and Demner-Fushman,Dina}
}
@article {12094,
	title = {Wireless Network Security and Interworking},
	journal = {Proceedings of the IEEE},
	volume = {94},
	year = {2006},
	month = {2006/02//},
	pages = {455 - 466},
	abstract = {A variety of wireless technologies have been standardized and commercialized, but no single technology is considered the best because of different coverage and bandwidth limitations. Thus, interworking between heterogeneous wireless networks is extremely important for ubiquitous and high-performance wireless communications. Security in interworking is a major challenge due to the vastly different security architectures used within each network. The goal of this paper is twofold. First, we provide a comprehensive discussion of security problems and current technologies in 3G and WLAN systems. Second, we provide introductory discussions about the security problems in interworking, the state-of-the-art solutions, and open problems.},
	keywords = {3G mobile communication, 3G systems, Authentication, Bandwidth, Communication system security, computer network security, computer security, Data security, internetworking, Land mobile radio cellular systems, Paper technology, security architectures, security of data, telecommunication security, wireless communication, wireless communications, Wireless LAN, wireless network security, Wireless networks, wireless technologies, WLAN systems},
	isbn = {0018-9219},
	doi = {10.1109/JPROC.2005.862322},
	author = {Shin,M. and Ma,J. and Mishra,A. and Arbaugh, William A.}
}
@conference {16705,
	title = {Word-based alignment, phrase-based translation: What{\textquoteright}s the link},
	booktitle = {Proc. of AMTA},
	year = {2006},
	month = {2006///},
	pages = {90 - 99},
	author = {Lopez,A. and Resnik, Philip}
}
@article {17513,
	title = {Workplace user frustration with computers: an exploratory investigation of the causes and severity},
	journal = {Behaviour \& Information Technology},
	volume = {25},
	year = {2006},
	month = {2006///},
	pages = {239 - 251},
	abstract = {When hard-to-use computers cause users to become frustrated, it can affect workplace productivity, user mood and interactions with other co-workers. Previous research has examined the frustration that students and their families face in using computers. To learn more about the causes and measure the severity of user frustration with computers in the workplace, we collected modified time diaries from 50 workplace users, who spent an average of 5.1 hours on the computer. In this exploratory research, users reported wasting on average, 42~?~43\% of their time on the computer due to frustrating experiences. The largest number of frustrating experiences occurred while using word processors, email and web browsers. The causes of the frustrating experiences, the time lost due to the frustrating experiences, and the effects of the frustrating experiences on the mood of the users are discussed in this paper. Implications for designers, managers, users, information technology staff and policymakers are discussed.When hard-to-use computers cause users to become frustrated, it can affect workplace productivity, user mood and interactions with other co-workers. Previous research has examined the frustration that students and their families face in using computers. To learn more about the causes and measure the severity of user frustration with computers in the workplace, we collected modified time diaries from 50 workplace users, who spent an average of 5.1 hours on the computer. In this exploratory research, users reported wasting on average, 42~?~43\% of their time on the computer due to frustrating experiences. The largest number of frustrating experiences occurred while using word processors, email and web browsers. The causes of the frustrating experiences, the time lost due to the frustrating experiences, and the effects of the frustrating experiences on the mood of the users are discussed in this paper. Implications for designers, managers, users, information technology staff and policymakers are discussed.
},
	isbn = {0144-929X},
	doi = {10.1080/01449290500196963},
	url = {http://www.tandfonline.com/doi/abs/10.1080/01449290500196963},
	author = {Lazar,Jonathan and Jones,Adam and Shneiderman, Ben}
}
@conference {16684,
	title = {The web in theoretical linguistics research: Two case studies using the Linguist{\textquoteright}s Search Engine},
	booktitle = {31st Meeting of the Berkeley Linguistics Society},
	year = {2005},
	month = {2005///},
	pages = {265 - 276},
	author = {Resnik, Philip and Elkiss,A. and Lau,E. and Taylor,H.}
}
@inbook {18924,
	title = {Web Service Composition with Volatile Information},
	booktitle = {The Semantic Web {\textendash} ISWC 2005},
	series = {Lecture Notes in Computer Science},
	volume = {3729},
	year = {2005},
	month = {2005///},
	pages = {52 - 66},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In many Web service composition problems, information may be needed from Web services during the composition process. Existing research on Web service composition (WSC) procedures has generally assumed that this information will not change. We describe two ways to take such WSC procedures and systematically modify them to deal with volatile information. The black-box approach requires no knowledge of the WSC procedure{\textquoteright}s internals: it places a wrapper around the WSC procedure to deal with volatile information. The gray-box approach requires partial information of those internals, in order to insert coding to perform certain bookkeeping operations. We show theoretically that both approaches work correctly. We present experimental results showing that the WSC procedures produced by the gray-box approach can run much faster than the ones produced by the black-box approach.},
	keywords = {Computer science},
	isbn = {978-3-540-29754-3},
	url = {http://www.springerlink.com/content/y105x8464k54l760/abstract/},
	author = {Au,Tsz-Chiu and Kuter,Ugur and Nau, Dana S.},
	editor = {Gil,Yolanda and Motta,Enrico and Benjamins,V. and Musen,Mark}
}
@article {12097,
	title = {Weighted coloring based channel assignment for WLANs},
	journal = {ACM SIGMOBILE Mobile Computing and Communications Review},
	volume = {9},
	year = {2005},
	month = {2005///},
	pages = {19 - 31},
	author = {Mishra,A. and Banerjee,S. and Arbaugh, William A.}
}
@conference {19670,
	title = {What Are the Ants Doing? Vision-Based Tracking and Reconstruction of Control Programs},
	booktitle = {Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005. ICRA 2005},
	year = {2005},
	month = {2005/04//},
	pages = {4182 - 4187},
	abstract = {In this paper, we study the problem of going from a real-world, multi-agent system to the generation of control programs in an automatic fashion. In particular, a computer vision system is presented, capable of simultaneously tracking multiple agents, such as social insects. Moreover, the data obtained from this system is fed into a mode-reconstruction module that generates low-complexity control programs, i.e. strings of symbolic descriptions of control-interrupt pairs, consistent with the empirical data. The result is a mechanism for going from the real system to an executable implementation that can be used for controlling multiple mobile robots.},
	keywords = {Animals, Automatic generation control, Biological information theory, Computer vision, Control systems, Mobile robots, Probability distribution, Robot control, target tracking, Trajectory},
	author = {Egerstedt, M. and Balch, T. and Dellaert, F. and Delmotte, F. and Zia Khan}
}
@article {13900,
	title = {What children can teach us: Developing digital libraries for children with children},
	journal = {Library Quarterly},
	volume = {75},
	year = {2005},
	month = {2005///},
	pages = {20 - 41},
	author = {Druin, Allison}
}
@article {17509,
	title = {Why Not Make Interfaces Better than 3D Reality? (2004)},
	year = {2005},
	month = {2005///},
	abstract = {Some designers dream about building interfaces that approach the richness of 3D reality. They believe that the closer an interface resembles the real world, the easier the usage. They strive for resolution that matches filmith rapid camera movement and lively animated objects. This is a dubious proposition since user studies show that disorienting navigation, complex user actions, and annoying occlusions can slow performance in the real world as well as 3D interfaces.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6523},
	author = {Shneiderman, Ben}
}
@article {19211,
	title = {WalkSAT as an Informed Heuristic to DPLL in SAT Solving},
	journal = {Department of Computer Science, University of Washington, Seattle},
	year = {2004},
	month = {2004},
	author = {Ferris,B. and Jon Froehlich}
}
@conference {13055,
	title = {Web search intent induction via automatic query reformulation},
	booktitle = {Proceedings of HLT-NAACL 2004: Short Papers on XX},
	year = {2004},
	month = {2004///},
	pages = {49 - 52},
	author = {Daum{\'e}, Hal and Brill,E.}
}
@conference {15314,
	title = {What works better for question answering: Stemming or morphological query expansion},
	booktitle = {Proceedings of the Information Retrieval for Question Answering (IR4QA) Workshop at SIGIR 2004},
	year = {2004},
	month = {2004///},
	abstract = {How do different information retrieval techniques affect theperformance of document retrieval in the context of question
answering? An exploration of this question is our overall re-
search goal. In this paper, we specifically examine strategies
for coping with morphological variation. This work quanti-
tatively compares two different approaches to handling term
variation: applying a stemming algorithm at indexing time,
and performing morphological query expansion at retrieval
time. We discovered that, compared to the no-stemming
baseline, stemming results in lower recall, and morphologi-
cal expansion yields higher recall. By separately weighting
different term variants, we were able to achieve even higher
recall, which opens the door to interesting question analy-
sis algorithms for sophisticated query generation. Another
significant contribution of our work is the development of a
reusable question answering test collection to support our
experiments.
},
	author = {Bilotti,M. W and Katz,B. and Jimmy Lin}
}
@article {14851,
	title = {Whitening for photometric comparison of smooth surfaces under varying illumination},
	journal = {Computer Vision-ECCV 2004},
	year = {2004},
	month = {2004///},
	pages = {217 - 228},
	abstract = {We consider the problem of image comparison in order to match smooth surfaces under varying illumination. In a smooth surface nearby surface normals are highly correlated. We model such surfaces as Gaussian processes and derive the resulting statistical characterization of the corresponding images. Supported by this model, we treat the difference between two images, associated with the same surface and different lighting, as colored Gaussian noise, and use the whitening tool from signal detection theory to construct a measure of difference between such images. This also improves comparisons by accentuating the differences between images of different surfaces. At the same time, we prove that no linear filter, including ours, can produce lighting insensitive image comparisons. While our Gaussian assumption is a simplification, the resulting measure functions well for both synthetic and real smooth objects. Thus we improve upon methods for matching images of smooth objects, while providing insight into the performance of such methods. Much prior work has focused on image comparison methods appropriate for highly curved surfaces. We combine our method with one of these, and demonstrate high performance on rough and smooth objects.},
	doi = {10.1007/978-3-540-24673-2_18},
	author = {Osadchy,M. and Lindenbaum,M. and Jacobs, David W.}
}
@article {14578,
	title = {Whole-genome shotgun assembly and comparison of human genome assemblies},
	journal = {Proceedings of the National Academy of Sciences of the United States of America},
	volume = {101},
	year = {2004},
	month = {2004///},
	pages = {1916 - 1916},
	author = {Istrail,S. and Sutton,G. G and Florea,L. and Halpern,A. L and Mobarry,C. M and Lippert,R. and Walenz,B. and Shatkay,H. and Dew,I. and Miller,J. R and others}
}
@article {16497,
	title = {Wide area performance monitoring using aggregate latency profiles},
	journal = {Web Engineering},
	year = {2004},
	month = {2004///},
	pages = {771 - 775},
	author = {Zadorozhny,V. and Gal,A. and Raschid, Louiqa and Ye,Q.}
}
@article {12699,
	title = {Wide baseline image registration with application to 3-D face modeling},
	journal = {Multimedia, IEEE Transactions on},
	volume = {6},
	year = {2004},
	month = {2004/06//},
	pages = {423 - 434},
	abstract = {Establishing correspondence between features in two images of the same scene taken from different viewing angles is a challenging problem in image processing and computer vision. However, its solution is an important step in many applications like wide baseline stereo, three-dimensional (3-D) model alignment, creation of panoramic views, etc. In this paper, we propose a technique for registration of two images of a face obtained from different viewing angles. We show that prior information about the general characteristics of a face obtained from video sequences of different faces can be used to design a robust correspondence algorithm. The method works by matching two-dimensional (2-D) shapes of the different features of the face (e.g., eyes, nose etc.). A doubly stochastic matrix, representing the probability of match between the features, is derived using the Sinkhorn normalization procedure. The final correspondence is obtained by minimizing the probability of error of a match between the entire constellation of features in the two sets, thus taking into account the global spatial configuration of the features. The method is applied for creating holistic 3-D models of a face from partial representations. Although this paper focuses primarily on faces, the algorithm can also be used for other objects with small modifications.},
	keywords = {2D, 3D, algorithm;, baseline, biometrics;, Computer, configuration;, correspondence, doubly, error, extraction;, Face, feature, holistic, image, matching;, matrix;, minimization;, modeling;, models;, normalization, probability, probability;, procedure;, processes;, processing;, recognition;, registration;, representation;, sequences;, shapes;, Sinkhorn, spatial, statistics;, Stochastic, video, vision;, wide},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2004.827511},
	author = {Roy-Chowdhury, A.K. and Chellapa, Rama and Keaton, T.}
}
@conference {13217,
	title = {Window-based, discontinuity preserving stereo},
	booktitle = {Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on},
	volume = {1},
	year = {2004},
	month = {2004/07/02/june},
	pages = {I-66 - I-73 Vol.1 - I-66 - I-73 Vol.1},
	abstract = {Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper we present an algorithm which combines window-based local matching into a global optimization framework. Our local matching algorithm assumes that local windows can have at most two disparities. Under this assumption, the local matching can be performed very efficiently using graph cuts. The global matching is formulated as minimization of an energy term that takes into account the matching constraints induced by the local stereo algorithm. Fast, approximate minimization of this energy is achieved through graph cuts. The key feature of our algorithm is that it preserves discontinuities both during the local as well as global matching phase.},
	keywords = {algorithm;, approach;, based, cuts;, dense, discontinuity, global, graph, image, local, MATCHING, matching;, minimisation;, optimization;, Pixel, preserving, processing;, stereo, theory;, window},
	doi = {10.1109/CVPR.2004.1315015},
	author = {Agrawal,M. and Davis, Larry S.}
}
@conference {13698,
	title = {Word Level Script Identification on Scanned Document Images},
	booktitle = {SPIEConference on Document Recognition and Retrieval},
	year = {2004},
	month = {2004///},
	pages = {124 - 135},
	address = {San Jose, CA},
	author = {Ma,Huanfeng and David Doermann}
}
@article {14486,
	title = {A workshop report: mining for and from the Semantic Web at KDD 2004},
	journal = {SIGKDD Explor. Newsl.},
	volume = {6},
	year = {2004},
	month = {2004/12//},
	pages = {142 - 143},
	abstract = {The international workshop on Mining for and from the Semantic Web (MSW) at the KDD 2004 successfully brought together people from the communities Semantic Web and Knowledge Discovery. The goal of the workshop was to strengthen the communication and interaction between these communities as there is currently an agreement that both can benefit largely from each other. Overall the contributions and discussions showed that today mining for the semantic web is the primarily targeted research area. However, with a growing amount of available semantic web data also mining from the semantic web will be more prominent.},
	isbn = {1931-0145},
	doi = {10.1145/1046456.1046482},
	url = {http://doi.acm.org/10.1145/1046456.1046482},
	author = {Hotho,Andreas and Sure,York and Getoor, Lise}
}
@conference {15285,
	title = {What makes a good answer? The role of context in question answering},
	booktitle = {Human-Computer Interaction, Interact {\textquoteright}03},
	year = {2003},
	month = {2003///},
	pages = {25 - 25},
	author = {Jimmy Lin and Quan,D. and Sinha,V. and Bakshi,K. and Huynh,D. and Katz,B. and Karger,D. R}
}
@article {14877,
	title = {What makes viewpoint-invariant properties perceptually salient?},
	journal = {Journal of the Optical Society of America A},
	volume = {20},
	year = {2003},
	month = {2003///},
	pages = {1304 - 1320},
	abstract = {It has been noted that many of the perceptually salient image properties identified by the Gestalt psychologists, such as collinearity, parallelism, and good continuation, are invariant to changes in viewpoint. However, I show that viewpoint invariance is not sufficient to distinguish these Gestalt properties; one can define an infinite number of viewpoint-invariant properties that are not perceptually salient. I then show that generally, the perceptually salient viewpoint-invariant properties are minimal, in the sense that they can be derived by using less image information than for nonsalient properties. This finding provides support for the hypothesis that the biological relevance of an image property is determined both by the extent to which it provides information about the world and by the ease with which this property can be computed. [An abbreviated version of this work, including technical details that are avoided in this paper, is contained in K. Boyer and S. Sarker, eds., Perceptual Organization for Artificial Vision Systems (Kluwer Academic, Dordrecht, The Netherlands, 2000), pp. 121{\textendash}138.]},
	author = {Jacobs, David W.}
}
@conference {15428,
	title = {What test oracle should I use for effective GUI testing?},
	booktitle = {Automated Software Engineering, 2003. Proceedings. 18th IEEE International Conference on},
	year = {2003},
	month = {2003/10//},
	pages = {164 - 173},
	abstract = {Test designers widely believe that the overall effectiveness and cost of software testing depends largely on the type and number of test cases executed on the software. In this paper we show that the test oracle used during testing also contributes significantly to test effectiveness and cost. A test oracle is a mechanism that determines whether software executed correctly for a test case. We define a test oracle to contain two essential parts: oracle information that represents expected output; and an oracle procedure that compares the oracle information with the actual output. By varying the level of detail of oracle information and changing the oracle procedure, a test designer can create different types of test oracles. We design 11 types of test oracles and empirically compare them on four software systems. We seed faults in software to create 100 faulty versions, execute 600 test cases on each version, for all 11 types of oracles. In all, we report results of 660,000 test runs on software. We show (1) the time and space requirements of the oracles, (2) that faults are detected early in the testing process when using detailed oracle information and complex oracle procedures, although at a higher cost per test case, and (3) that employing expensive oracles results in detecting a large number of faults using relatively smaller number of test cases.},
	keywords = {empirical studies, graphical user interface, Graphical user interfaces, GUI testing, oracle information, oracle procedure, oracle space requirement, oracle time requirements, program testing, software engineering, Software testing, test cost, test effectiveness, test oracle},
	doi = {10.1109/ASE.2003.1240304},
	author = {Memon, Atif M. and Banerjee,I. and Nagarajan,A.}
}
@article {17672,
	title = {When does a random Robin Hood win?},
	journal = {Theoretical Computer Science},
	volume = {304},
	year = {2003},
	month = {2003/07/28/},
	pages = {477 - 484},
	abstract = {A certain two-person infinite game (between {\textquotedblleft}Robin Hood{\textquotedblright} and the {\textquotedblleft}Sheriff{\textquotedblright}) has been studied in the context of set theory. In certain cases, it is known that for any deterministic strategy of Robin Hood{\textquoteright}s, if the Sheriff knows Robin Hood{\textquoteright}s strategy, he can adapt a winning counter-strategy. We show that in these cases, Robin Hood wins with {\textquotedblleft}probability one{\textquotedblright} if he adopts a natural random strategy. We then characterize when this random strategy has the almost-surely winning property. We also explore the case of a random Sheriff versus a deterministic Robin Hood.},
	keywords = {Games, Randomized strategy, STRATEGY},
	isbn = {0304-3975},
	doi = {10.1016/S0304-3975(03)00289-5},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397503002895},
	author = {Gasarch,William and Golub,Evan and Srinivasan, Aravind}
}
@conference {16141,
	title = {Which comes first, usability or utility?},
	booktitle = {Proceedings of the 14th IEEE Visualization 2003 (VIS{\textquoteright}03)},
	series = {VIS {\textquoteright}03},
	year = {2003},
	month = {2003///},
	pages = {112{\textendash} - 112{\textendash}},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Washington, DC, USA},
	isbn = {0-7695-2030-8},
	doi = {10.1109/VISUAL.2003.1250426},
	url = {http://dx.doi.org/10.1109/VISUAL.2003.1250426},
	author = {Grinstein,Georges and Kobsa,Alfred and Plaisant, Catherine and Shneiderman, Ben and Stasko,John T}
}
@article {17508,
	title = {Why not make interfaces better than 3D reality?},
	journal = {IEEE Computer Graphics and Applications},
	volume = {23},
	year = {2003},
	month = {2003/12//Nov},
	pages = {12 - 15},
	abstract = {Many constrained interfaces are designed to be simpler than the real world by restricting movement, limiting interface actions, and keeping interface objects in a plane. However, the strong utility of pure 3D interfaces for medical, architectural, product design, and scientific visualization means that interface design for pure 3D remains an important challenge. An intriguing possibility is that enhanced 3D interfaces might offer simpler navigation, more compelling functionality, safer movements, and less occlusion, than 3D reality, especially for information exploration and visualization tasks. Such features can enable superhuman capabilities such as faster-than-light teleportation, flying through objects, and X-ray vision. Enhanced 3D interfaces might have supernatural tools such as magic wands for instantly shrinking, enlarging, duplicating, or sending objects and enchanted environments that provide error prevention, history keeping, and programming-by-demonstration. Playful game designers and creative application developers have already pushed the technology further than those who seek merely to mimic reality. Advanced designs are marked by their support of rapid situation awareness through effective overviews, reduced numbers of actions to accomplish tasks; and prompt, meaningful feedback for user actions. This article reviews these clever enhanced 3D-design features and encourages approaches that facilitate user tasks rather than mimic reality.},
	keywords = {3D interfaces, 3D reality, Atmosphere, Avatars, Cities and towns, Collaboration, Computer displays, Computer Graphics, error prevention, history keeping, information exploration, Information Visualization, movements, Navigation, occlusion, overviews, programming-by-demonstration, rapid situation awareness, Testing, usability, user action feedback, User interfaces, Virtual reality, Visualization},
	isbn = {0272-1716},
	doi = {10.1109/MCG.2003.1242376},
	author = {Shneiderman, Ben}
}
@article {12084,
	title = {WLAN problems and solutions},
	journal = {Communications of the ACM},
	volume = {46},
	year = {2003},
	month = {2003///},
	pages = {31 - 34},
	author = {Housley,R. and Arbaugh, William A.}
}
@inbook {16131,
	title = {The World{\textquoteright}s Information in Digital Libraries},
	booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections},
	year = {2003},
	month = {2003///},
	pages = {149 - 149},
	publisher = {Morgan Kaufmann Publishers Inc.},
	organization = {Morgan Kaufmann Publishers Inc.},
	isbn = {978-1-55860-915-0},
	author = {Plaisant, Catherine and Marchimini,G. and Bruns,T. and Komlodi,A. and Campbell,L. and Rose,A. and Ding,G.M. and Beale Jr,J. and Nolet,V. and Shneiderman, Ben and others}
}
@article {17670,
	title = {Wavelength rerouting in optical networks, or the Venetian Routing problem},
	journal = {Journal of Algorithms},
	volume = {45},
	year = {2002},
	month = {2002/11//},
	pages = {93 - 125},
	abstract = {Wavelength rerouting has been suggested as a viable and cost-effective method to improve the blocking performance of wavelength-routed wavelength-division multiplexing (WDM) networks. This method leads to the following combinatorial optimization problem, dubbed Venetian Routing. Given a directed multigraph G along with two vertices s and t and a collection of pairwise arc-disjoint paths, we wish to find an st-path which arc-intersects the smallest possible number of the given paths. In this paper we prove the computational hardness of this problem even in various special cases, and present several approximation algorithms for its solution. In particular we show a non-trivial connection between Venetian Routing and Label Cover.},
	keywords = {Approximation algorithms, Label Cover, Optical networks, Shortest paths, Wavelength rerouting, Wavelength-division multiplexing},
	isbn = {0196-6774},
	doi = {10.1016/S0196-6774(02)00214-6},
	url = {http://www.sciencedirect.com/science/article/pii/S0196677402002146},
	author = {Caprara,Alberto and Italiano,Giuseppe F. and Mohan,G. and Panconesi,Alessandro and Srinivasan, Aravind}
}
@conference {15303,
	title = {Web question answering: is more always better?},
	booktitle = {Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval},
	series = {SIGIR {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {291 - 298},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper describes a question answering system that is designed to capitalize on the tremendous amount of data that is now available online. Most question answering systems use a wide variety of linguistic resources. We focus instead on the redundancy available in large corpora as an important resource. We use this redundancy to simplify the query rewrites that we need to use, and to support answer mining from returned snippets. Our system performs quite well given the simplicity of the techniques being utilized. Experimental results show that question answering accuracy can be greatly improved by analyzing more and more matching passages. Simple passage ranking and n-gram extraction techniques work well in our system making it efficient to use with many backend retrieval engines.},
	isbn = {1-58113-561-0},
	doi = {10.1145/564376.564428},
	url = {http://doi.acm.org/10.1145/564376.564428},
	author = {Dumais,Susan and Banko,Michele and Brill,Eric and Jimmy Lin and Ng,Andrew}
}
@conference {18765,
	title = {Web-based innovation alert services to support product design evolution},
	year = {2002},
	month = {2002///},
	abstract = {Technological innovations provide an opportunity toimprove product performance and reduce cost. Therefore,
design organizations are interested in monitoring technological
innovations. A large number of innovations are announced
every year. Monitoring them manually is very time consuming.
We are developing web-based innovation-alert services that can
be used to monitor and communicate information about
innovations relevant to a particular product design. In this
paper, we discuss the required infrastructure, relevant design
issues, and our approach to developing web-based innovation
alert services to support product design evolution. We also
describe a prototype innovation monitoring service for
computer components and an interactive tool to transform
semi-structured web contents into semantic representations in
XML.
},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.198.1039\&rep=rep1\&type=pdf},
	author = {Gupta,S.K. and Lin,E. and Lo,A. J. and Xu,C.}
}
@conference {18453,
	title = {What we have learned about fighting defects},
	booktitle = {Software Metrics, 2002. Proceedings. Eighth IEEE Symposium on},
	year = {2002},
	month = {2002///},
	pages = {249 - 258},
	abstract = {The Center for Empirically Based Software Engineering helps improve software development by providing guidelines for selecting development techniques, recommending areas for further research, and supporting software engineering education. A central activity toward achieving this goal has been the running of "e- Workshops" that capture expert knowledge with a minimum of overhead effort to formulate heuristics on a particular topic. The resulting heuristics are a useful summary of the current state of knowledge in an area based on expert opinion. This paper discusses the results to date of a series of e-Workshops on software defect reduction. The original discussion items are presented along with an encapsulated summary of the expert discussion. The reformulated heuristics can be useful both to researchers (for pointing out gaps in the current state of the knowledge requiring further investigation) and to practitioners (for benchmarking or setting expectations about development practices).},
	keywords = {based, Center, Computer, defect, development;, education;, electronic, Empiric, engineering, engineering;, eWorkshops;, for, heuristics;, reduction;, Science, software, workshops;},
	doi = {10.1109/METRIC.2002.1011343},
	author = {Shull, F. and Basili, Victor R. and Boehm,B. and Brown,A. W and Costa,P. and Lindvall,M. and Port,D. and Rus,I. and Tesoriero,R. and Zelkowitz, Marvin V}
}
@conference {12747,
	title = {Wide baseline image registration using prior information},
	booktitle = {Multimedia Signal Processing, 2002 IEEE Workshop on},
	year = {2002},
	month = {2002/12//},
	pages = {37 - 40},
	abstract = {Establishing correspondence between features in two images of the same scene taken from different viewing angles in a challenging problem in image processing and computer vision. However, its solution is an important step in many applications like wide baseline stereo, 3D model alignment, creation of panoramic views etc. In this paper, we propose a technique for registration of two images of a face obtained from different viewing angles. We show that prior information about the general characteristics of a face obtained from video sequences of different faces can be used to design a robust correspondence algorithm. The method works by matching 2D shapes of the different features of the face. A doubly stochastic matrix, representing the probability of match between the features, is derived using the Sinkhorn normalization procedure. The final correspondence is obtained by minimizing the probability of error of a match between the entire constellations of features in the two sets, thus taking into account the global spatial configuration of the features. The method is applied for creating holistic 3D models of a face from partial representations. Although this paper focuses primarily on faces, the algorithm can also be used for other objects with small modifications.},
	keywords = {2D, 3D, algorithm;, alignment;, angles;, baseline, Computer, configuration;, constellation;, correspondence, creation;, doubly, error, extraction;, Face, feature, global, holistic, image, images;, matching;, matrix;, model, models;, normalization, panoramic, probability;, procedure;, processes;, processing;, registration;, robust, sequences;, SHAPE, signal, Sinkhorn, spatial, statistics;, stereo;, Stochastic, video, view, viewing, vision;, wide},
	doi = {10.1109/MMSP.2002.1203242},
	author = {Chowdhury, AM and Chellapa, Rama and Keaton, T.}
}
@article {16720,
	title = {Word-level Alignment for Multilingual Resource Acquisition},
	year = {2002},
	month = {2002/04//},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {We present a simple, one-pass word alignment algorithm for parallel text. Our algorithm utilizes synchronous parsing and takes advantage of existing syntactic annotations. In our experiments the performance of this model is comparable to more complicated iterative methods. We discuss the challenges and potential benefits of using the model to train syntactic parsers for new languages.},
	keywords = {*LEARNING MACHINES, *MULTILINGUAL RESOURCES, *WORDS(LANGUAGE), ACQUISITION, algorithms, ALIGNMENT, BENEFITS, ITERATIONS, LANGUAGE, linguistics},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458782},
	author = {Lopez,Adam and Nossal,Michael and Hwa,Rebecca and Resnik, Philip}
}
@article {18291,
	title = {Watermarking scheme for image authentication},
	year = {2001},
	month = {2001/09/04/},
	abstract = {A digital watermarking process whereby an invisible watermark inserted into a host image is utilized to determine whether or not the image has been altered and, if so, where in the image such alteration occurred. The watermarking method includes the steps of providing a look-up table containing a plurality of coefficients and corresponding values; transforming the image into a plurality of blocks, wherein each block contains coefficients matching coefficients in the look-up table; and embedding the watermark in the image by performing the following substeps for at least some of the blocks: First, a coefficient is selected for insertion of a marking value representative of a corresponding portion of the watermark. Next, the value of the selected coefficient to used to identify a corresponding value in the look-up table. Finally, the identified coefficient is left unchanged if the corresponding value is the same as the marking value, and is changed if the corresponding value is...},
	url = {http://www.google.com/patents?id=BmoIAAAAEBAJ},
	author = {M. Wu and Liu,Bede},
	editor = {The Trustees of the University of Princeton}
}
@article {17945,
	title = {Web-based interactive design of freeform motions},
	journal = {Proceedings of the ASME 2001 Design Engineering Technical Conferences and Computers and Information in Engineering Conference},
	year = {2001},
	month = {2001///},
	author = {Li,ST and Ge,Q. J and Varshney, Amitabh}
}
@conference {18292,
	title = {What can we reasonably expect from watermarks?},
	booktitle = {Applications of Signal Processing to Audio and Acoustics, 2001 IEEE Workshop on the},
	year = {2001},
	month = {2001///},
	pages = {223 - 226},
	abstract = {Digital watermarking has been positioned as a solution to copyright protection of digital music, and some doubt exists about its ability to perform in this regard. A survey of watermarking applications assesses the technology{\textquoteright}s potential for copy protection, as well as other digital audio applications},
	keywords = {applications;audio, applications;digital, audio, coding;copy, data;, databases;music, hashing;steganography;watermarking, music;digital, of, protection;copyright, protection;copyright;music;security, protection;digital, watermarking;copy, watermarking;forensic, watermarking;music},
	doi = {10.1109/ASPAA.2001.969583},
	author = {Craver,S.A. and M. Wu and Liu,B.}
}
@inbook {17671,
	title = {Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem},
	booktitle = {Approximation Algorithms for Combinatorial Optimization},
	series = {Lecture Notes in Computer Science},
	volume = {1913},
	year = {2000},
	month = {2000///},
	pages = {71 - 84},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Wavelength rerouting has been suggested as a viable and cost-effective method to improve the blocking performance of wavelength-routed Wavelength-Division Multiplexing (WDM) networks. This method leads to the following combinatorial optimization problem, dubbed Venetian Routing. Given a directed multigraph G along with two vertices s and t and a collection of pairwise arc-disjoint paths, we wish to find an st -path which arc-intersects the smallest possible number of such paths. In this paper we prove the computational hardness oft his problem even in various special cases, and present several approximation algorithms for its solution. In particular we show a non-trivial connection between Venetian Routing and Label Cover.},
	isbn = {978-3-540-67996-7},
	url = {http://dx.doi.org/10.1007/3-540-44436-X_9},
	author = {Caprara,Alberto and Italiano,Giuseppe and Mohan,G. and Panconesi,Alessandro and Srinivasan, Aravind},
	editor = {Jansen,Klaus and Khuller, Samir}
}
@conference {15052,
	title = {Web based progressive transmission for browsing remotely sensed imagery},
	booktitle = {Geoscience and Remote Sensing Symposium, 2000. Proceedings. IGARSS 2000. IEEE 2000 International},
	volume = {2},
	year = {2000},
	month = {2000///},
	pages = {591 -593 vol.2 - 591 -593 vol.2},
	abstract = {This paper describes an image representation technique that entails progressive refinement of user specified regions of interest (ROI) of large images. Progressive refinement to original quality can be accomplished in theory. However, due to heavy burden on storage resources for the authors{\textquoteright} applications, they restrict the refinement to about 25\% of the original data resolution. A wavelet decomposition of the data combined with scalar and vector quantization (VQ) of the high frequency components and JPEG/DCT compression of low frequency component is used as representation framework. Their software will reconstruct the region selected by the user from its wavelet decomposition such that it fills up the preview window with the appropriate subimages at the desired resolution, including full resolution stored for preview. Further refinement from the first preview can be obtained progressively by transmitting high frequency coefficients from low resolution to high resolution which are compressed by variant of vector quantization called model-based VQ (MVQ). The user will have an option for progressive build up of the ROIs until full resolution stored or terminate the transmission at any time during the progressive refinement},
	keywords = {based, decomposition;geophysical, image;model-based, interest;remote, interest;vector, mapping;user, mapping;vector, measurement, of, processing;geophysical, processing;image, Progressive, quantisation;wavelet, quantization;wavelet, refinement;region, regions, representation;land, representation;remote, sensing;scalar;terrain, sensing;terrain, signal, specified, specified;user, surface;large, technique;image, techniques;image, transforms;, transmission;browsing;geophysical, VQ;progressive, Web},
	doi = {10.1109/IGARSS.2000.861640},
	author = {Mareboyana,M. and Srivastava,S. and JaJa, Joseph F.}
}
@conference {16455,
	title = {Web Query Optimizer},
	booktitle = {Data Engineering, International Conference on},
	year = {2000},
	month = {2000///},
	pages = {661 - 661},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {We demonstrate a Web Query Optimizer (WQO) within an architecture of mediators and wrappers, for WebSources of limited capability in a wide area environment. The WQO has several innovative features including a CBR (capability based rewriting) Tool, an enhanced randomized relational optimizer extended to a Web environment, and a WebWrapper cost model that can provide relevant metrics for accessing WebSources. The prototype has been tested against a number of WebSources.},
	doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2000.839484},
	author = {Zadorozhny,Vladimir and Bright,Laura and Raschid, Louiqa and Urhan,Tolga and Vidal,Maria Esther}
}
@conference {18761,
	title = {A web-based process/material advisory system},
	year = {2000},
	month = {2000///},
	abstract = {This paper describes a web-based process/material advisorysystem that can be used during conceptual design. Given a set of
design requirements for a part during conceptual design stage, our
system produces process sequences that can meet the design
requirements. Quite often during conceptual design stage, design
requirements are not precisely defined. Therefore, we allow users to
describe design requirements in terms of parameter ranges. Parameter
ranges are used to capture uncertainties in design requirements. Our
system accounts for uncertainties in design requirements in generating
and evaluating process/material combinations. Our system uses a two
step algorithm. During the first step, we generate a material/process
option tree. This tree represents various process/material options that
can be used to meet the given set of design requirements. During the
second step, we evaluate various alternative process/material options
using a depth first branch and bound algorithm to identify and
recommend the least expensive process/material combination to the
designer. Our system can be accessed on the World Wide Web using a
standard browser. Our system allows designs to consider a wide
variety of process/material options during the conceptual design stage
and allows them to find the most cost-effective combination. By
selecting the process/material combination during the early design
stages, designers can ensure that the detailed design is compatible with
all of the process constraints for the selected process.
},
	url = {http://www.mel.nist.gov/msidlibrary/doc/imece_feng.pdf},
	author = {Chen,Y. S. and Gupta,S.K. and Feng,S.}
}
@article {16810,
	title = {WebView materialization},
	journal = {SIGMOD Rec.},
	volume = {29},
	year = {2000},
	month = {2000/05//},
	pages = {367 - 378},
	abstract = {A WebView is a web page automatically created from base data typically stored in a DBMS. Given the multi-tiered architecture behind database-backed web servers, we have the option of materializing a WebView inside the DBMS, at the web server, or not at all, always computing it on the fly (virtual). Since WebViews must be up to date, materialized WebViews are immediately refreshed with every update on the base data. In this paper we compare the three materialization policies (materialized inside the DBMS, materialized at the web server and virtual) analytically, through a detailed cost model, and quantitatively, through extensive experiments on an implemented system. Our results indicate that materializing at the web server is a more scalable solution and can facilitate an order of magnitude more users than the virtual and materialized inside the DBMS policies, even under high update workloads.},
	isbn = {0163-5808},
	doi = {10.1145/335191.335430},
	url = {http://doi.acm.org/10.1145/335191.335430},
	author = {Labrinidis,Alexandros and Roussopoulos, Nick}
}
@article {16018,
	title = {What does it take to refer},
	journal = {Journal of Consciousness Studies},
	volume = {7},
	year = {2000},
	month = {2000///},
	pages = {67 - 9},
	author = {Perlis, Don}
}
@article {16014,
	title = {What does it take to refer? a reply to Bojadziev},
	journal = {Journal of Consciousness Studies},
	volume = {7},
	year = {2000},
	month = {2000///},
	pages = {67 - 69},
	author = {Perlis, Don}
}
@article {14898,
	title = {What makes viewpoint invariant properties perceptually salient?: A computational perspective},
	journal = {Perceptual organization for artificial vision systems},
	year = {2000},
	month = {2000///},
	pages = {121 - 138},
	abstract = {Many perceptually salient image properties identified by the Gestalt psychologists, such as collinearity, parallelism, and good continuation, are viewpoint invariant. That is, there exist scene structures that always produce images with these properties regardless of viewpoint, while other scene structures virtually never produce these properties. This has suggested that the perceptual salience of viewpoint invariants is due to the leverage they provide for inferring 3-D properties of objects and scenes. However, we show that viewpoint invariance is not sufficient to distinguish these Gestalt properties; one can define an infinite number of viewpoint invariant properties that are not perceptually salient. We then show that generally, the perceptually salient viewpoint invariant properties are minimal, in the sense that they can be derived using less image information than non-salient properties. Computations that use minimal properties are more tractable than those requiring higher order properties. This provides support for the hypothesis that the biological relevance of an image property is determined both by the extent to which it provides information about the world and by the ease with which this property can be computed.},
	doi = {10.1007/978-1-4615-4413-5_8},
	author = {Jacobs, David W.}
}
@article {12081,
	title = {Windows of Vulnerability: A Case Study Analysis},
	volume = {33},
	year = {2000},
	month = {2000///},
	pages = {52 - 59},
	abstract = {The authors propose a life-cycle model for system vulnerabilities, applying to three case studies to show how systems remain vulnerable long after security fixes are available. Complex information and communication systems give rise to design, implementation, and management errors, leading to a vulnerability in an information technology product that can allow security policy violations. Using their vulnerability life-cycle model, the authors present a case study analysis of specific computer vulnerabilities. For each case, the authors provide background information about the vulnerability, such as how attackers exploited it and which systems were affected. They tie the case to the life-cycle model by identifying the dates for each state within the model. Finally, they use a histogram of reported intrusions to show the life of the vulnerability and conclude with an analysis specific to the particular vulnerability.},
	isbn = {0018-9162},
	author = {Arbaugh, William A. and Fithen,William L. and McHugh,John}
}
@article {15516,
	title = {The Workshop on Logic-Based Artificial Intelligence},
	journal = {AI Magazine},
	volume = {20},
	year = {1999},
	month = {1999/12/15/},
	pages = {97 - 97},
	abstract = {The Workshop on Logic-Based Artificial Intelligence},
	isbn = {0738-4602},
	doi = {10.1609/aimag.v20i4.1484},
	url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1484},
	author = {Minker, Jack}
}
@article {17914,
	title = {Walkthroughs of complex environments using image-based simplification},
	journal = {Computers \& Graphics},
	volume = {22},
	year = {1998},
	month = {1998/02/25/},
	pages = {55 - 69},
	abstract = {We present an image-based technique to accelerate the navigation in complex static environments. We perform an image-space simplification of each sample of the scene taken at a particular viewpoint and dynamically combine these simplified samples to produce images for arbitrary viewpoints. Since the scene is converted into a bounded complexity representation in the image space, with the base images rendered beforehand, the rendering speed is relatively insensitive to the complexity of the scene. The proposed method correctly simulates the kinetic depth effect (parallax), occlusion, and can resolve the missing visibility information. This paper describes a suitable representation for the samples, a specific technique for simplifying them, and different morphing methods for combining the sample information to reconstruct the scene. We use hardware texture mapping to implement the image-space warping and hardware affine transformations to compute the view-dependent warping function.},
	keywords = {image-based rendering, image morphing, virtual walkthroughs, visibility, image compositing},
	isbn = {0097-8493},
	doi = {10.1016/S0097-8493(97)00083-6},
	url = {http://www.sciencedirect.com/science/article/pii/S0097849397000836},
	author = {Darsa,L. and Costa,B. and Varshney, Amitabh}
}
@conference {18290,
	title = {Watermarking for image authentication},
	booktitle = {Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on},
	volume = {2},
	year = {1998},
	month = {1998/10//},
	pages = {437 -441 vol.2 - 437 -441 vol.2},
	abstract = {A data embedding method is proposed for image authentication based on table look-up in frequency domain. A visually meaningful watermark and a set of simple features are embedded invisibly in the marked image, which can be stored in the compressed form. The scheme can detect and localize alterations of the original image, such as the tampering of images exported from a digital camera},
	keywords = {alterations, analysis;image, analysis;message, authentication;image, authentication;table, camera;frequency, coding;image, colour, compression;frequency-domain, detection;alterations, domain;image, EMBEDDING, image, image;compressed, image;ownership, localisation;color, look-up;watermarking;data, lookup;, method;digital, protection;table, storage;data, tampering;marked},
	doi = {10.1109/ICIP.1998.723413},
	author = {M. Wu and Liu,Bede}
}
@conference {17269,
	title = {Is the Web really different from everything else?},
	booktitle = {CHI 98 conference summary on Human factors in computing systems},
	series = {CHI {\textquoteright}98},
	year = {1998},
	month = {1998///},
	pages = {92 - 93},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {design, user experience, World Wide Web},
	isbn = {1-58113-028-7},
	doi = {10.1145/286498.286545},
	url = {http://doi.acm.org/10.1145/286498.286545},
	author = {Shneiderman, Ben and Nielsen,Jakob and Butler,Scott and Levi,Michael and Conrad,Frederick}
}
@inbook {14277,
	title = {What is computed by structure from motion algorithms?},
	booktitle = {Computer Vision {\textemdash} ECCV{\textquoteright}98},
	series = {Lecture Notes in Computer Science},
	volume = {1406},
	year = {1998},
	month = {1998///},
	pages = {359 - 375},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In the literature we find two classes of algorithms which, on the basis of two views of a scene, recover the rigid transformation between the views and subsequently the structure of the scene. The first class contains techniques which require knowledge of the correspondence or the motion field between the images and are based on the epipolar constraint. The second class contains so-called direct algorithms which require knowledge about the value of the flow in one direction only and are based on the positive depth constraint. Algorithms in the first class achieve the solution by minimizing a function representing deviation from the epipolar constraint while direct algorithms find the 3D motion that, when used to estimate depth, produces a minimum number of negative depth values. This paper presents a stability analysis of both classes of algorithms. The formulation is such that it allows comparison of the robustness of algorithms in the two classes as well as within each class. Specifically, a general statistical model is employed to express the functions which measure the deviation from the epipolar constraint and the number of negative depth values, and these functions are studied with regard to their topographic structure, specifically as regards the errors in the 3D motion parameters at the places representing the minima of the functions. The analysis shows that for algorithms in both classes which estimate all motion parameters simultaneously, the obtained solution has an error such that the projections of the translational and rotational errors on the image plane are perpendicular to each other. Furthermore, the estimated projection of the translation on the image lies on a line through the origin and the projection of the real translation.},
	isbn = {978-3-540-64569-6},
	url = {http://dx.doi.org/10.1007/BFb0055678},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.},
	editor = {Burkhardt,Hans and Neumann,Bernd}
}
@conference {13921,
	title = {When Two Hands Are Better Than One: Enhancing Collaboration Using Single Display Groupware. CHI{\textquoteright}98},
	booktitle = {Extended Abstracts},
	year = {1998},
	month = {1998///},
	pages = {287 - 288},
	author = {Stewart,J. and Raybourn,E. and Bederson, Benjamin B. and Druin, Allison}
}
@conference {12047,
	title = {Which shape from motion?},
	booktitle = {Sixth International Conference on Computer Vision, 1998},
	year = {1998},
	month = {1998/01/04/7},
	pages = {689 - 695},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In a practical situation, the rigid transformation relating different views is recovered with errors. In such a case, the recovered depth of the scene contains errors, and consequently a distorted version of visual space is computed. What then are meaningful shape representations that can be computed from the images? The result presented in this paper states that if the rigid transformation between different views is estimated in a way that gives rise to a minimum number of negative depth values, then at the center of the image affine shape can be correctly computed. This result is obtained by exploiting properties of the distortion function. The distortion model turns out to be a very powerful tool in the analysis and design of 3D motion and shape estimation algorithms, and as a byproduct of our analysis we present a computational explanation of psychophysical results demonstrating human visual space distortion from motion information},
	keywords = {3D motion estimation, affine shape, Algorithm design and analysis, Computer vision, distorted version, distortion function, human visual space distortion, HUMANS, Image motion analysis, image representation, Information analysis, Layout, Motion analysis, Motion estimation, motion information, Psychology, rigid transformation, SHAPE, shape estimation, shape representations, State estimation, visual space},
	isbn = {81-7319-221-9},
	doi = {10.1109/ICCV.1998.710792},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@article {16661,
	title = {WordNet and class-based probabilities},
	journal = {WordNet: An electronic lexical database},
	year = {1998},
	month = {1998///},
	pages = {239 - 263},
	author = {Resnik, Philip}
}
@conference {16499,
	title = {Wrapper generation for Web accessible data sources},
	booktitle = {3rd IFCIS International Conference on Cooperative Information Systems, 1998. Proceedings},
	year = {1998},
	month = {1998/08/22/22},
	pages = {14 - 23},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {There is an increase in the number of data sources that can be queried across the WWW. Such sources typically support HTML forms-based interfaces and search engines query collections of suitably indexed data. The data is displayed via a browser: One drawback to these sources is that there is no standard programming interface suitable for applications to submit queries. Second, the output (answer to a query) is not well structured. Structured objects have to be extracted from the HTML documents which contain irrelevant data and which may be volatile. Third, domain knowledge about the data source is also embedded in HTML documents and must be extracted. To solve these problems, we present technology to define and (automatically) generate wrappers for Web accessible sources. Our contributions are as follows: (1) Defining a wrapper interface to specify the capability of Web accessible data sources. (2) Developing a wrapper generation toolkit of graphical interfaces and specification languages to specify the capability of sources and the functionality of the wrapper (3) Developing the technology to automatically generate a wrapper appropriate to the Web accessible source, from the specifications.},
	keywords = {application program interfaces, data mining, Databases, Educational institutions, Electrical capacitance tomography, HTML, HTML documents, Internet, Query processing, Read only memory, Search engines, Specification languages, Uniform resource locators, World Wide Web, wrapper generation toolkit, WWW},
	isbn = {0-8186-8380-5},
	doi = {10.1109/COOPIS.1998.706180},
	author = {Gruser,J. and Raschid, Louiqa and Vidal,M. E and Bright,L.}
}
@article {17728,
	title = {On the weighting method for least squares problems with linear equality constraints},
	journal = {BIT Numerical Mathematics},
	volume = {37},
	year = {1997},
	month = {1997///},
	pages = {961 - 967},
	abstract = {The weighting method for solving a least squares problem with linear equality constraints multiplies the constraints by a large number and appends them to the top of the least squares problem, which is then solved by standard techniques. In this paper we give a new analysis of the method, based on the QR decomposition, that exhibits many features of the algorithm. In particular it suggests a natural criterion for chosing the weighting factor.},
	doi = {10.1007/BF02510363},
	author = {Stewart, G.W.}
}
@conference {16205,
	title = {Where is information visualization technology going?},
	booktitle = {Proceedings of the 9th annual ACM symposium on User interface software and technology},
	series = {UIST {\textquoteright}96},
	year = {1996},
	month = {1996///},
	pages = {75 - 77},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {0-89791-798-7},
	doi = {10.1145/237091.237101},
	url = {http://doi.acm.org/10.1145/237091.237101},
	author = {Hasco{\"e}t-Zizi,Mountaz and Ahlberg,Chris and Korfhage,Robert and Plaisant, Catherine and Chalmers,Matthew and Rao,Ramana}
}
@inbook {15829,
	title = {What is Fundamental for Markov Chains: First Passage Times, Fundamental Matrices, and Group Generalized Inverses},
	booktitle = {Proceedings of the Second International Workshop on Markov ChainsProceedings of the Second International Workshop on Markov Chains},
	year = {1995},
	month = {1995///},
	pages = {151 - 161},
	publisher = {Kluwer Academic Publishers},
	organization = {Kluwer Academic Publishers},
	author = {Heyman,D. P. and O{\textquoteright}Leary, Dianne P.},
	editor = {Stewart,W.}
}
@article {15830,
	title = {Why Broyden{\textquoteright}s Nonsymmetric Method Terminates on Linear Equations},
	journal = {SIAM Journal on Optimization},
	volume = {5},
	year = {1995},
	month = {1995///},
	pages = {231 - 235},
	author = {O{\textquoteright}Leary, Dianne P.}
}
@article {17512,
	title = {Windows of opportunity in electronic classrooms},
	journal = {Communications of the ACM},
	volume = {38},
	year = {1995},
	month = {1995/11//},
	pages = {19 - 24},
	abstract = {Paradigm-shifting landmark buildings are cherished by their occupants and remembered because they reshape our expectations of schools, homes, or offices. Classic examples include Thomas Jefferson{\textquoteright}s communal design of the {\textquotedblleft}academical village{\textquotedblright} at the University of Virginia where faculty and students lived close to classrooms, Frank Lloyd Wright{\textquoteright}s organic harmony with nature in Fallingwater (in western Pennsylvania) where the waterfall sounds and leafy surroundings offered a stress-reducing getaway for an urban executive, or Kevin Roche{\textquoteright}s open glass-walled Ford Foundation (in New York City) that promoted new team-oriented management strategies.},
	isbn = {0001-0782},
	doi = {10.1145/219717.219725},
	url = {http://doi.acm.org/10.1145/219717.219725},
	author = {Shneiderman, Ben and Alavi,Maryann and Norman,Kent and Borkowski,Ellen Yu}
}
@conference {15967,
	title = {What Experts Deny, Novices Must Understand},
	booktitle = {In 3rd International Workshop on Human and Machine Cognition},
	year = {1994},
	month = {1994///},
	author = {Perlis, Don and Miller,M. and Perlis, Don}
}
@article {11987,
	title = {What I have learned},
	journal = {CVGIP: Image Understanding},
	volume = {60},
	year = {1994},
	month = {1994///},
	pages = {74 - 85},
	author = {Aloimonos, J.}
}
@article {13483,
	title = {Workshop summary: AAAI-92 Workshop on Constraining Learning with Prior Knowledge},
	journal = {ACM SIGART Bulletin},
	volume = {4},
	year = {1993},
	month = {1993/07//},
	pages = {11 - 13},
	isbn = {0163-5719},
	doi = {10.1145/152947.152948},
	url = {http://doi.acm.org/10.1145/152947.152948},
	author = {desJardins, Marie}
}
@article {16229,
	title = {When an Intermediate View Matters a 2D-browser Experiment},
	journal = {Institute for Systems Research Technical Reports},
	year = {1992},
	month = {1992///},
	abstract = {The browsing of two dimensional images can be found in a large number of application. When the image to be viewed is much larger than the screen available, a two dimensional browser has to be provided to allow users to access all parts of the image. We show the diversity of tasks and systems available and the need for 2D browser design guidelines. In the context of a microscope image browser, we investigate one common technique consisting of a global view of the whole image, coupled to a detailed, magnified view of part of the image. In particular we look at the benefits of providing an intermediate view when the detail- to-overview ratio over 20:1. Our experience is also a good example of a real world application for which added features and added hardware need to be justified.},
	keywords = {Human computer interaction, Supervisory control, Systems Integration},
	url = {http://drum.lib.umd.edu/handle/1903/5300},
	author = {Plaisant, Catherine and Carr,David A and Hasegawa,Hiroaki}
}
@conference {16686,
	title = {Wordnet and distributional analysis: A class-based approach to lexical discovery},
	booktitle = {AAAI workshop on statistically-based natural language processing techniques},
	year = {1992},
	month = {1992///},
	pages = {56 - 64},
	author = {Resnik, Philip}
}
@article {17510,
	title = {Window control strategies for hypertext traversal: An empirical study},
	journal = {Proc. 29th Annual ACM DC Technical Symposium},
	year = {1991},
	month = {1991///},
	abstract = {Nowadays, larger and higher resolution screens supporting multiple windows are widely available. They are often used to traverse hypertext databases for fact retrieval, education or casual browsing. This paper describes a study comparing two methods of window control strategies for article placement in four, equal sized and tiled windows (By tiled we mean non-overlapping, non-movable and non-resizable windows, which together cover the entire screen.) The first placement strategy - Automatic Panning (A P) - was controlled by the system software and the second placement strategy - User Controlled Placement (UCP) - trasferred control to the users. The task required subjects to answer questions about the content of a hypertext. Statistical analysis shows that subjective preference was significantly higher and amount of backtracking was significantly lower for the user controlled placement. Speed differences did not prove to be significant, although there was consistent tendency favoring the automatic pa nning strategy.},
	author = {Lifshitz,J. and Shneiderman, Ben}
}
@conference {12797,
	title = {When is {\textquoteleft}partial{\textquoteright} adequate? A logic-based proof technique using partial specifications},
	booktitle = {Logic in Computer Science, 1990. LICS {\textquoteright}90, Proceedings., Fifth Annual IEEE Symposium on e},
	year = {1990},
	month = {1990/06/04/7},
	pages = {440 - 449},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A technique is presented for ascertaining when a (finite-state) partial process specification is adequate, in the sense of being specified enough, for contexts in which it is to be used. The method relies on the automatic generation of a modal formula from the partial specification; if the remainder of the network satisfies this formula, then any process that meets the specification is guaranteed to ensure correct behavior of the overall system. Using the results, the authors develop compositional proof rules for establishing the correctness of networks of parallel processes and illustrate their use with several examples},
	keywords = {Calculus, Carbon capture and storage, compositional proof rules, Computer science, Concurrent computing, Context, correctness, formal specification, logic-based proof technique, modal formula, parallel processes, partial process specification, partial specifications, specification adequacy, State-space methods, Technological innovation},
	isbn = {0-8186-2073-0},
	doi = {10.1109/LICS.1990.113768},
	author = {Cleaveland, Rance and Steffen,B.}
}
@article {17505,
	title = {We can design better user interfaces: A review of human-computer interaction styles},
	journal = {Ergonomics},
	volume = {31},
	year = {1988},
	month = {1988///},
	pages = {699 - 710},
	abstract = {The widespread use of computers has opened a new dimension of application for the ergonomic sciences. This review recommends three pillars to support the user interface design process: guidelines documents, User Interface Management Systems, and usability labs for iterative testing. Then it presents five primary interaction styles: menu selection, form fill-in, command language, natural language and direct manipulation. The author encourages greater attention to direct manipulation in which the objects and actions are visible, the actions are invoked by selection or pointing, and the impact is immediately visible and reversible.The widespread use of computers has opened a new dimension of application for the ergonomic sciences. This review recommends three pillars to support the user interface design process: guidelines documents, User Interface Management Systems, and usability labs for iterative testing. Then it presents five primary interaction styles: menu selection, form fill-in, command language, natural language and direct manipulation. The author encourages greater attention to direct manipulation in which the objects and actions are visible, the actions are invoked by selection or pointing, and the impact is immediately visible and reversible.
},
	isbn = {0014-0139},
	doi = {10.1080/00140138808966713},
	url = {http://www.tandfonline.com/doi/abs/10.1080/00140138808966713},
	author = {Shneiderman, Ben}
}
@article {17511,
	title = {Window control strategies for on-line text traversal},
	journal = {Department of Computer Science and Human Computer Interaction Laboratory, University of Maryland, College Park, MD (correspondence with B. Schneiderman)},
	year = {1987},
	month = {1987///},
	abstract = {Larger and higher resolution screens that support multiple windows are now widely available. They are often used to traverse hypertext databases for fact retrieval, education or casual browsing. This paper introduces window control strategies that we implemented, describes their cognitive complexity, and characterizes the tasks that users might encounter. An infomal usage by dozens of visitors and a usability test with four subjects performing information search tasks revealed the limitations of several strategies and guided us to select user control of article placement in a tiled non-overlapping multiple window display.},
	author = {Lifshitz,K. and Shneiderman, Ben}
}
