@conference {12435,
	title = {Blurring-invariant Riemannian metrics for comparing signals and images},
	booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)},
	year = {2011},
	month = {2011/11/06/13},
	pages = {1770 - 1775},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We propose a novel Riemannian framework for comparing signals and images in a manner that is invariant to their levels of blur. This framework uses a log-Fourier representation of signals/images in which the set of all possible Gaussian blurs of a signal, i.e. its orbits under semigroup action of Gaussian blur functions, is a straight line. Using a set of Riemannian metrics under which the group actions are by isometries, the orbits are compared via distances between orbits. We demonstrate this framework using a number of experimental results involving 1D signals and 2D images.},
	keywords = {blurring-invariant Riemannian metrics, Estimation, Fourier transforms, Gaussian blur function, Gaussian processes, image representation, log-Fourier representation, measurement, Orbits, Polynomials, signal representation, Space vehicles, vectors},
	isbn = {978-1-4577-1101-5},
	doi = {10.1109/ICCV.2011.6126442},
	author = {Zhengwu Zhang and Klassen, E. and Srivastava, A. and Turaga,P. and Chellapa, Rama}
}
@conference {12437,
	title = {Domain adaptation for object recognition: An unsupervised approach},
	booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)},
	year = {2011},
	month = {2011/11/06/13},
	pages = {999 - 1006},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Adapting the classifier trained on a source domain to recognize instances from a new target domain is an important problem that is receiving recent attention. In this paper, we present one of the first studies on unsupervised domain adaptation in the context of object recognition, where we have labeled data only from the source domain (and therefore do not have correspondences between object categories across domains). Motivated by incremental learning, we create intermediate representations of data between the two domains by viewing the generative subspaces (of same dimension) created from these domains as points on the Grassmann manifold, and sampling points along the geodesic between them to obtain subspaces that provide a meaningful description of the underlying domain shift. We then obtain the projections of labeled source domain data onto these subspaces, from which a discriminative classifier is learnt to classify projected data from the target domain. We discuss extensions of our approach for semi-supervised adaptation, and for cases with multiple source and target domains, and report competitive results on standard datasets.},
	keywords = {Data models, data representations, discriminative classifier, Feature extraction, Grassmann manifold, image sampling, incremental learning, labeled source domain, Manifolds, measurement, object category, Object recognition, Principal component analysis, sampling points, semisupervised adaptation, target domain, underlying domain shift, unsupervised approach, unsupervised domain adaptation, Unsupervised learning, vectors},
	isbn = {978-1-4577-1101-5},
	doi = {10.1109/ICCV.2011.6126344},
	author = {Gopalan,R. and Ruonan Li and Chellapa, Rama}
}
@conference {12450,
	title = {Entropy rate superpixel segmentation},
	booktitle = {2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
	year = {2011},
	month = {2011/06/20/25},
	pages = {2097 - 2104},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term. The entropy rate favors formation of compact and homogeneous clusters, while the balancing function encourages clusters with similar sizes. We present a novel graph construction for images and show that this construction induces a matroid - a combinatorial structure that generalizes the concept of linear independence in vector spaces. The segmentation is then given by the graph topology that maximizes the objective function under the matroid constraint. By exploiting submodular and mono-tonic properties of the objective function, we develop an efficient greedy algorithm. Furthermore, we prove an approximation bound of {\textonehalf} for the optimality of the solution. Extensive experiments on the Berkeley segmentation benchmark show that the proposed algorithm outperforms the state of the art in all the standard evaluation metrics.},
	keywords = {balancing function, Berkeley segmentation benchmark, Complexity theory, Entropy, entropy rate, graph construction, graph theory, graph topology, greedy algorithm, Greedy algorithms, homogeneous clusters, Image edge detection, Image segmentation, matrix algebra, matroid constraint, measurement, pattern clustering, Random variables, standard evaluation metrics, superpixel segmentation, vector spaces},
	isbn = {978-1-4577-0394-2},
	doi = {10.1109/CVPR.2011.5995323},
	author = {Ming-Yu Liu and Tuzel, O. and Ramalingam, S. and Chellapa, Rama}
}
@conference {17144,
	title = {EventGraphs: Charting Collections of Conference Connections},
	booktitle = {2011 44th Hawaii International Conference on System Sciences (HICSS)},
	year = {2011},
	month = {2011/01/04/7},
	pages = {1 - 10},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {EventGraphs are social media network diagrams of conversations related to events, such as conferences. Many conferences now communicate a common "hashtag" or keyword to identify messages related to the event. EventGraphs help make sense of the collections of connections that form when people follow, reply or mention one another and a keyword. This paper defines EventGraphs, characterizes different types, and shows how the social media network analysis add-in NodeXL supports their creation and analysis. The structural patterns to look for in EventGraphs are highlighted and design ideas for their improvement are discussed.},
	keywords = {conference connections, Conferences, Data visualization, EventGraphs, hashtag, measurement, Media, message identification, multimedia computing, NodeXL, Real time systems, social media network diagrams, social networking (online), Twitter},
	isbn = {978-1-4244-9618-1},
	doi = {10.1109/HICSS.2011.196},
	author = {Hansen,D. and Smith,M. A and Shneiderman, Ben}
}
@conference {17306,
	title = {NetVisia: Heat Map \& Matrix Visualization of Dynamic Social Network Statistics \& Content},
	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 = {19 - 26},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Visualizations of static networks in the form of node-link diagrams have evolved rapidly, though researchers are still grappling with how best to show evolution of nodes over time in these diagrams. This paper introduces NetVisia, a social network visualization system designed to support users in exploring temporal evolution in networks by using heat maps to display node attribute changes over time. NetVisia{\textquoteright}s novel contributions to network visualizations are to (1) cluster nodes in the heat map by similar metric values instead of by topological similarity, and (2) align nodes in the heat map by events. We compare NetVisia to existing systems and describe a formative user evaluation of a NetVisia prototype with four participants that emphasized the need for tool tips and coordinated views. Despite the presence of some usability issues, in 30-40 minutes the user evaluation participants discovered new insights about the data set which had not been discovered using other systems. We discuss implemented improvements to NetVisia, and analyze a co-occurrence network of 228 business intelligence concepts and entities. This analysis confirms the utility of a clustered heat map to discover outlier nodes and time periods.},
	keywords = {business intelligence concept, business intelligence entity, competitive intelligence, data visualisation, dynamic networks, dynamic social network, heat map, Heating, Image color analysis, Information Visualization, Layout, matrix visualization, measurement, NetVisia system, network evolution, network visualization, node-link diagrams, outlier node, social network content, Social network services, social network statistics, social networking (online), social networks, static network visualization, time period, topological similarity, Training, usability, user evaluation, User interfaces},
	isbn = {978-1-4577-1931-8},
	doi = {10.1109/PASSAT/SocialCom.2011.216},
	author = {Gove,R. and Gramsky,N. and Kirby,R. and Sefer,E. and Sopan,A. and Dunne,C. and Shneiderman, Ben and Taieb-Maimon,M.}
}
@conference {17484,
	title = {Visual Analysis of Temporal Trends in Social Networks Using Edge Color Coding and Metric Timelines},
	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 = {549 - 554},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present Net EvViz, a visualization tool for analysis and exploration of a dynamic social network. There are plenty of visual social network analysis tools but few provide features for visualization of dynamically changing networks featuring the addition or deletion of nodes or edges. Our tool extends the code base of the Node XL template for Microsoft Excel, a popular network visualization tool. The key features of this work are (1) The ability of the user to specify and edit temporal annotations to the network components in an Excel sheet, (2) See the dynamics of the network with multiple graph metrics plotted over the time span of the graph, called the Timeline, and (3) Temporal exploration of the network layout using an edge coloring scheme and a dynamic Time slider. The objectives of the new features presented in this paper are to let the data analysts, computer scientists and others to observe the dynamics or evolution in a network interactively. We presented Net EvViz to five users of Node XL and received positive responses.},
	keywords = {Color, computer scientists, data analysts, data visualisation, Data visualization, dynamic social network, dynamic timeslider, edge color coding, excel sheet, Image coding, image colour analysis, Layout, measurement, metric timelines, Microsoft excel, multiple graph metrics, Net EvViz, network components, network layout, network visualization tool, NodeXL template, social networking (online), temporal trends, Twitter, Visualization},
	isbn = {978-1-4577-1931-8},
	doi = {10.1109/PASSAT/SocialCom.2011.212},
	author = {Khurana,U. and Nguyen,Viet-An and Hsueh-Chien Cheng and Ahn,Jae-wook and Chen,Xi and Shneiderman, Ben}
}
@article {12463,
	title = {Compressive Video Acquisition, Fusion and Processing},
	year = {2010},
	month = {2010/12/14/},
	abstract = {Modern developments in sensor technology, signal processing, and wireless communications have enabled the conception and deployment of large-scale networked sensing systems spanning numerous collection platforms and varied modalities. These systems have the potential to make intelligent decisions by integrating information from massive amounts of sensor data. Before such benefits can be achieved, significant advances must be made in methods for communicating, fusing, and processing this evergrowing volume of diverse data. In this one-year research project, we aimed to expose the fundamental issues and pave the way for further careful study of compressive approaches to video acquisition, fusion, and processing. In doing so, we developed a theoretical definition of video temporal bandwidth and applied the theory to compressive sampling and reconstruction. We created a new framework for compressive video sensing based on linear dynamical systems, lowering the compressive measurement rate. Finally, we applied our own joint manifold model to a variety of relevant image processing problems, demonstrating the model{\textquoteright}s effectiveness and ability to overcome noise and occlusion obstacles. We also showed how joint manifold models can discover an object{\textquoteright}s trajectory, an important step towards video fusion.},
	keywords = {*DATA FUSION, *DETECTORS, *SIGNAL PROCESSING, *VIDEO SIGNALS, ACQUISITION, COLLECTION, COMMUNICATION AND RADIO SYSTEMS, COMPRESSIVE PROPERTIES, COMPRESSIVE SAMPLING, compressive sensing, COMPRESSIVE VIDEO, decision making, DEPLOYMENT, DETECTION, DYNAMICS, IMAGE PROCESSING, Linear systems, Linearity, MANIFOLDS(ENGINES), measurement, MISCELLANEOUS DETECTION AND DETECTORS, MODELS, sampling, THEORY, TRAJECTORIES},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA533703},
	author = {Baraniuk,Richard G. and Chellapa, Rama and Wakin,Michael}
}
@conference {12511,
	title = {Enhancing sparsity using gradients for compressive sensing},
	booktitle = {Image Processing (ICIP), 2009 16th IEEE International Conference on},
	year = {2009},
	month = {2009/11//},
	pages = {3033 - 3036},
	abstract = {In this paper, we propose a reconstruction method that recovers images assumed to have a sparse representation in a gradient domain by using partial measurement samples that are collected in the Fourier domain. A key improvement of this technique is that it makes use of a robust generalized Poisson solver that greatly aids in achieving a significantly improved performance over similar proposed methods. Experiments provided also demonstrate that this new technique is more flexible to work with either random or restricted sampling scenarios better than its competitors.},
	keywords = {analysis;gradient, domain;compressive, domain;image, Fourier, generalized, measurement, methods;, methods;image, Poisson, reconstruction;image, reconstruction;partial, representation;Fourier, representation;sampling, samples;robust, scenarios;sparse, sensing;enhancing, solver;sampling, sparsity;gradient},
	doi = {10.1109/ICIP.2009.5414411},
	author = {Patel, Vishal M. and Easley,G. R and Chellapa, Rama and Healy,D. M}
}
@article {12162,
	title = {The Use of Empirical Studies in the Development of High End Computing Applications},
	year = {2009},
	month = {2009/12//},
	institution = {University of Maryland, College Park},
	abstract = {This report provides a description of the research and development activities towards learning much about the development and measurement of productivity in high performance computing environments. Many objectives were accomplished including the development of a methodology for measuring productivity in the parallel programming domain. This methodology was tested over 25 times at 8 universities across the United States and can be used to aid other researchers studying similar environments. The productivity measurement methodology incorporates both development time and performance into a single productivity number. An Experiment Manager tool for collecting data on the development of parallel programs, as well as a suite of tools to aid in the capture and analysis of such data was also developed. Lastly, several large scale development environments were studied in order to better understand the environment used to build large parallel programming applications. That work also included several surveys and interviews with many professional programmers in these environments.},
	keywords = {*COMPUTER PROGRAMMING, *EMPIRICAL STUDIES, *HPC(HIGH PERFORMANCE COMPUTING), *METHODOLOGY, *PARALLEL PROCESSING, *PARALLEL PROGRAMMING, *PRODUCTIVITY, *SOFTWARE ENGINEERING, *SOFTWARE METRICS, ADMINISTRATION AND MANAGEMENT, APMS(AUTOMATED PERFORMANCE MEASUREMENT SYSTEM), COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER SYSTEMS MANAGEMENT AND STANDARDS, data acquisition, efficiency, ENVIRONMENTS, HIGH END COMPUTING, HPCBUGBASE, HUMAN FACTORS ENGINEERING \& MAN MACHINE SYSTEM, learning, measurement, MPI(MESSAGE PASSING INTERFACE), PARALLEL ORIENTATION, PE62303E, PROGRAMMERS, SE(SOFTWARE ENGINEERING), SUPERVISORS, TEST AND EVALUATION, TEST FACILITIES, EQUIPMENT AND METEORS, TIME, tools, United States, WUAFRLT810HECA},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA511351},
	author = {Basili, Victor R. and Zelowitz,Marvin V}
}
@conference {12245,
	title = {Growth of the flickr social network},
	booktitle = {Proceedings of the first workshop on Online social networks},
	series = {WOSN {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {25 - 30},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Online social networking sites like MySpace, Orkut, and Flickr are among the most popular sites on the Web and continue to experience dramatic growth in their user population. The popularity of these sites offers a unique opportunity to study the dynamics of social networks at scale. Having a proper understanding of how online social networks grow can provide insights into the network structure, allow predictions of future growth, and enable simulation of systems on networks of arbitrary size. However, to date, most empirical studies have focused on static network snapshots rather than growth dynamics. In this paper, we collect and examine detailed growth data from the Flickr online social network, focusing on the ways in which new links are formed. Our study makes two contributions. First, we collect detailed data covering three months of growth, encompassing 950,143 new users and over 9.7 million new links, and we make this data available to the research community. Second, we use a first-principles approach to investigate the link formation process. In short, we find that links tend to be created by users who already have many links, that users tend to respond to incoming links by creating links back to the source, and that users link to other users who are already close in the network.},
	keywords = {growth, measurement, social networks},
	isbn = {978-1-60558-182-8},
	doi = {10.1145/1397735.1397742},
	url = {http://doi.acm.org/10.1145/1397735.1397742},
	author = {Mislove,Alan and Koppula,Hema Swetha and Gummadi,Krishna P. and Druschel,Peter and Bhattacharjee, Bobby}
}
@article {12147,
	title = {Measures and Risk Indicators for Early Insight into Software Safety. Development of Fault-Tolerant Systems},
	year = {2008},
	month = {2008/10//},
	institution = {ABERDEEN TEST CENTER MD},
	abstract = {Software contributes an ever-increasing level of functionality and control in today{\textquoteright}s systems. This increased use of software can dramatically increase the complexity and time needed to evaluate the safety of a system. Although the actual system safety cannot be verified during its development, measures can reveal early insights into potential safety problems and risks. An approach for developing early software safety measures is presented in this article. The approach and the example software measures presented are based on experience working with the safety engineering group on a large Department of Defense program.},
	keywords = {*SOFTWARE ENGINEERING, *SYSTEM SAFETY, COMPUTER PROGRAMMING AND SOFTWARE, fault tolerant computing, INDICATORS, measurement, REPRINTS, risk, SAFETY ENGINEERING},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA487120},
	author = {Basili, Victor R. and Marotta,Frank and Dangle,Kathleen and Esker,Linda and Rus,Ioana}
}
@conference {12256,
	title = {Measurement and analysis of online social networks},
	booktitle = {Proceedings of the 7th ACM SIGCOMM conference on Internet measurement},
	series = {IMC {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {29 - 42},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity to study the characteristics of online social network graphs at large scale. Understanding these graphs is important, both to improve current systems and to design new applications of online social networks. This paper presents a large-scale measurement study and analysis of the structure of multiple online social networks. We examine data gathered from four popular online social networks: Flickr, YouTube, LiveJournal, and Orkut. We crawled the publicly accessible user links on each site, obtaining a large portion of each social network{\textquoteright}s graph. Our data set contains over 11.3 million users and 328 million links. We believe that this is the first study to examine multiple online social networks at scale. Our results confirm the power-law, small-world, and scale-free properties of online social networks. We observe that the indegree of user nodes tends to match the outdegree; that the networks contain a densely connected core of high-degree nodes; and that this core links small groups of strongly clustered, low-degree nodes at the fringes of the network. Finally, we discuss the implications of these structural properties for the design of social network based systems.},
	keywords = {analysis, measurement, social networks},
	isbn = {978-1-59593-908-1},
	doi = {10.1145/1298306.1298311},
	url = {http://doi.acm.org/10.1145/1298306.1298311},
	author = {Mislove,Alan and Marcon,Massimiliano and Gummadi,Krishna P. and Druschel,Peter and Bhattacharjee, Bobby}
}
@conference {14803,
	title = {Performance Measurement of Novice HPC Programmers Code},
	booktitle = {Proceedings of the 3rd International Workshop on Software Engineering for High Performance Computing Applications},
	series = {SE-HPC {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {3{\textendash} - 3{\textendash}},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	abstract = {Performance is one of the key factors of improving productivity in High Performance Computing (HPC). In this paper we discuss current studies in the field of performance measurement of codes captured in classroom experiments for the High Productivity Computing Project (HPCS). We give two examples of measurements introducing two new hypotheses: spending more effort doesn{\textquoteright}t always result in improvement of performance for novices; the use of higher level MPI functions promises better performance for novices. We also present a tool - the Automated Performance Measurement System (APMS). APMS helps to partially automate the measurement of the performance of a set of parallel programs with several inputs. The design and implementation of the tool is flexible enough to allow other researchers to conduct similar studies.},
	keywords = {measurement, performance, performance measures, product metrics, program analysis},
	isbn = {0-7695-2969-0},
	doi = {http://dx.doi.org/10.1109/SE-HPC.2007.4},
	url = {http://dx.doi.org/10.1109/SE-HPC.2007.4},
	author = {Alameh, Rola and Zazworka, Nico and Hollingsworth, Jeffrey K}
}
@conference {14777,
	title = {Combining self-reported and automatic data to improve programming effort measurement},
	booktitle = {Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering},
	series = {ESEC/FSE-13},
	year = {2005},
	month = {2005///},
	pages = {356 - 365},
	publisher = {ACM},
	organization = {ACM},
	address = {Lisbon, Portugal},
	abstract = {Measuring effort accurately and consistently across subjects in a programming experiment can be a surprisingly difficult task. In particular, measures based on self-reported data may differ significantly from measures based on data which is recorded automatically from a subject{\textquoteright}s computing environment. Since self-reports can be unreliable, and not all activities can be captured automatically, a complete measure of programming effort should incorporate both classes of data. In this paper, we show how self-reported and automatic effort can be combined to perform validation and to measure total programming effort.},
	keywords = {effort, experimentation, human factors, manual approaches, measurement, process metrics, verification},
	isbn = {1-59593-014-0},
	doi = {10.1145/1081706.1081762},
	author = {Hochstein, Lorin and Basili, Victor R. and Zelkowitz, Marvin V and Hollingsworth, Jeffrey K and Carver, Jeff}
}
@conference {16420,
	title = {Measurements for understanding the behavior of the genetic algorithm in dynamic environments: a case study using the Shaky Ladder Hyperplane-Defined Functions},
	booktitle = {Proceedings of the 2005 workshops on Genetic and evolutionary computation},
	series = {GECCO {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {32 - 38},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We describe a set of measures to examine the behavior of the Genetic Algorithm (GA) in dynamic environments. We describe how to use both average and best measures to look at performance, satisficability, robustness, and diversity. We use these measures to examine GA behavior with a recently devised dynamic test suite, the Shaky Ladder Hyperplane-Defined Functions (sl-hdf{\textquoteright}s). This test suite can generate random problems with similar levels of difficulty and provides a platform allowing systematic controlled observations of the GA in dynamic environments. We examine the results of these measures in two different versions of the sl-hdf{\textquoteright}s, one static and one regularly-changing. We provide explanations for the observations in these two different environments, and give suggestions as to future work.},
	keywords = {dynamic environments, Genetic algorithms, hyperplane-defined functions, measurement},
	doi = {10.1145/1102256.1102263},
	url = {http://doi.acm.org/10.1145/1102256.1102263},
	author = {Rand, William and Riolo,Rick}
}
@article {14758,
	title = {Recovering system specific rules from software repositories},
	journal = {SIGSOFT Softw. Eng. Notes},
	volume = {30},
	year = {2005},
	month = {2005/05//},
	pages = {1 - 5},
	abstract = {One of the most successful applications of static analysis based bug finding tools is to search the source code for violations of system-specific rules. These rules may describe how functions interact in the code, how data is to be validated or how an API is to be used. To apply these tools, the developer must encode a rule that must be followed in the source code. The difficulty is that many of these system-specific rules are undocumented and "grow" over time as the source code changes. Most research in this area relies on expert programmers to document these little-known rules. In this paper we discuss a method to automatically recover a subset of these rules, function usage patterns, by mining the software repository. We present a preliminary study that applies our work to a large open source software project.},
	keywords = {data warehouse and repository, debugging aids, design, experimentation, measurement, performance},
	isbn = {0163-5948},
	doi = {10.1145/1082983.1083144},
	author = {Williams, Chadd C and Hollingsworth, Jeffrey K}
}
@conference {14785,
	title = {Using Dynamic Tracing Sampling to Measure Long Running Programs},
	booktitle = {Proceedings of the 2005 ACM/IEEE conference on Supercomputing},
	series = {SC {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {59{\textendash} - 59{\textendash}},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	abstract = {Detailed cache simulation can be useful to both system developers and application writers to understand an application{\textquoteright}s performance. However, measuring long running programs can be extremely slow. In this paper we present a technique to use dynamic sampling of trace snippets throughout an application{\textquoteright}s execution. We demonstrate that our approach improves accuracy compared to sampling a few timesteps at the beginning of execution by judiciously choosing the frequency, as well as the points in the control flow, at which samples are collected. Our approach is validated using the SIGMA tracing and simulation framework for the IBM Power family of processors.},
	keywords = {data communications, design, experimentation, measurement, performance, tracing},
	isbn = {1-59593-061-2},
	doi = {http://dx.doi.org/10.1109/SC.2005.77},
	url = {http://dx.doi.org/10.1109/SC.2005.77},
	author = {Odom, Jeffrey and Hollingsworth, Jeffrey K and DeRose,Luiz and Ekanadham, Kattamuri and Sbaraglia, Simone}
}
@article {12752,
	title = {A generic approach to simultaneous tracking and verification in video},
	journal = {Image Processing, IEEE Transactions on},
	volume = {11},
	year = {2002},
	month = {2002/05//},
	pages = {530 - 544},
	abstract = {A generic approach to simultaneous tracking and verification in video data is presented. The approach is based on posterior density estimation using sequential Monte Carlo methods. Visual tracking, which is in essence a temporal correspondence problem, is solved through probability density propagation, with the density being defined over a proper state space characterizing the object configuration. Verification is realized through hypothesis testing using the estimated posterior density. In its most basic form, verification can be performed as follows. Given a measurement vector Z and two hypotheses H<sub>1</sub> and H0, we first estimate posterior probabilities P(H<sub>0</sub>|Z) and P(H<sub>1</sub>|Z), and then choose the one with the larger posterior probability as the true hypothesis. Several applications of the approach are illustrated by experiments devised to evaluate its performance. The idea is first tested on synthetic data, and then experiments with real video sequences are presented, illustrating vehicle tracking and verification, human (face) tracking and verification, facial feature tracking, and image sequence stabilization.},
	keywords = {approach;, Carlo, configuration;, correspondence, data;, density, density;, estimated, estimation;, evaluation;, extraction;, Face, facial, feature, generic, human, hypothesis, image, measurement, methods;, Monte, object, performance, posterior, probability, probability;, problem;, processing;, propagation;, recognition;, road, sequence, sequences;, sequential, signal, space;, stabilization;, state, synthetic, temporal, testing;, tracking;, vector;, vehicle, vehicles;, verification;, video, visual},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2002.1006400},
	author = {Li,Baoxin and Chellapa, Rama}
}
@conference {14772,
	title = {Recompilation for debugging support in a JIT-compiler},
	booktitle = {Proceedings of the 2002 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering},
	series = {PASTE {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {10 - 17},
	publisher = {ACM},
	organization = {ACM},
	address = {Charleston, South Carolina, USA},
	abstract = {A static Java compiler converts Java source code into a verifiably secure and compact architecture-neutral intermediate format, called Java byte codes. The Java byte codes can be either interpreted by a Java Virtual Machine or translated into native code by Java Just-In-Time compilers. Static Java compilers embed debug information in the Java class files to be used by the source level debuggers. However, the debug information is generated for architecture independent byte codes and most of the debug information is valid only when the byte codes are interpreted. Translating byte codes into native instructions puts a limitation on the amount of usable debug information that can be used by source level debuggers. In this paper, we present a new technique to generate valid debug information when Just-In-Time compilers are used. Our approach is based on the dynamic recompilation of Java methods by a fast code generator and lazily generates debug information when it is required. We also present three implementations for field watch support in the Java Virtual Machine Debugger Interface to investigate the runtime overhead and code size growth by our approach.},
	keywords = {algorithms, debug information, debugging aids, dynamic recompilation, field access watch, java, java virtual machine debugger interface, just-in-time compilation, measurement, performance},
	isbn = {1-58113-479-7},
	doi = {10.1145/586094.586100},
	author = {Tikir, Mustafa M. and Hollingsworth, Jeffrey K and Lueh,Guei-Yuan}
}
@conference {12306,
	title = {Scalable peer finding on the Internet},
	booktitle = {Global Telecommunications Conference, 2002. GLOBECOM {\textquoteright}02. IEEE},
	volume = {3},
	year = {2002},
	month = {2002/11//},
	pages = {2205 - 2209 vol.3 - 2205 - 2209 vol.3},
	abstract = {We consider the problem of finding nearby application peers over the Internet. We define a new peer-finding scheme (called Tiers) that scales to large application peer groups. Tiers creates a hierarchy of the peers, which allows an efficient and scalable solution to this problem. The scheme can be implemented entirely in the application-layer and does not require the deployment of either any additional measurement services, or well-known reference landmarks in the network. We present detailed evaluation of Tiers and compare it to one previously proposed scheme called Beaconing. Through analysis and detailed simulations on 10,000 node Internet-like topologies we show that Tiers achieves comparable or better performance with a significant reduction in control overheads for groups of size 32 or more.},
	keywords = {application, application-layer;, Beaconing;, CONTROL, finding;, Internet-like, Internet;, measurement, network, overhead, peer, peer-finding, peers;, protocol;, protocols;, reduction;, scalable, scheme;, services;, simulations;, solution;, Tiers;, topologies;, topology;},
	doi = {10.1109/GLOCOM.2002.1189023},
	author = {Banerjee,S. and Kommareddy,C. and Bhattacharjee, Bobby}
}
@conference {12315,
	title = {Finding close friends on the Internet},
	booktitle = {Network Protocols, 2001. Ninth International Conference on},
	year = {2001},
	month = {2001/11//},
	pages = {301 - 309},
	abstract = {We consider the problem of finding nearby application-peers (close friends) over the Internet. We focus on unicast-only solutions and introduce a new scheme -Beaconing-for finding peers that are near. Our scheme uses distance measurement points (called beacons) and can be implemented entirely in the application-layer without investing in large infrastructure changes. We present an extensive evaluation of Beaconing and compare it to existing schemes including Expanding Ring searches and Triangulation. Our experiments show that 3-8 beacons are sufficient to provide efficient peer-location service on 10 000 node Internet-like topologies. Further, our results are 2-5 times more accurate than existing techniques. We also present results from an implementation of Beaconing over a non-trivial wide-area testbed. In our experiments, Beaconing is able to efficiently (< 3 K Bytes and < 50 packets on average), quickly (< 1 second on average), and accurately (< 20 ms error on average) find nearby peers on the Internet.},
	keywords = {application-layer;, application-peers;, Beaconing;, beacons;, close, distance, Expanding, friends;, Internet-like, Internet;, IP;, measurement, nearby, network, peer-location, points;, protocols;, Ring, searches;, service;, solutions;, testbed;, topologies;, topology;, transport, Triangulation;, unicast-only, wide-area},
	doi = {10.1109/ICNP.2001.992910},
	author = {Kommareddy,C. and Shankar,N. and Bhattacharjee, Bobby}
}
@conference {15052,
	title = {Web based progressive transmission for browsing remotely sensed imagery},
	booktitle = {Geoscience and Remote Sensing Symposium, 2000. Proceedings. IGARSS 2000. IEEE 2000 International},
	volume = {2},
	year = {2000},
	month = {2000///},
	pages = {591 -593 vol.2 - 591 -593 vol.2},
	abstract = {This paper describes an image representation technique that entails progressive refinement of user specified regions of interest (ROI) of large images. Progressive refinement to original quality can be accomplished in theory. However, due to heavy burden on storage resources for the authors{\textquoteright} applications, they restrict the refinement to about 25\% of the original data resolution. A wavelet decomposition of the data combined with scalar and vector quantization (VQ) of the high frequency components and JPEG/DCT compression of low frequency component is used as representation framework. Their software will reconstruct the region selected by the user from its wavelet decomposition such that it fills up the preview window with the appropriate subimages at the desired resolution, including full resolution stored for preview. Further refinement from the first preview can be obtained progressively by transmitting high frequency coefficients from low resolution to high resolution which are compressed by variant of vector quantization called model-based VQ (MVQ). The user will have an option for progressive build up of the ROIs until full resolution stored or terminate the transmission at any time during the progressive refinement},
	keywords = {based, decomposition;geophysical, image;model-based, interest;remote, interest;vector, mapping;user, mapping;vector, measurement, of, processing;geophysical, processing;image, Progressive, quantisation;wavelet, quantization;wavelet, refinement;region, regions, representation;land, representation;remote, sensing;scalar;terrain, sensing;terrain, signal, specified, specified;user, surface;large, technique;image, techniques;image, transforms;, transmission;browsing;geophysical, VQ;progressive, Web},
	doi = {10.1109/IGARSS.2000.861640},
	author = {Mareboyana,M. and Srivastava,S. and JaJa, Joseph F.}
}
@conference {14927,
	title = {A hierarchical data archiving and processing system to generate custom tailored products from AVHRR data},
	booktitle = {Geoscience and Remote Sensing Symposium, 1999. IGARSS {\textquoteright}99 Proceedings. IEEE 1999 International},
	volume = {5},
	year = {1999},
	month = {1999///},
	pages = {2374 -2376 vol.5 - 2374 -2376 vol.5},
	abstract = {A novel indexing scheme is described to catalogue satellite data on a pixel basis. The objective of this research is to develop an efficient methodology to archive, retrieve and process satellite data, so that data products can be generated to meet the specific needs of individual scientists. When requesting data, users can specify the spatial and temporal resolution, geographic projection, choice of atmospheric correction, and the data selection methodology. The data processing is done in two stages. Satellite data is calibrated, navigated and quality flags are appended in the initial processing. This processed data is then indexed and stored. Secondary processing such as atmospheric correction and projection are done after a user requests the data to create custom made products. By dividing the processing in to two stages saves time, since the basic processing tasks such as navigation and calibration which are common to all requests are not repeated when different users request satellite data. The indexing scheme described can be extended to allow fusion of data sets from different sensors},
	keywords = {archiving;image, AVHRR;GIS;PACS;custom, data, image;land, image;remote, mapping;, mapping;PACS;geophysical, measurement, PROCESSING, processing;geophysical, product;data, remote, scheme;infrared, sensing;optical, sensing;terrain, signal, surface;multispectral, system;indexing, tailored, technique;hierarchical, techniques;remote},
	doi = {10.1109/IGARSS.1999.771514},
	author = {Kalluri, SNV and Zhang,Z. and JaJa, Joseph F. and Bader, D.A. and Song,H. and El Saleous,N. and Vermote,E. and Townshend,J.R.G.}
}
@conference {14784,
	title = {LBF: a performance metric for program reorganization},
	booktitle = {18th International Conference on Distributed Computing Systems, 1998. Proceedings},
	year = {1998},
	month = {1998/05/26/29},
	pages = {222 - 229},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We introduce a new performance metric, called Load Balancing Factor (LBF), to assist programmers with evaluating different tuning alternatives. The LBF metric differs from traditional performance metrics since it is intended to measure the performance implications of a specific tuning alternative rather than quantifying where time is spent in the current version of the program. A second unique aspect of the metric is that it provides guidance about moving work within a distributed or parallel program rather than reducing it. A variation of the LBF metric can also be used to predict the performance impact of changing the underlying network. The LBF metric can be computed incrementally and online during the execution of the program to be tuned. We also present a case study that shows that our metric can predict the actual performance gains accurately for a test suite of six programs},
	keywords = {case study, Computational modeling, computer network, Computer science, Debugging, distributed processing, distributed program, Educational institutions, Integrated circuit testing, LBF metric, load balancing factor, Load management, measurement, NIST, parallel program, parallel programming, performance metric, program reorganization, program tuning, Programming profession, resource allocation, software metrics, software performance evaluation, US Department of Energy},
	isbn = {0-8186-8292-2},
	doi = {10.1109/ICDCS.1998.679505},
	author = {Eom, H. and Hollingsworth, Jeffrey K}
}
@conference {14809,
	title = {Performance measurement using low perturbation and high precision hardware assists},
	booktitle = {, The 19th IEEE Real-Time Systems Symposium, 1998. Proceedings},
	year = {1998},
	month = {1998/12/02/4},
	pages = {379 - 388},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present the design and implementation of MultiKron PCI, a hardware performance monitor that can be plugged into any computer with a free PCI bus slot. The monitor provides a series of high-resolution timers, and the ability to monitor the utilization of the PCI bus. We also demonstrate how the monitor can be integrated with online performance monitoring tools such as the Paradyn parallel performance measurement tools to improve the overhead of key timer operations by a factor of 25. In addition, we present a series of case studies using the MultiKron hardware performance monitor to measure and tune high-performance parallel completing applications. By using the monitor, we were able to find and correct a performance bug in a popular implementation of the MPI message passing library that caused some communication primitives to run at one half their potential speed},
	keywords = {Clocks, Computerized monitoring, Counting circuits, Debugging, Hardware, hardware performance monitor, high precision hardware assists, low perturbation, measurement, MPI message passing library, MultiKron hardware performance monitor, MultiKron PCI, NIST, online performance monitoring tools, Paradyn parallel performance measurement tools, PCI bus slot, performance bug, performance evaluation, performance measurement, program debugging, program testing, real-time systems, Runtime, Timing},
	isbn = {0-8186-9212-X},
	doi = {10.1109/REAL.1998.739771},
	author = {Mink, A. and Salamon, W. and Hollingsworth, Jeffrey K and Arunachalam, R.}
}
@article {18377,
	title = {Comments on "Towards a framework for software measurement validation"},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {23},
	year = {1997},
	month = {1997/03//},
	pages = {187 - 189},
	abstract = {A view of software measurement that disagrees with the model presented by Kitchenham, Pfleeger, and Fenton (1995), is given. Whereas Kitchenham et al. argue that properties used to define measures should not constrain the scale type of measures, the authors contend that that is an inappropriate restriction. In addition, a misinterpretation of Weyuker{\textquoteright}s (1988) properties is noted.},
	keywords = {measurement, metrics;, software, testing;program, validation;program, verification;software},
	isbn = {0098-5589},
	doi = {10.1109/32.585506},
	author = {Morasca,S. and Briand,L.C. and Basili, Victor R. and Weyuker,E.J. and Zelkowitz, Marvin V and Kitchenham,B. and Lawrence Pfleeger,S. and Fenton,N.}
}
@article {18392,
	title = {Experimental validation in software engineering},
	journal = {Information and Software Technology},
	volume = {39},
	year = {1997},
	month = {1997///},
	pages = {735 - 743},
	abstract = {Although experimentation is an accepted approach toward scientific validation in most scientific disciplines, it only recently has gained acceptance within the software development community. In this paper we discuss a 12-model classification scheme for performing experimentation within the software development domain. We evaluate over 600 published papers in the computer science literature and over one hundred papers from other scientific disciplines in order to determine: (1) how well the computer science community is succeeding at validating its theories, and (2) how computer science compares to other scientific disciplines.},
	keywords = {data collection, Evaluation, experimentation, measurement},
	isbn = {0950-5849},
	doi = {10.1016/S0950-5849(97)00025-6},
	url = {http://www.sciencedirect.com/science/article/pii/S0950584997000256},
	author = {Zelkowitz, Marvin V and Wallace,Dolores}
}
@conference {14813,
	title = {MDL: a language and compiler for dynamic program instrumentation},
	booktitle = {, 1997 International Conference on Parallel Architectures and Compilation Techniques., 1997. Proceedings},
	year = {1997},
	month = {1997/11/10/14},
	pages = {201 - 212},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We use a form of dynamic code generation, called dynamic instrumentation, to collect data about the execution of an application program. Dynamic instrumentation allows us to instrument running programs to collect performance and other types of information. The instrumentation code is generated incrementally and can be inserted and removed at any time. Our instrumentation currently runs on the SPARC, PA-RISC, Power 2, Alpha, and x86 architectures. Specification of what data to collect are written in a specialized language called the Metric Description Language, that is part of the Paradyn Parallel Performance Tools. This language allows platform independent descriptions of how to collect performance data. It also provides a concise way to specify, how to constrain performance data to particular resources such as modules, procedures, nodes, files, or message channels (or combinations of these resources). We also describe the details of how we weave instrumentation into a running program},
	keywords = {Alpha architecture, application program, application program interfaces, Application software, compiler generators, Computer science, dynamic code generation, Dynamic compiler, dynamic program instrumentation, Educational institutions, files, instrumentation code, Instruments, MDL, measurement, message channels, Message passing, Metric Description Language, modules, nodes, Operating systems, optimising compilers, PA-RISC, Paradyn Parallel Performance Tools, Parallel architectures, parallel programming, performance data, platform independent descriptions, Power 2 architecture, Power generation, procedures, program debugging, Program processors, running programs, Runtime, software metrics, SPARC, Specification languages, x86 architecture},
	isbn = {0-8186-8090-3},
	doi = {10.1109/PACT.1997.644016},
	author = {Hollingsworth, Jeffrey K and Niam, O. and Miller, B. P and Zhichen Xu and Goncalves,M. J.R and Ling Zheng}
}
@article {14816,
	title = {The Paradyn parallel performance measurement tool},
	journal = {Computer},
	volume = {28},
	year = {1995},
	month = {1995/11//},
	pages = {37 - 46},
	abstract = {Paradyn is a tool for measuring the performance of large-scale parallel programs. Our goal in designing a new performance tool was to provide detailed, flexible performance information without incurring the space (and time) overhead typically associated with trace-based tools. Paradyn achieves this goal by dynamically instrumenting the application and automatically controlling this instrumentation in search of performance problems. Dynamic instrumentation lets us defer insertion until the moment it is needed (and remove it when it is no longer needed); Paradyn{\textquoteright}s Performance Consultant decides when and where to insert instrumentation},
	keywords = {Aerodynamics, Automatic control, automatic instrumentation control, Debugging, dynamic instrumentation, flexible performance information, high level languages, insertion, Instruments, large-scale parallel program, Large-scale systems, measurement, Paradyn parallel performance measurement tool, Parallel machines, parallel programming, Performance Consultant, Programming profession, scalability, software performance evaluation, software tools},
	isbn = {0018-9162},
	doi = {10.1109/2.471178},
	author = {Miller, B. P and Callaghan, M. D and Cargille, J. M and Hollingsworth, Jeffrey K and Irvin, R. B and Karavanic, K. L and Kunchithapadam, K. and Newhall, T.}
}
@article {18432,
	title = {Software Process Improvement in the NASA Software Engineering Laboratory.},
	year = {1994},
	month = {1994/12//},
	institution = {CARNEGIE-MELLON UNIV PITTSBURGH PA SOFTWARE ENGINEERING INSTITUTE},
	abstract = {The Software Engineering Laboratory (SEL) was established in 1976 for the purpose of studying and measuring software processes with the intent of identifying improvements that could be applied to the production of ground support software within the Flight Dynamics Division (FDD) at the National Aeronautics and Space Administration (NASA)/Goddard Space Flight Center (GSFC). The SEL has three member organizations: NASA/GSFC, the University of Maryland, and Computer Sciences Corporation (CSC). The concept of process improvement within the SEL focuses on the continual understanding of both process and product as well as goal-driven experimentation and analysis of process change within a production environment.},
	keywords = {*AWARDS, *SOFTWARE ENGINEERING, *SYSTEMS ANALYSIS, *WORK MEASUREMENT, ADMINISTRATION AND MANAGEMENT, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER PROGRAMS, COMPUTERS, data acquisition, ENVIRONMENTS, EXPERIMENTAL DATA, GROUND SUPPORT., measurement, Organizations, PE63756E, Production, SOFTWARE PROCESS IMPROVEMENT, SPI(SOFTWARE PROCESS IMPROVEMENT), SPN-19950120014},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA289912},
	author = {McGarry,Frank and Pajerski,Rose and Page,Gerald and Waligora,Sharon and Basili, Victor R.}
}
@article {14791,
	title = {IPS-2: the second generation of a parallel program measurement system},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {1},
	year = {1990},
	month = {1990/04//},
	pages = {206 - 217},
	abstract = {IPS, a performance measurement system for parallel and distributed programs, is currently running on its second implementation. IPS{\textquoteright}s model of parallel programs uses knowledge about the semantics of a program{\textquoteright}s structure to provide two important features. First, IPS provides a large amount of performance data about the execution of a parallel program, and this information is organized so that access to it is easy and intuitive. Secondly, IPS provides performance analysis techniques that help to guide the programmer automatically to the location of program bottlenecks. The first implementation of IPS was a testbed for the basic design concepts, providing experience with a hierarchical program and measurement model, interactive program analysis, and automatic guidance techniques. It was built on the Charlotte distributed operating system. The second implementation, IPS-2, extends the basic system with new instrumentation techniques, an interactive and graphical user interface, and new automatic guidance analysis techniques. This implementation runs on 4.3BSD UNIX systems, on the VAX, DECstation, Sun 4, and Sequent Symmetry multiprocessor},
	keywords = {4.3BSD UNIX systems, automatic guidance techniques, Automatic testing, Charlotte distributed operating system, CPA, DECstation, design concepts, distributed programs, graphical user interface, Graphical user interfaces, Instruments, interactive program analysis, IPS-2, measurement, message systems, network operating systems, Operating systems, parallel program measurement system, parallel programming, parallel programs, Performance analysis, performance analysis techniques, performance evaluation, performance measurement system, Power system modeling, program bottlenecks, program diagnostics, Programming profession, semantics, Sequent Symmetry multiprocessor, shared-memory systems, software tools, Springs, Sun, Sun 4, Unix, VAX},
	isbn = {1045-9219},
	doi = {10.1109/71.80132},
	author = {Miller, B. P and Clark, M. and Hollingsworth, Jeffrey K and Kierstead, S. and Lim,S. -S and Torzewski, T.}
}
@article {18415,
	title = {Program complexity using Hierarchical Abstract Computers},
	journal = {Computer Languages},
	volume = {13},
	year = {1988},
	month = {1988///},
	pages = {109 - 123},
	abstract = {A model of program complexity is introduced which combines structural control flow measures with data flow measures. This complexity measure is based upon the prime program decomposition of a program written for a Hierarchical Abstract Computer. It is shown that this measure is consistent with the ideas of information hiding and data abstraction. Because this measure is sensitive to the linear form of a program, it can be used to measure different concrete representations of the same algorithm, as in a structured and an unstructured version of the same program. Application of the measure as a model of system complexity is given for {\textquotedblleft}upstream{\textquotedblright} processes (e.g. specification and design phases) where there is no source program to measure by other techniques.},
	keywords = {CASE tools, complexity, ENVIRONMENTS, measurement, Prime programs},
	isbn = {0096-0551},
	doi = {10.1016/0096-0551(88)90019-7},
	url = {http://www.sciencedirect.com/science/article/pii/0096055188900197},
	author = {Bail,William G and Zelkowitz, Marvin V}
}
@article {18420,
	title = {Research in Programming Languages and Software Engineering.},
	year = {1985},
	month = {1985/12/24/},
	institution = {Department of Computer Science, University of Maryland, College Park},
	abstract = {During the past year three research papers were written and two published conference presentations were given. Titles of the published research articles are: A Stochastic Analysis of a Modified Gain Extended Kalman Filter with Applications to Estimation with Bearings only Measurements; The Modified Gain Extended Kalman Kilter and Parameter Identification in Linear Systems and Maximum Information Guidance for Homing Missiles.},
	keywords = {*BEARINGS, *COMPUTER PROGRAMS, *ESTIMATES, *GUIDANCE, *KALMAN FILTERING, *LINEAR SYSTEMS, *STOCHASTIC PROCESSES, COMPUTER PROGRAMMING AND SOFTWARE, GAIN, identification, measurement, programming languages, STATISTICS AND PROBABILITY, SYSTEMS ENGINEERING., TARGET DIRECTION, RANGE AND POSITION FINDING},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA186269},
	author = {Gannon,John and Basili, Victor R. and Zelkowitz, Marvin V and Yeh,Raymond}
}
