@conference {11902,
	title = {Approximate kernel matrix computation on GPUs forlarge scale learning applications},
	booktitle = {Proceedings of the 23rd international conference on Supercomputing},
	series = {ICS {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {511 - 512},
	publisher = {ACM},
	organization = {ACM},
	address = {Yorktown Heights, NY, USA},
	abstract = {Kernel-based learning methods require quadratic space and time complexities to compute the kernel matrix. These complexities limit the applicability of kernel methods to large scale problems with millions of data points. In this paper, we introduce a novel representation of kernel matrices on Graphics Processing Units (GPU). The novel representation exploits the sparseness of the kernel matrix to address the space complexity problem. It also respects the guidelines for memory access on GPUs, which are critical for good performance, to address the time complexity problem. Our representation utilizes the locality preserving properties of space filling curves to obtain a band approximation of the kernel matrix. To prove the validity of the representation, we use Affinity Propagation, an unsupervised clustering algorithm, as an example of kernel methods. Experimental results show a 40x speedup of AP using our representation without degradation in clustering performance.},
	keywords = {affinity propagation, algorithms, arrays, gpu, kernel methods, parallel programming, performance, space filling curves, sparse matrices},
	isbn = {978-1-60558-498-0},
	doi = {10.1145/1542275.1542355},
	author = {Hussein,Mohamed E and Abd-Almageed, Wael}
}
@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 {12264,
	title = {CAM04-6: Single-Path Routing of Time-varying Traffic},
	booktitle = {Global Telecommunications Conference, 2006. GLOBECOM {\textquoteright}06. IEEE},
	year = {2006},
	month = {2006/12/27/1},
	pages = {1 - 6},
	abstract = {We consider the problem of finding a single-path intra-domain routing for time-varying traffic. We characterize the traffic variations by a finite set of traffic profiles with given non-zero fractions of occurrence. Our goal is to optimize the average performance over all of these traffic profiles. We solve the optimal multi-path version of this problem using linear programming and develop heuristic single-path solutions using randomized rounding and iterated rounding. We analyze our single-path heuristic (finding the optimal single-path routing is NP-hard), and prove that the randomized rounding algorithm has a worst case performance bound of O(log(KN)/log(log(KN))) compared to the optimal multi-path routing with a high probability, where K is the number of traffic profiles, and N the number of nodes in the network. Further, our simulations show the iterated rounding heuristics perform close to the optimal multi-path routing on a wide range of measured ISP topologies, in both the average and the worst-case. Overall, these results are extremely positive since they show that in a wide-range of practical situations, it is not necessary to deploy multi-path routing; instead, an appropriately computed single-path routing is sufficient to provide good performance.},
	keywords = {algorithm;linear, algorithm;time-varying, algorithms;telecommunication, bound;IP, case, complexity;iterative, intra-domain, IP, methods;linear, multipath, network, network;ISP, networks;Internet;computational, optimal, performance, problem;heuristic, profile;worst, programming;optimal, programming;probability;randomised, rounding, routing;iterated, routing;probability;randomized, routing;telecommunication, single-path, topology;NP-hard, topology;telecommunication, traffic, traffic;},
	doi = {10.1109/GLOCOM.2006.29},
	author = {Kashyap,A. and Bhattacharjee, Bobby and La,R. and Shayman,M. and Tabatabaee,V.}
}
@article {15031,
	title = {Synthetic-perturbation techniques for screening shared memory programs},
	journal = {Software: Practice and Experience},
	volume = {24},
	year = {2006},
	month = {2006/10/30/},
	pages = {679 - 701},
	abstract = {The synthetic-perturbation screening (SPS) methodology is based on an empirical approach; SPS introduces artificial perturbations into the MIMD program and captures the effects of such perturbations by using the modern branch of statistics called design of experiments. SPS can provide the basis of a powerful tool for screening MIMD programs for performance bottlenecks. This technique is portable across machines and architectures, and scales extremely well on massively parallel processors. The purpose of this paper is to explain the general approach and to extend it to address specific features that are the main source of poor performance on the shared memory programming model. These include performance degradation due to load imbalance and insufficient parallelism, and overhead introduced by synchronizations and by accessing shared data structures. We illustrate the practicality of SPS by demonstrating its use on two very different case studies: a large image understanding benchmark and a parallel quicksort.},
	keywords = {Design of experiments, parallel programs, performance, Shared memory programming model, Synthetic perturbation},
	isbn = {1097-024X},
	doi = {10.1002/spe.4380240802},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.4380240802/abstract},
	author = {Snelick,Robert and JaJa, Joseph F. and Kacker,Raghu and Lyon,Gordon}
}
@conference {12279,
	title = {Differentiated traffic engineering for QoS provisioning},
	booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE},
	volume = {4},
	year = {2005},
	month = {2005/03//},
	pages = {2349 - 2359 vol. 4 - 2349 - 2359 vol. 4},
	abstract = {We introduce a new approach for QoS provisioning in packet networks based on the notion of differentiated traffic engineering (DTE). We consider a single AS network capable of source based multi-path routing. We do not require sophisticated queuing or per-class scheduling at individual routers; instead, if a link is used to forward QoS sensitive packets, we maintain its utilization below a threshold. As a consequence, DTE eliminates the need for per-flow (IntServ) or per-class (DiffServ) packet processing tasks such as traffic classification, queueing, shaping, policing and scheduling in the core and hence poses a lower burden on the network management unit. Conversely, DTE utilizes network bandwidth much more efficiently than simple over-provisioning. In this paper, we propose a complete architecture and an algorithmic structure for DTE. We show that our scheme can be formulated as a non-convex optimization problem, and we present an optimal solution framework based on simulated annealing. We present a simulation-based performance evaluation of DTE, and compare our scheme to existing (gradient projection) methods.},
	keywords = {based, Computer, differentiated, DiffServ, DTE;, engineering;, evaluation;, link;, links;, management;, multipath, network, networks;, nonconvex, of, optimisation;, OPTIMIZATION, packet, performance, problem;, provisioning;, QoS, QUALITY, routing;, service;, simulation-based, source, Telecommunication, traffic, traffic;},
	doi = {10.1109/INFCOM.2005.1498521},
	author = {Tabatabaee,V. and Bhattacharjee, Bobby and La,R.J. and Shayman,M.A.}
}
@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}
}
@conference {12290,
	title = {The case for a multi-hop wireless local area network},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {2},
	year = {2004},
	month = {2004/03//},
	pages = {894 - 905 vol.2 - 894 - 905 vol.2},
	abstract = {We propose a multi-hop wireless LAN architecture and demonstrate its benefits to wireless clients. For this architecture, we define implementation paths that allow interoperation with existing wireless LANs which can lead to an incremental deployment of this system. We quantify the performance benefits of the proposed schemes through measurements in realistic wireless LAN environments. We also examine the performance of such multi-hop wireless LANs through detailed simulation studies. Our results show that these multi-hop extensions can significantly improve the wireless access experience (in terms of data throughput, latency, etc.) for clients who enable such mechanisms. More interestingly, when multi-hop extensions are enabled by some of the clients, it also positively impacts the performance at other clients that are completely unaware of these extensions.},
	keywords = {access, access;, area, benefits;, client-server, clients;, interoperation;, LAN;, local, multihop, network;, networks;, performance, radio, systems;, wireless},
	doi = {10.1109/INFCOM.2004.1356977},
	author = {Lee,Seungjoon and Banerjee,S. and Bhattacharjee, Bobby}
}
@article {12165,
	title = {User interface evaluation and empirically-based evolution of a prototype experience management tool},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {29},
	year = {2003},
	month = {2003/09//},
	pages = {838 - 850},
	abstract = {Experience management refers to the capture, structuring, analysis, synthesis, and reuse of an organization{\textquoteright}s experience in the form of documents, plans, templates, processes, data, etc. The problem of managing experience effectively is not unique to software development, but the field of software engineering has had a high-level approach to this problem for some time. The Experience Factory is an organizational infrastructure whose goal is to produce, store, and reuse experiences gained in a software development organization. This paper describes The Q-Labs Experience Management System (Q-Labs EMS), which is based on the Experience Factory concept and was developed for use in a multinational software engineering consultancy. A critical aspect of the Q-Labs EMS project is its emphasis on empirical evaluation as a major driver of its development and evolution. The initial prototype requirements were grounded in the organizational needs and vision of Q-Labs, as were the goals and evaluation criteria later used to evaluate the prototype. However, the Q-Labs EMS architecture, data model, and user interface were designed to evolve, based on evolving user needs. This paper describes this approach, including the evaluation that was conducted of the initial prototype and its implications for the further development of systems to support software experience management.},
	keywords = {data, development;, empirical, EMS;, engineering;, evaluation;, experience, experience;, Factory;, interface, interfaces;, knowledge, management, management;, model;, models;, organization, performance, prototype, Q-Labs, re-engineering;, reusability;, reuse;, software, system;, systems, tool;, user},
	isbn = {0098-5589},
	doi = {10.1109/TSE.2003.1232288},
	author = {Seaman,C.B and Mendonca,M.G. and Basili, Victor R. and Kim,Y. M}
}
@conference {12735,
	title = {Video synthesis of arbitrary views for approximately planar scenes},
	booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on},
	volume = {3},
	year = {2003},
	month = {2003/04//},
	pages = {III - 497-500 vol.3 - III - 497-500 vol.3},
	abstract = {In this paper, we propose a method to synthesize arbitrary views of a planar scene, given a monocular video sequence. The method is based on the availability of knowledge of the angle between the original and synthesized views. Such a method has many important applications, one of them being gait recognition. Gait recognition algorithms rely on the availability of an approximate side-view of the person. From a realistic viewpoint, such an assumption is impractical in surveillance applications and it is of interest to develop methods to synthesize a side view of the person, given an arbitrary view. For large distances from the camera, a planar approximation for the individual can be assumed. In this paper, we propose a perspective projection approach for recovering the direction of motion of the person purely from the video data, followed by synthesis of a new video sequence at a different angle. The algorithm works purely in the image and video domain, though 3D structure plays an implicit role in its theoretical justification. Examples of synthesized views using our method and performance evaluation are presented.},
	keywords = {(access, 3D, applications;, approach;, approximately, approximation;, arbitrary, Biometrics, control);, data;, direction, estimation;, evaluation;, Gait, image, monocular, MOTION, performance, perspective, planar, processing;, projection, recognition;, recovery;, scenes;, sequence;, sequences;, side, signal, structure;, Surveillance, surveillance;, synthesis;, synthesized, video, view, views;},
	doi = {10.1109/ICASSP.2003.1199520},
	author = {Chowdhury, A.K.R. and Kale, A. and Chellapa, Rama}
}
@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 {13623,
	title = {Performance evaluation of object detection algorithms},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {965 - 969 vol.3 - 965 - 969 vol.3},
	abstract = {The continuous development of object detection algorithms is ushering in the need for evaluation tools to quantify algorithm performance. In this paper a set of seven metrics are proposed for quantifying different aspects of a detection algorithm{\textquoteright}s performance. The strengths and weaknesses of these metrics are described. They are implemented in the Video Performance Evaluation Resource (ViPER) system and will be used to evaluate algorithms for detecting text, faces, moving people and vehicles. Results for running two previous text-detection algorithms on a common data set are presented.},
	keywords = {algorithms;, common, data, DETECTION, detection;, Evaluation, evaluation;, image, object, performance, recognition;, resource, set;, system;, text-detection, video},
	doi = {10.1109/ICPR.2002.1048198},
	author = {Mariano,V.Y. and Min,Junghye and Park,Jin-Hyeong and Kasturi,R. and Mihalcik,D. and Huiping Li and David Doermann and Drayer,T.}
}
@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 {17859,
	title = {Scheduling multiple data visualization query workloads on a shared memory machine},
	booktitle = {Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM},
	year = {2002},
	month = {2002///},
	pages = {11 - 18},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimization techniques to batches of queries, in which portions of datasets as well as intermediate results are maintained in memory to speed up query evaluation. We present a dynamic query scheduling model based on a priority queue implementation using a directed graph and a strategy for ranking queries. We examine the relative performance of several ranking strategies on a shared-memory machine using two different versions of an application, called the Virtual Microscope, for browsing digitized microscopy images},
	keywords = {Atomic force microscopy, Biomedical informatics, Computer science, Data analysis, data visualisation, Data visualization, datasets, deductive databases, digitized microscopy image browsing, directed graph, directed graphs, dynamic query scheduling model, Educational institutions, high workloads, image database, limited resources, multiple data visualization query workloads, multiple query optimization, performance, priority queue, Processor scheduling, Query processing, query ranking, Relational databases, scheduling, shared memory machine, shared memory systems, Virtual Microscope, visual databases},
	isbn = {0-7695-1573-8},
	doi = {10.1109/IPDPS.2002.1015482},
	author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.}
}
@conference {18302,
	title = {Smiling faces are better for face recognition},
	booktitle = {Fifth IEEE International Conference on Automatic Face and Gesture Recognition, 2002. Proceedings},
	year = {2002},
	month = {2002/05//},
	pages = {52 - 57},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper investigates face recognition during facial expressions. While face expressions have been treated as an adverse factor in standard face recognition approaches, our research suggests that, if a system has a choice in the selection of faces to use in training and recognition, its best performance would be obtained on faces displaying expressions. Naturally, smiling faces are the most prevalent (among expressive faces) for both training and recognition in dynamic scenarios. We employ a measure of discrimination power that is computed from between-class and within-class scatter matrices. Two databases are used to show the performance differences on different sets of faces},
	keywords = {between-class scatter matrices, Databases, discrimination power measure, dynamic scenarios, expressive faces, face recognition, facial expressions, performance, performance differences, smiling faces, software performance evaluation, Training, visual databases, within-class scatter matrices},
	isbn = {0-7695-1602-5},
	doi = {10.1109/AFGR.2002.1004132},
	author = {Yacoob,Yaser and Davis, Larry S.}
}
@conference {14725,
	title = {Practical programmable packets},
	booktitle = {IEEE INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {1},
	year = {2001},
	month = {2001///},
	pages = {41-50 vol.1 - 41-50 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present SNAP (safe and nimble active packets), a new scheme for programmable (or active) packets centered around a new low-level packet language. Unlike previous active packet approaches, SNAP is practical: namely, adding significant flexibility over IP without compromising safety and security or efficiency. In this paper we show how to compile from the well-known active picket language PLAN to SNAP, showing that SNAP retains PLAN{\textquoteright}s flexibility; give proof sketches of its novel approach to resource control; and present experimental data showing SNAP attains performance very close to that of a software IP router},
	keywords = {active picket language, Application software, complier, Contracts, Data security, efficiency, Explosives, INFORMATION SCIENCE, Internet, IP, IP networks, low-level packet language, packet switching, performance, PLAN, practical programmable packets, program compilers, Protection, resource control, Resource management, safe and nimble active packets, Safety, Security, SNAP, software IP router, Software performance, telecommunication security, Transport protocols},
	isbn = {0-7803-7016-3},
	doi = {10.1109/INFCOM.2001.916685},
	author = {Moore,J. T and Hicks, Michael W. and Nettles,S.}
}
@conference {17640,
	title = {Optimal design of signaling networks for Internet telephony},
	booktitle = {IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {2},
	year = {2000},
	month = {2000///},
	pages = {707-716 vol.2 - 707-716 vol.2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present an approach for efficient design of a signaling network for a network of software switches supporting Internet telephony. While one may take an integer programming approach to solve this problem, it quickly becomes intractable even for modest-sized networks. Instead, our topology design uses random graphs that we show to be nearly optimal in cost, highly connected, and computationally efficient even for large networks. We then formulate a quadratic assignment problem (QAP) to map the abstract topology into the physical network to achieve optimal load balancing for given demand forecasts, which we solve using randomized heuristics. Numerical results on several example networks illustrate the performance and computational efficiency of our method. A graphical design tool has been developed based on our algorithms},
	keywords = {bandwidth allocation, Computational efficiency, Computer networks, Cost function, Demand forecasting, demand forecasts, graph theory, graphical design tool, Internet telephony, Linear programming, Load forecasting, Load management, Network topology, optimal design, optimal load balancing, optimisation, performance, quadratic assignment problem, random graphs, randomised algorithms, randomized heuristics, Signal design, signaling networks, Switches, telecommunication signalling, topology design},
	isbn = {0-7803-5880-5},
	doi = {10.1109/INFCOM.2000.832245},
	author = {Srinivasan, Aravind and Ramakrishnan,K. G and Kumaran,K. and Aravamudan,M. and Naqvi,S.}
}
@conference {15691,
	title = {Integrated admission control in hierarchical video-on-demand systems},
	booktitle = {IEEE International Conference on Multimedia Computing and Systems, 1999},
	volume = {1},
	year = {1999},
	month = {1999/07//},
	pages = {220-225 vol.1 - 220-225 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We develop a unified model of a hierarchical video-on-demand (VoD) system by integrating the storage and the network subsystems. Rather than restricting the analysis to an isolated subsystem the performance of the VoD system is analyzed as an end-to-end system. On a system-wide basis, request handling and admission control policies are designed to minimize global performance metrics. Through our simulation, we compare different request handling policies and show that a hierarchical VoD architecture with request handling that allows retrials at more than one resource will minimize overall blocking},
	keywords = {Admission control, Bandwidth, blocking, Computer science, Design methodology, end-to-end system, hierarchical video-on-demand systems, integrated admission control, Intelligent networks, Load management, Motion pictures, Network servers, network subsystem, performance, Performance analysis, performance evaluation, quality of service, request handling, resource allocation, Resource management, simulation, storage subsystem, video on demand, video servers},
	isbn = {0-7695-0253-9},
	doi = {10.1109/MMCS.1999.779196},
	author = {Mundur, Padma and Simon,R. and Sood,A.}
}
@conference {14723,
	title = {PLANet: an active internetwork},
	booktitle = {IEEE INFOCOM {\textquoteright}99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {3},
	year = {1999},
	month = {1999/03/21/25},
	pages = {1124-1133 vol.3 - 1124-1133 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present PLANet: an active network architecture and implementation. In addition to a standard suite of Internet-like services, PLANet has two key programmability features: (1) all packets contain programs; and (2) router functionality may be extended dynamically. Packet programs are written in our special purpose programming language PLAN, the Packet Language for Active Networks, while dynamic router extensions are written in OCaml, a dialect of ML. Currently, PLANet routers run as byte-code-interpreted Linux user-space applications, and support Ethernet and IP as link layers. PLANet achieves respectable performance on standard networking operations: on 300 MHz Pentium-II{\textquoteright}s attached to 100 Mbps Ethernet, PLANet can route 48 Mbps and switch over 5000 packets per second. We demonstrate the utility of PLANet{\textquoteright}s activeness by showing experimentally how it can nontrivially improve application and aggregate network performance in congested conditions},
	keywords = {100 Mbit/s, 300 MHz, 48 Mbit/s, active internetwork, active network architecture, active network implementation, byte-code-interpreted applications, Computer architecture, Computer languages, Computer networks, congested conditions, dynamic programming, dynamic router extensions, Ethernet, Ethernet networks, INFORMATION SCIENCE, Internet, Internet-like services, internetworking, IP, IP networks, link layers, Linux user-space applications, Local area networks, ML dialect, Network performance, networking operations, OCaml, Packet Language for Active Networks, packet programs, packet switching, Pentium-II, performance, performance evaluation, PLAN, PLANet, Planets, programmability features, programming languages, router functionality, special purpose programming language, Switches, telecommunication network routing, Transport protocols, Web and internet services},
	isbn = {0-7803-5417-6},
	doi = {10.1109/INFCOM.1999.751668},
	author = {Hicks, Michael W. and Moore,J. T and Alexander,D. S and Gunter,C. A and Nettles,S. M}
}
@article {18378,
	title = {Complexity measure evaluation and selection},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {21},
	year = {1995},
	month = {1995/08//},
	pages = {641 - 650},
	abstract = {A formal model of program complexity developed earlier by the authors is used to derive evaluation criteria for program complexity measures. This is then used to determine which measures are appropriate within a particular application domain. A set of rules for determining feasible measures for a particular application domain are given, and an evaluation model for choosing among alternative feasible measures is presented. This model is used to select measures from the classification trees produced by the empirically guided software development environment of R.W. Selby and A.A. Porter, and early experiments show it to be an effective process},
	keywords = {alternative, complexity, criteria;evaluation, development, domain;classification, environment;evaluation, evaluation;empirically, evaluation;software, feasible, guided, measure, measures;application, measures;program, measures;software, metrics;software, model;feasible, performance, quality;software, selection;, software, trees;complexity},
	isbn = {0098-5589},
	doi = {10.1109/32.403788},
	author = {Tian,J. and Zelkowitz, Marvin V}
}
@conference {14955,
	title = {Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data},
	booktitle = {Supercomputing, 1995. Proceedings of the IEEE/ACM SC95 Conference},
	year = {1995},
	month = {1995///},
	pages = {12 - 12},
	abstract = {Remotely sensed imagery has been used for developing and validating various studies regarding land cover dynamics. However, the large amounts of imagery collected by the satellites are largely contaminated by the effects of atmospheric particles. The objective of atmospheric correction is to retrieve the surface reflectance from remotely sensed imagery by removing the atmospheric effects. We introduce a number of computational techniques that lead to a substantial speedup of an atmospheric correction algorithm based on using look-up tables. Excluding I/O time, the previous known implementation processes one pixel at a time and requires about 2.63 seconds per pixel on a SPARC-10 machine, while our implementation is based on processing the whole image and takes about 4-20 microseconds per pixel on the same machine. We also develop a parallel version of our algorithm that is scalable in terms of both computation and I/O. Experimental results obtained show that a Thematic Mapper (TM) image (36 MB per band, 5 bands need to be corrected) can be handled in less than 4.3 minutes on a 32-node CM-5 machine, including I/O time.},
	keywords = {Atmospheric, AVHRR;, computing;, correction;, high, I/O;, Parallel, performance, processing;, remote, scalable, sensing;, TM;},
	doi = {10.1109/SUPERC.1995.242453},
	author = {Fallah-Adl,H. and JaJa, Joseph F. and Liang,Shunlin and Kaufman,Y.J. and Townshend,J.}
}
@article {17160,
	title = {Fighting for the User.},
	journal = {Bulletin of the American Society for Information ScienceBulletin of the American Society for Information Science},
	volume = {9},
	year = {1982},
	month = {1982///},
	pages = {27 - 29},
	abstract = {Redesign of human-computer interface for users of computerized information systems can make substantial difference in training time, performance speed, error rates, and user satisfaction. Information and computer scientists are using controlled psychologically oriented experimentation, and evaluations during system development and active use to test design impact on human performance measures. (EJS)},
	keywords = {Automation, design, Formative Evaluation, Human Factors Engineering, Information systems, Input Output Devices, Man Machine Systems, Online Systems, performance, Summative Evaluation, Systems Development, Technological Advancement},
	url = {http://www.eric.ed.gov/ERICWebPortal/detail?accno=EJ276739},
	author = {Shneiderman, Ben}
}
