@conference {14736,
	title = {State transfer for clear and efficient runtime updates},
	booktitle = {2011 IEEE 27th International Conference on Data Engineering Workshops (ICDEW)},
	year = {2011},
	month = {2011/04/11/16},
	pages = {179 - 184},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Dynamic software updating (DSU), the practice of updating software while it executes, is a lively area of research. The DSU approach most prominent in both commercial and research systems is in-place updating, in which patches containing program modifications are loaded into a running process. However, in-place updating suffers from several problems: it requires complex tool support, it may adversely affect the performance of normal execution, it requires challenging reasoning to understand the behavior of an updated program, and it requires extra effort to modify program state to be compatible with an update. This paper presents preliminary work investigating the potential for state transfer updating to address these problems. State transfer updates work by launching a new process running the updated program version and transferring program state from the running process to the updated version. In this paper, we describe the use and implementation of Ekiden, a new state transfer updating library for C/C++ programs. Ekiden seeks to redress the difficulties of in-place updating, and we report on our experience updating VSFTPD using Ekiden. This initial experience suggests that state transfer provides the availability benefits of in-place DSU approaches while addressing many of their shortcomings.},
	keywords = {C++ language, C++ program, Cognition, complex tool support, dynamic software updating, efficient runtime update, in-place DSU approach, Libraries, Operating systems, program modification, Program processors, program transfer, program version, Runtime, servers, software libraries, Software maintenance, state transfer update, Steady-state, updating library, VSFTPD},
	isbn = {978-1-4244-9195-7},
	doi = {10.1109/ICDEW.2011.5767632},
	author = {Hayden,C.M. and Smith,E. K and Hicks, Michael W. and Foster, Jeffrey S.}
}
@article {16949,
	title = {A telescope for high-dimensional data},
	journal = {Computing in Science \& Engineering},
	volume = {8},
	year = {2006},
	month = {2006/04//March},
	pages = {48 - 53},
	abstract = {Muscular dystrophy is a degenerative disease that destroys muscles and ultimately kills its victims. Researchers worldwide are racing to find a cure by trying to uncover the genetic processes that cause it. Given that a key process is muscle development, researchers at a consortium of 10 institutions are studying 1,000 men and women, ages 18 to 40 years, to see how their muscles enlarge with exercise. The 150 variables collected for each participant will make this data analysis task challenging for users of traditional statistical software tools. However, a new approach to visual data analysis is helping these researchers speed up their work. At the University of Maryland{\textquoteright}s Human-Computer Interaction Library, we developed an interactive approach to let researchers explore high-dimensional data in an orderly manner, focusing on specific features one at a time. The rank-by-feature framework lets them adjust controls to specify what they{\textquoteright}re looking for, and then, with only a glance, they can spot strong relationships among variables, find tight data clusters, or identify unexpected gaps. Sometimes surprising outliers invite further study as to whether they represent errors or an unusual outcome. Similar data analysis problems come up in meteorology, finance, chemistry, and other sciences in which complex relationships among many variables govern outcomes. The rank-by-feature framework could be helpful to many researchers, engineers, and managers because they can then steer their analyses toward the action},
	keywords = {Chemistry, Data analysis, data mining, data visualisation, degenerative disease, Degenerative diseases, diseases, Finance, genetic process, Genetics, high-dimensional data, interactive data analysis, medical computing, Meteorology, muscle, muscle development, Muscles, muscular dystrophy, Rank-by-feature framework, software, software libraries, software tools, Telescopes, visual data, visual data analysis},
	isbn = {1521-9615},
	doi = {10.1109/MCSE.2006.21},
	author = {Shneiderman, Ben}
}
@conference {17288,
	title = {Meaningful presentations of photo libraries: rationale and applications of bi-level radial quantum layouts},
	booktitle = {Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries, 2005. JCDL {\textquoteright}05},
	year = {2005},
	month = {2005/06/07/11},
	pages = {188 - 196},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Searching photo libraries can be made more satisfying and successful if search results are presented in a way that allows users to gain an overview of the photo categories. Since photo layouts on computer displays are the primary way that users get an overview, we propose a novel approach to show more photos in meaningful groupings. Photo layouts can be linear strips, or zoomable three dimensional arrangements, but the most common form is the two-dimensional grid. This paper introduces a novel bi-level hierarchical layout with motivating examples. In a bilevel hierarchy, one region is designated for primary content - an image, text, or combination. Adjacent to that region, groups of photos are placed radially in an ordered fashion, such that the relationship of the single primary region to its many secondary regions is apparent. A compelling aspect is the interactive experience in which the layout is dynamically resized, allowing users to rapidly, incrementally, and reversibly alter the dimensions and content. It can accommodate hundreds of photos in dozens of regions, can be customized in a corner or center layout, and can scale from an element on a web page to a large poster size. On typical displays (1024 times 1280 or 1200 times 1600 pixels), bi-level radial quantum layouts can conveniently accommodate 2-20 regions with tens or hundreds of photos per region},
	keywords = {1024 pixel, 1200 pixel, 1280 pixel, 1310720 pixel, 1600 pixel, 1920000 pixel, Application software, bi-level radial quantum layouts, Computer displays, Computer science, digital libraries, Educational institutions, Image retrieval, Layout, layout generation, Lifting equipment, linear strips, Permission, photo layouts, photo library searching, photo management, Photography, Quantum computing, software libraries, Strips, two-dimensional grid, User interfaces, visual databases, visual presentation, zoomable three dimensional arrangements},
	isbn = {1-58113-876-8},
	doi = {10.1145/1065385.1065431},
	author = {Kustanowitz,J. and Shneiderman, Ben}
}
@conference {14795,
	title = {Active Harmony: Towards Automated Performance Tuning},
	booktitle = {Supercomputing, ACM/IEEE 2002 Conference},
	year = {2002},
	month = {2002/11//},
	pages = {44 - 44},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we present the Active Harmony automated runtime tuning system. We describe the interface used by programs to make applications tunable. We present the Library Specification Layer which helps program library developers expose multiple variations of the same API using different algorithms.The Library Specification Language helps to select the most appropriate program library to tune the overall performance. We also present the optimization algorithm used to adjust parameters in the application and the libraries. Finally, we present results that show how the system is able to tune several real applications. The automated tuning system is able to tune the application parameers to within a few percent of the best value after evaluating only 11 out of over 1,700 possible configurations.},
	keywords = {Application software, Automatic control, Computational modeling, Computer science, Computerized monitoring, Control systems, grid computing, Runtime library, software libraries, Specification languages},
	isbn = {0-7695-1524-X},
	doi = {10.1109/SC.2002.10062},
	author = {Tapus, C. and I-Hsin Chung and Hollingsworth, Jeffrey K}
}
@article {17293,
	title = {Meeting human needs with new digital imaging technologies},
	journal = {IEEE Multimedia},
	volume = {9},
	year = {2002},
	month = {2002/12//Oct},
	pages = {8 - 14},
	abstract = {It{\textquoteright}s a visual world. Images capture many people{\textquoteright}s thrills, emotions, and concerns. Art can shock or inspire, and family photos are some of our greatest treasures. It{\textquoteright}s not surprising that visual information is a vital component of the new computing. Most people depend on visual input to understand the world around them and as a basis for further creative activities. The popularity of visual media such as photos, short videos, and animations attests to their mainstream acceptance. Digital photos and image-laden Web pages have already become major computing applications, but users still want higher-resolution images and faster downloads},
	keywords = {animation, animations, Computer applications, digital images, digital imaging technologies, Helium, History, HUMANS, Image databases, IMAGE PROCESSING, Photography, photos, software libraries, Videos, visual media, Web pages},
	isbn = {1070-986X},
	doi = {10.1109/MMUL.2002.1041942},
	author = {Shneiderman, Ben}
}
@conference {16466,
	title = {Optimized seamless integration of biomolecular data},
	booktitle = {Proceedings of the IEEE 2nd International Symposium on Bioinformatics and Bioengineering Conference, 2001},
	year = {2001},
	month = {2001/11/04/6},
	pages = {23 - 32},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Today, scientific data is inevitably digitized, stored in a variety of heterogeneous formats, and is accessible over the Internet. Scientists need to access an integrated view of multiple remote or local heterogeneous data sources. They then integrate the results of complex queries and apply further analysis and visualization to support the task of scientific discovery. Building a digital library for scientific discovery requires accessing and manipulating data extracted from flat files or databases, documents retrieved from the Web, as well as data that is locally materialized in warehouses or is generated by software. We consider several tasks to provide optimized and seamless integration of biomolecular data. Challenges to be addressed include capturing and representing source capabilities; developing a methodology to acquire and represent metadata about source contents and access costs; and decision support to select sources and capabilities using cost based and semantic knowledge, and generating low cost query evaluation plans},
	keywords = {analysis, Bioinformatics, biology computing, cost based knowledge, Costs, Data analysis, data mining, data visualisation, Data visualization, Data warehouses, decision support, digital library, Educational institutions, information resources, Internet, low cost query evaluation plans, Mediation, meta data, metadata, molecular biophysics, multiple local heterogeneous data sources, multiple remote heterogeneous data sources, optimized seamless biomolecular data integration, scientific discovery, scientific information systems, semantic knowledge, software libraries, visual databases, Visualization},
	isbn = {0-7695-1423-5},
	doi = {10.1109/BIBE.2001.974408},
	author = {Eckman,B. A and Lacroix,Z. and Raschid, Louiqa}
}
@article {17842,
	title = {Visualization of large data sets with the Active Data Repository},
	journal = {IEEE Computer Graphics and Applications},
	volume = {21},
	year = {2001},
	month = {2001/08//Jul},
	pages = {24 - 33},
	abstract = {We implement ray-casting-based volume rendering and isosurface rendering methods using the Active Data Repository (ADR) for visualizing out-of-core data sets. We have developed the ADR object-oriented framework to provide support for applications that employ range queries with user-defined mapping and aggregation operations on large-scale multidimensional data. ADR targets distributed-memory parallel machines with one or more disks attached to each node. It is designed as a set of modular services implemented in C++, which can be customized for application-specific processing. The ADR runtime system supports common operations such as memory management, data retrieval, and scheduling of processing across a parallel machine},
	keywords = {active data repository, ADR runtime system, Algorithm design and analysis, application-specific processing, C++, data mining, data retrieval, data visualisation, Data visualization, distributed-memory parallel machines, Indexing, Information retrieval, isosurface rendering, Isosurfaces, large data sets, large-scale multidimensional data, Memory management, modular services, out-of-core data sets, parallel machine, Parallel machines, Partitioning algorithms, ray-casting-based volume rendering, Rendering (computer graphics), Runtime, software libraries, storage management},
	isbn = {0272-1716},
	doi = {10.1109/38.933521},
	author = {Kurc, T. and Catalyurek,U. and Chang,Chialin and Sussman, Alan and Saltz, J.}
}
@conference {17386,
	title = {Supporting creativity with powerful composition tools for artifacts and performances},
	booktitle = {Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, 2000},
	year = {2000},
	month = {2000/01/04/7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Modern software such as word processors, slide preparation/presentation tools, or music composition packages are designed to produce artifacts or performances. Now, some designers are expanding their goals to include creativity support into their software. This essay builds on the genex framework for creativity, which has four phases and eight activities. It focuses on the composition activity by considering tools to support initiation, revision, and evaluation. Some existing tools provide partial support that suggests ways in which to develop more ambitious low, middle, and high level tools. The goal is to enable more people to be more creative more of the time.},
	keywords = {artifacts, Artificial intelligence, composition tools, Computer science, Context modeling, creativity, creativity support, Educational institutions, Information retrieval, Laboratories, Manufacturing, music composition, performances, Software design, software libraries, software tools, US Department of Transportation},
	isbn = {0-7695-0493-0},
	doi = {10.1109/HICSS.2000.926896},
	author = {Shneiderman, Ben}
}
@conference {17498,
	title = {Visualization methods for personal photo collections: browsing and searching in the PhotoFinder},
	booktitle = {2000 IEEE International Conference on Multimedia and Expo, 2000. ICME 2000},
	volume = {3},
	year = {2000},
	month = {2000///},
	pages = {1539-1542 vol.3 - 1539-1542 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Software tools for personal photo collection management are proliferating, but they usually have limited searching and browsing functions. We implemented the PhotoFinder prototype to enable non-technical users of personal photo collections to search and browse easily. PhotoFinder provides a set of visual Boolean query interfaces, coupled with dynamic query and query preview features. It gives users powerful search capabilities. Using a scatter plot thumbnail display and drag-and-drop interface, PhotoFinder is designed to be easy to use for searching and browsing photos},
	keywords = {Browsing, Computer science, digital photo library, Displays, drag-and-drop interface, dynamic query, Educational institutions, Filters, Histograms, Image retrieval, personal computing, personal photo collections, photo collection management, PhotoFinder, Prototypes, query preview, scatter plot thumbnail display, Scattering, searching, software libraries, software tools, User interfaces, visual Boolean query interfaces, visual databases, Visualization, visualization methods},
	isbn = {0-7803-6536-4},
	doi = {10.1109/ICME.2000.871061},
	author = {Kang,Hyunmo and Shneiderman, Ben}
}
@conference {14762,
	title = {Benchmarking a network of PCs running parallel applications},
	booktitle = {Performance, Computing and Communications, 1998. IPCCC {\textquoteright}98., IEEE International},
	year = {1998},
	month = {1998/02/16/18},
	pages = {1 - 7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Presents a benchmarking study that compares the performance of a network of four PCs connected by a 100 Mbit/s fast Ethernet running three different system software configurations: TCP/IP on Windows NT, TCP/IP on Linux and a lightweight message-passing protocol (U-Net active messages) on Linux. For each configuration, we report results for communication micro-benchmarks and the NAS (Numerical Aerodynamics Simulation) parallel benchmarks. For the NAS benchmarks, the overall running time using Linux TCP/IP was 12-500\% less than the Windows NT TCP/IP configuration. Likewise, the Linux U-Net based message-passing protocol outperformed the Linux TCP/IP version by 5-200\%+. We also show that, by using Linux U-Net, we are able to achieve 125 μs latency between two processes using PVM. Finally, we report that the default mathematical libraries supplied with NT (for both gcc and Visual C++) are substantially slower than the one supplied with Linux},
	keywords = {100 Mbit/s, 125 mus, Aerodynamics, Application software, communication micro-benchmarks, default mathematical libraries, Delay, Ethernet, Ethernet networks, gcc, latency, lightweight message-passing protocol, Linux, Local area networks, mathematics computing, Message passing, microcomputer applications, Microsoft Windows NT, NAS parallel benchmarks, network operating systems, Numerical simulation, parallel applications, PARALLEL PROCESSING, PC network benchmarking, performance comparison, performance evaluation, Personal communication networks, Protocols, PVM, running time, software libraries, System software, system software configurations, TCP/IP, TCPIP, Transport protocols, U-Net active messages, Visual C++},
	isbn = {0-7803-4468-5},
	doi = {10.1109/PCCC.1998.659876},
	author = {Hollingsworth, Jeffrey K and Guven, E. and Akinlar, C.}
}
