@article {19716,
	title = {TIGRFAMs and Genome Properties in 2013.},
	journal = {Nucleic Acids Res},
	volume = {41},
	year = {2013},
	month = {2013 Jan},
	pages = {D387-95},
	abstract = {<p>TIGRFAMs, available online at http://www.jcvi.org/tigrfams is a database of protein family definitions. Each entry features a seed alignment of trusted representative sequences, a hidden Markov model (HMM) built from that alignment, cutoff scores that let automated annotation pipelines decide which proteins are members, and annotations for transfer onto member proteins. Most TIGRFAMs models are designated equivalog, meaning they assign a specific name to proteins conserved in function from a common ancestral sequence. Models describing more functionally heterogeneous families are designated subfamily or domain, and assign less specific but more widely applicable annotations. The Genome Properties database, available at http://www.jcvi.org/genome-properties, specifies how computed evidence, including TIGRFAMs HMM results, should be used to judge whether an enzymatic pathway, a protein complex or another type of molecular subsystem is encoded in a genome. TIGRFAMs and Genome Properties content are developed in concert because subsystems reconstruction for large numbers of genomes guides selection of seed alignment sequences and cutoff values during protein family construction. Both databases specialize heavily in bacterial and archaeal subsystems. At present, 4284 models appear in TIGRFAMs, while 628 systems are described by Genome Properties. Content derives both from subsystem discovery work and from biocuration of the scientific literature.</p>},
	keywords = {Databases, Protein, Genome, Archaeal, Genome, Bacterial, Genomics, Internet, Markov chains, Molecular Sequence Annotation, Proteins, sequence alignment},
	issn = {1362-4962},
	doi = {10.1093/nar/gks1234},
	author = {Haft, Daniel H and Jeremy D Selengut and Richter, Roland A and Harkins, Derek and Basu, Malay K and Beck, Erin}
}
@conference {17630,
	title = {Networking lessons: From computers to water},
	booktitle = {2012 Fourth International Conference on Communication Systems and Networks (COMSNETS)},
	year = {2012},
	month = {2012/01/03/7},
	pages = {1 - 6},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {As an instance of using IT to green non-IT domains, we consider the question whether lessons from computer networking can be applied in water distribution networks to improve their energy footprint and/or efficiency. Our contributions in this work are: (i) we identify several areas where principles from computer networking can be used to better water distribution; (ii) we focus on a specific infrastructure enhancement problem caused by increasing demands on a water utility network and present solutions (similar to those used in computer networks) that optimize both operational expenditure and total cost of ownership. We validate our solutions through simulations and compare their efficacy against techniques that are traditionally used in enhancing water networks. Our results show that lessons from computer networks can help in enhancing water networks.},
	keywords = {Biological cells, computer networking, Computer networks, COMPUTERS, energy footprint, Genetic algorithms, green nonIT domains, infrastructure enhancement problem, Internet, network theory (graphs), networking lessons, planning, pricing, water distribution networks, water supply, water utility network},
	isbn = {978-1-4673-0296-8},
	doi = {10.1109/COMSNETS.2012.6151373},
	author = {Narayanan,I. and Sarangan,V. and Vasan, A. and Srinivasan, Aravind and Sivasubramaniam,A.}
}
@conference {19465,
	title = {You{\textquoteright}Re Capped: Understanding the Effects of Bandwidth Caps on Broadband Use in the Home},
	booktitle = {SIGCHI {\textquoteright}12},
	series = {CHI {\textquoteright}12},
	year = {2012},
	month = {2012///},
	pages = {3021 - 3030},
	publisher = {ACM},
	organization = {ACM},
	abstract = {Bandwidth caps, a limit on the amount of data users can upload and download in a month, are common globally for both home and mobile Internet access. With caps, each bit of data consumed comes at a cost against a monthly quota or a running tab. Yet, relatively little work has considered the implications of this usage-based pricing model on the user experience. In this paper, we present results from a qualitative study of households living with bandwidth caps. Our findings suggest home users grapple with three uncertainties regarding their bandwidth usage: invisible balances, mysterious processes, and multiple users. We discuss how these uncertainties impact their usage and describe the potential for better tools to help monitor and manage data caps. We conclude that as a community we need to cater for users under Internet cost constraints.},
	keywords = {Bandwidth, bandwidth cap, data cap, Internet, metered use, pricing, usage-based billing, usage-based pricing},
	isbn = {978-1-4503-1015-4},
	url = {http://doi.acm.org/10.1145/2207676.2208714},
	author = {Marshini Chetty and Banks, Richard and Brush, A.J. and Donner, Jonathan and Grinter, Rebecca}
}
@conference {16407,
	title = {Comparing Social Tags to Microblogs},
	booktitle = {Privacy, security, risk and trust (passat), 2011 IEEE third international conference on and 2011 IEEE third international conference on social computing (socialcom)},
	year = {2011},
	month = {2011/10//},
	pages = {1380 - 1383},
	abstract = {As Internet usage and e-commerce grow, online social media serve as popular outlets for consumers to express sentiments about products. On Amazon, users can tag an album with a keyword, while tweets on Twitter represent a more natural conversation. The differing natures of these media make them difficult to compare. This project collects and analyzes social media data for newly released music albums and develops new methods of comparing a product{\textquoteright}s social tags to its microblogging data. It explores information retrieval and rank correlation measures as similarity measures, as well as term frequency-inverse document frequency (tf-idf) processing. We conclude that with sufficient Twitter activity about an album, social tags do represent the most frequent conversations occurring on Twitter. These results imply that managers can collect and analyze tags and use them as a proxy for most common consumer feedback from microblogging, which is more difficult to collect.},
	keywords = {(online);, album;online, commerce;information, correlation, document, frequency-inverse, frequency;electronic, Internet, measure;social, measures;similarity, media;rank, networking, retrieval;microblog;music, retrieval;music;social, social, tags;term, usage;Twitter;e-commerce;information},
	doi = {10.1109/PASSAT/SocialCom.2011.52},
	author = {Lai,V. and Rajashekar,C. and Rand, William}
}
@conference {17861,
	title = {Decentralized, accurate, and low-cost network bandwidth prediction},
	booktitle = {2011 Proceedings IEEE INFOCOM},
	year = {2011},
	month = {2011/04/10/15},
	pages = {6 - 10},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The distributed nature of modern computing makes end-to-end prediction of network bandwidth increasingly important. Our work is inspired by prior work that treats the Internet and bandwidth as an approximate tree metric space. This paper presents a decentralized, accurate, and low cost system that predicts pairwise bandwidth between hosts. We describe an algorithm to construct a distributed tree that embeds bandwidth measurements. The correctness of the algorithm is provable when driven by precise measurements. We then describe three novel heuristics that achieve high accuracy for predicting bandwidth even with imprecise input data. Simulation experiments with a real-world dataset confirm that our approach shows high accuracy with low cost.},
	keywords = {accuracy, approximate tree metric space, Bandwidth, bandwidth allocation, bandwidth measurement, decentralized low cost system, distributed tree, end-to-end prediction, Extraterrestrial measurements, Internet, low-cost network bandwidth prediction, Measurement uncertainty, pairwise bandwidth, Peer to peer computing, Prediction algorithms, trees (mathematics)},
	isbn = {978-1-4244-9919-9},
	doi = {10.1109/INFCOM.2011.5935251},
	author = {Sukhyun Song and Keleher,P. and Bhattacharjee, Bobby and Sussman, Alan}
}
@article {15470,
	title = {Developing a Single Model and Test Prioritization Strategies for Event-Driven Software},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {37},
	year = {2011},
	month = {2011///},
	pages = {48 - 64},
	abstract = {Event-Driven Software (EDS) can change state based on incoming events; common examples are GUI and Web applications. These EDSs pose a challenge to testing because there are a large number of possible event sequences that users can invoke through a user interface. While valuable contributions have been made for testing these two subclasses of EDS, such efforts have been disjoint. This work provides the first single model that is generic enough to study GUI and Web applications together. In this paper, we use the model to define generic prioritization criteria that are applicable to both GUI and Web applications. Our ultimate goal is to evolve the model and use it to develop a unified theory of how all EDS should be tested. An empirical study reveals that the GUI and Web-based applications, when recast using the new model, show similar behavior. For example, a criterion that gives priority to all pairs of event interactions did well for GUI and Web applications; another criterion that gives priority to the smallest number of parameter value settings did poorly for both. These results reinforce our belief that these two subclasses of applications should be modeled and studied together.},
	keywords = {EDS, event-driven software, graphical user interface, Graphical user interfaces, GUI testing, Internet, program testing, service-oriented architecture, test prioritization strategy, Web application testing},
	isbn = {0098-5589},
	doi = {10.1109/TSE.2010.12},
	author = {Bryce,R.C. and Sampath,S. and Memon, Atif M.}
}
@conference {17643,
	title = {Predicting Trust and Distrust in Social Networks},
	booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)},
	year = {2011},
	month = {2011/10/09/11},
	pages = {418 - 424},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {As user-generated content and interactions have overtaken the web as the default mode of use, questions of whom and what to trust have become increasingly important. Fortunately, online social networks and social media have made it easy for users to indicate whom they trust and whom they do not. However, this does not solve the problem since each user is only likely to know a tiny fraction of other users, we must have methods for inferring trust - and distrust - between users who do not know one another. In this paper, we present a new method for computing both trust and distrust (i.e., positive and negative trust). We do this by combining an inference algorithm that relies on a probabilistic interpretation of trust based on random graphs with a modified spring-embedding algorithm. Our algorithm correctly classifies hidden trust edges as positive or negative with high accuracy. These results are useful in a wide range of social web applications where trust is important to user behavior and satisfaction.},
	keywords = {distrust prediction, Electronic publishing, Encyclopedias, graph theory, inference algorithm, Inference algorithms, inference mechanisms, Internet, negative trust, online social networks, positive trust, Prediction algorithms, probability, random graphs, security of data, social media, social networking (online), spring-embedding algorithm, Training, trust inference, trust probabilistic interpretation, user behavior, user satisfaction, user-generated content, user-generated interactions},
	isbn = {978-1-4577-1931-8},
	doi = {10.1109/PASSAT/SocialCom.2011.56},
	author = {DuBois,T. and Golbeck,J. and Srinivasan, Aravind}
}
@conference {18578,
	title = {Joint analysis of network incidents and intradomain routing changes},
	booktitle = {Network and Service Management (CNSM), 2010 International Conference on},
	year = {2010},
	month = {2010/10//},
	pages = {198 - 205},
	abstract = {This paper studies how intradomain routing instability relates to events in network trouble tickets for two networks: a VPN provider and the Internet2 backbone network. Our goal in performing this joint analysis of routing and trouble tickets is to better understand the likely underlying causes of intradomain routing instability. We develop a method to correlate trouble tickets with instability events and find that, although unplanned events last longer than scheduled maintenance, there is no single underlying cause for most instability, and that these causes differ across networks. In comparison to a similar study from Labovitz et al. from ten years ago, we find that, while certain causes of instability such as maintenance and circuit problems remain significant, power issues have become much less prevalent, and software-related problems have become more common.},
	keywords = {correlation method, Internet, Internet2 backbone network, intradomain routing instability, network maintenance, network routing joint analysis, telecommunication network routing, Virtual private networks, VPN provider},
	doi = {10.1109/CNSM.2010.5691306},
	author = {Medem,A. and Teixeira,R. and Feamster, Nick and Meulle,M.}
}
@article {12464,
	title = {Video Pr{\'e}cis: Highlighting Diverse Aspects of Videos},
	journal = {IEEE Transactions on Multimedia},
	volume = {12},
	year = {2010},
	month = {2010/12//},
	pages = {853 - 868},
	abstract = {Summarizing long unconstrained videos is gaining importance in surveillance, web-based video browsing, and video-archival applications. Summarizing a video requires one to identify key aspects that contain the essence of the video. In this paper, we propose an approach that optimizes two criteria that a video summary should embody. The first criterion, {\textquotedblleft}coverage,{\textquotedblright} requires that the summary be able to represent the original video well. The second criterion, {\textquotedblleft}diversity,{\textquotedblright} requires that the elements of the summary be as distinct from each other as possible. Given a user-specified summary length, we propose a cost function to measure the quality of a summary. The problem of generating a précis is then reduced to a combinatorial optimization problem of minimizing the proposed cost function. We propose an efficient method to solve the optimization problem. We demonstrate through experiments (on KTH data, unconstrained skating video, a surveillance video, and a YouTube home video) that optimizing the proposed criterion results in meaningful video summaries over a wide range of scenarios. Summaries thus generated are then evaluated using both quantitative measures and user studies.},
	keywords = {$K$-means, CAMERAS, combinatorial mathematics, combinatorial optimization, Cost function, data compression, Exemplar selection, Image segmentation, Internet, Iron, Length measurement, multimedia systems, Ncut, optimisation, Optimization methods, original video, Permission, shot segmentation, Surveillance, user specified summary length, video précis, Video sharing, video signal processing, Video summarization},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2010.2058795},
	author = {Shroff, N. and Turaga,P. and Chellapa, Rama}
}
@conference {16470,
	title = {ApproxRank: Estimating Rank for a Subgraph},
	booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09},
	year = {2009},
	month = {2009/04/29/March},
	pages = {54 - 65},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgraph of the global Web graph. The challenge for these applications is to compute PageRank-style scores efficiently on the subgraph, i.e., the ranking must reflect the global link structure of the Web graph but it must do so without paying the high overhead associated with a global computation. We propose a framework of an exact solution and an approximate solution for computing ranking on a subgraph. The IdealRank algorithm is an exact solution with the assumption that the scores of external pages are known. We prove that the IdealRank scores for pages in the subgraph converge. Since the PageRank-style scores of external pages may not typically be available, we propose the ApproxRank algorithm to estimate scores for the subgraph. Both IdealRank and ApproxRank represent the set of external pages with an external node L1 and extend the subgraph with links to L1. They also modify the PageRank-style transition matrix with respect to L1. We analyze the L1 distance between IdealRank scores and ApproxRank scores of the subgraph and show that it is within a constant factor of the L1 distance of the external pages (e.g., the true PageRank scores and uniform scores assumed by ApproxRank). We compare ApproxRank and a stochastic complementation approach (SC), a current best solution for this problem, on different types of subgraphs. ApproxRank has similar or superior performance to SC and typically improves on the runtime performance of SC by an order of magnitude or better. We demonstrate that ApproxRank provides a good approximation to PageRank for a variety of subgraphs.},
	keywords = {Application software, ApproxRank, Computer applications, Crawlers, customized semantic query answering, Data engineering, Educational institutions, Explosions, focused crawlers, global Web graph, graph theory, IdealRank algorithm, Internet, localized search engines, PageRank-style, personalized search, Query processing, Runtime, Search engines, Stochastic processes, Web pages},
	isbn = {978-1-4244-3422-0},
	doi = {10.1109/ICDE.2009.108},
	author = {Yao Wu and Raschid, Louiqa}
}
@conference {17168,
	title = {First Steps to Netviz Nirvana: Evaluating Social Network Analysis with NodeXL},
	booktitle = {International Conference on Computational Science and Engineering, 2009. CSE {\textquoteright}09},
	volume = {4},
	year = {2009},
	month = {2009/08/29/31},
	pages = {332 - 339},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Social Network Analysis (SNA) has evolved as a popular, standard method for modeling meaningful, often hidden structural relationships in communities. Existing SNA tools often involve extensive pre-processing or intensive programming skills that can challenge practitioners and students alike. NodeXL, an open-source template for Microsoft Excel, integrates a library of common network metrics and graph layout algorithms within the familiar spreadsheet format, offering a potentially low-barrier-to-entry framework for teaching and learning SNA. We present the preliminary findings of 2 user studies of 21 graduate students who engaged in SNA using NodeXL. The majority of students, while information professionals, had little technical background or experience with SNA techniques. Six of the participants had more technical backgrounds and were chosen specifically for their experience with graph drawing and information visualization. Our primary objectives were (1) to evaluate NodeXL as an SNA tool for a broad base of users and (2) to explore methods for teaching SNA. Our complementary dual case-study format demonstrates the usability of NodeXL for a diverse set of users, and significantly, the power of a tightly integrated metrics/visualization tool to spark insight and facilitate sense-making for students of SNA.},
	keywords = {Computer science, computer science education, data visualisation, Data visualization, Educational institutions, graph drawing, graph layout algorithm, Information services, Information Visualization, Internet, Libraries, Microsoft Excel open-source template, MILC, multi-dimensional in-depth long-term case studies, Netviz Nirvana, NodeXL, Open source software, Programming profession, SNA, social network analysis, Social network services, social networking (online), spreadsheet programs, structural relationship, teaching, visual analytics, visualization tool, Web sites},
	isbn = {978-1-4244-5334-4},
	doi = {10.1109/CSE.2009.120},
	author = {Bonsignore,E. M and Dunne,C. and Rotman,D. and Smith,M. and Capone,T. and Hansen,D. L and Shneiderman, Ben}
}
@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}
}
@conference {14205,
	title = {Bilateral symmetry of object silhouettes under perspective projection},
	booktitle = {19th International Conference on Pattern Recognition, 2008. ICPR 2008},
	year = {2008},
	month = {2008/12/08/11},
	pages = {1 - 4},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Symmetry is an important property of objects and is exhibited in different forms e.g., bilateral, rotational, etc. This paper presents an algorithm for computing the bilateral symmetry of silhouettes of shallow objects under perspective distortion, exploiting the invariance of the cross ratio to projective transformations. The basic idea is to use the cross ratio to compute a number of midpoints of cross sections and then fit a straight line through them. The goodness-of-fit determines the likelihood of the line to be the axis of symmetry. We analytically estimate the midpointpsilas location as a function of the vanishing point for a given object silhouette. Hence finding the symmetry axis amounts to a 2D search in the space of vanishing points. We present experiments on two datasets as well as Internet images of symmetric objects that validate our approach.},
	keywords = {Automation, bilateral symmetry, Computer vision, Frequency, Image analysis, Image coding, Image reconstruction, Internet, Internet images, Object detection, object silhouettes, perspective distortion, perspective projection, SHAPE, symmetric objects},
	isbn = {978-1-4244-2174-9},
	doi = {10.1109/ICPR.2008.4761501},
	author = {Bitsakos,K. and Yi,H. and Yi,L. and Ferm{\"u}ller, Cornelia}
}
@conference {18681,
	title = {On the Comparison of Network Attack Datasets: An Empirical Analysis},
	year = {2008},
	month = {2008/12//},
	pages = {39 - 48},
	abstract = {Network malicious activity can be collected and reported by various sources using different attack detection solutions. The granularity of these solutions provides either very detailed information (intrusion detection systems, honeypots) or high-level trends (CAIDA, SANS). The problem for network security operators is often to select the sources of information to better protect their network. How much information from these sources is redundant and how much is unique? The goal of this paper is to show empirically that while some global attack events can be correlated across various sensors, the majority of incoming malicious activity has local specificities. This study presents a comparative analysis of four different attack datasets offering three different levels of granularity: 1) two high interaction honeynets deployed at two different locations (i.e., a corporate and an academic environment); 2) ATLAS which is a distributed network telescope from Arbor; and 3) Internet Protecttrade which is a global alerting service from AT amp;T.},
	keywords = {ATLAS, distributed network telescope, Internet, intrusion detection systems, network attack datasets, network malicious activity, network security operators, security of data},
	doi = {10.1109/HASE.2008.50},
	author = {Berthier,R. and Korman,D. and Michel Cukier and Hiltunen,M. and Vesonder,G. and Sheleheda,D.}
}
@conference {18682,
	title = {On the Use of Security Metrics Based on Intrusion Prevention System Event Data: An Empirical Analysis},
	year = {2008},
	month = {2008/12//},
	pages = {49 - 58},
	abstract = {With the increasing number of attacks on the Internet, a primary concern for organizations is the protection of their network. To do so, organizations install security devices such as intrusion prevention systems to monitor network traffic. However, data that are collected by these devices are often imperfect. The contribution of this paper is to try to define some practical metrics based on imperfect data collected by an intrusion prevention system. Since attacks greatly differ, we propose to group the attacks into several attack type groups. We then define a set of metrics for each attack type group. We introduce an approach that consists in analyzing the evolution of these metrics per attack type group by focusing on outliers in order to give an insight into an organizationpsilas security. The method is assessed for an organization of about 40,000 computers. The results were encouraging: outliers could be related to security issues that, in some cases, had not been previously flagged.},
	keywords = {empirical analysis, Internet, Internet attack group, intrusion prevention system event data, network traffic monitoring, organization security metrics, security of data},
	doi = {10.1109/HASE.2008.52},
	author = {Chrun,D. and Michel Cukier and Sneeringer,G.}
}
@article {16998,
	title = {Browsing large online data tables using generalized query previews},
	journal = {Information Systems},
	volume = {32},
	year = {2007},
	month = {2007/05//},
	pages = {402 - 423},
	abstract = {Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purpose. Users query such tables with front-ends that typically use menus or form fillin interfaces, but these interfaces rarely give users information about the contents and distribution of the data. Such a situation leads users to waste time and network/server resources posing queries that have zero- or mega-hit results. Generalized query previews enable efficient browsing of large online data tables by supplying data distribution information to users. The data distribution information provides continuous feedback about the size of the result set as the query is being formed. Our paper presents a new user interface architecture and discusses three controlled experiments (with 12, 16, and 48 participants). Our prototype systems provide flexible user interfaces for research and testing of the ideas. The user studies show that for exploratory querying tasks, generalized query previews can speed user performance for certain user domains and can reduce network/server load.},
	keywords = {Information Visualization, Internet, Online querying, World-wide web},
	isbn = {0306-4379},
	doi = {10.1016/j.is.2005.12.006},
	url = {http://www.sciencedirect.com/science/article/pii/S0306437905001213},
	author = {Tanin,Egemen and Shneiderman, Ben and Xie,Hairuo}
}
@conference {19633,
	title = {Configuration Reasoning and Ontology For Web},
	booktitle = {IEEE International Conference on Services Computing, 2007. SCC 2007},
	year = {2007},
	month = {2007/07//},
	pages = {387 - 394},
	abstract = {Configuration plays a central role in the deployment and management of Web infrastructures and applications. A configuration often consists of assigning "values" to a pre-defined set of parameters defined in one or more files. Although the task of assigning values to (configuration) parameters looks simple, configuring infrastructures and applications is a very complex process. In this paper we present a framework for defining and analyzing configuration of an Apache server. We define the notion of "configuration space" of an Apache server as a set of possible values that can be assigned to configuration parameters. We then define the notion of an "obstacle" and "forbidden region" in the configuration space that should be avoided. We model configuration space using a logical framework based on OWL (Web ontology language). The obstacles and forbidden regions in the configuration space are modeled as constraints in the logical framework. These obstacles and forbidden regions are essentially "anti-patterns" that a typical installation should avoid. Given an instance of a configuration (that is, a "point" in the configuration space) we then check if the instance is "obstacle free" using logical reasoning.},
	keywords = {Apache server, Application software, configuration management, configuration reasoning, configuration space, File servers, Information security, Internet, knowledge representation languages, logical framework, logical reasoning, ontologies, ontologies (artificial intelligence), Orbital robotics, OWL, path planning, Robot kinematics, Runtime environment, Taxonomy, Web infrastructures management, Web ontology language, Web server},
	author = {Dana Dachman-Soled and Sreedhar, V.C.}
}
@article {18576,
	title = {Implications of Autonomy for the Expressiveness of Policy Routing},
	journal = {Networking, IEEE/ACM Transactions on},
	volume = {15},
	year = {2007},
	month = {2007/12//},
	pages = {1266 - 1279},
	abstract = {Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain routing system enables each AS to express policy using rankings that determine how each router in the AS chooses among different routes to a destination, and filters that determine which routes are hidden from each neighboring AS. Because the Internet is composed of many independent, competing networks, the interdomain routing system should provide autonomy, allowing network operators to set their rankings independently, and to have no constraints on allowed filters. This paper studies routing protocol stability under these conditions. We first demonstrate that ldquonext-hop rankings,rdquo commonly used in practice, may not ensure routing stability. We then prove that, when providers can set rankings and filters autonomously, guaranteeing that the routing system will converge to a stable path assignment imposes strong restrictions on the rankings ASes are allowed to choose. We discuss the implications of these results for the future of interdomain routing.},
	keywords = {autonomous systems, global Internet connectivity, interdomain routing system, Internet, next-hop rankings, routing protocol, routing protocols, routing stability, stable path assignment},
	isbn = {1063-6692},
	doi = {10.1109/TNET.2007.896531},
	author = {Feamster, Nick and Johari,R. and Balakrishnan,H.}
}
@conference {18582,
	title = {Measuring the Contributions of Routing Dynamics to Prolonged End-to-End Internet Path Failures},
	booktitle = {Global Telecommunications Conference, 2007. GLOBECOM {\textquoteright}07. IEEE},
	year = {2007},
	month = {2007/11//},
	pages = {1855 - 1859},
	abstract = {This paper studies the contributions of routing dynamics to the duration of long-lived end-to-end Internet path failures. Studies have shown that end-to-end Internet failures (periods of prolonged packet loss) are widespread. These failures are typically attributed to either congestion or routing dynamics. Unfortunately, the extent to which congestion and routing dynamics contribute to long-lasting path failures, and the effect of routing dynamics on end-to-end performance, are not well understood. This paper uses a joint analysis of active measurements and routing data to characterize end-to-end failures observed over one month on a topologically diverse Internet testbed. We find that routing dynamics coincide with most prolonged end-to-end failures, suggesting that routing dynamics contribute significantly to the duration of these failures. We also find that most long-lived end-to-end path failures that coincide with routing dynamics are caused by BGP convergence or instability. Our results provide new insights into the effects of routing instability on end-to-end Internet path performance.},
	keywords = {diverse Internet topological testbed, Internet, prolonged end-to-end Internet path failure, routing dynamics, telecommunication network reliability, telecommunication network routing, telecommunication network topology},
	doi = {10.1109/GLOCOM.2007.357},
	author = {Wang,Feng and Feamster, Nick and Gao,Lixin}
}
@conference {19493,
	title = {Eye of the Beholder: Phone-Based Text-Recognition for the Visually-Impaired},
	booktitle = {2006 10th IEEE International Symposium on Wearable Computers},
	year = {2006},
	month = {2006///},
	pages = {145 - 146},
	abstract = {Blind and visually-impaired people cannot access essential information in the form of written text in our environment (e.g., on restaurant menus, street signs, door labels, product names and instructions, expiration dates). In this paper, we present and evaluate a mobile text-recognition system capable of extracting written information from a wide variety of sources and communicating it on-demand to the user. The user needs no additional hardware except an ordinary, Internet- enabled mobile camera-phone - a device that many visually-impaired individuals already own. This approach fills a gap in assistive technologies for the visually- impaired because it makes users aware of textual information not available to them through any other means.},
	keywords = {CAMERAS, data mining, handicapped aids, Hardware, Image quality, Internet, Land mobile radio cellular systems, Mobile computing, mobile handsets, mobile text-recognition system, Optical character recognition software, phone-based text-recognition, Product safety, Text recognition, visually-impaired},
	author = {Tudor Dumitras and Lee, M. and Quinones, P. and Smailagic, A. and Siewiorek, Dan and Narasimhan, P.}
}
@conference {15543,
	title = {Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data},
	booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on},
	volume = {5},
	year = {2006},
	month = {2006/05//},
	pages = {V - V},
	abstract = {The future of remote sensing will see the development of spacecraft formations, and with this development will come a number of complex challenges such as maintaining precise relative position and specified attitudes. At the same time, there will be increasing needs to understand planetary system processes and build accurate prediction models. One essential technology to accomplish these goals is the integration of multiple source data. For this integration, image registration and fusion represent the first steps and need to be performed with very high accuracy. In this paper, we describe studies performed in both image registration and fusion, including a modular framework that was built to describe registration algorithms, a Web-based image registration toolbox, and the comparison of several image fusion techniques using data from the EO-1/ALI and Hyperion sensors},
	keywords = {ALI, EO-1, fusion studies, geophysical signal processing, Hyperion sensors, image registration, Internet, multiple remote sensing data, multiple source data, Remote sensing, Web-based image registration toolbox},
	doi = {10.1109/ICASSP.2006.1661494},
	author = {Le Moigne,J. and Cole-Rhodes,A. and Eastman,R. and Jain,P. and Joshua,A. and Memarsadeghi,N. and Mount, Dave and Netanyahu,N. and Morisette,J. and Uko-Ozoro,E.}
}
@article {18577,
	title = {In VINI veritas: realistic and controlled network experimentation},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {36},
	year = {2006},
	month = {2006/08//},
	pages = {3 - 14},
	abstract = {This paper describes VINI, a virtual network infrastructure that allows network researchers to evaluate their protocols and services in a realistic environment that also provides a high degree of control over network conditions. VINI allows researchers to deploy and evaluate their ideas with real routing software, traffic loads, and network events. To provide researchers flexibility in designing their experiments, VINI supports simultaneous experiments with arbitrary network topologies on a shared physical infrastructure. This paper tackles the following important design question: What set of concepts and techniques facilitate flexible, realistic, and controlled experimentation (e.g., multiple topologies and the ability to tweak routing algorithms) on a fixed physical infrastructure? We first present VINI{\textquoteright}s high-level design and the challenges of virtualizing a single network. We then present PL-VINI, an implementation of VINI on PlanetLab, running the "Internet In a Slice". Our evaluation of PL-VINI shows that it provides a realistic and controlled environment for evaluating new protocols and services.},
	keywords = {architecture, experimentation, Internet, Routing, virtualization},
	isbn = {0146-4833},
	doi = {10.1145/1151659.1159916},
	url = {http://doi.acm.org/10.1145/1151659.1159916},
	author = {Bavier,Andy and Feamster, Nick and Huang,Mark and Peterson,Larry and Rexford,Jennifer}
}
@article {17650,
	title = {Resilient multicast using overlays},
	journal = {IEEE/ACM Transactions on Networking},
	volume = {14},
	year = {2006},
	month = {2006/04//},
	pages = {237 - 248},
	abstract = {We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Through detailed analysis in this paper, we show that this loss recovery technique has efficient scaling properties-the overheads at each overlay node asymptotically decrease to zero with increasing group sizes. As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10 000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (>97\%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1\%-5\%) and high topology change rates (5 changes per second) while incurring very low overheads (<5\%).},
	keywords = {application-layer multicast protocols, Computer science, Data communication, Delay, Internet, Internet-like topologies, IP networks, loss recovery technique, Multicast, multicast data recovery scheme, Multicast protocols, Network topology, NETWORKS, overlays, Performance loss, probabilistic forwarding, probabilistic resilient multicast, Protocols, Resilience, Streaming media, telecommunication network topology, Terminology},
	isbn = {1063-6692},
	doi = {10.1109/TNET.2006.872579},
	author = {Banerjee,S. and Lee,Seungjoon and Bhattacharjee, Bobby and Srinivasan, Aravind}
}
@conference {18575,
	title = {Implications of autonomy for the expressiveness of policy routing},
	booktitle = {Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications},
	series = {SIGCOMM {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {25 - 36},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain routing system enables each AS to express policy using rankings that determine how each router inthe AS chooses among different routes to a destination, and filters that determine which routes are hidden from each neighboring AS. Because the Internet is composed of many independent, competing networks, the interdomain routing system should provide autonomy, allowing network operators to set their rankings independently, and to have no constraints on allowed filters. This paper studies routing protocol stability under these conditions. We first demonstrate that certain rankings that are commonly used in practice may not ensure routing stability. We then prove that, when providers can set rankings and filters autonomously, guaranteeing that the routing system will converge to a stable path assignment essentially requires ASes to rank routes based on AS-path lengths. We discuss the implications of these results for the future of interdomain routing.},
	keywords = {autonomy, BGP, Internet, policy, protocol, Routing, Safety, stability},
	isbn = {1-59593-009-4},
	doi = {10.1145/1080091.1080096},
	url = {http://doi.acm.org/10.1145/1080091.1080096},
	author = {Feamster, Nick and Johari,Ramesh and Balakrishnan,Hari}
}
@conference {15466,
	title = {ASPIRE: automated systematic protocol implementation robustness evaluation},
	booktitle = {Software Engineering Conference, 2004. Proceedings. 2004 Australian},
	year = {2004},
	month = {2004///},
	pages = {241 - 250},
	abstract = {Network protocol implementations are susceptible to problems caused by their lack of ability to handle invalid inputs. We present ASPIRE: automated systematic protocol implementation robustness evaluation, an automated approach to pro-actively test protocol implementations by observing their responses to faulty protocol data units (PDUs) or messages. In contrast to existing approaches, we sample the faulty PDU space in a systematic manner, thus allowing us to evaluate protocol implementations in the face of a wider variety of faulty PDUs. We use a pruning strategy to reduce, from exponential, the size of the faulty PDU set to polynomial in the number of fields of a PDU. We have implemented the ASPIRE algorithms and evaluated them on implementations of HTTP (Apache, Google Web Server (GWS), and Microsoft IIS) and SMTP (Sendmail and Microsoft Exchange) protocols. Our results show that Apache, GWS, and IIS, although implementing the same protocol specification, behave differently on faulty HTTP PDUs; Sendmail and exchange are different in handling our faulty SMTP PDUs.},
	keywords = {algorithm, ASPIRE, automated systematic protocol, automated testing, fault tolerant computing, faulty PDU, formal specification, HTTP, implementation robustness evaluation, Internet, network protocol, protocol data unit, protocol specification, robustness testing, SMTP protocol, stateful protocols, stateless protocols, Transport protocols},
	doi = {10.1109/ASWEC.2004.1290477},
	author = {Vasan,Arunchandar and Memon, Atif M.}
}
@conference {14811,
	title = {Automated cluster-based Web service performance tuning},
	booktitle = {13th IEEE International Symposium on High performance Distributed Computing, 2004. Proceedings},
	year = {2004},
	month = {2004/06/04/6},
	pages = {36 - 44},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Active harmony provides a way to automate performance tuning. We apply the Active Harmony system to improve the performance of a cluster-based web service system. The performance improvement cannot easily be achieved by tuning individual components for such a system. The experimental results show that there is no single configuration for the system that performs well for all kinds of workloads. By tuning the parameters, Active Harmony helps the system adapt to different workloads and improve the performance up to 16\%. For scalability, we demonstrate how to reduce the time when tuning a large system with many tunable parameters. Finally an algorithm is proposed to automatically adjust the structure of cluster-based web systems, and the system throughput is improved up to 70\% using this technique.},
	keywords = {Active Harmony system, automated performance tuning, business, cluster-based Web service system, Clustering algorithms, Computer science, Educational institutions, electronic commerce, Internet, Middleware, performance evaluation, scalability, Throughput, Transaction databases, Web server, Web services, workstation clusters},
	isbn = {0-7695-2175-4},
	doi = {10.1109/HPDC.2004.1323484},
	author = {Chung,I. -H and Hollingsworth, Jeffrey K}
}
@conference {15684,
	title = {Dynamic load balancing across mirrored multimedia servers},
	booktitle = {2003 International Conference on Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings},
	volume = {2},
	year = {2003},
	month = {2003/07/06/9},
	pages = {II- 53-6 vol.2 - II- 53-6 vol.2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The purpose of this paper is to present protocols for efficient load balancing across replicated multimedia servers in a metropolitan area network. Current multimedia infrastructures, even when they use mirrored servers, do not have standardized load balancing schemes. Existing schemes frequently require participation from the clients in balancing the load across the servers efficiently. We propose two protocols in this paper for fair load balancing without any client-side processing being required. Neither protocol requires any change to the network-level infrastructure. Using network packet loss and packet transmission delay as the chief metrics, we show the effectiveness of the protocols through extensive simulations.},
	keywords = {client-server systems, Delay, Internet, load balancing protocols, Load management, media streaming, metropolitan area network, metropolitan area networks, mirrored multimedia servers, Multimedia communication, multimedia servers, network packet loss, Network servers, packet transmission delay, Propagation losses, Protocols, Streaming media, Topology, Traffic control, Web server},
	isbn = {0-7803-7965-9},
	doi = {10.1109/ICME.2003.1221551},
	author = {Matthur,A. and Mundur, Padma}
}
@article {14653,
	title = {A secure PLAN},
	journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews},
	volume = {33},
	year = {2003},
	month = {2003/08//},
	pages = {413 - 426},
	abstract = {Active networks, being programmable, promise greater flexibility than current networks. Programmability, however, may introduce safety and security risks. This correspondence describes the design and implementation of a security architecture for the active network PLANet. Security is obtained with a two-level architecture that combines a functionally restricted packet language, PLAN, with an environment of general-purpose service routines governed by trust management. In particular, a technique is used which expands or contracts a packet{\textquoteright}s service environment based on its level of privilege, termed namespace-based security. The design and implementation of an active-network firewall and virtual private network is used as an application of the security architecture. Measurements of the system show that the addition of the firewall imposes an approximately 34\% latency overhead and as little as a 6.7\% space overhead to incoming packets.},
	keywords = {active networks, active-network firewall, Authentication, Authorization, Contracts, cryptography, Environmental management, Extraterrestrial measurements, functionally restricted packet language, general-purpose service routines, Internet, latency overhead, namespace-based security, packet switching, PLANet, Planets, privilege level, programmable networks, Safety, safety risks, secure PLAN, security of data, security risks, trust management, two-level architecture, virtual private network, Virtual private networks, Web and internet services},
	isbn = {1094-6977},
	doi = {10.1109/TSMCC.2003.817347},
	author = {Hicks, Michael W. and Keromytis,A. D and Smith,J. M}
}
@conference {12299,
	title = {On the use of flow migration for handling short-term overloads},
	booktitle = {Global Telecommunications Conference, 2003. GLOBECOM {\textquoteright}03. IEEE},
	volume = {6},
	year = {2003},
	month = {2003/12//},
	pages = {3108 - 3112 vol.6 - 3108 - 3112 vol.6},
	abstract = {In this work, we investigate flow migration as a mechanism to sustain QoS to network users during short-term overloads in the context of an MPLS IP network. We experiment with three different control techniques: static long-term optimal mapping of flows to LSPs; on-line locally optimal mapping of flows to LSPs at flow set-up time; and dynamic flow migration in response to transient congestion. These techniques are applicable over different timescales, have different run-time overheads, and require different levels of monitoring and control software inside the network. We present results both from detailed simulations and a complete implementation using software IP routers. We use voice-over-IP as our test application, and show that if end-to-end quality is to be maintained during short unpredictable bursts of high load, then a fast-timescale control such as migration is required.},
	keywords = {computing;, CONGESTION, congestion;, CONTROL, control;, dynamic, end-to-end, engineering, fast-timescale, flow, Internet, IP, label, long-term, mapping;, migration;, MPLS, multiprotocol, network, network;, networks;, of, optimal, overloads;, protocol;, QoS;, QUALITY, quality;, routers;, routing;, service;, set-up, short-term, software, software;, static, switching;, Telecommunication, telephony;, time;, transient, voice-over-IP;},
	doi = {10.1109/GLOCOM.2003.1258807},
	author = {Kuo,Kuo-Tung and Phuvoravan,S. and Bhattacharjee, Bobby and Jun La,R. and Shayman,M. and Chang,Hyeong Soo}
}
@conference {17575,
	title = {Clustering and server selection using passive monitoring},
	booktitle = {IEEE INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {1717- 1725 vol.3 - 1717- 1725 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We consider the problem of client assignment in a distributed system of content servers. We present a system called Webmapper for clustering IP addresses and assigning each cluster to an optimal content server. The system is passive in that the only information it uses comes from monitoring the TCP connections between the clients and the servers. It is also flexible in that it makes no a priori assumptions about network topology and server placement and it can react quickly to changing network conditions. We present experimental results to evaluate the performance of Webmapper.},
	keywords = {client assignment, client-server systems, clustering, content servers, Delay, distributed system, Educational institutions, Internet, IP addresses, Monitoring, network conditions, Network servers, Network topology, optimal content server, passive monitoring, server selection, Space technology, TCPIP, Transport protocols, Web pages, Web server, Webmapper},
	isbn = {0-7803-7476-2},
	doi = {10.1109/INFCOM.2002.1019425},
	author = {Andrews,M. and Shepherd,B. and Srinivasan, Aravind and Winkler,P. and Zane,F.}
}
@conference {13363,
	title = {Decoupled query optimization for federated database systems},
	booktitle = {18th International Conference on Data Engineering, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {716 - 727},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We study the problem of query optimization in federated relational database systems. The nature of federated databases explicitly decouples many aspects of the optimization process, often making it imperative for the optimizer to consult underlying data sources while doing cost-based optimization. This not only increases the cost of optimization, but also changes the trade-offs involved in the optimization process significantly. The dominant cost in the decoupled optimization process is the "cost of costing" that traditionally has been considered insignificant. The optimizer can only afford a few rounds of messages to the underlying data sources and hence the optimization techniques in this environment must be geared toward gathering all the required cost information with minimal communication. In this paper, we explore the design space for a query optimizer in this environment and demonstrate the need for decoupling various aspects of the optimization process. We present minimum-communication decoupled variants of various query optimization techniques, and discuss tradeoffs in their performance in this scenario. We have implemented these techniques in the Cohera federated database system and our experimental results, somewhat surprisingly, indicate that a simple two-phase optimization scheme performs fairly well as long as the physical database design is known to the optimizer, though more aggressive algorithms are required otherwise},
	keywords = {Algorithm design and analysis, Cohera federated database, Computer science, Corporate acquisitions, Cost function, Database systems, decoupled optimization, Design optimization, distributed databases, federated databases, federated relational database systems, Internet, Query optimization, query optimizer, Query processing, Relational databases, Space exploration},
	isbn = {0-7695-1531-2},
	doi = {10.1109/ICDE.2002.994788},
	author = {Deshpande, Amol and Hellerstein,J. M}
}
@article {18326,
	title = {Embedded grammar tags: advancing natural language interaction on the Web},
	journal = {Intelligent Systems, IEEE},
	volume = {17},
	year = {2002},
	month = {2002///},
	pages = {48 - 53},
	abstract = {Embedded grammar tags (EGTs) reflect Web page content by anticipating queries users might launch to retrieve that content. The grammars provide a unifying component for speech recognition engines, semantic Web page representation, and speech output generation. We propose a new framework that lets intelligent agents discover accurate, concise responses to natural language queries. This framework{\textquoteright}s backbone consists of embedded grammar tags that capture natural language queries. EGTs reflect information content in Web pages by anticipating the queries that users might launch to retrieve particular content.},
	keywords = {embedded grammar tags, grammars, information content, information resources, intelligent agents, Internet, natural language interaction, natural language queries, natural languages, Search engines, semantic Web page representation, software agents, speech output generation, Speech recognition, speech recognition engines, Web page content},
	isbn = {1541-1672},
	doi = {10.1109/5254.988450},
	author = {Dorai,G. K and Yacoob,Yaser}
}
@conference {14695,
	title = {Experiences with capsule-based active networking},
	booktitle = {DARPA Active NEtworks Conference and Exposition, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {16 - 24},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Active networking adds programmability to the elements of the network, most aggressively by using programmable packets, or capsules. ANTS [22, 21] and PLANet [10, 8] are the most mature examples of capsule-based systems, both having been publicly available for several years. This paper presents our experience with these systems and the lessons they hold for the future of capsule-based active networking. The paper focuses on four key issues: flexibility, performance, security, and usability. We consider how ANTS and PLANet address these issues, noting that despite substantial surface differences, both systems identify similar key problems and use closely related solutions. Based on our experience with these systems we conclude that capsule-based systems can achieve useful levels of flexibility, performance, and usability. Many aspects of security can also be adequately addressed, but some important problems related to denial of service remain as open problems},
	keywords = {active networking, ANTS, application-specific routing, capsule architecture, capsule-based systems, computer crime, Computer network management, Computer networks, Computer science, Contracts, Electronic switching systems, INFORMATION SCIENCE, Internet, internetworking, network management, PLANet, Planets, programmability, programmable packets, Programming, Security, Standards development, telecommunication network routing, usability},
	isbn = {0-7695-1564-9},
	doi = {10.1109/DANCE.2002.1003481},
	author = {Hicks, Michael W. and Moore,J. T and Wetherall,D. and Nettles,S.}
}
@conference {17642,
	title = {P5 : a protocol for scalable anonymous communication},
	booktitle = {2002 IEEE Symposium on Security and Privacy, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {58 - 70},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a protocol for anonymous communication over the Internet. Our protocol, called P5 (peer-to-peer personal privacy protocol) provides sender-, receiver-, and sender-receiver anonymity. P5 is designed to be implemented over current Internet protocols, and does not require any special infrastructure support. A novel feature of P5 is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalably implement large anonymous groups. We present a description of P5, an analysis of its anonymity and communication efficiency, and evaluate its performance using detailed packet-level simulations.},
	keywords = {Broadcasting, communication efficiency, Computer science, cryptography, data privacy, Educational institutions, Internet, large anonymous groups, P5 protocol, packet-level simulations, Particle measurements, Peer to peer computing, peer-to-peer personal privacy protocol, privacy, Protocols, receiver anonymity, scalable anonymous communication, security of data, sender anonymity, sender-receiver anonymity, Size measurement, telecommunication security},
	isbn = {0-7695-1543-6},
	doi = {10.1109/SECPRI.2002.1004362},
	author = {Sherwood,R. and Bhattacharjee, Bobby and Srinivasan, Aravind}
}
@conference {16910,
	title = {Remote access to large spatial databases},
	booktitle = {Proceedings of the 10th ACM international symposium on Advances in geographic information systems},
	series = {GIS {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {5 - 10},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Enterprises in the public and private sectors have been making their large spatial data archives available over the Internet. However, interactive work with such large volumes of online spatial data is a challenging task. We propose two efficient approaches to remote access to large spatial data. First, we introduce a client-server architecture where the work is distributed between the server and the individual clients for spatial query evaluation, data visualization, and data management. We enable the minimization of the requirements for system resources on the client side while maximizing system responsiveness as well as the number of connections one server can handle concurrently. Second, for prolonged periods of access to large online data, we introduce APPOINT (an Approach for Peer-to-Peer Offloading the INTernet). This is a centralized peer-to-peer approach that helps Internet users transfer large volumes of online data efficiently. In APPOINT, active clients of the client-server architecture act on the server{\textquoteright}s behalf and communicate with each other to decrease network latency, improve service bandwidth, and resolve server congestions.},
	keywords = {client/server, GIS, Internet, peer-to-peer},
	isbn = {1-58113-591-2},
	doi = {10.1145/585147.585150},
	url = {http://doi.acm.org/10.1145/585147.585150},
	author = {Tanin,Egemen and Brabec,Franti{\v s}ek and Samet, Hanan}
}
@article {12307,
	title = {Scalable secure group communication over IP multicast},
	journal = {Selected Areas in Communications, IEEE Journal on},
	volume = {20},
	year = {2002},
	month = {2002/10//},
	pages = {1511 - 1527},
	abstract = {We introduce and analyze a scalable rekeying scheme for implementing secure group communications Internet protocol multicast. We show that our scheme incurs constant processing, message, and storage overhead for a rekey operation when a single member joins or leaves the group, and logarithmic overhead for bulk simultaneous changes to the group membership. These bounds hold even when group dynamics are not known a priori. Our rekeying algorithm requires a particular clustering of the members of the secure multicast group. We describe a protocol to achieve such clustering and show that it is feasible to efficiently cluster members over realistic Internet-like topologies. We evaluate the overhead of our own rekeying scheme and also of previously published schemes via simulation over an Internet topology map containing over 280 000 routers. Through analysis and detailed simulations, we show that this rekeying scheme performs better than previous schemes for a single change to group membership. Further, for bulk group changes, our algorithm outperforms all previously known schemes by several orders of magnitude in terms of actual bandwidth usage, processing costs, and storage requirements.},
	keywords = {access, algorithm;, authentication;, Bandwidth, communication;, CONTROL, costs;, cryptography;, dynamics;, group, group;, Internet, Internet-like, Internet;, IP, logarithmic, map;, membership;, message, Multicast, multicast;, network, overhead;, PROCESSING, protocol, protocols;, rekeying, requirements;, routers;, routing;, scalable, secure, security;, server;, simulation;, storage, Telecommunication, topologies;, Topology, topology;, transport, usage;},
	isbn = {0733-8716},
	doi = {10.1109/JSAC.2002.803986},
	author = {Banerjee,S. and Bhattacharjee, Bobby}
}
@conference {16466,
	title = {Optimized seamless integration of biomolecular data},
	booktitle = {Proceedings of the IEEE 2nd International Symposium on Bioinformatics and Bioengineering Conference, 2001},
	year = {2001},
	month = {2001/11/04/6},
	pages = {23 - 32},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Today, scientific data is inevitably digitized, stored in a variety of heterogeneous formats, and is accessible over the Internet. Scientists need to access an integrated view of multiple remote or local heterogeneous data sources. They then integrate the results of complex queries and apply further analysis and visualization to support the task of scientific discovery. Building a digital library for scientific discovery requires accessing and manipulating data extracted from flat files or databases, documents retrieved from the Web, as well as data that is locally materialized in warehouses or is generated by software. We consider several tasks to provide optimized and seamless integration of biomolecular data. Challenges to be addressed include capturing and representing source capabilities; developing a methodology to acquire and represent metadata about source contents and access costs; and decision support to select sources and capabilities using cost based and semantic knowledge, and generating low cost query evaluation plans},
	keywords = {analysis, Bioinformatics, biology computing, cost based knowledge, Costs, Data analysis, data mining, data visualisation, Data visualization, Data warehouses, decision support, digital library, Educational institutions, information resources, Internet, low cost query evaluation plans, Mediation, meta data, metadata, molecular biophysics, multiple local heterogeneous data sources, multiple remote heterogeneous data sources, optimized seamless biomolecular data integration, scientific discovery, scientific information systems, semantic knowledge, software libraries, visual databases, Visualization},
	isbn = {0-7695-1423-5},
	doi = {10.1109/BIBE.2001.974408},
	author = {Eckman,B. A and Lacroix,Z. and Raschid, Louiqa}
}
@conference {14725,
	title = {Practical programmable packets},
	booktitle = {IEEE INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {1},
	year = {2001},
	month = {2001///},
	pages = {41-50 vol.1 - 41-50 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present SNAP (safe and nimble active packets), a new scheme for programmable (or active) packets centered around a new low-level packet language. Unlike previous active packet approaches, SNAP is practical: namely, adding significant flexibility over IP without compromising safety and security or efficiency. In this paper we show how to compile from the well-known active picket language PLAN to SNAP, showing that SNAP retains PLAN{\textquoteright}s flexibility; give proof sketches of its novel approach to resource control; and present experimental data showing SNAP attains performance very close to that of a software IP router},
	keywords = {active picket language, Application software, complier, Contracts, Data security, efficiency, Explosives, INFORMATION SCIENCE, Internet, IP, IP networks, low-level packet language, packet switching, performance, PLAN, practical programmable packets, program compilers, Protection, resource control, Resource management, safe and nimble active packets, Safety, Security, SNAP, software IP router, Software performance, telecommunication security, Transport protocols},
	isbn = {0-7803-7016-3},
	doi = {10.1109/INFCOM.2001.916685},
	author = {Moore,J. T and Hicks, Michael W. and Nettles,S.}
}
@conference {17532,
	title = {Receiver based management of low bandwidth access links},
	booktitle = {IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {1},
	year = {2000},
	month = {2000///},
	pages = {245-254 vol.1 - 245-254 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we describe a receiver-based congestion control policy that leverages TCP flow control mechanisms to prioritize mixed traffic loads across access links. We manage queueing at the access link to: (1) improve the response time of interactive network applications; (2) reduce congestion-related packet losses; while (3) maintaining high throughput for bulk-transfer applications. Our policy controls queue length by manipulating receive socket buffer sizes. We have implemented this solution in a dynamically loadable Linux kernel module, and tested it over low-bandwidth links. Our approach yields a 7-fold improvement in packet latency over an unmodified system while maintaining 94\% link utilization. In the common case, congestion-related packet losses at the access link can be eliminated. Finally, by prioritizing short flows, we show that our system reduces the time to download a complex Web page during a large background transfer by a factor of two},
	keywords = {Bandwidth, buffer storage, bulk-transfer applications, complex Web page, congestion control policy, Delay, dynamically loadable Linux kernel module, information resources, interactive network, Internet, Kernel, link utilization, Linux, low-bandwidth access links, mixed traffic load, packet latency, queue length, queueing theory, receive socket buffer sizes, receiver-based management, response time, short flow prioritizing, Size control, Sockets, subscriber loops, TCP flow control, telecommunication congestion control, telecommunication network management, Telecommunication traffic, Testing, Throughput, Transport protocols, Unix, Web pages},
	isbn = {0-7803-5880-5},
	doi = {10.1109/INFCOM.2000.832194},
	author = {Spring, Neil and Chesire,M. and Berryman,M. and Sahasranaman,V. and Anderson,T. and Bershad,B.}
}
@article {17209,
	title = {Human-centered computing, online communities, and virtual environments},
	journal = {IEEE Computer Graphics and Applications},
	volume = {19},
	year = {1999},
	month = {1999/12//Nov},
	pages = {70 - 74},
	abstract = {This report summarizes results of the first EC/NSF joint Advanced Research Workshop, which identified key research challenges and opportunities in information technology. The group agreed that the first joint research workshop should concentrate on the themes of human-centered computing and VEs. Human-centered computing is perceived as an area of strategic importance because of the move towards greater decentralization and decomposition in the location and provision of computation. The area of VEs is one where increased collaboration should speed progress in solving some of the more intractable problems in building effective applications},
	keywords = {Books, Collaboration, Collaborative work, Conferences, EC/NSF joint Advanced Research Workshop, Feeds, Human computer interaction, human-centered computing, Internet, Joining materials, Laboratories, Online communities, Research initiatives, USA Councils, User interfaces, Virtual environment, virtual environments, Virtual reality},
	isbn = {0272-1716},
	doi = {10.1109/38.799742},
	author = {Brown,J. R and van Dam,A. and Earnshaw,R. and Encarnacao,J. and Guedj,R. and Preece,J. and Shneiderman, Ben and Vince,J.}
}
@conference {14723,
	title = {PLANet: an active internetwork},
	booktitle = {IEEE INFOCOM {\textquoteright}99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {3},
	year = {1999},
	month = {1999/03/21/25},
	pages = {1124-1133 vol.3 - 1124-1133 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present PLANet: an active network architecture and implementation. In addition to a standard suite of Internet-like services, PLANet has two key programmability features: (1) all packets contain programs; and (2) router functionality may be extended dynamically. Packet programs are written in our special purpose programming language PLAN, the Packet Language for Active Networks, while dynamic router extensions are written in OCaml, a dialect of ML. Currently, PLANet routers run as byte-code-interpreted Linux user-space applications, and support Ethernet and IP as link layers. PLANet achieves respectable performance on standard networking operations: on 300 MHz Pentium-II{\textquoteright}s attached to 100 Mbps Ethernet, PLANet can route 48 Mbps and switch over 5000 packets per second. We demonstrate the utility of PLANet{\textquoteright}s activeness by showing experimentally how it can nontrivially improve application and aggregate network performance in congested conditions},
	keywords = {100 Mbit/s, 300 MHz, 48 Mbit/s, active internetwork, active network architecture, active network implementation, byte-code-interpreted applications, Computer architecture, Computer languages, Computer networks, congested conditions, dynamic programming, dynamic router extensions, Ethernet, Ethernet networks, INFORMATION SCIENCE, Internet, Internet-like services, internetworking, IP, IP networks, link layers, Linux user-space applications, Local area networks, ML dialect, Network performance, networking operations, OCaml, Packet Language for Active Networks, packet programs, packet switching, Pentium-II, performance, performance evaluation, PLAN, PLANet, Planets, programmability features, programming languages, router functionality, special purpose programming language, Switches, telecommunication network routing, Transport protocols, Web and internet services},
	isbn = {0-7803-5417-6},
	doi = {10.1109/INFCOM.1999.751668},
	author = {Hicks, Michael W. and Moore,J. T and Alexander,D. S and Gunter,C. A and Nettles,S. M}
}
@conference {17443,
	title = {Trust me, I{\textquoteright}m accountable: trust and accountability online},
	booktitle = {CHI {\textquoteright}99 extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}99},
	year = {1999},
	month = {1999///},
	pages = {79 - 80},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We live in an increasingly wired world. According to Robert Putnam, people are spending less time in persistent personal face to face interactions and more time in pursuits such as watching TV and using the Internet. At the same time, independently measured "social capital" -- the extent to which we trust and work for a common good -- is declining. In this panel, we explore: the impacts of electronic media on trust and accountability; whether and how electronic media can be designed and used to increase deserved trust and accountability; the relationship between protecting privacy and increasing the efficacy of communication; and how people{\textquoteright}s tendency to treat computers as social actors impacts these issues. In brief, how can modern technology enhance humanity{\textquoteright}s humanity?},
	keywords = {accountability, anonymity, Communication, computers and society, ethics, Internet, media effects, privacy, Reciprocity, repute, social actors, social capital, social impacts, trust, value-sensitive design, wired world, WWW},
	isbn = {1-58113-158-5},
	doi = {10.1145/632716.632766},
	url = {http://doi.acm.org/10.1145/632716.632766},
	author = {Friedman,Batya and Thomas,John C. and Grudin,Jonathan and Nass,Clifford and Nissenbaum,Helen and Schlager,Mark and Shneiderman, Ben}
}
@conference {17094,
	title = {Distance learning: is it the end of education as most of us know it?},
	booktitle = {CHI 98 conference summary on Human factors in computing systems},
	series = {CHI {\textquoteright}98},
	year = {1998},
	month = {1998///},
	pages = {86 - 87},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {distance learning, education, Internet, Web},
	isbn = {1-58113-028-7},
	doi = {10.1145/286498.286542},
	url = {http://doi.acm.org/10.1145/286498.286542},
	author = {Laurillard,Diana and Preece,Jenny and Shneiderman, Ben and Neal,Lisa and W{\ae}rn,Yvonne}
}
@article {12103,
	title = {Security for virtual private intranets},
	journal = {Computer},
	volume = {31},
	year = {1998},
	month = {1998/09//},
	pages = {48 - 55},
	abstract = {As telecommuting grows, businesses must consider security when extending their network environment to employees{\textquoteright} homes. Researchers at the University of Pennsylvania have addressed the problem with smart cards, operating system modifications, and network authentication. We note the distinction between trust and integrity: trust is determined through the verification of components and the dependencies among them, while integrity demonstrates that components haven{\textquoteright}t been modified. Thus integrity checking in a trustworthy system is about preserving an established trust or trust relationship. Our solution to the challenge of isolating functional roles that may share a single hardware platform is called secure identity based lending (SIBL). SIBL provides multiple personalities by partitioning the hard drive into n+1 partitions, where n is the number of supported personalities. All personalities use the system partition for core operating system components and shared applications. Each of the personalities is also associated with one of the remaining partitions, which are encrypted using a symmetric algorithm},
	keywords = {businesses, Clouds, Companies, core operating system components, cryptography, Data security, employee homes, encryption, functional roles, hard drive, Home computing, home working, integrity checking, Internet, Local area networks, multiple personalities, network authentication, network environment, operating system modifications, Operating systems, Roads, secure identity based lending, security management, security of data, shared applications, SIBL, single hardware platform, smart cards, symmetric algorithm, system partition, telecommuting, Teleworking, trust relationship, trustworthy system, virtual private intranets},
	isbn = {0018-9162},
	doi = {10.1109/2.708450},
	author = {Arbaugh, William A. and Davin,J. R and Farber,D. J and Smith,J. M}
}
@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.}
}
@conference {12092,
	title = {A secure and reliable bootstrap architecture},
	booktitle = {, 1997 IEEE Symposium on Security and Privacy, 1997. Proceedings},
	year = {1997},
	month = {1997/05/04/7},
	pages = {65 - 71},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In a computer system, the integrity of lower layers is typically treated as axiomatic by higher layers. Under the presumption that the hardware comprising the machine (the lowest layer) is valid, the integrity of a layer can be guaranteed if and only if: (1) the integrity of the lower layers is checked and (2) transitions to higher layers occur only after integrity checks on them are complete. The resulting integrity {\textquotedblleft}chain{\textquotedblright} inductively guarantees system integrity. When these conditions are not met, as they typically are not in the bootstrapping (initialization) of a computer system, no integrity guarantees can be made, yet these guarantees are increasingly important to diverse applications such as Internet commerce, security systems and {\textquotedblleft}active networks{\textquotedblright}. In this paper, we describe the AEGIS architecture for initializing a computer system. It validates integrity at each layer transition in the bootstrap process. AEGIS also includes a recovery process for integrity check failures, and we show how this results in robust systems},
	keywords = {active networks, AEGIS architecture, bootstrap architecture, Computer architecture, computer bootstrapping, data integrity, Distributed computing, Hardware, hardware validity, initialization, integrity chain, integrity check failures, Internet, Internet commerce, IP networks, Laboratories, lower-layer integrity, Microprogramming, Operating systems, recovery process, reliability, robust systems, Robustness, Security, security of data, software reliability, system integrity guarantees, system recovery, transitions, Virtual machining},
	isbn = {0-8186-7828-3},
	doi = {10.1109/SECPRI.1997.601317},
	author = {Arbaugh, William A. and Farber,D. J and Smith,J. M}
}
@conference {16204,
	title = {User controlled overviews of an image library: a case study of the visible human},
	booktitle = {Proceedings of the first ACM international conference on Digital libraries},
	series = {DL {\textquoteright}96},
	year = {1996},
	month = {1996///},
	pages = {74 - 82},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {Browsing, digital library, image database, information exploration, Information retrieval, Internet, medical image, remote access, user interface, Visualization, World-wide web},
	isbn = {0-89791-830-4},
	doi = {10.1145/226931.226946},
	url = {http://doi.acm.org/10.1145/226931.226946},
	author = {North,Chris and Shneiderman, Ben and Plaisant, Catherine}
}
