@article {12888,
	title = {Microbial oceanography in a sea of opportunity},
	journal = {Nature},
	volume = {459},
	year = {2009},
	month = {2009/05/13/},
	pages = {180 - 184},
	abstract = {Plankton use solar energy to drive the nutrient cycles that make the planet habitable for larger organisms. We can now explore the diversity and functions of plankton using genomics, revealing the gene repertoires associated with survival in the oceans. Such studies will help us to appreciate the sensitivity of ocean systems and of the ocean{\textquoteright}s response to climate change, improving the predictive power of climate models.},
	keywords = {Astronomy, astrophysics, Biochemistry, Bioinformatics, Biology, biotechnology, cancer, cell cycle, cell signalling, climate change, Computational Biology, development, developmental biology, DNA, drug discovery, earth science, ecology, environmental science, Evolution, evolutionary biology, functional genomics, Genetics, Genomics, geophysics, immunology, interdisciplinary science, life, marine biology, materials science, medical research, medicine, metabolomics, molecular biology, molecular interactions, nanotechnology, Nature, neurobiology, neuroscience, palaeobiology, pharmacology, Physics, proteomics, quantum physics, RNA, Science, science news, science policy, signal transduction, structural biology, systems biology, transcriptomics},
	isbn = {0028-0836},
	doi = {10.1038/nature08056},
	url = {http://www.nature.com/nature/journal/v459/n7244/abs/nature08056.html},
	author = {Bowler,Chris and Karl,David M. and Rita R Colwell}
}
@inbook {12235,
	title = {Triangle Inequality and Routing Policy Violations in the Internet},
	booktitle = {Passive and Active Network MeasurementPassive and Active Network Measurement},
	series = {Lecture Notes in Computer Science},
	volume = {5448},
	year = {2009},
	month = {2009///},
	pages = {45 - 54},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is available. TIVs are a natural, widespread and persistent consequence of Internet routing policies. By exposing opportunities to improve the delay between two nodes, TIVs can help myriad applications that seek to minimize end-to-end latency. However, sending traffic along the detour paths revealed by TIVs may influence Internet routing negatively. In this paper we study the interaction between triangle inequality violations and policy routing in the Internet. We use measured and predicted AS paths between Internet nodes to show that 25\% of the detour paths exposed by TIVs are in fact available to BGP but are simply deemed {\textquotedblleft}less efficient{\textquotedblright}. We also compare the AS paths of detours and direct paths and find that detours use AS edges that are rarely followed by default Internet paths, while avoiding others that BGP seems to prefer. Our study is important both for understanding the various interactions that occur at the routing layer as well as their effects on applications that seek to use TIVs to minimize latency.},
	keywords = {Computer, Science},
	isbn = {978-3-642-00974-7},
	url = {http://dx.doi.org/10.1007/978-3-642-00975-4_5},
	author = {Lumezanu,Cristian and Baden,Randy and Spring, Neil and Bhattacharjee, Bobby},
	editor = {Moon,Sue and Teixeira,Renata and Uhlig,Steve}
}
@article {12158,
	title = {The ASC-Alliance Projects: A Case Study of Large-Scale Parallel Scientific Code Development},
	journal = {Computer},
	volume = {41},
	year = {2008},
	month = {2008/03//},
	pages = {50 - 58},
	abstract = {Computational scientists face many challenges when developing software that runs on large-scale parallel machines. However, software-engineering researchers haven{\textquoteright}t studied their software development processes in much detail. To better understand the nature of software development in this context, the authors examined five large-scale computational science software projects operated at the five ASC-Alliance centers.},
	keywords = {ASC-Alliance, code, development;large-scale, development;parallel, engineering;, machines;software, Parallel, projects;computational, scale, Science, scientific, scientists;large, software, systems;parallel},
	isbn = {0018-9162},
	doi = {10.1109/MC.2008.101},
	author = {Hochstein, L. and Basili, Victor R.}
}
@article {16066,
	title = {Evaluating Visual Analytics at the 2007 VAST Symposium Contest},
	journal = {Computer Graphics and Applications, IEEE},
	volume = {28},
	year = {2008},
	month = {2008/04//march},
	pages = {12 - 21},
	abstract = {In this article, we report on the contest{\textquoteright}s data set and tasks, the judging criteria, the winning tools, and the overall lessons learned in the competition. We believe that by organizing these contests, we{\textquoteright}re creating useful resources for researchers and are beginning to understand how to better evaluate VA tools. Competitions encourage the community to work on difficult problems, improve their tools, and develop baselines for others to build or improve upon. We continue to evolve a collection of data sets, scenarios, and evaluation methodologies that reflect the richness of the many VA tasks and applications.},
	keywords = {2007, analytics, analytics;data, and, Contest;Visual, Science, Symposium, Technology;data, VAST, visualisation;, visualization;visual},
	isbn = {0272-1716},
	doi = {10.1109/MCG.2008.27},
	author = {Plaisant, Catherine and Grinstein,G. and Scholtz,J. and Whiting,M. and O{\textquoteright}Connell,T. and Laskowski,S. and Chien,L. and Tat,A. and Wright,W. and Gorg,C. and Zhicheng Liu and Parekh,N. and Singhal,K. and Stasko,J.}
}
@article {18448,
	title = {Understanding the High-Performance-Computing Community: A Software Engineer{\textquoteright}s Perspective},
	journal = {Software, IEEE},
	volume = {25},
	year = {2008},
	month = {2008/08//july},
	pages = {29 - 36},
	abstract = {Computational scientists developing software for HPC systems face unique software engineering issues. Attempts to transfer SE technologies to this domain must take these issues into account.},
	keywords = {community;software, computational, engineering;, engineering;software, Science, software;high-performance-computing},
	isbn = {0740-7459},
	doi = {10.1109/MS.2008.103},
	author = {Basili, Victor R. and Carver, J. C and Cruzes, D. and Hochstein, L. M and Hollingsworth, Jeffrey K and Shull, F. and Zelkowitz, Marvin V}
}
@inbook {17770,
	title = {Aggregates in Generalized Temporally Indeterminate Databases},
	booktitle = {Scalable Uncertainty ManagementScalable Uncertainty Management},
	series = {Lecture Notes in Computer Science},
	volume = {4772},
	year = {2007},
	month = {2007///},
	pages = {171 - 186},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Dyreson and Snodgrass as well as Dekhtyar et. al. have provided a probabilistic model (as well as compelling example applications) for why there may be temporal indeterminacy in databases. In this paper, we first propose a formal model for aggregate computation in such databases when there is uncertainty not just in the temporal attribute, but also in the ordinary (non-temporal) attributes. We identify two types of aggregates: event correlated aggregates, and non event correlated aggregations, and provide efficient algorithms for both of them. We prove that our algorithms are correct, and we present experimental results showing that the algorithms work well in practice.},
	keywords = {Computer, Science},
	isbn = {978-3-540-75407-7},
	url = {http://dx.doi.org/10.1007/978-3-540-75410-7_13},
	author = {Udrea,Octavian and Majki{\'c},Zoran and Subrahmanian,V.},
	editor = {Prade,Henri and Subrahmanian,V.}
}
@article {15507,
	title = {Developing a Computer Science Department at the University of Maryland},
	journal = {Annals of the History of Computing, IEEE},
	volume = {29},
	year = {2007},
	month = {2007/12//oct},
	pages = {64 - 75},
	abstract = {This article describes the first six years of the Computer Science Department, established in 1973 at the University of Maryland. The department evolved out of the Computer Science Center, which had been instituted in February 1962. In 1980, the National Academy of Sciences judged the department as being among the leading computer science departments in the US.},
	keywords = {administrative, data, department;educational, MARYLAND, processing;, Science, University;computer},
	isbn = {1058-6180},
	doi = {10.1109/MAHC.2007.4407446},
	author = {Minker, Jack}
}
@article {18717,
	title = {Structural Biology: Analysis of {\textquoteright}downhill{\textquoteright} protein folding; Analysis of protein-folding cooperativity (Reply)},
	journal = {Nature},
	volume = {445},
	year = {2007},
	month = {2007/02/15/},
	pages = {E17-E18 - E17-E18},
	abstract = {Ferguson et al. and Zhou and Bai criticize the quality of our nuclear magnetic resonance (NMR) data and atom-by-atom analysis of global {\textquoteright}downhill{\textquoteright} folding, also claiming that the data are compatible with two-state folding.},
	keywords = {Astronomy, astrophysics, Biochemistry, Bioinformatics, Biology, biotechnology, cancer, cell cycle, cell signalling., climate change, Computational Biology, development, developmental biology, DNA, drug discovery, earth science, ecology, environmental science, Evolution, evolutionary biology, functional genomics, Genetics, Genomics, geophysics, immunology, interdisciplinary science, life, marine biology, materials science, medical research, medicine, metabolomics, molecular biology, molecular interactions, nanotechnology, Nature, neurobiology, neuroscience, palaeobiology, pharmacology, Physics, proteomics, quantum physics, RNA, Science, science news, science policy, signal transduction, structural biology, systems biology, transcriptomics},
	isbn = {0028-0836},
	doi = {10.1038/nature05645},
	url = {http://www.nature.com/nature/journal/v445/n7129/full/nature05645.html?lang=en},
	author = {Sadqi,Mourad and Fushman, David and Mu{\~n}oz,Victor}
}
@conference {16083,
	title = {VAST 2006 Contest - A Tale of Alderwood},
	booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On},
	year = {2006},
	month = {2006/11/31/2},
	pages = {215 - 216},
	abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The first visual analytics science and technology (VAST) contest was held in conjunction with the 2006 IEEE VAST Symposium. The competition entailed the identification of possible political shenanigans in the fictitious town of Alderwood. A synthetic data set was made available as well as tasks. We summarize how we prepared and advertised the contest, developed some initial metrics for evaluation, and selected the winners. The winners were invited to participate at an additional live competition at the symposium to provide them with feedback from senior analysts},
	keywords = {Alderwood;human, analysis;data, analytics, and, contest;data, information, interaction;sense, making;visual, Science, technology, visualisation;},
	doi = {10.1109/VAST.2006.261420},
	author = {Grinstein,G. and O{\textquoteright}Connell,T. and Laskowski,S. and Plaisant, Catherine and Scholtz,J. and Whiting,M.}
}
@inbook {17795,
	title = {Distributed Algorithms for Dynamic Survivability of Multiagent Systems},
	booktitle = {Computational Logic in Multi-Agent SystemsComputational Logic in Multi-Agent Systems},
	series = {Lecture Notes in Computer Science},
	volume = {3259},
	year = {2005},
	month = {2005///},
	pages = {139 - 144},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Though multiagent systems (MASs) are being increasingly used, few methods exist to ensure survivability of MASs. All existing methods suffer from two flaws. First, a centralized survivability algorithm (CSA) ensures survivability of the MAS {\textendash} unfortunately, if the node on which the CSA exists goes down, the survivability of the MAS is questionable. Second, no mechanism exists to change how the MAS is deployed when external factors trigger a re-evaluation of the survivability of the MAS. In this paper, we present three algorithms to address these two important problems. Our algorithms can be built on top of any CSA. Our algorithms are completely distributed and can handle external triggers to compute a new deployment. We report on experiments assessing the efficiency of these algorithms.},
	keywords = {Computer, Science},
	isbn = {978-3-540-24010-5},
	url = {http://dx.doi.org/10.1007/978-3-540-30200-1_1},
	author = {Subrahmanian,V. and Kraus,Sarit and Zhang,Yingqian},
	editor = {Dix,J{\"u}rgen and Leite,Jo{\~a}o}
}
@inbook {17793,
	title = {Probabilistic Ontologies and Relational Databases},
	booktitle = {On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASEOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE},
	series = {Lecture Notes in Computer Science},
	volume = {3760},
	year = {2005},
	month = {2005///},
	pages = {1 - 17},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to a query are always returned, leading to low recall. In this paper, we propose the novel notion of a constrained probabilistic ontology (CPO). We developed the concept of a CPO-enhanced relation in which each attribute of a relation has an associated CPO. These CPOs describe relationships between terms occurring in the domain of that attribute. We show that the relational algebra can be extended to handle CPO-enhanced relations. This allows queries to yield sets of tuples, each of which has a probability of being correct.},
	keywords = {Computer, Science},
	isbn = {978-3-540-29736-9},
	url = {http://dx.doi.org/10.1007/11575771_1},
	author = {Udrea,Octavian and Yu,Deng and Hung,Edward and Subrahmanian,V.},
	editor = {Meersman,Robert and Tari,Zahir}
}
@inbook {18019,
	title = {PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness},
	booktitle = {Mathematical Foundations of Computer Science 2004Mathematical Foundations of Computer Science 2004},
	series = {Lecture Notes in Computer Science},
	volume = {3153},
	year = {2004},
	month = {2004///},
	pages = {104 - 105},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Consider situations where once you were told about a new technical idea you reacted by saying: {\textquotedblleft}but this is so obvious, I wonder how I missed it{\textquotedblright}. I found out recently that the US patent law has a nice formal way of characterizing such a situation. The US patent law protects inventions that meet three requirements: utility, novelty and non-obviousness. Non-obviousness is considered the most challenging of the three to establish. The talk will try to argue that a possible virtue for a technical contribution is when, in restrospect, its non-obviousness is not too obvious; and since hindsight is always 20/20, one may often need to resort to various types of circumstantial evidence in order to establish non-obviousness. There are two reasons for bringing this issue up in my talk: (i) seeking such a virtue has been an objective of my work over the years, and (ii) issues of taste in research are more legitimate for invited talks; there might be merit in reminding younger researchers that not every {\textquotedblleft}result{\textquotedblright} is necessarily also a {\textquotedblleft}contribution{\textquotedblright}; perhaps the criterion of not-so-obvious non-obviousness could be helpful in some cases to help recognize a contribution. The focus of the second focal point for my talk, the PRAM-On-Chip approach, meets at least one of the standard legal ways to support non-obviousness: {\textquotedblleft}Expressions of disbelief by experts constitute strong evidence of non-obviousness{\textquotedblright}. It is well documented that the whole PRAM algorithmic theory was considered {\textquotedblleft}unrealistic{\textquotedblright} by numerous experts in the field, prior to the PRAM-On-Chip project. In fact, I needed recently to use this documentation in a reply to the U.S. patent office. An introduction of the PRAM-On-Chip approach follows. Many parallel computer systems architectures have been proposed and built over the last several decades. The outreach of the few that survived has been severely limited due to their programmability problems. The question of how to think algorithmically in parallel has been the fundamental problem for which these architectures did not have an adequate answer. A computational model, the Parallel Random Access Model (PRAM), has been developed by numerous (theoretical computer science) algorithm researchers to address this question during the 1980s and 1990s and is considered by many as the easiest known approach to parallel programming. Despite the broad interest the PRAM generated, it had not been possible to build parallel machines that adequately support it using multi-chip multiprocessors, the only multiprocessors that were buildable in the 1990s since low-overhead coordination was not possible. Our main insight is that this is becoming possible with the increasing amounts of hardware that can be placed on a single chip. From the PRAM, as a starting point, a highly parallel explicit multi-threaded (XMT) on-chip processor architecture that relies on new low-overhead coordination mechanisms and whose performance objective is reducing single task completion time has been conceived and developed. Simulated program executions have shown dramatic performance gains over conventional processor architectures. Namely, in addition to the unique parallel programmability features, which set XMT apart from any other current approach, XMT also provides very competitive performance. If XMT will meet expectations, its introduction would greatly enhance the normal rate of improvement of conventional processor architectures leading to new applications.},
	keywords = {Computer, Science},
	isbn = {978-3-540-22823-3},
	url = {http://dx.doi.org/10.1007/978-3-540-28629-5_5},
	author = {Vishkin, Uzi},
	editor = {Fiala,Jir{\'\i} and Koubek,V{\'a}clav and Kratochv{\'\i}l,Jan}
}
@inbook {12294,
	title = {Using Trust in Recommender Systems: An Experimental Analysis},
	booktitle = {Trust ManagementTrust Management},
	series = {Lecture Notes in Computer Science},
	volume = {2995},
	year = {2004},
	month = {2004///},
	pages = {221 - 235},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Recommender systems (RS) have been used for suggesting items (movies, books, songs, etc.) that users might like. RSs compute a user similarity between users and use it as a weight for the users{\textquoteright} ratings. However they have many weaknesses, such as sparseness, cold start and vulnerability to attacks. We assert that these weaknesses can be alleviated using a Trust-aware system that takes into account the {\textquotedblleft}web of trust{\textquotedblright} provided by every user. Specifically, we analyze data from the popular Internet web site epinions.com . The dataset consists of 49290 users who expressed reviews (with rating) on items and explicitly specified their web of trust, i.e. users whose reviews they have consistently found to be valuable. We show that any two users have usually few items rated in common. For this reason, the classic RS technique is often ineffective and is not able to compute a user similarity weight for many of the users. Instead exploiting the webs of trust, it is possible to propagate trust and infer an additional weight for other users. We show how this quantity can be computed against a larger number of users.},
	keywords = {Computer, Science},
	isbn = {978-3-540-21312-3},
	url = {http://dx.doi.org/10.1007/978-3-540-24747-0_17},
	author = {Massa,Paolo and Bhattacharjee, Bobby},
	editor = {Jensen,Christian and Poslad,Stefan and Dimitrakos,Theo}
}
@article {18023,
	title = {Deterministic Resource Discovery in Distributed Networks},
	journal = {Theory of Computing Systems},
	volume = {36},
	year = {2003},
	month = {2003///},
	pages = {479 - 495},
	abstract = {The resource discovery problem was introduced by Harchol-Balter, Leighton, and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. This model is a directed logical graph that represents the vertices{\textquoteright} knowledge about the topology of the underlying communication network. The current paper proposes a deterministic algorithm for the problem in the same model, with improved time, message, and communication complexities. Each previous algorithm had a complexity that was higher at least in one of the measures. Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity $O(n^3)$ (with message complexity $O(n^2)$), or message complexity $O(|E_0| {\l}og n)$ (where $E_0$ is the arc set of the initial graph $G_0$). Compared with the main randomized algorithm of Harchol-Balter, Leighton, and Lewin, the time complexity is reduced from $O({\l}og^2n)$ to\pagebreak[4] $O({\l}og n )$, the message complexity from $O(n {\l}og^2 n)$ to $O(n {\l}og n )$, and the communication complexity from $O(n^2 {\l}og^3 n)$ to $O(|E_0|{\l}og ^2 n )$. \par Our work significantly extends the connectivity algorithm of Shiloach and Vishkin which was originally given for a parallel model of computation. Our result also confirms a conjecture of Harchol-Balter, Leighton, and Lewin, and addresses an open question due to Lipton.},
	keywords = {Computer, Science},
	isbn = {1432-4350},
	url = {http://dx.doi.org/10.1007/s00224-003-1084-8},
	author = {Kutten,Shay and Peleg,David and Vishkin, Uzi}
}
@conference {14961,
	title = {Efficient techniques for range search queries on earth science data},
	booktitle = {Scientific and Statistical Database Management, 2002. Proceedings. 14th International Conference on},
	year = {2002},
	month = {2002///},
	pages = {142 - 151},
	abstract = {We consider the problem of organizing large scale earth science raster data to efficiently handle queries for identifying regions whose parameters fall within certain range values specified by the queries. This problem seems to be critical to enabling basic data mining tasks such as determining associations between physical phenomena and spatial factors, detecting changes and trends, and content based retrieval. We assume that the input is too large to fit in internal memory and hence focus on data structures and algorithms that minimize the I/O bounds. A new data structure, called a tree-of-regions (ToR), is introduced and involves a combination of an R-tree and efficient representation of regions. It is shown that such a data structure enables the handling of range queries in an optimal I/O time, under certain reasonable assumptions. We also show that updates to the ToR can be handled efficiently. Experimental results for a variety of multi-valued earth science data illustrate the fast execution times of a wide range of queries, as predicted by our theoretical analysis.},
	keywords = {based, computing;, content, data, data;, databases;, Earth, factors;, large, mining, mining;, natural, processing;, queries;, query, range, raster, retrieval;, scale, Science, sciences, search, spatial, structures;, tasks;, temporal, tree, tree-of-regions;, visual},
	doi = {10.1109/SSDM.2002.1029714},
	author = {Shi,Qingmin and JaJa, Joseph F.}
}
@inbook {17817,
	title = {Error-Tolerant Agents},
	booktitle = {Computational Logic: Logic Programming and BeyondComputational Logic: Logic Programming and Beyond},
	series = {Lecture Notes in Computer Science},
	volume = {2407},
	year = {2002},
	month = {2002///},
	pages = {83 - 104},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The use of agents in today{\textquoteright}s Internet world is expanding rapidly. Yet, agent developers proceed largely under the optimistic assumption that agents will be error-free. Errors may arise in agents for numerous reasons {\textemdash} agents may share a workspace with other agents or humans and updates made by these other entities may cause an agent to face a situation that it was not explicitly programmed to deal with. Likewise, errors in coding agents may lead to inconsistent situations where it is unclear how the agent should act. In this paper, we define an agent execution model that allows agents to continue acting {\textquotedblleft}reasonably{\textquotedblright} even when some errors of the above types occur. More importantly, in our framework, agents take {\textquotedblleft}repair{\textquotedblright} actions automatically when confronted with such situations, but while taking such repair actions, they can often continue to engage in work and/or interactions with other agents that are unaffected by repairs.},
	keywords = {Computer, Science},
	isbn = {978-3-540-43959-2},
	url = {http://dx.doi.org/10.1007/3-540-45628-7_22},
	author = {Eiter,Thomas and Mascardi,Viviana and Subrahmanian,V.},
	editor = {Kakas,Antonis and Sadri,Fariba}
}
@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 {16164,
	title = {Evaluation challenges for a Federation of heterogeneous information providers: the case of NASA{\textquoteright}s Earth Science Information Partnerships},
	booktitle = {Enabling Technologies: Infrastructure for Collaborative Enterprises, 2000. (WET ICE 2000). Proeedings. IEEE 9th International Workshops on},
	year = {2000},
	month = {2000///},
	pages = {130 - 135},
	abstract = {NASA{\textquoteright}s Earth Science Information Partnership Federation is an experiment funded to assess the ability of a group of widely heterogeneous earth science data or service providers to self organize and provide improved and affordable access to an expanding earth science user community. As it is self-organizing, the Federation is mandated to set in place an evaluation methodology and collect metrics reflecting the outcomes and benefits of the Federation. This paper describes the challenges of organizing such a federated partnership self-evaluation and discusses the issues encountered during the metrics definition phase of the early data collection. Our experience indicates that a large number of metrics will be needed to fully represent the activities and strengths of all partners, but because of the heterogeneity of the ESIPs the qualitative data (comments accompanying the metric data and success stories) becomes the most useful information. Other lessons learned included the absolute need for online browsing tools to accompany data collection tools. Finally, our experience confirms the effect of evaluation as an agent of change, the best example being the high level of collaboration among the ESIPs which can be in part attributed to the initial identification of collaboration as one of the important evaluation factors of the Federation},
	keywords = {Browsing, collection;heterogeneous, computing;groupware;, data;online, Earth, Federation;data, information, NASA{\textquoteright}s, Partnership, Science, systems;geophysics, tools;geographic},
	doi = {10.1109/ENABL.2000.883717},
	author = {Plaisant, Catherine and Komlodi,A. and Lindsay,F.}
}
@conference {16167,
	title = {Refining query previews techniques for data with multivalued attributes: the case of NASA EOSDIS},
	booktitle = {Research and Technology Advances in Digital Libraries, 1999. ADL {\textquoteright}99. Proceedings. IEEE Forum on},
	year = {1999},
	month = {1999///},
	pages = {50 - 59},
	abstract = {Query Previews allow users to rapidly gain an understanding of the content and scope of a digital data collection. These previews present overviews of abstracted metadata, enabling users to rapidly and dynamically avoid undesired data. We present our recent work on developing query previews for a variety of NASA EOSDIS situations. We focus on approaches that successfully address the challenge of multi-valued attribute data. Memory requirements and processing time associated with running these new solutions remain independent of the number of records in the dataset. We describe two techniques and their respective prototypes used to preview NASA Earth science data},
	keywords = {attribute, attributes;processing, collection;memory, computing;meta, data, data;abstracted, data;digital, data;multivalued, data;query, Earth, EOSDIS;NASA, libraries;geophysics, metadata;dataset;digital, NASA, previews, processing;, requirements;multi-valued, Science, techniques;undesired, time;query},
	doi = {10.1109/ADL.1999.777690},
	author = {Plaisant, Catherine and Venkatraman,M. and Ngamkajorwiwat,K. and Barth,R. and Harberts,B. and Feng,Wenlan}
}
@article {18438,
	title = {The empirical investigation of Perspective-Based Reading},
	journal = {Empirical Software Engineering},
	volume = {1},
	year = {1996},
	month = {1996///},
	pages = {133 - 164},
	abstract = {We consider reading techniques a fundamental means of achieving high quality software. Due to the lack of research in this area, we are experimenting with the application and comparison of various reading techniques. This paper deals with our experiences with a family of reading techniques known as Perspective-Based Reading (PBR), and its application to requirements documents. The goal of PBR is to provide operational scenarios where members of a review team read a document from a particular perspective, e.g., tester, developer, user. Our assumption is that the combination of different perspectives provides better coverage of the document, i.e., uncovers a wider range of defects, than the same number of readers using their usual technique.},
	keywords = {Computer, Science},
	isbn = {1382-3256},
	url = {http://dx.doi.org/10.1007/BF00368702},
	author = {Basili, Victor R. and Green,Scott and Laitenberger,Oliver and Lanubile,Filippo and Shull, Forrest and S{\o}rumg{\r a}rd,Sivert and Zelkowitz, Marvin V}
}
@inbook {18049,
	title = {On a parallel-algorithms method for string matching problems (overview)},
	booktitle = {Algorithms and ComplexityAlgorithms and Complexity},
	series = {Lecture Notes in Computer Science},
	volume = {778},
	year = {1994},
	month = {1994///},
	pages = {22 - 32},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	keywords = {Computer, Science},
	isbn = {978-3-540-57811-6},
	url = {http://dx.doi.org/10.1007/3-540-57811-0_3},
	author = {Sahinalp,Suleyman and Vishkin, Uzi},
	editor = {Bonuccelli,M. and Crescenzi,P. and Petreschi,R.}
}
