@article {17397,
	title = {Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison},
	journal = {IEEE Transactions on Visualization and Computer Graphics},
	volume = {15},
	year = {2009},
	month = {2009/12//Nov},
	pages = {1049 - 1056},
	abstract = {When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.},
	keywords = {Aggregates, Collaborative work, Computational Biology, Computer Graphics, Data analysis, data visualisation, Data visualization, Databases, Factual, Displays, Event detection, Filters, Heparin, History, Human computer interaction, Human-computer interaction, HUMANS, Information Visualization, Interaction design, interactive visualization technique, Medical Records Systems, Computerized, Pattern Recognition, Automated, Performance analysis, Springs, temporal categorical data visualization, temporal categorical searching, temporal ordering, temporal summaries, Thrombocytopenia, Time factors},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2009.187},
	author = {Wang,T. D and Plaisant, Catherine and Shneiderman, Ben and Spring, Neil and Roseman,D. and Marchand,G. and Mukherjee,V. and Smith,M.}
}
@article {16983,
	title = {Balancing Systematic and Flexible Exploration of Social Networks},
	journal = {IEEE Transactions on Visualization and Computer Graphics},
	volume = {12},
	year = {2006},
	month = {2006/10//Sept},
	pages = {693 - 700},
	abstract = {Social network analysis (SNA) has emerged as a powerful method for understanding the importance of relationships in networks. However, interactive exploration of networks is currently challenging because: (1) it is difficult to find patterns and comprehend the structure of networks with many nodes and links, and (2) current systems are often a medley of statistical methods and overwhelming visual output which leaves many analysts uncertain about how to explore in an orderly manner. This results in exploration that is largely opportunistic. Our contributions are techniques to help structural analysts understand social networks more effectively. We present SocialAction, a system that uses attribute ranking and coordinated views to help users systematically examine numerous SNA measures. Users can (1) flexibly iterate through visualizations of measures to gain an overview, filter nodes, and find outliers, (2) aggregate networks using link structure, find cohesive subgroups, and focus on communities of interest, and (3) untangle networks by viewing different link types separately, or find patterns across different link types using a matrix overview. For each operation, a stable node layout is maintained in the network visualization so users can make comparisons. SocialAction offers analysts a strategy beyond opportunism, as it provides systematic, yet flexible, techniques for exploring social networks},
	keywords = {Aggregates, algorithms, attribute ranking, Cluster Analysis, Computer Graphics, Computer simulation, Coordinate measuring machines, coordinated views, Data analysis, data visualisation, Data visualization, exploratory data analysis, Filters, Gain measurement, graph theory, Graphical user interfaces, Information Storage and Retrieval, interactive graph visualization, matrix algebra, matrix overview, Models, Biological, Navigation, network visualization, Pattern analysis, Population Dynamics, Social Behavior, social network analysis, Social network services, social networks, social sciences computing, Social Support, SocialAction, software, statistical analysis, statistical methods, User-Computer Interface},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2006.122},
	author = {Perer,A. and Shneiderman, Ben}
}
@article {17791,
	title = {Aggregate operators in probabilistic databases},
	journal = {J. ACM},
	volume = {52},
	year = {2005},
	month = {2005/01//},
	pages = {54 - 101},
	abstract = {Though extensions to the relational data model have been proposed in order to handle probabilistic information, there has been very little work to date on handling aggregate operators in such databases. In this article, we present a very general notion of an aggregate operator and show how classical aggregation operators (such as COUNT, SUM, etc.) as well as statistical operators (such as percentiles, variance, etc.) are special cases of this general definition. We devise a formal linear programming based semantics for computing aggregates over probabilistic DBMSs, develop algorithms that satisfy this semantics, analyze their complexity, and introduce several families of approximation algorithms that run in polynomial time. We implemented all of these algorithms and tested them on a large set of data to help determine when each one is preferable.},
	keywords = {Aggregates, probabilistic relational databases},
	isbn = {0004-5411},
	doi = {10.1145/1044731.1044734},
	url = {http://doi.acm.org/10.1145/1044731.1044734},
	author = {Ross,Robert and V.S. Subrahmanian and Grant,John}
}
@conference {12100,
	title = {High-performance MAC for high-capacity wireless LANs},
	booktitle = {13th International Conference on Computer Communications and Networks, 2004. ICCCN 2004. Proceedings},
	year = {2004},
	month = {2004/10/11/13},
	pages = {167 - 172},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The next-generation wireless technologies, e.g., 802.11n and 802.15.3a, offer a physical-layer speed at least an-order-of-magnitude higher than the current standards. However, direct application of current MACs leads to high protocol overhead and significant throughput degradation. In this paper, we propose ADCA, a high-performance MAC that works with high-capacity physical layer. ADCA exploits two ideas of adaptive batch transmission and opportunistic selection of high-rate hosts to simultaneously reduce the overhead and improve the aggregate throughput. It opportunistically favors high-rate hosts by providing higher access probability and more access time, while ensuring each low-rate host certain minimum amount of channel access time. Simulations show that the ADCA design increases the throughput by 112\% and reduces the average delay by 55\% compared with the legacy DCF. It delivers more than 100 Mbps MAC-layer throughput as compared with 35 Mbps offered by the legacy MAC},
	keywords = {35 Mbit/s, access protocols, Aggregates, Bandwidth, batch transmission, Computer science, Educational institutions, high-capacity wireless LAN, high-performance MAC, Laboratories, Local area networks, Media Access Protocol, opportunistic selection, Physical layer, probability, Throughput, Wireless LAN},
	isbn = {0-7803-8814-3},
	doi = {10.1109/ICCCN.2004.1401615},
	author = {Yuan Yuan and Daqing Gu and Arbaugh, William A. and Jinyun Zhang}
}
@conference {17835,
	title = {Multiple Query Optimization for Data Analysis Applications on Clusters of SMPs},
	booktitle = {2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2002},
	year = {2002},
	month = {2002/05/21/24},
	pages = {154 - 154},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper is concerned with the efficient execution of multiple query workloads on a cluster of SMPs. We target applications that access and manipulate large scientific datasets. Queries in these applications involve user-defined processing operations and distributed data structures to hold intermediate and final results. Our goal is to implement system components to leverage previously computed query results and to effectively utilize processing power and aggregated I/O bandwidth on SMP nodes so that both single queries and multi-query batches can be efficiently executed.},
	keywords = {Aggregates, Application software, Bandwidth, Data analysis, Data structures, Delay, Query processing, scheduling, Subcontracting, Switched-mode power supply},
	isbn = {0-7695-1582-7},
	doi = {10.1109/CCGRID.2002.1017123},
	author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.}
}
@article {16305,
	title = {Assessing software review meetings: results of a comparative analysis of two experimental studies},
	journal = {IEEE Transactions on Software Engineering},
	volume = {23},
	year = {1997},
	month = {1997/03//},
	pages = {129 - 145},
	abstract = {Software review is a fundamental tool for software quality assurance. Nevertheless, there are significant controversies as to the most efficient and effective review method. One of the most important questions currently being debated is the utility of meetings. Although almost all industrial review methods are centered around the inspection meeting, recent findings call their value into question. In prior research the authors separately and independently conducted controlled experimental studies to explore this issue. The paper presents new research to understand the broader implications of these two studies. To do this, they designed and carried out a process of {\textquotedblleft}reconciliation{\textquotedblright} in which they established a common framework for the comparison of the two experimental studies, reanalyzed the experimental data with respect to this common framework, and compared the results. Through this process they found many striking similarities between the results of the two studies, strengthening their individual conclusions. It also revealed interesting differences between the two experiments, suggesting important avenues for future research},
	keywords = {Aggregates, Collaborative work, Computer Society, Costs, Helium, Inspection, inspection meeting, Job shop scheduling, Programming, reconciliation, Software development management, Software quality, software quality assurance, software review meeting assessment, Software reviews},
	isbn = {0098-5589},
	doi = {10.1109/32.585501},
	author = {Porter, Adam and Johnson,P. M}
}
