@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 {12120,
	title = {An experience management system for a software engineering research organization},
	booktitle = {Software Engineering Workshop, 2001. Proceedings. 26th Annual NASA Goddard},
	year = {2001},
	month = {2001///},
	pages = {29 - 35},
	abstract = {Most businesses rely on the fact that their employees possess relevant knowledge and that they can apply it to the task at hand. The problem is that this knowledge is not owned by the organization. It is owned and controlled by its employees. Maintaining an appropriate level of knowledge in the organization is a very important issue. It is, however, not an easy task for most organizations, and it is particularly problematic for software organizations, which are human- and knowledge-intensive. Knowledge management is a relatively new area that has attempted to address these problems. This paper introduces an approach called the "knowledge dust-to-pearls" approach. This approach addresses some of the issues with knowledge management by providing low-barrier mechanisms to "jump start" the experience base. This approach allows the experience base to become more useful more quickly than traditional approaches. This paper describes the approach and gives an example of its use at the Fraunhofer Center for Experimental Software Engineering, Maryland, USA},
	keywords = {and, approach;knowledge, base;experience, Center, control;knowledge, data, development, dust-to-pearls, engineering, Engineering;business, engineering;software, experimental, for, Fraunhofer, houses;, knowledge;employee, knowledge;experience, level, maintenance;knowledge, management, management;knowledge, management;software, mechanisms;software, organization;software, organizational, organizations;administrative, organizations;knowledge, organizations;low-barrier, ownership;knowledge-intensive, processing;personnel;research, research, software, system;human-intensive},
	doi = {10.1109/SEW.2001.992652},
	author = {Basili, Victor R. and Costa,P. and Lindvall,M. and Mendonca,M. and Seaman,C. and Tesoriero,R. and Zelkowitz, Marvin V}
}
@article {15235,
	title = {Centers of sets of pixels},
	journal = {Discrete Applied Mathematics},
	volume = {103},
	year = {2000},
	month = {2000/07/15/},
	pages = {297 - 306},
	abstract = {The center of a connected graph G is the set of nodes of G for which the maximum distance to any other node of G is as small as possible. If G is a simply connected set of lattice points ({\textquotedblleft}pixels{\textquotedblright}) with graph structure defined by 4-neighbor adjacency, we show that the center of G is either a 2{\texttimes}2 square block, a diagonal staircase, or a (dotted) diagonal line with no gaps.},
	keywords = {Center, Chessboard distance, City block distance, Intrinsic distance, Simply connected set},
	isbn = {0166-218X},
	doi = {10.1016/S0166-218X(99)00248-6},
	url = {http://www.sciencedirect.com/science/article/pii/S0166218X99002486},
	author = {Khuller, Samir and Rosenfeld,Azriel and Wu,Angela}
}
