@article {18820,
	title = {Automated synthesis of action selection policies for unmanned vehicles operating in adverse environments},
	journal = {Autonomous Robots},
	volume = {32},
	year = {2012},
	month = {2012///},
	pages = {149 - 164},
	abstract = {We address the problem of automated action selection policy synthesis for unmanned vehicles operating in adverse environments. We introduce a new evolutionary computation-based approach using which an initial version of the policy is automatically generated and then gradually refined by detecting and fixing its shortcomings. The synthesis technique consists of the automated extraction of the vehicle{\textquoteright}s exception states and Genetic Programming (GP) for automated composition and optimization of corrective sequences of commands in the form of macro-actions to be applied locally. The focus is specifically on automated synthesis of a policy for Unmanned Surface Vehicle (USV) to efficiently block the advancement of an intruder boat toward a valuable target. This task requires the USV to utilize reactive planning complemented by short-term forward planning to generate specific maneuvers for blocking. The intruder is human-competitive and exhibits a deceptive behavior so that the USV cannot exploit regularity in its attacking behavior. We compared the performance of a hand-coded blocking policy to the performance of a policy that was automatically synthesized. Our results show that the performance of the automatically generated policy exceeds the performance of the hand-coded policy and thus demonstrates the feasibility of the proposed approach.},
	keywords = {Computer science},
	isbn = {0929-5593},
	doi = {10.1007/s10514-011-9268-6},
	url = {http://www.springerlink.com/content/664k84x080868141/abstract/},
	author = {Svec,Petr and Gupta, Satyandra K.}
}
@inbook {18597,
	title = {Re-wiring Activity of Malicious Networks},
	booktitle = {Passive and Active MeasurementPassive and Active Measurement},
	series = {Lecture Notes in Computer Science},
	volume = {7192},
	year = {2012},
	month = {2012///},
	pages = {116 - 125},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This paper studies the AS-level re-wiring dynamics (changes in the connectivity) of malicious networks. Anecdotal evidence suggests that some malicious ASes that are primarily involved in nefarious activities on the Internet, were sequentially de-peered by providers before their final cut-off (as occurred in the well-publicized cases of Atrivo/Intercage). We present the first systematic study of the re-wiring dynamics of malicious ASes. We tracked the ASes that were listed by Hostexploit over the last two years and compared their AS-level re-wiring dynamics with non-reported ASes. Using a publicly available dataset of Customer-Provider (CP) relations in the Internet{\textquoteright}s AS graph, we studied how interconnection between autonomous systems evolves, both for ASes that provide connectivity for attackers and ASes that were not reported as malicious. We find that malicious networks are more aggressive both in forming links with providers and changing their upstream connectivity than other ASes. Our results indicate that the re-wiring dynamics of the networks that host attacks are stable over time, despite the evolving nature of the attacks themselves, which suggests that existing defense mechanisms could benefit from incorporating these features.},
	keywords = {Computer science},
	isbn = {978-3-642-28536-3},
	url = {http://www.springerlink.com/content/95vn833728404877/abstract/},
	author = {Konte,Maria and Feamster, Nick},
	editor = {Taft,Nina and Ricciato,Fabio}
}
@inbook {19034,
	title = {Implicit Authentication through Learning User Behavior},
	booktitle = {Information Security},
	series = {Lecture Notes in Computer Science},
	volume = {6531},
	year = {2011},
	month = {2011},
	pages = {99 - 113},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Users are increasingly dependent on mobile devices. However, current authentication methods like password entry are significantly more frustrating and difficult to perform on these devices, leading users to create and reuse shorter passwords and pins, or no authentication at all. We present implicit authentication - authenticating users based on behavior patterns. We describe our model for performing implicit authentication and assess our techniques using more than two weeks of collected data from over 50 subjects.},
	keywords = {Computer science},
	isbn = {978-3-642-18177-1},
	url = {http://www.springerlink.com/content/m57u551u3133475m/abstract/},
	author = {Elaine Shi and Niu, Yuan and Jakobsson, Markus and Chow, Richard},
	editor = {Burmester, Mike and Tsudik, Gene and Magliveras, Spyros and Ilic, Ivana}
}
@inbook {19037,
	title = {Oblivious RAM with O((logN)^3) Worst-Case Cost},
	booktitle = {Advances in Cryptology {\textendash} ASIACRYPT 2011},
	series = {Lecture Notes in Computer Science},
	volume = {7073},
	year = {2011},
	month = {2011},
	pages = {197 - 214},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Oblivious RAM is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. Until recently, most prior works on Oblivious RAM aim to optimize its amortized cost, while suffering from linear or even higher worst-case cost. Such poor worst-case behavior renders these schemes impractical in realistic settings, since a data access request can occasionally be blocked waiting for an unreasonably large number of operations to complete. This paper proposes novel Oblivious RAM constructions that achieves poly-logarithmic worst-case cost, while consuming constant client-side storage. To achieve the desired worst-case asymptotic performance, we propose a novel technique in which we organize the O-RAM storage into a binary tree over data buckets, while moving data blocks obliviously along tree edges.},
	keywords = {Computer science},
	isbn = {978-3-642-25384-3},
	url = {http://www.springerlink.com/content/2214q8013376rj37/abstract/},
	author = {Elaine Shi and Chan, T. and Stefanov, Emil and Li, Mingfei},
	editor = {Lee, Dong and Wang, Xiaoyun}
}
@conference {17442,
	title = {TreeVersity: Comparing tree structures by topology and node{\textquoteright}s attributes differences},
	booktitle = {2011 IEEE Conference on Visual Analytics Science and Technology (VAST)},
	year = {2011},
	month = {2011/10/23/28},
	pages = {275 - 276},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity.},
	keywords = {Computer science, data classification, Data visualization, Educational institutions, hierarchy, Image color analysis, LifeFlow, node attributes differences, Pattern classification, structural changes, Topology, topology attributes differences, traffic agencies, tree structures comparison, trees (mathematics), TreeVersity, Vegetation, Visualization},
	isbn = {978-1-4673-0015-5},
	doi = {10.1109/VAST.2011.6102471},
	author = {Gomez,J.A.G. and Buck-Coleman,A. and Plaisant, Catherine and Shneiderman, Ben}
}
@conference {13391,
	title = {On Computing Compression Trees for Data Collection in Wireless Sensor Networks},
	booktitle = {2010 Proceedings IEEE INFOCOM},
	year = {2010},
	month = {2010/03/14/19},
	pages = {1 - 9},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and understanding how close we can get to the known theoretical lower bounds. Our proposed approach is based on finding an optimal or a near-optimal compression tree for a given sensor network: a compression tree is a directed tree over the sensor network nodes such that the value of a node is compressed using the value of its parent. We focus on broadcast communication model in this paper, but our results are more generally applicable to a unicast communication model as well. We draw connections between the data collection problem and a previously studied graph concept called weakly connected dominating sets, and we use this to develop novel approximation algorithms for the problem. We present comparative results on several synthetic and real-world datasets showing that our algorithms construct near-optimal compression trees that yield a significant reduction in the data collection cost.},
	keywords = {Approximation algorithms, Base stations, Communications Society, Computer networks, Computer science, computing compression trees, Costs, data collection, Data communication, data compression, designing algorithms, Educational institutions, Entropy, graph concept, Monitoring, Protocols, trees (mathematics), weakly connected dominating sets, Wireless sensor networks},
	isbn = {978-1-4244-5836-3},
	doi = {10.1109/INFCOM.2010.5462035},
	author = {Li,Jian and Deshpande, Amol and Khuller, Samir}
}
@conference {17843,
	title = {Decentralized dynamic scheduling across heterogeneous multi-core desktop grids},
	booktitle = {2010 IEEE International Symposium on Parallel \& Distributed Processing, Workshops and Phd Forum (IPDPSW)},
	year = {2010},
	month = {2010/04/19/23},
	pages = {1 - 9},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The recent advent of multi-core computing environments increases both the heterogeneity and complexity of managing desktop grid resources, making efficient load balancing challenging even for a centralized manager. Even with good initial job assignments, dynamic scheduling is still needed to adapt to dynamic environments, as well as for applications whose running times are not known a priori. In this paper, we propose new decentralized scheduling schemes that backfill jobs locally and dynamically migrate waiting jobs across nodes to leverage residual resources, while guaranteeing bounded waiting times for all jobs. The methods attempt to maximize total throughput while balancing load across available grid resources. Experimental results via simulation show that our scheduling scheme has performance competitive with an online centralized scheduler.},
	keywords = {backfill jobs, bounded waiting time, Computer science, decentralized dynamic scheduling, desktop grid resource management, Dynamic scheduling, Educational institutions, Environmental management, grid computing, heterogeneous multicore desktop grid, job assignment, job migration, load balancing, Load management, multicore computing environment, Peer to peer computing, Processor scheduling, residual resources, resource allocation, Resource management, scheduling, Scheduling algorithm, Throughput},
	isbn = {978-1-4244-6533-0},
	doi = {10.1109/IPDPSW.2010.5470877},
	author = {Jaehwan Lee and Keleher,P. and Sussman, Alan}
}
@conference {17633,
	title = {New Constructive Aspects of the Lovasz Local Lemma},
	booktitle = {2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS)},
	year = {2010},
	month = {2010/10/23/26},
	pages = {397 - 406},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The Lov{\textquoteright}{a}sz Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding all of a given set of {\textquoteleft}{\textquoteleft}bad{\textquoteright}{\textquoteright} events, with positive probability. A series of results have provided algorithms to efficiently construct structures whose existence is non-constructively guaranteed by the LLL, culminating in the recent breakthrough of Moser \& Tardos. We show that the output distribution of the Moser-Tardos algorithm well-approximates the emph{conditional LLL-distribution} {\textendash} the distribution obtained by conditioning on all bad events being avoided. We show how a known bound on the probabilities of events in this distribution can be used for further probabilistic analysis and give new constructive and non-constructive results. We also show that when an LLL application provides a small amount of slack, the number of resamplings of the Moser-Tardos algorithm is nearly linear in the number of underlying independent variables (not events!), and can thus be used to give efficient constructions in cases where the underlying proof applies the LLL to super-polynomially many events. Even in cases where finding a bad event that holds is computationally hard, we show that applying the algorithm to avoid a polynomial-sized {\textquoteleft}{\textquoteleft}core{\textquoteright}{\textquoteright} subset of bad events leads to a desired outcome with high probability. We demonstrate this idea on several applications. We give the first constant-factor approximation algorithm for the Santa Claus problem by making an LLL-based proof of Feige constructive. We provide Monte Carlo algorithms for acyclic edge coloring, non-repetitive graph colorings, and Ramsey-type graphs. In all these applications the algorithm falls directly out of the non-constructive LLL-based proof. Our algorithms are very simple, often provide better bounds than previous algorithms, and are in several cases the first efficient algorithms known. As a second type of application we consider settings beyond the critical dependency threshold of the LLL: - - avoiding all bad events is impossible in these cases. As the first (even non-constructive) result of this kind, we show that by sampling from the LLL-distribution of a selected smaller core, we can avoid a fraction of bad events that is higher than the expectation. MAX $k$-SAT is an example of this.},
	keywords = {acyclic edge coloring, Algorithm design and analysis, Approximation algorithms, Approximation methods, computational complexity, Computer science, constant factor approximation algorithm, graph colouring, Linearity, Lovasz Local Lemma, MAX k-SAT, Monte Carlo Algorithm, Monte Carlo methods, Moser-Tardos algorithm, nonrepetitive graph coloring, output distribution, polynomial sized core subset, Polynomials, Probabilistc Method, probabilistic analysis, probabilistic logic, probability, Ramsey type graph, Sampling methods, Santa Claus Problem},
	isbn = {978-1-4244-8525-3},
	doi = {10.1109/FOCS.2010.45},
	author = {Haeupler,B. and Saha,B. and Srinivasan, Aravind}
}
@inbook {19044,
	title = {Signatures of Reputation},
	booktitle = {Financial Cryptography and Data Security},
	series = {Lecture Notes in Computer Science},
	volume = {6052},
	year = {2010},
	month = {2010},
	pages = {400 - 407},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	keywords = {Computer science},
	isbn = {978-3-642-14576-6},
	url = {http://www.springerlink.com/content/8484428n77226512/abstract/},
	author = {Bethencourt, John and Elaine Shi and Song, Dawn},
	editor = {Sion, Radu}
}
@conference {14208,
	title = {Combining powerful local and global statistics for texture description},
	booktitle = {IEEE Conference on Computer Vision and Pattern Recognition, 2009. CVPR 2009},
	year = {2009},
	month = {2009/06/20/25},
	pages = {573 - 580},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A texture descriptor is proposed, which combines local highly discriminative features with the global statistics of fractal geometry to achieve high descriptive power, but also invariance to geometric and illumination transformations. As local measurements SIFT features are estimated densely at multiple window sizes and discretized. On each of the discretized measurements the fractal dimension is computed to obtain the so-called multifractal spectrum, which is invariant to geometric transformations and illumination changes. Finally to achieve robustness to scale changes, a multi-scale representation of the multifractal spectrum is developed using a framelet system, that is, a redundant tight wavelet frame system. Experiments on classification demonstrate that the descriptor outperforms existing methods on the UIUC as well as the UMD high-resolution dataset.},
	keywords = {Computer science, discretized measurements, fractal geometry, Fractals, geometric transformations, global statistics, Histograms, illumination transformations, image classification, image resolution, Image texture, lighting, local measurements SIFT features, local statistics, MATHEMATICS, multifractal spectrum, multiscale representation, Power engineering and energy, Power engineering computing, Robustness, Solids, Statistics, texture description, UMD high-resolution dataset, wavelet frame system, Wavelet transforms},
	isbn = {978-1-4244-3992-8},
	doi = {10.1109/CVPR.2009.5206741},
	author = {Yong Xu and Si-Bin Huang and Hui Ji and Ferm{\"u}ller, Cornelia}
}
@conference {17585,
	title = {Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks},
	booktitle = {IEEE INFOCOM 2009},
	year = {2009},
	month = {2009/04/19/25},
	pages = {1521 - 1529},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Equipping wireless nodes with multiple radios can significantly increase the capacity of wireless networks, by making these radios simultaneously transmit over multiple non-overlapping channels. However, due to the limited number of radios and available orthogonal channels, designing efficient channel assignment and scheduling algorithms in such networks is a major challenge. In this paper, we present provably-good distributed algorithms for simultaneous channel allocation of individual links and packet-scheduling, in software-defined radio (SDR) wireless networks. Our distributed algorithms are very simple to implement, and do not require any coordination even among neighboring nodes. A novel access hash function or random oracle methodology is one of the key drivers of our results. With this access hash function, each radio can know the transmitters{\textquoteright} decisions for links in its interference set for each time slot without introducing any extra communication overhead between them. Further, by utilizing the inductive-scheduling technique, each radio can also backoff appropriately to avoid collisions. Extensive simulations demonstrate that our bounds are valid in practice.},
	keywords = {access hash function, Channel allocation, channel assignment algorithm, channel capacity, collision avoidance, Computer science, cryptography, distributed algorithm, distributed algorithms, Educational institutions, inductive-scheduling technique, Interference, interference set, packet scheduling algorithm, Peer to peer computing, Radio network, radio networks, radiofrequency interference, random oracle methodology, scheduling, Scheduling algorithm, simultaneous channel allocation, software radio, software-defined radio wireless network capacity, telecommunication congestion control, telecommunication security, Throughput, wireless channels, Wireless networks},
	isbn = {978-1-4244-3512-8},
	doi = {10.1109/INFCOM.2009.5062069},
	author = {Han,Bo and Kumar,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind}
}
@conference {17168,
	title = {First Steps to Netviz Nirvana: Evaluating Social Network Analysis with NodeXL},
	booktitle = {International Conference on Computational Science and Engineering, 2009. CSE {\textquoteright}09},
	volume = {4},
	year = {2009},
	month = {2009/08/29/31},
	pages = {332 - 339},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Social Network Analysis (SNA) has evolved as a popular, standard method for modeling meaningful, often hidden structural relationships in communities. Existing SNA tools often involve extensive pre-processing or intensive programming skills that can challenge practitioners and students alike. NodeXL, an open-source template for Microsoft Excel, integrates a library of common network metrics and graph layout algorithms within the familiar spreadsheet format, offering a potentially low-barrier-to-entry framework for teaching and learning SNA. We present the preliminary findings of 2 user studies of 21 graduate students who engaged in SNA using NodeXL. The majority of students, while information professionals, had little technical background or experience with SNA techniques. Six of the participants had more technical backgrounds and were chosen specifically for their experience with graph drawing and information visualization. Our primary objectives were (1) to evaluate NodeXL as an SNA tool for a broad base of users and (2) to explore methods for teaching SNA. Our complementary dual case-study format demonstrates the usability of NodeXL for a diverse set of users, and significantly, the power of a tightly integrated metrics/visualization tool to spark insight and facilitate sense-making for students of SNA.},
	keywords = {Computer science, computer science education, data visualisation, Data visualization, Educational institutions, graph drawing, graph layout algorithm, Information services, Information Visualization, Internet, Libraries, Microsoft Excel open-source template, MILC, multi-dimensional in-depth long-term case studies, Netviz Nirvana, NodeXL, Open source software, Programming profession, SNA, social network analysis, Social network services, social networking (online), spreadsheet programs, structural relationship, teaching, visual analytics, visualization tool, Web sites},
	isbn = {978-1-4244-5334-4},
	doi = {10.1109/CSE.2009.120},
	author = {Bonsignore,E. M and Dunne,C. and Rotman,D. and Smith,M. and Capone,T. and Hansen,D. L and Shneiderman, Ben}
}
@conference {13385,
	title = {Minimizing Communication Cost in Distributed Multi-query Processing},
	booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09},
	year = {2009},
	month = {2009/04/29/March},
	pages = {772 - 783},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in the area of distributed query processing and optimization. In this paper we address a general, distributed multi-query processing problem motivated by the need to minimize the communication cost in these environments. Specifically we address the problem of optimally sharing data movement across the communication edges in a distributed communication network given a set of overlapping queries and query plans for them (specifying the operations to be executed). Most of the problem variations of our general problem can be shown to be NP-Hard by a reduction from the Steiner tree problem. However, we show that the problem can be solved optimally if the communication network is a tree, and present a novel algorithm for finding an optimal data movement plan. For general communication networks, we present efficient approximation algorithms for several variations of the problem. Finally, we present an experimental study over synthetic datasets showing both the need for exploiting the sharing of data movement and the effectiveness of our algorithms at finding such plans.},
	keywords = {Approximation algorithms, Communication networks, Computer science, Cost function, Data engineering, distributed communication network, distributed databases, distributed multi-query processing, grid computing, Large-scale systems, NP-hard, optimisation, Polynomials, Publish-subscribe, publish-subscribe systems, Query optimization, Query processing, sensor networks, Steiner tree problem, Tree graphs, trees (mathematics)},
	isbn = {978-1-4244-3422-0},
	doi = {10.1109/ICDE.2009.85},
	author = {Li,Jian and Deshpande, Amol and Khuller, Samir}
}
@inbook {18916,
	title = {Planning for Interactions among Autonomous Agents},
	booktitle = {Programming Multi-Agent Systems},
	series = {Lecture Notes in Computer Science},
	volume = {5442},
	year = {2009},
	month = {2009///},
	pages = {1 - 23},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {AI planning research has traditionally focused on offline pl- anning for static single-agent environments. In environments where an agent needs to plan its interactions with other autonomous agents, planning is much more complicated, because the actions of the other agents can induce a combinatorial explosion in the number of contingencies that the planner will need to consider. This paper discusses several ways to alleviate the combinatorial explosion, and illustrates their use in several different kinds of multi-agent planning domains.},
	keywords = {Computer science},
	isbn = {978-3-642-03277-6},
	url = {http://www.springerlink.com/content/j258015ux2p38383/abstract/},
	author = {Au,Tsz-Chiu and Kuter,Ugur and Nau, Dana S.},
	editor = {Hindriks,Koen and Pokahr,Alexander and Sardina,Sebastian}
}
@inbook {19041,
	title = {Predicate Privacy in Encryption Systems},
	booktitle = {Theory of Cryptography},
	series = {Lecture Notes in Computer Science},
	volume = {5444},
	year = {2009},
	month = {2009},
	pages = {457 - 473},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Predicate encryption is a new encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. The master secret key owner can generate secret key tokens corresponding to predicates. An encryption of data x can be evaluated using a secret token corresponding to a predicate f ; the user learns whether the data satisfies the predicate, i.e., whether f ( x ) = 1. Prior work on public-key predicate encryption has focused on the notion of data or plaintext privacy, the property that ciphertexts reveal no information about the encrypted data to an attacker other than what is inherently revealed by the tokens the attacker possesses. In this paper, we consider a new notion called predicate privacy , the property that tokens reveal no information about the encoded query predicate. Predicate privacy is inherently impossible to achieve in the public-key setting and has therefore received little attention in prior work. In this work, we consider predicate encryption in the symmetric-key setting and present a symmetric-key predicate encryption scheme which supports inner product queries. We prove that our scheme achieves both plaintext privacy and predicate privacy.},
	keywords = {Computer science},
	isbn = {978-3-642-00456-8},
	url = {http://www.springerlink.com/content/1717x5445k4718rp/abstract/},
	author = {Shen, Emily and Elaine Shi and Waters,Brent},
	editor = {Reingold, Omer}
}
@article {15035,
	title = {Techniques to audit and certify the long-term integrity of digital archives},
	journal = {International Journal on Digital Libraries},
	volume = {10},
	year = {2009},
	month = {2009///},
	pages = {123 - 131},
	abstract = {A fundamental requirement for a digital archive is to set up mechanisms that will ensure the authenticity of its holdings in the long term. In this article, we develop a new methodology to address the long-term integrity of digital archives using rigorous cryptographic techniques. Our approach involves the generation of a small-size integrity token for each object, some cryptographic summary information, and a framework that enables cost-effective regular and periodic auditing of the archive{\textquoteright}s holdings depending on the policy set by the archive. Our scheme is very general, architecture and platform independent, and can detect with high probability any alteration to an object, including malicious alterations introduced by the archive or by an external intruder. The scheme can be shown to be mathematically correct as long as a small amount of cryptographic information, in the order of 100 KB/year, can be kept intact. Using this approach, a prototype system called ACE (Auditing Control Environment) has been built and tested in an operational large scale archiving environment.},
	keywords = {Computer science},
	isbn = {1432-5012},
	doi = {10.1007/s00799-009-0056-2},
	url = {http://www.springerlink.com/content/y52815g805h96334/abstract/},
	author = {Song,Sangchul and JaJa, Joseph F.}
}
@conference {17453,
	title = {Understanding social computing participation with visual exploration tools},
	booktitle = {International Symposium on Collaborative Technologies and Systems, 2009. CTS {\textquoteright}09},
	year = {2009},
	month = {2009/05/18/22},
	pages = {xi-xii - xi-xii},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The rapid growth of socio-technical systems, social media and social networking websites has raised the importance of understanding the determinants of their success. The pressure to understand success is increased by the shift from playful discretionary applications to mission critical applications in government, business, and civic settings. These include homeland defense, energy sustainability, environmental conservation, disaster response, and community safety. Information visualization tools and statistical methods can both be helpful, but their utility grows when they are well-integrated. This talk will demonstrate novel tools for network evolution and offer a framework for thinking about motivating technology-mediated social participation.},
	keywords = {Application software, Books, Collaborative tools, Computer science, Data visualization, Educational institutions, History, International collaboration, Social network services, Sociotechnical systems},
	isbn = {978-1-4244-4584-4},
	doi = {10.1109/CTS.2009.5067426},
	author = {Shneiderman, Ben}
}
@conference {17559,
	title = {Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints},
	booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications},
	year = {2008},
	month = {2008/04/13/18},
	pages = {1166 - 1174},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.},
	keywords = {Algorithm design and analysis, approximation algorithm, Approximation algorithms, approximation theory, Computer networks, Computer science, graph theory, graph-based model, Interference constraints, polynomial time algorithm, Propagation losses, Protocols, radio networks, radiofrequency interference, signal to interference plus noise ratio, Signal to noise ratio, Throughput, wireless interference, wireless network, Wireless networks},
	isbn = {978-1-4244-2025-4},
	doi = {10.1109/INFOCOM.2008.172},
	author = {Chafekar,D. and Kumart,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind}
}
@conference {17570,
	title = {Capacity of Asynchronous Random-Access Scheduling in Wireless Networks},
	booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications},
	year = {2008},
	month = {2008/04/13/18},
	pages = {1148 - 1156},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how should we set the channel-access probability for each link in the network so that the network operates close to its optimal throughput capacity? We design simple and distributed channel-access strategies for random-access networks which are provably competitive with respect to the optimal scheduling strategy, which is deterministic, centralized, and computationally infeasible. We show that the competitiveness of our strategies are nearly the best achievable via random-access scheduling, thus establishing fundamental limits on the performance of random- access. A notable outcome of our work is that random access compares well with deterministic scheduling when link transmission durations differ by small factors, and much worse otherwise. The distinguishing aspects of our work include modeling and rigorous analysis of asynchronous communication, asymmetry in link transmission durations, and hidden terminals under arbitrary link-conflict based wireless interference models.},
	keywords = {asynchronous random-access scheduling, channel access probability, Computer networks, Computer science, Educational institutions, Interference, Optimal scheduling, Peer to peer computing, probability, Processor scheduling, radio link, radio links, radio networks, Routing, scheduling, Throughput, throughput capacity, wireless channels, Wireless networks},
	isbn = {978-1-4244-2025-4},
	doi = {10.1109/INFOCOM.2008.170},
	author = {Chafekar,D. and Levin,D. and Kumar,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind}
}
@article {18899,
	title = {Computational Cultural Dynamics},
	journal = {Intelligent Systems, IEEE},
	volume = {23},
	year = {2008},
	month = {2008/08//july},
	pages = {18 - 19},
	abstract = {Computational cultural dynamics blends the behavioral and social sciences - fields such as political science, psychology, journalism, anthropology, and sociology - with technological fields such as computer science, computational linguistics, game theory, statistical modeling, and operations research.},
	keywords = {anthropology, behavioral science, behavioural sciences computing, computational cultural dynamics, computational linguistics, Computer science, game theory, journalism, operations research, political science, Psychology, social sciences, social sciences computing, sociology, statistical modeling},
	isbn = {1541-1672},
	doi = {10.1109/MIS.2008.61},
	author = {Nau, Dana S. and Wilkenfeld,J.}
}
@inbook {19030,
	title = {Delegating Capabilities in Predicate Encryption Systems},
	booktitle = {Automata, Languages and Programming},
	series = {Lecture Notes in Computer Science},
	volume = {5126},
	year = {2008},
	month = {2008},
	pages = {560 - 578},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In predicate encryption systems, given a capability, one can evaluate one or more predicates on the plaintext encrypted, while all other information about the plaintext remains hidden. We consider the role of delegation in such predicate encryption systems. Suppose Alice has a capability, and she wishes to delegate to Bob a more restrictive capability allowing the decryption of a subset of the information Alice can learn about the plaintext encrypted. We formally define delegation in predicate encryption systems, propose a new security definition for delegation, and give an efficient construction supporting conjunctive queries. The security of our construction can be reduced to the general 3-party Bilinear Diffie-Hellman assumption, and the Bilinear Decisional Diffie-Hellman assumption in composite order bilinear groups.},
	keywords = {Computer science},
	isbn = {978-3-540-70582-6},
	url = {http://www.springerlink.com/content/w320422h15050004/abstract/},
	author = {Elaine Shi and Waters,Brent},
	editor = {Aceto,Luca and Damg{\r a}rd,Ivan and Goldberg,Leslie and Halld{\'o}rsson,Magn{\'u}s and Ing{\'o}lfsd{\'o}ttir,Anna and Walukiewicz,Igor}
}
@inbook {18675,
	title = {Finding Corrupted Computers Using Imperfect Intrusion Prevention System Event Data},
	booktitle = {Computer Safety, Reliability, and Security},
	series = {Lecture Notes in Computer Science},
	volume = {5219},
	year = {2008},
	month = {2008///},
	pages = {221 - 234},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {With the increase of attacks on the Internet, a primary concern for organizations is how to protect their network. The objectives of a security team are 1) to prevent external attackers from launching successful attacks against organization computers that could become compromised, 2) to ensure that organization computers are not vulnerable (e.g., fully patched) so that in either case the organization computers do not start launching attacks. The security team can monitor and block malicious activity by using devices such as intrusion prevention systems. However, in large organizations, such monitoring devices could record a high number of events. The contributions of this paper are 1) to introduce a method that ranks potentially corrupted computers based on imperfect intrusion prevention system event data, and 2) to evaluate the method based on empirical data collected at a large organization of about 40,000 computers. The evaluation is based on the judgment of a security expert of which computers were indeed corrupted. On the one hand, we studied how many computers classified as of high concern or of concern were indeed corrupted (i.e., true positives). On the other hand, we analyzed how many computers classified as of lower concern were in fact corrupted (i.e., false negatives).},
	keywords = {Computer science},
	isbn = {978-3-540-87697-7},
	url = {http://www.springerlink.com/content/4767u3017r613822/abstract/},
	author = {Chrun,Danielle and Michel Cukier and Sneeringer,Gerry},
	editor = {Harrison,Michael and Sujan,Mark-Alexander}
}
@article {14620,
	title = {Guest Editors{\textquoteright} Introduction to the Special Section on Algorithms in Bioinformatics},
	journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
	volume = {5},
	year = {2008},
	month = {2008/12//Oct},
	pages = {482 - 483},
	keywords = {Abstracts, Algorithm design and analysis, Bioinformatics, Biological system modeling, biology computing, Computational Biology, Computational modeling, Computer science, Genomics, sequences},
	isbn = {1545-5963},
	doi = {10.1109/TCBB.2008.116},
	author = {Giancarlo,Raffaele and Hannenhalli, Sridhar}
}
@article {18900,
	title = {Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds},
	journal = {Annals of Mathematics and Artificial Intelligence},
	volume = {51},
	year = {2007},
	month = {2007///},
	pages = {295 - 331},
	abstract = {The semantics of probabilistic logic programs (PLPs) is usually given through a possible worlds semantics. We propose a variant of PLPs called action probabilistic logic programs or -programs that use a two-sorted alphabet to describe the conditions under which certain real-world entities take certain actions. In such applications, worlds correspond to sets of actions these entities might take. Thus, there is a need to find the most probable world (MPW) for -programs. In contrast, past work on PLPs has primarily focused on the problem of entailment. This paper quickly presents the syntax and semantics of -programs and then shows a naive algorithm to solve the MPW problem using the linear program formulation commonly used for PLPs. As such linear programs have an exponential number of variables, we present two important new algorithms, called and to solve the MPW problem exactly. Both these algorithms can significantly reduce the number of variables in the linear programs. Subsequently, we present a {\textquotedblleft}binary{\textquotedblright} algorithm that applies a binary search style heuristic in conjunction with the Naive, and algorithms to quickly find worlds that may not be {\textquotedblleft}most probable.{\textquotedblright} We experimentally evaluate these algorithms both for accuracy (how much worse is the solution found by these heuristics in comparison to the exact solution) and for scalability (how long does it take to compute). We show that the results of are very accurate and also very fast: more than 10 30,000 worlds can be handled in a few minutes. Subsequently, we develop parallel versions of these algorithms and show that they provide further speedups.},
	keywords = {Computer science},
	isbn = {1012-2443},
	doi = {10.1007/s10472-008-9089-2},
	url = {http://www.springerlink.com/content/t70g873h613273pu/abstract/},
	author = {Khuller, Samir and Martinez,M. and Nau, Dana S. and Sliva,Amy and Simari,Gerardo and Subrahmanian,V.}
}
@article {17591,
	title = {Efficient lookup on unstructured topologies},
	journal = {IEEE Journal on Selected Areas in Communications},
	volume = {25},
	year = {2007},
	month = {2007/01//},
	pages = {62 - 72},
	abstract = {We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a Distributed Hash Table (DHT). We present analytic bounds for the worst-case performance of LMS. Through detailed simulations (with up to 100,000 nodes), we show that the actual performance on realistic topologies is significantly better. We also show in both simulations and a complete implementation (which includes over five hundred nodes) that our protocol is inherently robust against multiple node failures and can adapt its replication strategy to optimize searches according to a specific heuristic. Moreover, the simulation demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size. The overhead incurred by LMS is small, and its performance approaches that of DHTs on networks of similar size},
	keywords = {Computer science, DHT, distributed algorithms, Distributed computing, distributed hash table, Least squares approximation, LMS, local minima search, lookup protocol, Network topology, node failures, Peer to peer computing, Performance analysis, Protocols, replication strategy, Resilience, Robustness, table lookup, telecommunication network topology, unstructured network topology},
	isbn = {0733-8716},
	doi = {10.1109/JSAC.2007.07007},
	author = {Morselli,R. and Bhattacharjee, Bobby and Marsh,M.A. and Srinivasan, Aravind}
}
@inbook {18904,
	title = {Finding Most Probable Worlds of Probabilistic Logic Programs},
	booktitle = {Scalable Uncertainty Management},
	series = {Lecture Notes in Computer Science},
	volume = {4772},
	year = {2007},
	month = {2007///},
	pages = {45 - 59},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are interested in finding a possible world that is most probable. Our first result shows that the problem of computing such {\textquotedblright}maximally probable worlds{\textquotedblright} (MPW) is intractable. We subsequently show that we can often greatly reduce the size of the linear program used in past work (by Ng and Subrahmanian) and yet solve the problem exactly. However, the intractability results still make computational efficiency quite impossible. We therefore also develop several heuristics to solve the MPW problem and report extensive experimental results on the accuracy and efficiency of such heuristics.},
	keywords = {Computer science},
	isbn = {978-3-540-75407-7},
	url = {http://www.springerlink.com/content/e4463p4rv4k01u93/abstract/},
	author = {Khuller, Samir and Martinez,Vanina and Nau, Dana S. and Simari,Gerardo and Sliva,Amy and Subrahmanian,V.},
	editor = {Prade,Henri and Subrahmanian,V.}
}
@conference {13402,
	title = {Representing Tuple and Attribute Uncertainty in Probabilistic Databases},
	booktitle = {Seventh IEEE International Conference on Data Mining Workshops, 2007. ICDM Workshops 2007},
	year = {2007},
	month = {2007/10/28/31},
	pages = {507 - 512},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources-sensor data, experimental data, data from uncurated sources, and many others. There is a growing need to be able to flexibly represent the uncertainties in the data, and to efficiently query the data. Building on existing probabilistic database work, we present a unifying framework which allows a flexible representation of correlated tuple and attribute level uncertainties. An important capability of our representation is the ability to represent shared correlation structures in the data. We provide motivating examples to illustrate when such shared correlation structures are likely to exist. Representing shared correlations structures allows the use of sophisticated inference techniques based on lifted probabilistic inference that, in turn, allows us to achieve significant speedups while computing probabilities for results of user-submitted queries.},
	keywords = {attribute uncertainty, Computer science, Conferences, correlation structures, data mining, Data models, database management systems, Educational institutions, inference mechanisms, noisy data sources, probabilistic database, probabilistic inference, Probability distribution, Query processing, Relational databases, Sensor phenomena and characterization, tuple representation, Uncertainty, uncertainty handling},
	isbn = {978-0-7695-3019-2},
	doi = {10.1109/ICDMW.2007.11},
	author = {Sen,P. and Deshpande, Amol and Getoor, Lise}
}
@article {18869,
	title = {Towards the development of a virtual environment-based training system for mechanical assembly operations},
	journal = {Virtual Reality},
	volume = {11},
	year = {2007},
	month = {2007///},
	pages = {189 - 206},
	abstract = {In this paper, we discuss the development of Virtual Training Studio (VTS), a virtual environment-based training system that allows training supervisors to create training instructions and allows trainees to learn assembly operations in a virtual environment. Our system is mainly focused on the cognitive side of training so that trainees can learn to recognize parts, remember assembly sequences, and correctly orient the parts during assembly operations. Our system enables users to train using the following three training modes: (1) Interactive Simulation, (2) 3D Animation, and (3) Video. Implementing these training modes required us to develop several new system features. This paper presents an overview of the VTS system and describes a few main features of the system. We also report user test results that show how people train using our system. The user test results indicate that the system is able to support a wide variety of training preferences and works well to support training for assembly operations.},
	keywords = {Computer science},
	isbn = {1359-4338},
	doi = {10.1007/s10055-007-0076-4},
	url = {http://www.springerlink.com/content/g7760422m13l83x1/abstract/},
	author = {Brough,John and Schwartz,Maxim and Gupta, Satyandra K. and Anand,Davinder and Kavetsky,Robert and Pettersen,Ralph}
}
@inbook {18834,
	title = {Finding Mold-Piece Regions Using Computer Graphics Hardware},
	booktitle = {Geometric Modeling and Processing - GMP 2006},
	series = {Lecture Notes in Computer Science},
	volume = {4077},
	year = {2006},
	month = {2006///},
	pages = {655 - 662},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {An important step in the mold design process that ensures disassembly of mold pieces consists of identifying various regions on the part that will be formed by different mold pieces. This paper presents an efficient and robust algorithm to find and highlight the mold-piece regions on a part. The algorithm can be executed on current-generation computer graphics hardware. The complexity of the algorithm solely depends on the time to render the given part. By using a system that can quickly find various mold-piece regions on a part, designers can easily optimize the part and mold design and if needed make appropriate corrections upfront, streamlining the subsequent design steps.},
	keywords = {Computer science},
	isbn = {978-3-540-36711-6},
	url = {http://www.springerlink.com/content/t8t3588924263p12/abstract/},
	author = {Priyadarshi,Alok and Gupta, Satyandra K.},
	editor = {Kim,Myung-Soo and Shimada,Kenji}
}
@conference {18480,
	title = {Frequency Independent Flexible Spherical Beamforming Via Rbf Fitting},
	booktitle = {2006 IEEE International Conference on Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings},
	volume = {5},
	year = {2006},
	month = {2006/05//},
	pages = {V-V - V-V},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We describe a new method for sound analysis using a spherical microphone array without the use of quadrature over the sphere. Quadrature based solutions are very sensitive to the placement of microphones on the sphere, needing measurements to be made at exactly the quadrature positions. We propose to use fitting with band-limited radial basis functions (RBFs) rather than quadrature. Our approach results in frequency independent beamformer weights for flexibly placed microphone locations. Results are demonstrated using both synthetic and real spherical array data},
	keywords = {acoustic signal processing, array signal processing, band-limited radial basis functions, Computer science, Educational institutions, Eigenvalues and eigenfunctions, Equations, Frequency, frequency independent beamformer weights, frequency independent flexible spherical beamforming, microphone arrays, Nails, Position measurement, RBF fitting, Robustness, sound analysis, spherical array data, spherical microphone array},
	isbn = {1-4244-0469-X},
	doi = {10.1109/ICASSP.2006.1661208},
	author = {Yerukhimovich,A. and Duraiswami, Ramani and Gumerov, Nail A. and Zotkin,Dmitry N}
}
@article {17189,
	title = {Hierarchical Layouts for Photo Libraries},
	journal = {IEEE Multimedia},
	volume = {13},
	year = {2006},
	month = {2006/12//Oct},
	pages = {62 - 72},
	abstract = {We use an annotated digital photo collection to demonstrate a two-level auto-layout technique consisting of a central primary region with secondary regions surrounding it. Because the object sizes within regions can only be changed in discrete units, we refer to them as quantum content. Our real-time algorithms enable a compelling interactive display as users resize the canvas, or move and resize the primary region},
	keywords = {annotated digital photo collection, auto-layout technique, bi-level hierarchies, Computer science, data visualisation, digital libraries, document image processing, Information Visualization, interactive algorithms, interactive displays, Libraries, Lifting equipment, Organization Charts, photo collections, photo layouts, photo library, Photography, quantum content, Silver, Springs, User interfaces, Web pages},
	isbn = {1070-986X},
	doi = {10.1109/MMUL.2006.83},
	author = {Kustanowitz,J. and Shneiderman, Ben}
}
@conference {14187,
	title = {A Projective Invariant for Textures},
	booktitle = {2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition},
	volume = {2},
	year = {2006},
	month = {2006///},
	pages = {1932 - 1939},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Image texture analysis has received a lot of attention in the past years. Researchers have developed many texture signatures based on texture measurements, for the purpose of uniquely characterizing the texture. Existing texture signatures, in general, are not invariant to 3D transforms such as view-point changes and non-rigid deformations of the texture surface, which is a serious limitation for many applications. In this paper, we introduce a new texture signature, called the multifractal spectrum (MFS). It provides an efficient framework combining global spatial invariance and local robust measurements. The MFS is invariant under the bi-Lipschitz map, which includes view-point changes and non-rigid deformations of the texture surface, as well as local affine illumination changes. Experiments demonstrate that the MFS captures the essential structure of textures with quite low dimension.},
	keywords = {Computer science, Computer vision, Educational institutions, Fractals, Geometry, Image texture, Level set, lighting, Robustness, Surface texture},
	isbn = {0-7695-2597-0},
	doi = {10.1109/CVPR.2006.38},
	author = {Yong Xu and Hui Ji and Ferm{\"u}ller, Cornelia}
}
@article {17650,
	title = {Resilient multicast using overlays},
	journal = {IEEE/ACM Transactions on Networking},
	volume = {14},
	year = {2006},
	month = {2006/04//},
	pages = {237 - 248},
	abstract = {We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Through detailed analysis in this paper, we show that this loss recovery technique has efficient scaling properties-the overheads at each overlay node asymptotically decrease to zero with increasing group sizes. As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10 000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (>97\%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1\%-5\%) and high topology change rates (5 changes per second) while incurring very low overheads (<5\%).},
	keywords = {application-layer multicast protocols, Computer science, Data communication, Delay, Internet, Internet-like topologies, IP networks, loss recovery technique, Multicast, multicast data recovery scheme, Multicast protocols, Network topology, NETWORKS, overlays, Performance loss, probabilistic forwarding, probabilistic resilient multicast, Protocols, Resilience, Streaming media, telecommunication network topology, Terminology},
	isbn = {1063-6692},
	doi = {10.1109/TNET.2006.872579},
	author = {Banerjee,S. and Lee,Seungjoon and Bhattacharjee, Bobby and Srinivasan, Aravind}
}
@conference {12026,
	title = {A Sensory-Motor Language for Human Activity Understanding},
	booktitle = {2006 6th IEEE-RAS International Conference on Humanoid Robots},
	year = {2006},
	month = {2006/12/04/6},
	pages = {69 - 75},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We have empirically discovered that the space of human actions has a linguistic framework. This is a sensory-motor space consisting of the evolution of the joint angles of the human body in movement. The space of human activity has its own phonemes, morphemes, and sentences. We present a human activity language (HAL) for symbolic non-arbitrary representation of visual and motor information. In phonology, we define atomic segments (kinetemes) that are used to compose human activity. We introduce the concept of a kinetological system and propose five basic properties for such a system: compactness, view-invariance, reproducibility, selectivity, and reconstructivity. In morphology, we extend sequential language learning to incorporate associative learning with our parallel learning approach. Parallel learning is effective in identifying the kinetemes and active joints in a particular action. In syntax, we suggest four lexical categories for our human activity language (noun, verb, adjective, and adverb). These categories are combined into sentences through syntax for human movement},
	keywords = {Actuators, associative learning, atomic segments, computational linguistics, Computer science, Computer vision, Educational institutions, grammars, human activity language, human activity understanding, human movement syntax, Humanoid robots, HUMANS, joint angles, kinetemes, kinetological system, Laboratories, learning (artificial intelligence), List key index terms here, Morphology, motor information, No mare than 5, parallel learning, Reproducibility of results, Robot kinematics, Robot programming, robot vision, sensory-motor language, sequential language learning, symbolic nonarbitrary representation, visual information},
	isbn = {1-4244-0200-X},
	doi = {10.1109/ICHR.2006.321365},
	author = {Guerra-Filho,G. and Aloimonos, J.}
}
@inbook {18806,
	title = {A Step Towards Automated Design of Side Actions in Injection Molding of Complex Parts},
	booktitle = {Geometric Modeling and Processing - GMP 2006},
	series = {Lecture Notes in Computer Science},
	volume = {4077},
	year = {2006},
	month = {2006///},
	pages = {500 - 513},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Side actions contribute to mold cost by resulting in an additional manufacturing and assembly cost as well as by increasing the molding cycle time. Therefore, generating shapes of side actions requires solving a complex geometric optimization problem. Different objective functions may be needed depending upon different molding scenarios (e.g., prototyping versus large production runs). Manually designing side actions is a challenging task and requires considerable expertise. Automated design of side actions will significantly reduce mold design lead times. This paper describes algorithms for generating shapes of side actions to minimize a customizable molding cost function.},
	keywords = {Computer science},
	isbn = {978-3-540-36711-6},
	url = {http://www.springerlink.com/content/w7q3212607500635/abstract/},
	author = {Banerjee,Ashis and Gupta, Satyandra K.},
	editor = {Kim,Myung-Soo and Shimada,Kenji}
}
@book {12621,
	title = {Unconstrained face recognition},
	year = {2006},
	month = {2006///},
	publisher = {Springer Science \& Business},
	organization = {Springer Science \& Business},
	abstract = {Face recognition has been actively studied over the past decade and continues to be a big research challenge. Just recently, researchers have begun to investigate face recognition under unconstrained conditions. Unconstrained Face Recognition provides a comprehensive review of this biometric, especially face recognition from video, assembling a collection of novel approaches that are able to recognize human faces under various unconstrained situations. The underlying basis of these approaches is that, unlike conventional face recognition algorithms, they exploit the inherent characteristics of the unconstrained situation and thus improve the recognition performance when compared with conventional algorithms.Unconstrained Face Recognition is structured to meet the needs of a professional audience of researchers and practitioners in industry. This volume is also suitable for advanced-level students in computer science.},
	keywords = {Computer science, Computer vision, Computers / Computer Graphics, Computers / Computer Science, Computers / Computer Vision \& Pattern Recognition, Computers / General, Computers / Image Processing, Computers / Information Technology, Computers / Information Theory, Computers / Interactive \& Multimedia, Computers / Security / Cryptography, Computers / User Interfaces, Data encryption (Computer science), Data structures (Computer science), Electronic books, Human face recognition (Computer science), IMAGE PROCESSING, Image processing - Digital techniques, multimedia systems, Optical pattern recognition, Science / Life Sciences / Biology},
	isbn = {9780387264073},
	author = {Zhou,S. Kevin and Chellapa, Rama and Zhao,Wenyi}
}
@conference {16951,
	title = {A Visual Interface for Multivariate Temporal Data: Finding Patterns of Events across Multiple Histories},
	booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On},
	year = {2006},
	month = {2006/11/31/Oct. },
	pages = {167 - 174},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Finding patterns of events over time is important in searching patient histories, Web logs, news stories, and criminal activities. This paper presents PatternFinder, an integrated interface for query and result-set visualization for search and discovery of temporal patterns within multivariate and categorical data sets. We define temporal patterns as sequences of events with inter-event time spans. PatternFinder allows users to specify the attributes of events and time spans to produce powerful pattern queries that are difficult to express with other formalisms. We characterize the range of queries PatternFinder supports as users vary the specificity at which events and time spans are defined. Pattern Finder{\textquoteright}s query capabilities together with coupled ball-and-chain and tabular visualizations enable users to effectively query, explore and analyze event patterns both within and across data entities (e.g. patient histories, terrorist groups, Web logs, etc.)},
	keywords = {ball-and-chain visualization, Chromium, Computer science, Data analysis, data visualisation, Data visualization, Database languages, event pattern discovery, Graphical user interfaces, History, Information Visualization, Medical treatment, multivariate temporal data, Pattern analysis, pattern recognition, PatternFinder integrated interface, Query processing, query visualization, result-set visualization, Spatial databases, tabular visualization, temporal pattern discovery, temporal pattern searching, Temporal query, user interface, User interfaces, visual databases, visual interface},
	isbn = {1-4244-0591-2},
	doi = {10.1109/VAST.2006.261421},
	author = {Fails,J. A and Karlson,A. and Shahamat,L. and Shneiderman, Ben}
}
@article {15678,
	title = {Class-based access control for distributed video-on-demand systems},
	journal = {IEEE Transactions on Circuits and Systems for Video Technology},
	volume = {15},
	year = {2005},
	month = {2005/07//},
	pages = {844 - 853},
	abstract = {The focus of this paper is the analysis of threshold-based admission control policies for distributed video-on-demand (VoD) systems. Traditionally, admission control methods control access to a resource based on the resource capacity. We have extended that concept to include the significance of an arriving request to the VoD system by enforcing additional threshold restrictions in the admission control process on request classes deemed less significant. We present an analytical model for computing blocking performance of the VoD system under threshold-based admission control. Extending the same methodology to a distributed VoD architecture we show through simulation that the threshold performance conforms to the analytical model. We also show that threshold-based analysis can work in conjunction with other request handling policies and are useful for manipulating the VoD performance since we are able to distinguish between different request classes based on their merit. Enforcing threshold restrictions with the option of downgrading blocked requests in a multirate service environment results in improved performance at the same time providing different levels of quality of service (QoS). In fact, we show that the downgrade option combined with threshold restrictions is a powerful tool for manipulating an incoming request mix over which we have no control into a workload that the VoD system can handle.},
	keywords = {Access control, Admission control, Analytical models, blocking performance, class-based access control, Computational modeling, Computer architecture, Computer science, Distributed control, Distributed video-on-demand (VoD) system, distributed video-on-demand system, multimedia systems, multirate service model, Performance analysis, QoS, quality of service, request handling policy, resource allocation, resource capacity, telecommunication congestion control, threshold-based admission control, video on demand},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2005.848351},
	author = {Mundur, Padma and Sood,A. K and Simon,R.}
}
@conference {17887,
	title = {Comparing the Performance of High-Level Middleware Systems in Shared and Distributed Memory Parallel Environments},
	booktitle = {Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International},
	year = {2005},
	month = {2005/04//},
	pages = {30 - 30},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The utilization of toolkits for writing parallel and/or distributed applications has been shown to greatly enhance developer{\textquoteright}s productivity. Such an approach hides many of the complexities associated with writing these applications, rather than relying solely on programming language aids and parallel library support, such as MPI or PVM. In this work, we evaluate three different middleware systems that have been used to implement a computation and I/O-intensive data analysis application from the domain of computer vision. This study shows the benefits and overheads associated with each of the middleware systems, in different homogeneous computational environments and with different workloads. Our results lead the way toward being able to make better decisions for tuning the application environment, for selecting the appropriate middleware, and also for designing more powerful middleware systems to efficiently build and run highly complex applications in both parallel and distributed computing environments.},
	keywords = {Application software, Computer science, Computer vision, Data analysis, Distributed computing, distributed computing environment, distributed memory parallel environment, distributed shared memory systems, Educational institutions, high-level middleware system, I/O-intensive data analysis application, Libraries, Middleware, parallel computing environment, parallel library support, parallel memories, programming language, programming languages, Runtime environment, shared memory parallel environment, Writing},
	isbn = {0-7695-2312-9},
	doi = {10.1109/IPDPS.2005.144},
	author = {Kim,Jik-Soo and Andrade,H. and Sussman, Alan}
}
@conference {17875,
	title = {High Performance Communication between Parallel Programs},
	booktitle = {Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International},
	year = {2005},
	month = {2005/04//},
	pages = {177b- 177b - 177b- 177b},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present algorithms for high performance communication between message-passing parallel programs, and evaluate the algorithms as implemented in InterComm. InterComm is a framework to couple parallel programs in the presence of complex data distributions within a coupled application. Multiple parallel libraries and languages may be used in the different programs of a single coupled application. The ability to couple such programs is required in many emerging application areas, such as complex simulations that model physical phenomena at multiple scales and resolutions, and image data analysis applications. We describe the new algorithms we have developed for computing inter-program communication patterns. We present experimental results showing the performance of various algorithmic tradeoffs, and also compare performance against an earlier system.},
	keywords = {Adaptive arrays, Analytical models, Chaotic communication, Computational modeling, Computer science, Data analysis, data distribution, Educational institutions, high performance communication, image data analysis, image resolution, inter-program communication patterns, InterComm, Libraries, Message passing, parallel languages, parallel libraries, parallel programming, parallel programs, performance evaluation, Wind},
	isbn = {0-7695-2312-9},
	doi = {10.1109/IPDPS.2005.243},
	author = {Jae-Yong Lee and Sussman, Alan}
}
@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 {11975,
	title = {Robust Contrast Invariant Stereo Correspondence},
	booktitle = {Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005. ICRA 2005},
	year = {2005},
	month = {2005/04/18/22},
	pages = {819 - 824},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A stereo pair of cameras attached to a robot will inevitably yield images with different contrast. Even if we assume that the camera hardware is identical, due to slightly different points of view, the amount of light entering the two cameras is also different, causing dynamically adjusted internal parameters such as aperture, exposure and gain to be different. Due to the difficulty of obtaining and maintaining precise intensity or color calibration between the two cameras, contrast invariance becomes an extremely desirable property of stereo correspondence algorithms. The problem of achieving point correspondence between a stereo pair of images is often addressed by using the intensity or color differences as a local matching metric, which is sensitive to contrast changes. We present an algorithm for contrast invariant stereo matching which relies on multiple spatial frequency channels for local matching. A fast global framework uses the local matching to compute the correspondences and find the occlusions. We demonstrate that the use of multiple frequency channels allows the algorithm to yield good results even in the presence of significant amounts of noise.},
	keywords = {Apertures, Calibration, CAMERAS, Computer science, contrast invariance, diffusion, Educational institutions, Frequency, gabor, Hardware, occlusions, Robot vision systems, Robotics and automation, Robustness, stereo},
	isbn = {0-7803-8914-X},
	doi = {10.1109/ROBOT.2005.1570218},
	author = {Ogale, A. S and Aloimonos, J.}
}
@conference {17888,
	title = {Spatial indexing of distributed multidimensional datasets},
	booktitle = {IEEE International Symposium on Cluster Computing and the Grid, 2005. CCGrid 2005},
	volume = {2},
	year = {2005},
	month = {2005/05/09/12},
	pages = {743- 750 Vol. 2 - 743- 750 Vol. 2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {While declustering methods for distributed multidimensional indexing of large datasets have been researched widely in the past, replication techniques for multidimensional indexes have not been investigated deeply. In general, a centralized index server may become the performance bottleneck in a wide area network rather than the data servers, since the index is likely to be accessed more often than any of the datasets in the servers. In this paper, we present two different multidimensional indexing algorithms for a distributed environment - a centralized global index and a two-level hierarchical index. Our experimental results show that the centralized scheme does not scale well for either insertion or searching the index. In order to improve the scalability of the index server, we have employed a replication protocol for both the centralized and two-level index schemes that allows some inconsistency between replicas without affecting correctness. Our experiments show that the two-level hierarchical index scheme shows better scalability for both building and searching the index than the non-replicated centralized index, but replication can make the centralized index faster than the two-level hierarchical index for searching in some cases.},
	keywords = {centralized global index algorithm, centralized index server, Computer science, database indexing, distributed databases, distributed multidimensional dataset, Educational institutions, File servers, Indexing, Large-scale systems, Multidimensional systems, Network servers, replication protocol, replication techniques, scalability, Sensor systems, spatial data structures, spatial indexing, two-level hierarchical index algorithm, wide area networks},
	isbn = {0-7803-9074-1},
	doi = {10.1109/CCGRID.2005.1558637},
	author = {Nam,B. and Sussman, Alan}
}
@conference {17444,
	title = {Turning information visualization innovations into commercial products: lessons to guide the next success},
	booktitle = {IEEE Symposium on Information Visualization, 2005. INFOVIS 2005},
	year = {2005},
	month = {2005/10/23/25},
	pages = {241 - 244},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {As information visualization matures as an academic research field, commercial spinoffs are proliferating, but success stories are harder to find. This is the normal process of emergence for new technologies, but the panel organizers believe that there are certain strategies that facilitate success. To teach these lessons, we have invited several key figures who are seeking to commercialize information visualization tools. The panelists make short presentations, engage in a moderated discussion, and respond to audience questions.},
	keywords = {Books, commercial development, commercial product, Computer interfaces, Computer science, data visualisation, Data visualization, Educational institutions, exploratory data analysis, information visualization innovation, information visualization tool, innovation management, Laboratories, Management training, new technology emergence, Technological innovation, technology transfer, Turning, User interfaces},
	isbn = {0-7803-9464-X},
	doi = {10.1109/INFVIS.2005.1532153},
	author = {Shneiderman, Ben and Rao,R. and Andrews,K. and Ahlberg,C. and Brodbeck,D. and Jewitt,T. and Mackinlay,J.}
}
@inbook {18924,
	title = {Web Service Composition with Volatile Information},
	booktitle = {The Semantic Web {\textendash} ISWC 2005},
	series = {Lecture Notes in Computer Science},
	volume = {3729},
	year = {2005},
	month = {2005///},
	pages = {52 - 66},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In many Web service composition problems, information may be needed from Web services during the composition process. Existing research on Web service composition (WSC) procedures has generally assumed that this information will not change. We describe two ways to take such WSC procedures and systematically modify them to deal with volatile information. The black-box approach requires no knowledge of the WSC procedure{\textquoteright}s internals: it places a wrapper around the WSC procedure to deal with volatile information. The gray-box approach requires partial information of those internals, in order to insert coding to perform certain bookkeeping operations. We show theoretically that both approaches work correctly. We present experimental results showing that the WSC procedures produced by the gray-box approach can run much faster than the ones produced by the black-box approach.},
	keywords = {Computer science},
	isbn = {978-3-540-29754-3},
	url = {http://www.springerlink.com/content/y105x8464k54l760/abstract/},
	author = {Au,Tsz-Chiu and Kuter,Ugur and Nau, Dana S.},
	editor = {Gil,Yolanda and Motta,Enrico and Benjamins,V. and Musen,Mark}
}
@conference {12086,
	title = {Achieving packet-level quality of service through scheduling in multirate WLANs},
	booktitle = {Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th},
	volume = {4},
	year = {2004},
	month = {2004/09/26/29},
	pages = {2730- 2734 Vol. 4 - 2730- 2734 Vol. 4},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Wireless packet scheduling has been a popular paradigm to achieve packet-level QoS in terms of fairness and throughput in the presence of channel errors. However, the current design does not anticipate the multi-rate capability offered by the IEEE 802.11a/b/g physical layer, thus suffering significant performance degradation in 802.11 WLANs. In this paper, we propose multirate wireless fair scheduling (WMFS). In MWFS, each flow is granted a temporal fair share of the channel, in contrast to the throughput fair share adopted by existing algorithms. Therefore, each flow receives services in proportion to its perceived transmission rate, and high-rate flows are able to opportunistically exploit their good channel conditions and receive more services. MWFS also renovates the compensation model in order to allow for error-prone flows to catch up, thus ensuring fairness for all flows over error-prone channels. We demonstrate the effectiveness of MWFS through both simulations and analysis. Especially, WMFS achieves system throughput 159\% of state-of-the-art scheduling algorithms in simulated scenarios.},
	keywords = {Analytical models, channel conditions, channel errors, channel temporal fair share, compensation, Computer science, Delay, error-prone flow compensation, IEEE 802.11a/b/g physical layer, multirate wireless fair scheduling, multirate WLAN, packet radio networks, packet-level quality of service, Physical layer, Processor scheduling, QoS, quality of service, radio access networks, Scheduling algorithm, Throughput, throughput fairness, USA Councils, Wireless LAN, wireless packet scheduling, WMFS},
	isbn = {0-7803-8521-7},
	doi = {10.1109/VETECF.2004.1400554},
	author = {Yuan Yuan and Daqing Gu and Arbaugh, William A. and Jinyun Zhang}
}
@conference {14811,
	title = {Automated cluster-based Web service performance tuning},
	booktitle = {13th IEEE International Symposium on High performance Distributed Computing, 2004. Proceedings},
	year = {2004},
	month = {2004/06/04/6},
	pages = {36 - 44},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Active harmony provides a way to automate performance tuning. We apply the Active Harmony system to improve the performance of a cluster-based web service system. The performance improvement cannot easily be achieved by tuning individual components for such a system. The experimental results show that there is no single configuration for the system that performs well for all kinds of workloads. By tuning the parameters, Active Harmony helps the system adapt to different workloads and improve the performance up to 16\%. For scalability, we demonstrate how to reduce the time when tuning a large system with many tunable parameters. Finally an algorithm is proposed to automatically adjust the structure of cluster-based web systems, and the system throughput is improved up to 70\% using this technique.},
	keywords = {Active Harmony system, automated performance tuning, business, cluster-based Web service system, Clustering algorithms, Computer science, Educational institutions, electronic commerce, Internet, Middleware, performance evaluation, scalability, Throughput, Transaction databases, Web server, Web services, workstation clusters},
	isbn = {0-7695-2175-4},
	doi = {10.1109/HPDC.2004.1323484},
	author = {Chung,I. -H and Hollingsworth, Jeffrey K}
}
@conference {15690,
	title = {Automatic video summarization for wireless and mobile environments},
	booktitle = {2004 IEEE International Conference on Communications},
	volume = {3},
	year = {2004},
	month = {2004/06/20/24},
	pages = {1532- 1536 Vol.3 - 1532- 1536 Vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we propose a novel video summarization technique using which we can automatically generate high quality video summaries suitable for wireless and mobile environments. The significant contribution of this paper lies in the proposed clustering scheme. We use Delaunay diagrams to cluster multidimensional point data corresponding to the frame contents of the video. In contrast to the existing clustering techniques used for summarization, our clustering algorithm is fully automatic and well suited for batch processing. We illustrate the quality of our clustering and summarization scheme in an experiment using several video clips.},
	keywords = {automatic video summarization, batch processing, batch processing (computers), Clustering algorithms, Clustering methods, clustering scheme, Computer science, Delaunay diagram, graph theory, Gunshot detection systems, Image sequences, mesh generation, Mobile computing, mobile radio, multidimensional point data cluster, Multidimensional systems, Multimedia communication, video clip, video frame content, Video sequences, video signal processing, wireless mobile environment},
	isbn = {0-7803-8533-0},
	doi = {10.1109/ICC.2004.1312767},
	author = {Yong Rao and Mundur, Padma and Yesha,Y.}
}
@article {15679,
	title = {End-to-end analysis of distributed video-on-demand systems},
	journal = {IEEE Transactions on Multimedia},
	volume = {6},
	year = {2004},
	month = {2004/02//},
	pages = {129 - 141},
	abstract = {The focus of the research presented in this paper is the end-to-end analysis of a distributed Video-on-Demand (VoD) system. We analyze the distributed architecture of a VoD system to design global request handling and admission control strategies and evaluate them using global metrics. The performance evaluation methodology developed in this paper helps in determining efficient ways of using all resources in the VoD architecture within the constraints of providing guaranteed high quality service to each request. For instance, our simulation results show that request handling policies based on limited redirection of blocked requests to other resources perform better than load sharing policies. We also show that request handling policies based on redirection have simpler connection establishment semantics than load sharing policies and, therefore, are easily incorporated into reservation or signaling protocols.},
	keywords = {Admission control, admission control strategies, Analytical models, Computer science, distributed architecture, distributed video-on-demand systems, end-to-end analysis, global request handling, High-speed networks, Network servers, Next generation networking, Performance analysis, performance evaluation methodology, Protocols, request handling, reservation protocols, resource allocation, Resource management, signaling protocols, telecommunication congestion control, video on demand, Video sharing},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2003.819757},
	author = {Mundur, Padma and Simon,R. and Sood,A. K}
}
@conference {17155,
	title = {Extending the utility of treemaps with flexible hierarchy},
	booktitle = {Eighth International Conference on Information Visualisation, 2004. IV 2004. Proceedings},
	year = {2004},
	month = {2004/07/14/16},
	pages = {335 - 344},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Treemaps are a visualization technique for presenting hierarchical information on two-dimensional displays. Prior implementations limit the visualization to pre-defined static hierarchies. Flexible hierarchy, a new capability of Treemap 4.0, enables users to define various hierarchies through dynamically selecting a series of data attributes so that they can discover patterns, clusters and outliers. This work describes the design and implementation issues of flexible hierarchy. It then reports on a usability study, which led to enhancements to the interface.},
	keywords = {2D displays, Computer displays, Computer science, data visualisation, Data visualization, Educational institutions, flexible hierarchy, graphical user interface, Graphical user interfaces, hierarchical information, Nominations and elections, Switches, Tree data structures, Tree graphs, Treemap 4.0, Two dimensional displays, usability, visualization technique},
	isbn = {0-7695-2177-0},
	doi = {10.1109/IV.2004.1320166},
	author = {Chintalapani,G. and Plaisant, Catherine and Shneiderman, Ben}
}
@conference {17159,
	title = {Facilitating understanding of information visualizations: emerging principles and examples},
	booktitle = {Eighth International Conference on Information Visualisation, 2004. IV 2004. Proceedings},
	year = {2004},
	month = {2004/07/14/16},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Summary form only given. The enthusiasm for information visualization has generated a wide variety of interesting tools for multi-dimensional, hierarchical, and other kinds of visualizations. However, some designs are readily accepted as understandable and useful, while others are perceived as confusing and useless. Controlled studies have begun to sort of some of the issues, but the insights of designers and usability tests are contributing interesting cognitive hypotheses for researchers and practical guidelines for developers. This paper offers examples of what works and what doesn{\textquoteright}t with a preliminary set of principles that might have wide applicability.},
	keywords = {Computer science, data visualisation, Educational institutions, Guidelines, hierarchical visualization, HUMANS, Information Visualization, Laboratories, multidimensional visualization, Portable computers, Testing, usability, User interfaces, Visualization},
	isbn = {0-7695-2177-0},
	doi = {10.1109/IV.2004.1320117},
	author = {Shneiderman, Ben}
}
@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}
}
@inbook {18909,
	title = {Information Gathering During Planning for Web Service Composition},
	booktitle = {The Semantic Web {\textendash} ISWC 2004},
	series = {Lecture Notes in Computer Science},
	volume = {3298},
	year = {2004},
	month = {2004///},
	pages = {335 - 349},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL - S service ontologies. Many of the existing Web Services are either exclusively information providing or crucially depend on information-providing services. Thus, many interesting service compositions involve collecting information either during execution or during the composition process itself. In this paper, we focus on the latter issue. In particular, we present ENQUIRER , an HTN-planning algorithm designed for planning domains in which the information about the initial state of the world may not be complete, but it is discoverable through plan-time information-gathering queries. We have shown that ENQUIRER is sound and complete, and derived several mathematical relationships among the amount of available information, the likelihood of the planner finding a plan, and the quality of the plan found. We have performed experimental tests that confirmed our theoretical results and that demonstrated how ENQUIRER can be used in Web Service composition.},
	keywords = {Computer science},
	isbn = {978-3-540-23798-3},
	url = {http://www.springerlink.com/content/v829m5080fc0bpng/abstract/},
	author = {Kuter,Ugur and Sirin,Evren and Nau, Dana S. and Parsia,Bijan and Hendler,James},
	editor = {McIlraith,Sheila and Plexousakis,Dimitris and van Harmelen,Frank}
}
@inbook {18915,
	title = {Plan Databases: Model and Algebra},
	booktitle = {Foundations of Information and Knowledge Systems},
	series = {Lecture Notes in Computer Science},
	volume = {2942},
	year = {2004},
	month = {2004///},
	pages = {302 - 319},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Despite the fact that thousands of applications manipulate plans, there has been no work to date on managing large databases of plans. In this paper, we first propose a formal model of plan databases. We describe important notions of consistency and coherence for such databases. We then propose a set of operators similar to the relational algebra to query such databases of plans.},
	keywords = {Computer science},
	isbn = {978-3-540-20965-2},
	url = {http://www.springerlink.com/content/yqhlqtu4te18q2e1/abstract/},
	author = {Yaman,Fusun and Adali,Sibel and Nau, Dana S. and Sapino,Maria and Subrahmanian,V.},
	editor = {Seipel,Dietmar and Turull-Torres,Jos{\'e}}
}
@conference {16944,
	title = {A Rank-by-Feature Framework for Unsupervised Multidimensional Data Exploration Using Low Dimensional Projections},
	booktitle = {IEEE Symposium on Information Visualization, 2004. INFOVIS 2004},
	year = {2004},
	month = {2004///},
	pages = {65 - 72},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Exploratory analysis of multidimensional data sets is challenging because of the difficulty in comprehending more than three dimensions. Two fundamental statistical principles for the exploratory analysis are (1) to examine each dimension first and then find relationships among dimensions, and (2) to try graphical displays first and then find numerical summaries (D.S. Moore, (1999). We implement these principles in a novel conceptual framework called the rank-by-feature framework. In the framework, users can choose a ranking criterion interesting to them and sort 1D or 2D axis-parallel projections according to the criterion. We introduce the rank-by-feature prism that is a color-coded lower-triangular matrix that guides users to desired features. Statistical graphs (histogram, boxplot, and scatterplot) and information visualization techniques (overview, coordination, and dynamic query) are combined to help users effectively traverse 1D and 2D axis-parallel projections, and finally to help them interactively find interesting features},
	keywords = {axis-parallel projections, boxplot, color-coded lower-triangular matrix, computational complexity, computational geometry, Computer displays, Computer science, Computer vision, Data analysis, data mining, data visualisation, Data visualization, Displays, dynamic query, Educational institutions, exploratory data analysis, feature detection, feature detection/selection, Feature extraction, feature selection, graph theory, graphical displays, histogram, Information Visualization, interactive systems, Laboratories, Multidimensional systems, Principal component analysis, rank-by-feature prism, scatterplot, statistical analysis, statistical graphics, statistical graphs, unsupervised multidimensional data exploration, very large databases},
	isbn = {0-7803-8779-3},
	doi = {10.1109/INFVIS.2004.3},
	author = {Seo,J. and Shneiderman, Ben}
}
@conference {14817,
	title = {Unobtrusiveness and efficiency in idle cycle stealing for PC grids},
	booktitle = {Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International},
	year = {2004},
	month = {2004/04/26/30},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Summary form only given. Studies have shown that for a significant fraction of the time desktop PCs and workstations are under-utilized. To exploit these idle resources, various desktop/workstation grid systems have been developed. The ultimate goal of such systems is to maximize efficiency of resource usage while maintaining low obtrusiveness to machine owners. To this end, we created a new fine-grain cycle stealing approach and conducted a performance comparison study against the traditional coarse-grain cycle stealing. We developed a prototype of fine-grain cycle stealing, the Linger-Longer system, on a Linux cluster. The experiments on a cluster of desktop Linux PCs with benchmark applications show that, overall, fine-grain cycle stealing can improve efficiency of idle cycle usage by increasing the guest job throughput by 50\% to 70\%, while limiting obtrusiveness with no more than 3\% of host job slowdown.},
	keywords = {Biological system modeling, Computational modeling, Computer science, Computer simulation, Contracts, desktop grid system, fine-grain cycle stealing approach, grid computing, idle cycle stealing, Linger-Longer system, Linux, Linux cluster, microcomputers, PC grids, Personal communication networks, Prototypes, resource allocation, Throughput, workstation clusters, workstation grid systems, Workstations},
	isbn = {0-7695-2132-0},
	doi = {10.1109/IPDPS.2004.1302987},
	author = {Ryu, K. D and Hollingsworth, Jeffrey K}
}
@inbook {18896,
	title = {Automating DAML-S Web Services Composition Using SHOP2},
	booktitle = {The Semantic Web - ISWC 2003},
	series = {Lecture Notes in Computer Science},
	volume = {2870},
	year = {2003},
	month = {2003///},
	pages = {195 - 210},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The DAML-S Process Model is designed to support the application of AI planning techniques to the automated composition of Web services. SHOP2 is an Hierarchical Task Network (HTN) planner well-suited for working with the Process Model. We have proven the correspondence between the semantics of SHOP2 and the situation calculus semantics of the Process Model. We have also implemented a system which soundly and completely plans over sets of DAML-S descriptions using a SHOP2 planner, and then executes the resulting plans over the Web. We discuss the challenges and difficulties of using SHOP2 in the information-rich and human-oriented context of Web services.},
	keywords = {Computer science},
	isbn = {978-3-540-20362-9},
	url = {http://www.springerlink.com/content/rm5ejwlmbw0mdv97/abstract/},
	author = {Wu,Dan and Parsia,Bijan and Sirin,Evren and Hendler,James and Nau, Dana S.},
	editor = {Fensel,Dieter and Sycara,Katia and Mylopoulos,John}
}
@conference {15840,
	title = {The effect of bilingual term list size on dictionary-based cross-language information retrieval},
	booktitle = {Proceedings of the 36th Annual Hawaii International Conference on System Sciences, 2003},
	year = {2003},
	month = {2003/01/06/9},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Bilingual term lists are extensively used as a resource for dictionary-based cross-language information retrieval (CLIR), in which the goal is to find documents written in one natural language based on queries that are expressed in another. This paper identifies eight types of terms that affect retrieval effectiveness in CLIR applications through their coverage by general-purpose bilingual term lists, and reports results from an experimental evaluation of the coverage of 35 bilingual term lists in news retrieval application. Retrieval effectiveness was found to be strongly influenced by term list size for lists that contain between 3,000 and 30,000 unique terms per language. Supplemental techniques for named entity translation were found to be useful with even the largest lexicons. The contribution of named-entity translation was evaluated in a cross-language experiment involving English and Chinese. Smaller effects were observed from deficiencies in the coverage of domain-specific terminology when searching news stories.},
	keywords = {bilingual term list, Chinese language, Computer science, Control systems, Cross-language information retrieval, data mining, Dictionaries, dictionary-based information retrieval, Educational institutions, English language, Frequency, Information retrieval, language translation, named-entity translation, natural languages, Surface morphology, Terminology},
	isbn = {0-7695-1874-5},
	doi = {10.1109/HICSS.2003.1174250},
	author = {Demner-Fushman,D. and Oard, Douglas}
}
@article {18907,
	title = {IMPACTing SHOP: Putting an AI Planner Into a Multi-Agent Environment},
	journal = {Annals of Mathematics and Artificial Intelligence},
	volume = {37},
	year = {2003},
	month = {2003///},
	pages = {381 - 407},
	abstract = {In this paper we describe a formalism for integrating the SHOP HTN planning system with the IMPACT multi-agent environment. We define the A-SHOP algorithm, an agentized adaptation of the SHOP planning algorithm that takes advantage of IMPACT{\textquoteright}s capabilities for interacting with external agents, performing mixed symbolic/numeric computations, and making queries to distributed, heterogeneous information sources (such as arbitrary legacy and/or specialized data structures or external databases). We show that A-SHOP is both sound and complete if certain conditions are met.},
	keywords = {Computer science},
	isbn = {1012-2443},
	doi = {10.1023/A:1021560510377},
	url = {http://www.springerlink.com/content/g4r0mn835846p65w/abstract/},
	author = {Dix,J{\"u}rgen and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S. and Zhang,Lingling}
}
@conference {17878,
	title = {Improving access to multi-dimensional self-describing scientific datasets},
	booktitle = {3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. CCGrid 2003},
	year = {2003},
	month = {2003/05/12/15},
	pages = {172 - 179},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Applications that query into very large multidimensional datasets are becoming more common. Many self-describing scientific data file formats have also emerged, which have structural metadata to help navigate the multi-dimensional arrays that are stored in the files. The files may also contain application-specific semantic metadata. In this paper, we discuss efficient methods for performing searches for subsets of multi-dimensional data objects, using semantic information to build multidimensional indexes, and group data items into properly sized chunks to maximize disk I/O bandwidth. This work is the first step in the design and implementation of a generic indexing library that will work with various high-dimension scientific data file formats containing semantic information about the stored data. To validate the approach, we have implemented indexing structures for NASA remote sensing data stored in the HDF format with a specific schema (HDF-EOS), and show the performance improvements that are gained from indexing the datasets, compared to using the existing HDF library for accessing the data.},
	keywords = {Application software, application-specific semantic metadata, Bandwidth, Computer science, database indexing, disk I/O bandwidth, distributed databases, Educational institutions, Indexing, indexing structures, Libraries, meta data, Middleware, multidimensional arrays, multidimensional datasets, Multidimensional systems, NASA, NASA remote sensing data, Navigation, query formulation, self-describing scientific data file formats, structural metadata, very large databases},
	isbn = {0-7695-1919-9},
	doi = {10.1109/CCGRID.2003.1199366},
	author = {Nam,B. and Sussman, Alan}
}
@inbook {18918,
	title = {Planning in Answer Set Programming Using Ordered Task Decomposition},
	booktitle = {KI 2003: Advances in Artificial Intelligence},
	series = {Lecture Notes in Computer Science},
	volume = {2821},
	year = {2003},
	month = {2003///},
	pages = {490 - 504},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In this paper we introduce a formalism for solving Hierarchical Task Network ( HTN ) Planning using Answer Set Programming ( ASP ). We consider the formulation of HTN planning as described in the SHOP planning system and define a systematic translation method from SHOP {\textquoteright}s representation of the planning problem into logic programs with negation. We show that our translation is sound and complete : answer sets of the logic program obtained by our translation correspond exactly to the solutions of the planning problem. We compare our method to (1) similar approaches based on non- HTN planning and (2) SHOP , a dedicated planning system. We show that our approach outperforms non- HTN methods and that its performance is better with ASP systems that allow for nonground programs than with ASP systems that require ground programs.},
	keywords = {Computer science},
	isbn = {978-3-540-20059-8},
	url = {http://www.springerlink.com/content/ekt1kye92lh12lpj/abstract/},
	author = {Dix,J{\"u}rgen and Kuter,Ugur and Nau, Dana S.},
	editor = {G{\"u}nter,Andreas and Kruse,Rudolf and Neumann,Bernd}
}
@conference {12078,
	title = {A secure service discovery protocol for MANET},
	booktitle = {14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003},
	volume = {1},
	year = {2003},
	month = {2003/09/07/10},
	pages = {502- 506 Vol.1 - 502- 506 Vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Service discovery technologies are exploited to enable services to advertise their existence in a dynamic way, and can be discovered, configured and used by other devices with minimum manual efforts. It plays an essential role in future network scenarios especially with development of mobile ad hoc network (MANET) and emergence of pervasive computing. Because MANET allows these devices to communicate dynamically without fixed infrastructure and centralized administration, it gives rise to the challenges of the service discovery techniques. In this paper, we present a dynamic service discovery infrastructure that uses XML to describe services and match using the semantic content of service descriptions for MANET. We believe that the architecture we have designed is a necessary component of service discovery in non-infrastructure network by further exploring the secure and performance issues of this infrastructure.},
	keywords = {ad hoc networks, centralized administration, Computer architecture, Computer science, dynamic service discovery infrastructure, Educational institutions, MANET, Manuals, mobile ad hoc network, Mobile ad hoc networks, Mobile computing, mobile radio, noninfrastructure network, Pervasive computing, Protocols, routing protocols, secure service discovery protocol, Security, service discovery techniques, service discovery technologies, telecommunication computing, telecommunication services, XML},
	isbn = {0-7803-7822-9},
	doi = {10.1109/PIMRC.2003.1264322},
	author = {Yuan Yuan and Arbaugh, William A.}
}
@inbook {18603,
	title = {Thwarting Web Censorship with Untrusted Messenger Discovery},
	booktitle = {Privacy Enhancing TechnologiesPrivacy Enhancing Technologies},
	series = {Lecture Notes in Computer Science},
	volume = {2760},
	year = {2003},
	month = {2003///},
	pages = {125 - 140},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {All existing anti-censorship systems for the Web rely on proxies to grant clients access to censored information. Therefore, they face the proxy discovery problem : how can clients discover the proxies without having the censor discover and block these proxies? To avoid widespread discovery and blocking, proxies must not be widely published and should be discovered in-band. In this paper, we present a proxy discovery mechanism called keyspace hopping that meets this goal. Similar in spirit to frequency hopping in wireless networks, keyspace hopping ensures that each client discovers only a small fraction of the total number of proxies. However, requiring clients to independently discover proxies from a large set makes it practically impossible to verify the trustworthiness of every proxy and creates the possibility of having untrusted proxies. To address this, we propose separating the proxy into two distinct components{\textemdash}the messenger , which the client discovers using keyspace hopping and which simply acts as a gateway to the Internet; and the portal , whose identity is widely-published and whose responsibility it is to interpret and serve the client{\textquoteright}s requests for censored content. We show how this separation, as well as in-band proxy discovery, can be applied to a variety of anti-censorship systems.},
	keywords = {Computer science},
	isbn = {978-3-540-20610-1},
	url = {http://www.springerlink.com/content/1gg8p94deqek968t/abstract/},
	author = {Feamster, Nick and Balazinska,Magdalena and Wang,Winston and Balakrishnan,Hari and Karger,David},
	editor = {Dingledine,Roger}
}
@conference {14753,
	title = {User-specified adaptive scheduling in a streaming media network},
	booktitle = {2003 IEEE Conference on Open Architectures and Network Programming},
	year = {2003},
	month = {2003/04/04/5},
	pages = {87 - 96},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In disaster and combat situations, mobile cameras and other sensors transmit real-time data, used by many operators or analysis tools. Unfortunately, in the face of limited, unreliable resources, and varying demands, not all users may be able to get the fidelity they require. This paper describes MediaNet, a distributed stream processing system designed with the above scenarios in mind. Unlike past approaches, MediaNet{\textquoteright}s users can intuitively specify how the system should adapt based on their individual needs. MediaNet uses both local and online global resource scheduling to improve user performance and network utilization, and adapts without requiring underlying support for resource reservations. Performance experiments show that our scheduling algorithm is reasonably fast, and that user performance and network utilization are both significantly improved.},
	keywords = {Adaptive scheduling, CAMERAS, Computer networks, Computer science, distributed stream processing system, Educational institutions, global resource scheduling, Intelligent networks, MediaNet, Mobile computing, network utilization, Process design, Processor scheduling, quality of service, Streaming media, streaming media network, user performance, user-specified adaptive scheduling},
	isbn = {0-7803-7764-8},
	doi = {10.1109/OPNARC.2003.1196376},
	author = {Hicks, Michael W. and Nagarajan,A. and van Renesse,R.}
}
@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}
}
@inbook {18914,
	title = {On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework},
	booktitle = {Advances in Case-Based Reasoning},
	series = {Lecture Notes in Computer Science},
	volume = {2416},
	year = {2002},
	month = {2002///},
	pages = {199 - 206},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In this paper we present an algorithm called DerUCP, which can be regarded as a general model for plan adaptation using Derivational Analogy. Using DerUCP, we show that previous results on the complexity of plan adaptation do not apply to Derivational Analogy. We also show that Derivational Analogy can potentially produce exponential reductions in the size of the search space generated by a planning system.},
	keywords = {Computer science},
	isbn = {978-3-540-44109-0},
	url = {http://www.springerlink.com/content/db2mr13j90mfrcaw/abstract/},
	author = {Au,Tsz-Chiu and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S.},
	editor = {Craw,Susan and Preece,Alun}
}
@conference {13363,
	title = {Decoupled query optimization for federated database systems},
	booktitle = {18th International Conference on Data Engineering, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {716 - 727},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We study the problem of query optimization in federated relational database systems. The nature of federated databases explicitly decouples many aspects of the optimization process, often making it imperative for the optimizer to consult underlying data sources while doing cost-based optimization. This not only increases the cost of optimization, but also changes the trade-offs involved in the optimization process significantly. The dominant cost in the decoupled optimization process is the "cost of costing" that traditionally has been considered insignificant. The optimizer can only afford a few rounds of messages to the underlying data sources and hence the optimization techniques in this environment must be geared toward gathering all the required cost information with minimal communication. In this paper, we explore the design space for a query optimizer in this environment and demonstrate the need for decoupling various aspects of the optimization process. We present minimum-communication decoupled variants of various query optimization techniques, and discuss tradeoffs in their performance in this scenario. We have implemented these techniques in the Cohera federated database system and our experimental results, somewhat surprisingly, indicate that a simple two-phase optimization scheme performs fairly well as long as the physical database design is known to the optimizer, though more aggressive algorithms are required otherwise},
	keywords = {Algorithm design and analysis, Cohera federated database, Computer science, Corporate acquisitions, Cost function, Database systems, decoupled optimization, Design optimization, distributed databases, federated databases, federated relational database systems, Internet, Query optimization, query optimizer, Query processing, Relational databases, Space exploration},
	isbn = {0-7695-1531-2},
	doi = {10.1109/ICDE.2002.994788},
	author = {Deshpande, Amol and Hellerstein,J. M}
}
@conference {17583,
	title = {Dependent rounding in bipartite graphs},
	booktitle = {The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {323 - 332},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We combine the pipage rounding technique of Ageev \& Sviridenko with a recent rounding method developed by Srinivasan (2001), to develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to the following applications: richer random-graph models for graphs with a given degree-sequence; improved approximation algorithms for: (i) throughput-maximization in broadcast scheduling, (ii) delay-minimization in broadcast scheduling, and (iii) capacitated vertex cover; fair scheduling of jobs on unrelated parallel machines. A useful feature of our method is that it lets us prove certain (probabilistic) per-user fairness properties.},
	keywords = {Application software, Approximation algorithms, bipartite graph, bipartite graphs, broadcast channels, broadcast scheduling, Broadcasting, capacitated vertex cover, Character generation, computational complexity, Computer science, Delay, edge-sets, Educational institutions, fair scheduling, fractional vectors, graph theory, per-user fairness properties, pipage rounding technique, Processor scheduling, Random variables, random-graph models, randomized rounding approach, rounding method, scheduling, Scheduling algorithm, telecommunication computing, unrelated parallel machines},
	isbn = {0-7695-1822-2},
	doi = {10.1109/SFCS.2002.1181955},
	author = {Gandhi,R. and Khuller, Samir and Parthasarathy,S. and Srinivasan, Aravind}
}
@conference {14695,
	title = {Experiences with capsule-based active networking},
	booktitle = {DARPA Active NEtworks Conference and Exposition, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {16 - 24},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Active networking adds programmability to the elements of the network, most aggressively by using programmable packets, or capsules. ANTS [22, 21] and PLANet [10, 8] are the most mature examples of capsule-based systems, both having been publicly available for several years. This paper presents our experience with these systems and the lessons they hold for the future of capsule-based active networking. The paper focuses on four key issues: flexibility, performance, security, and usability. We consider how ANTS and PLANet address these issues, noting that despite substantial surface differences, both systems identify similar key problems and use closely related solutions. Based on our experience with these systems we conclude that capsule-based systems can achieve useful levels of flexibility, performance, and usability. Many aspects of security can also be adequately addressed, but some important problems related to denial of service remain as open problems},
	keywords = {active networking, ANTS, application-specific routing, capsule architecture, capsule-based systems, computer crime, Computer network management, Computer networks, Computer science, Contracts, Electronic switching systems, INFORMATION SCIENCE, Internet, internetworking, network management, PLANet, Planets, programmability, programmable packets, Programming, Security, Standards development, telecommunication network routing, usability},
	isbn = {0-7695-1564-9},
	doi = {10.1109/DANCE.2002.1003481},
	author = {Hicks, Michael W. and Moore,J. T and Wetherall,D. and Nettles,S.}
}
@inbook {18671,
	title = {Experimental Evaluation of the Unavailability Induced by a Group Membership Protocol},
	booktitle = {Dependable Computing EDCC-4},
	series = {Lecture Notes in Computer Science},
	volume = {2485},
	year = {2002},
	month = {2002///},
	pages = {644 - 648},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Group communication is an important paradigm for building highly available distributed systems. However, group membership operations often require the system to block message traffic, causing system services to become unavailable. This makes it important to quantify the unavailability induced by membership operations. This paper experimentally evaluates the blocking behavior of the group membership protocol of the Ensemble group communication system using a novel global-state-based fault injection technique. In doing so, we demonstrate how a layered distributed protocol such as the Ensemble group membership protocol can be modeled in terms of a state machine abstraction, and show how the resulting global state space can be used to specify fault triggers and define important measures on the system. Using this approach, we evaluate the cost associated with important states of the protocol under varying workload and group size. We also evaluate the sensitivity of the protocol to the occurrence of a second correlated crash failure during its operation.},
	keywords = {Computer science},
	isbn = {978-3-540-00012-9},
	url = {http://www.springerlink.com/content/mnkd4upqr14w2r7e/abstract/},
	author = {Joshi,Kaustubh and Michel Cukier and Sanders,William},
	editor = {Bondavalli,Andrea and Thevenod-Fosse,Pascale}
}
@conference {17227,
	title = {Improving Web-based civic information access: a case study of the 50 US states},
	booktitle = {2002 International Symposium on Technology and Society, 2002. (ISTAS{\textquoteright}02)},
	year = {2002},
	month = {2002///},
	pages = {275 - 282},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {An analysis of the home pages of all fifty US states reveals great variety in key design features that influence efficacy. Some states had excessively large byte counts that would slow users connected by commonly-used 56 K modems. Many web sites had low numbers of or poorly organized links that would make it hard for citizens to find what they were interested in. Features such as search boxes, privacy policies, online help, or contact information need to be added by several states. Our analysis concludes with ten recommendations and finds many further opportunities for individual states to improve their Websites. However still greater benefits will come through collaboration among the states that would lead to consistency, appropriate tagging, and common tools.},
	keywords = {Computer aided software engineering, Computer science, contact information, Educational institutions, government data processing, Guidelines, home page design features, information resources, Laboratories, Modems, Navigation, online help, privacy, privacy policies, search boxes, Tagging, Uniform resource locators, US states, USA, User interfaces, Web sites, Web-based civic information access},
	isbn = {0-7803-7284-0},
	doi = {10.1109/ISTAS.2002.1013826},
	author = {Ceaparu,I. and Shneiderman, Ben}
}
@conference {17642,
	title = {P5 : a protocol for scalable anonymous communication},
	booktitle = {2002 IEEE Symposium on Security and Privacy, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {58 - 70},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a protocol for anonymous communication over the Internet. Our protocol, called P5 (peer-to-peer personal privacy protocol) provides sender-, receiver-, and sender-receiver anonymity. P5 is designed to be implemented over current Internet protocols, and does not require any special infrastructure support. A novel feature of P5 is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalably implement large anonymous groups. We present a description of P5, an analysis of its anonymity and communication efficiency, and evaluate its performance using detailed packet-level simulations.},
	keywords = {Broadcasting, communication efficiency, Computer science, cryptography, data privacy, Educational institutions, Internet, large anonymous groups, P5 protocol, packet-level simulations, Particle measurements, Peer to peer computing, peer-to-peer personal privacy protocol, privacy, Protocols, receiver anonymity, scalable anonymous communication, security of data, sender anonymity, sender-receiver anonymity, Size measurement, telecommunication security},
	isbn = {0-7695-1543-6},
	doi = {10.1109/SECPRI.2002.1004362},
	author = {Sherwood,R. and Bhattacharjee, Bobby and Srinivasan, Aravind}
}
@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 {14654,
	title = {A secure PLAN (extended version)},
	booktitle = {DARPA Active NEtworks Conference and Exposition, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {224 - 237},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Active networks promise greater flexibility than current networks, but threaten safety and security by virtue of their programmability. We describe the design and implementation of a security architecture for the active network PLANet (Hicks et al., 1999). Security is obtained with a two-level architecture that combines a functionally restricted packet language, PLAN (Hicks et al., 1998), with an environment of general-purpose service routines governed by trust management (Blaze et al., 1996). In particular, we employ a technique which expands or contracts a packet{\textquoteright}s service environment based on its level of privilege, termed namespace-based security. As an application of our security architecture, we present the design and implementation of an active-network firewall. We find that the addition of the firewall imposes an approximately 34\% latency overhead and as little as a 6.7\% space overhead to incoming packets},
	keywords = {active internetwork, active networks, active-network firewall, Authentication, authorisation, Authorization, Cities and towns, Computer networks, Computer science, cryptography, functionally restricted packet language, general-purpose service routines, Information security, internetworking, IP networks, latency overhead, namespace-based security, PLAN, PLANet, Planets, programmability, Safety, security architecture, telecommunication security, trust management, two-level architecture, Web and internet services},
	isbn = {0-7695-1564-9},
	doi = {10.1109/DANCE.2002.1003496},
	author = {Hicks, Michael W. and Keromytis,A. D and Smith,J. M}
}
@inbook {18923,
	title = {Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment},
	booktitle = {Logics in Artificial Intelligence},
	series = {Lecture Notes in Computer Science},
	volume = {2424},
	year = {2002},
	month = {2002///},
	pages = {173 - 185},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We give the theoretical foundations and empirical evaluation of a planning agent, ashop, performing HTN planning in a multi-agent environment. ashop is based on ASHOP , an agentised version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO{\textquoteright}s. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimisations of such planners. Our main results are: (1) using NEO{\textquoteright}s as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance considerably.},
	keywords = {Computer science},
	isbn = {978-3-540-44190-8},
	url = {http://www.springerlink.com/content/10lxp56u3e9k0bdd/abstract/},
	author = {Dix,J{\"u}rgen and Munoz-Avila,Hector and Nau, Dana S. and Zhang,Lingling},
	editor = {Flesca,Sergio and Greco,Sergio and Ianni,Giovambattista and Leone,Nicola}
}
@conference {17101,
	title = {Dynamic queries and brushing on choropleth maps},
	booktitle = {Fifth International Conference on Information Visualisation, 2001. Proceedings},
	year = {2001},
	month = {2001///},
	pages = {757 - 764},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Users who must combine demographic, economic or other data in a geographic context are often hampered by the integration of tabular and map representations. Static, paper-based solutions limit the amount of data that can be placed on a single map or table. By providing an effective user interface, we believe that researchers, journalists, teachers, and students can explore complex data sets more rapidly and effectively. This paper presents Dynamaps, a generalized map-based information visualization tool for dynamic queries and brushing on choropleth maps. Users can use color coding to show a variable on each geographic region, and then filter out areas that do not meet the desired criteria. In addition, a scatterplot view and a details-on-demand window support overviews and specific fact-finding},
	keywords = {brushing, business, cartography, choropleth maps, color coding, colour graphics, complex data sets, Computational Intelligence Society, Computer science, data visualisation, Data visualization, demographic data, Demography, Dynamaps, dynamic queries, economic data, Educational institutions, geographic information system, geographic information systems, Joining processes, map representations, map-based information visualization, Query processing, Scattering, scatterplot view, tabular representations, user interface, User interfaces, World Wide Web},
	isbn = {0-7695-1195-3},
	doi = {10.1109/IV.2001.942141},
	author = {Dang,G. and North,C. and Shneiderman, Ben}
}
@inbook {15072,
	title = {Efficient and Non-interactive Non-malleable Commitment},
	booktitle = {Advances in Cryptology {\textemdash} EUROCRYPT 2001Advances in Cryptology {\textemdash} EUROCRYPT 2001},
	series = {Lecture Notes in Computer Science},
	volume = {2045},
	year = {2001},
	month = {2001///},
	pages = {40 - 59},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive . Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.},
	keywords = {Computer science},
	isbn = {978-3-540-42070-5},
	url = {http://www.springerlink.com/content/nhbj60a9da101w0r/abstract/},
	author = {Di Crescenzo,Giovanni and Katz, Jonathan and Ostrovsky,Rafail and Smith,Adam},
	editor = {Pfitzmann,Birgit}
}
@article {17667,
	title = {The one-inclusion graph algorithm is near-optimal for the prediction model of learning},
	journal = {IEEE Transactions on Information Theory},
	volume = {47},
	year = {2001},
	month = {2001/03//},
	pages = {1257 - 1261},
	abstract = {Haussler, Littlestone and Warmuth (1994) described a general-purpose algorithm for learning according to the prediction model, and proved an upper bound on the probability that their algorithm makes a mistake in terms of the number of examples seen and the Vapnik-Chervonenkis (VC) dimension of the concept class being learned. We show that their bound is within a factor of 1+o(1) of the best possible such bound for any algorithm},
	keywords = {Computer science, concept class, general-purpose algorithm, graph theory, learning prediction model, learning systems, near-optimal algorithm, Neural networks, one-inclusion graph algorithm, optimisation, Prediction algorithms, prediction theory, Predictive models, probability, Probability distribution, Upper bound, Vapnik-Chervonenkis dimension, Virtual colonoscopy},
	isbn = {0018-9448},
	doi = {10.1109/18.915700},
	author = {Li,Yi and Long,P. M and Srinivasan, Aravind}
}
@conference {17314,
	title = {Ordered treemap layouts},
	booktitle = {IEEE Symposium on Information Visualization, 2001. INFOVIS 2001},
	year = {2001},
	month = {2001///},
	pages = {73 - 78},
	publisher = {IEEE},
	organization = {IEEE},
	keywords = {Clustering algorithms, Computer science, Data visualization, Displays, Electronic switching systems, Filling, Monte Carlo methods, Read only memory, Testing},
	isbn = {0-7695-7342-5},
	doi = {10.1109/INFVIS.2001.963283},
	author = {Shneiderman, Ben and Wattenberg,M.}
}
@conference {12098,
	title = {A trend analysis of exploitations},
	booktitle = {2001 IEEE Symposium on Security and Privacy, 2001. S\&P 2001. Proceedings},
	year = {2001},
	month = {2001///},
	pages = {214 - 229},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We have conducted an empirical study of a number of computer security exploits and determined that the rates at which incidents involving the exploit are reported to CERT can be modeled using a common mathematical framework. Data associated with three significant exploits involving vulnerabilities in phf, imap, and bind can all be modeled using the formula C=I+S{\texttimes}√M where C is the cumulative count of reported incidents, M is the time since the start of the exploit cycle, and I and S are the regression coefficients determined by analysis of the incident report data. Further analysis of two additional exploits involving vulnerabilities in mountd and statd confirm the model. We believe that the models will aid in predicting the severity of subsequent vulnerability exploitations, based on the rate of early incident reports},
	keywords = {Computer science, computer security exploits, Data analysis, data mining, Educational institutions, exploitations, Performance analysis, Predictive models, Regression analysis, Risk management, security of data, software engineering, system intrusions, System software, trend analysis, vulnerabilities, vulnerability exploitation},
	isbn = {0-7695-1046-9},
	doi = {10.1109/SECPRI.2001.924300},
	author = {Browne,H. K and Arbaugh, William A. and McHugh,J. and Fithen,W. L}
}
@conference {17081,
	title = {Direct annotation: a drag-and-drop strategy for labeling photos},
	booktitle = {IEEE International Conference on Information Visualization, 2000. Proceedings},
	year = {2000},
	month = {2000///},
	pages = {88 - 95},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Annotating photographs is such a time-consuming, tedious and error-prone data entry task that it discourages most owners of personal photo libraries. By allowing the user to drag labels, such as personal names, from a scrolling list and drop them onto a photo, we believe we can make the task faster, easier and more appealing. Since the names are entered in a database, searching for all photos of a friend or family member is dramatically simplified. We describe the user interface design and the database schema to support direct annotation, as implemented in our PhotoFinder prototype},
	keywords = {Biomedical imaging, Cities and towns, Computer errors, Computer science, database indexing, database schema, Databases, digital libraries, direct annotation, direct manipulation, drag-and-drop strategy, Educational institutions, graphical user interface, Graphical user interfaces, History, hobby computing, image searching, label placement, Labeling, Laboratories, Libraries, personal information systems, personal names database, PhotoFinder prototype, photograph labelling, photographic libraries, Photography, scrolling list, user interface design, visual databases},
	isbn = {0-7695-0743-3},
	doi = {10.1109/IV.2000.859742},
	author = {Shneiderman, Ben and Kang,H.}
}
@conference {12197,
	title = {Domain name based visualization of Web histories in a zoomable user interface},
	booktitle = {11th International Workshop on Database and Expert Systems Applications, 2000. Proceedings},
	year = {2000},
	month = {2000///},
	pages = {591 - 598},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Users of hypertext systems like the World Wide Web (WWW) often find themselves following hypertext links deeper and deeper, only to find themselves {\textquotedblleft}lost{\textquotedblright} and unable to find their way back to the previously visited pages. We have implemented a Web browser companion called Domain Tree Browser (DTB) that builds a tree structured visual navigation history while browsing the Web. The Domain Tree Browser organizes the URLs visited based on the domain name of each URL and shows thumbnails of each page in a zoomable window},
	keywords = {Computer science, data visualisation, domain name, domain name based visualization, Domain Tree Browser, Educational institutions, History, hypermedia, hypertext links, hypertext systems, information resources, Navigation, online front-ends, thumbnails, Tree graphs, tree structured visual navigation history, Uniform resource locators, URLs, User interfaces, Visualization, Web browser companion, Web histories, Web pages, World Wide Web, zoomable user interface, zoomable window},
	isbn = {0-7695-0680-1},
	doi = {10.1109/DEXA.2000.875085},
	author = {Gandhi,R. and Kumar,G. and Bederson, Benjamin B. and Shneiderman, Ben}
}
@conference {17880,
	title = {Optimizing retrieval and processing of multi-dimensional scientific datasets},
	booktitle = {Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International},
	year = {2000},
	month = {2000///},
	pages = {405 - 410},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We have developed the Active Data Repository (ADR), an infrastructure that integrates storage, retrieval, and processing of large multi-dimensional scientific datasets on distributed memory parallel machines with multiple disks attached to each node. In earlier work, we proposed three strategies for processing range queries within the ADR framework. Our experimental results show that the relative performance of the strategies changes under varying application characteristics and machine configurations. In this work we investigate approaches to guide and automate the selection of the best strategy for a given application and machine configuration. We describe analytical models to predict the relative performance of the strategies where input data elements are uniformly distributed in the attribute space of the output dataset, restricting the output dataset to be a regular d-dimensional array},
	keywords = {active data repository, Area measurement, Computer science, Data analysis, distributed memory parallel machines, Educational institutions, Information retrieval, Information Storage and Retrieval, infrastructure, Microscopy, Microwave integrated circuits, multi-dimensional scientific datasets retrieval, PARALLEL PROCESSING, Pathology, range queries, regular d-dimensional array, Satellites, Tomography},
	isbn = {0-7695-0574-0},
	doi = {10.1109/IPDPS.2000.846013},
	author = {Chang,Chialin and Kurc, T. 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 {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 {15687,
	title = {Network service selection for distributed multimedia applications},
	booktitle = {Third International Conference on Computational Intelligence and Multimedia Applications, 1999. ICCIMA {\textquoteright}99. Proceedings},
	year = {1999},
	month = {1999///},
	pages = {388 - 392},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {An important question in the development of system support for distributed multimedia is the type of network service offered to applications. This paper compares two network service disciplines: weighted fair queueing (WFQ) and non-preemptive earliest deadline first (NEDF). We show that, for a broad class of high-bandwidth distributed multimedia applications, WFQ outperforms NEDF in terms of network throughput while still providing an application-adequate end-to-end service. This result holds despite the fact that NEDF offers applications far greater flexibility in terms of control over end-to-end delivery delay},
	keywords = {Admission control, Application software, application-adequate end-to-end service, Bandwidth, Communication system traffic control, Computer science, Delay, distributed processing, end-to-end delivery delay control, flexibility, high-bandwidth distributed multimedia applications, interactive multimedia, multimedia systems, network service selection, network throughput, nonpreemptive earliest deadline first, queueing theory, Regulators, system support, telecommunication services, Throughput, Traffic control, weighted fair queueing},
	isbn = {0-7695-0300-4},
	doi = {10.1109/ICCIMA.1999.798561},
	author = {Simon,R. and Sood,A. and Mundur, Padma}
}
@conference {17609,
	title = {Improved bounds and algorithms for hypergraph two-coloring},
	booktitle = {39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings},
	year = {1998},
	month = {1998/11/08/11},
	pages = {684 - 693},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We show that for all large n, every n-uniform hypergraph with at most 0.7√(n/lnn){\texttimes}2n edges can be two-colored. We, in fact, present fast algorithms that output a proper two-coloring with high probability for such hypergraphs. We also derandomize and parallelize these algorithms, to derive NC1 versions of these results. This makes progress on a problem of Erdos (1963), improving the previous-best bound of n1/3-0(1){\texttimes}2n due to Beck (1978). We further generalize this to a {\textquotedblleft}local{\textquotedblright} version, improving on one of the first applications of the Lovasz Local Lemma},
	keywords = {algorithms, Application software, Approximation algorithms, bounds, computational geometry, Computer science, Contracts, Erbium, graph colouring, History, hypergraph two-coloring, Lab-on-a-chip, MATHEMATICS, n-uniform hypergraph, Parallel algorithms, Polynomials, probability},
	isbn = {0-8186-9172-7},
	doi = {10.1109/SFCS.1998.743519},
	author = {Radhakrishnan,J. and Srinivasan, Aravind}
}
@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 {17627,
	title = {Multicommodity flow and circuit switching},
	booktitle = {, Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998},
	volume = {7},
	year = {1998},
	month = {1998/01/06/9},
	pages = {459-465 vol.7 - 459-465 vol.7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Given a set of request pairs in a network, the problem of routing virtual circuits with low congestion is to connect each pair by a path so that few paths use the same link in the network. We build on an earlier multicommodity flow based approach of Leighton and Rao (1996) to show that short flow paths lead to path selections with low congestion. This shows that such good path selections exist for constant-degree expanders with strong expansion, generalizing a result of (Broder et al., 1994). We also show, for infinitely many n, n-vertex undirected graphs Gn along with a set T of connection requests, such that: T is fractionally realizable using flow-paths that impose a (fractional) congestion of at most 1; but any rounding of such a flow to the given set of flow-paths, leads to a congestion of Ω(log n/log log n). This is progress on a long-standing open problem},
	keywords = {Application software, Bandwidth, circuit switching, Computer science, constant-degree expanders, graph theory, High speed integrated circuits, Integrated circuit technology, Laboratories, low congestion, MATHEMATICS, multicommodity flow, National electric code, network routing, path selections, Routing, short flow paths, Switching circuits, switching theory, undirected graphs, virtual circuit routing},
	isbn = {0-8186-8255-8},
	doi = {10.1109/HICSS.1998.649241},
	author = {Leighton,T. and Rao,S. and Srinivasan, Aravind}
}
@conference {18454,
	title = {Pictorial query trees for query specification in image databases},
	booktitle = {Fourteenth International Conference on Pattern Recognition, 1998. Proceedings},
	volume = {1},
	year = {1998},
	month = {1998/08//},
	pages = {919-921 vol.1 - 919-921 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A technique that enables specifying complex queries in image databases using pictorial query trees is presented. The leaves of a pictorial query tree correspond to individual pictorial queries that specify which objects should appear in the target images as well as how many occurrences of each object are required. In addition, the minimum required certainty of matching between query-image objects and database-image objects, as well as spatial constraints that specify bounds on the distance between objects and the relative direction between them are also specified. Internal nodes in the query tree represent logical operations (AND, OR, XOR) and their negations on the set of pictorial queries (or subtrees) represented by its children. The syntax of query trees is described. Algorithms for processing individual pictorial queries and for parsing and computing the overall result of a pictorial query tree are outlined},
	keywords = {Automation, complex queries, Computer science, content-based retrieval, Database systems, database-image objects, Educational institutions, Electrical capacitance tomography, grammars, Image databases, Image matching, parsing, pictorial query trees, Postal services, query specification, query-image objects, spatial constraints, syntax, visual databases},
	isbn = {0-8186-8512-3},
	doi = {10.1109/ICPR.1998.711383},
	author = {Soffer,A. and Samet, Hanan and Zotkin,Dmitry N}
}
@conference {17056,
	title = {Design and evaluation of incremental data structures and algorithms for dynamic query interfaces},
	booktitle = {IEEE Symposium on Information Visualization, 1997. Proceedings},
	year = {1997},
	month = {1997/10/21/21},
	pages = {81 - 86},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A dynamic query interface (DQI) is a database access mechanism that provides continuous real-time feedback to the user during query formulation. Previous work shows that DQIs are elegant and powerful interfaces to small databases. Unfortunately, when applied to large databases, previous DQI algorithms slow to a crawl. We present a new incremental approach to DQI algorithms and display updates that work well with large databases, both in theory and in practice.},
	keywords = {Algorithm design and analysis, Bars, Computer science, continuous real-time feedback, Data structures, data visualisation, Data visualization, database access mechanism, Displays, DQI algorithms, dynamic query interfaces, Feedback, Graphical user interfaces, Heuristic algorithms, incremental data structures, Information Visualization, large databases, Manipulator dynamics, NASA, query formulation, query languages, Query processing, real-time systems, small databases, User interfaces, very large databases, visual databases, visual languages},
	isbn = {0-8186-8189-6},
	doi = {10.1109/INFVIS.1997.636790},
	author = {Tanin,E. and Beigel,R. and Shneiderman, Ben}
}
@conference {17607,
	title = {Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems},
	booktitle = {, 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings},
	year = {1997},
	month = {1997/10/20/22},
	pages = {416 - 425},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present improved approximation algorithms for a family of problems involving edge-disjoint paths and unsplittable flow, and for some related routing problems. The central theme of all our algorithms is the underlying multi-commodity flow relaxation},
	keywords = {Approximation algorithms, Bandwidth, Channel allocation, computational complexity, Computer science, edge-disjoint paths, graph theory, High speed integrated circuits, IEL, Image motion analysis, Information systems, multi-commodity flow relaxation, Multiprocessor interconnection networks, network routing, Optical fiber networks, Routing, routing problems, unsplittable flow},
	isbn = {0-8186-8197-7},
	doi = {10.1109/SFCS.1997.646130},
	author = {Srinivasan, Aravind}
}
@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}
}
@conference {12802,
	title = {An algebraic theory of process efficiency},
	booktitle = {, Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS {\textquoteright}96. Proceedings},
	year = {1996},
	month = {1996/07/27/30},
	pages = {63 - 72},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper presents a testing-based semantic theory for reasoning about the efficiency of concurrent systems as measured in terms of the amount of their internal activity. The semantic preorders are given an algebraic characterization, and their optimality is established by means of a full abstractness result. They are also shown to subsume existing bisimulation-based efficiency preorders. An example is provided to illustrate the utility of this approach},
	keywords = {algebraic characterization, algebraic specification, algebraic theory, bisimulation-based efficiency preorders, Calculus, calculus of communicating systems, Carbon capture and storage, Computer science, concurrent systems, formal logic, formal specification, full abstractness result, internal activity, optimality, process efficiency, reasoning, semantic preorders, System testing, testing-based semantic theory},
	isbn = {0-8186-7463-6},
	doi = {10.1109/LICS.1996.561304},
	author = {Natarajan,V. and Cleaveland, Rance}
}
@conference {12799,
	title = {Efficient model checking via the equational μ-calculus},
	booktitle = {, Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS {\textquoteright}96. Proceedings},
	year = {1996},
	month = {1996/07/27/30},
	pages = {304 - 312},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper studies the use of an equational variant of the modal μ-calculus as a unified framework for efficient temporal logic model checking. In particular we show how an expressive temporal logic, CTL*, may be efficiently translated into the μ-calculus. Using this translation, one may then employ μ-calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and compositional model-checking approaches, to determine if systems satisfy formulas in CTL*},
	keywords = {Automata, BDD-based algorithms, Boolean functions, Calculus, compositional model-checking approaches, computational complexity, Computer science, CTL*, Data structures, Encoding, equational variant, equational μ-calculus, Equations, expressive temporal logic, Logic, Maintenance, modal μ-calculus, Model checking, on-the-fly procedures, Surges, temporal logic, temporal logic model checking, unified framework},
	isbn = {0-8186-7463-6},
	doi = {10.1109/LICS.1996.561358},
	author = {Bhat,G. and Cleaveland, Rance}
}
@inbook {18680,
	title = {On stratified sampling for high coverage estimations},
	booktitle = {Dependable Computing {\textemdash} EDCC-2},
	series = {Lecture Notes in Computer Science},
	volume = {1150},
	year = {1996},
	month = {1996///},
	pages = {35 - 54},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This paper addresses the problem of estimating the coverage of a fault tolerance mechanism through statistical processing of observations collected in faultinjection experiments. In an earlier paper, several techniques for sampling the fault/activity input space of a fault tolerance mechanism were presented. Various estimators based on simple sampling in the whole space and stratified sampling in a partitioned space were studied; confidence limits were derived based on a normal approximation. In this paper, the validity of this approximation is analyzed, especially for high coverage systems. The theory of confidence regions is then introduced to estimate the coverage without approximation when, for practical reasons, stratification is used. Three statistics are considered for defining confidence regions. It is shown that one of these statistics {\textemdash} a vectorial statistic {\textemdash} is often more conservative than the other two. However, only the vectorial statistic is computationally tractable. The results obtained are compared with those based on approximation by means of three hypothetical example systems.},
	keywords = {Computer science},
	isbn = {978-3-540-61772-3},
	url = {http://www.springerlink.com/content/7t2w2u472601h730/abstract/},
	author = {Powell,David and Michel Cukier and Arlat,Jean},
	editor = {Hlawiczka,Andrzej and Silva,Jo{\~a}o and Simoncini,Luca}
}
@conference {16363,
	title = {Code generation for multiple mappings},
	booktitle = {Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers {\textquoteright}95., Fifth Symposium on the},
	year = {1995},
	month = {1995/02/06/9},
	pages = {332 - 341},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {There has been a great amount of recent work toward unifying iteration reordering transformations. Many of these approaches represent transformations as affine mappings from the original iteration space to a new iteration space. These approaches show a great deal of promise, but they all rely on the ability to generate code that iterates over the points in these new iteration spaces in the appropriate order. This problem has been fairly well-studied in the case where all statements use the same mapping. We have developed an algorithm for the less well-studied case where each statement uses a potentially different mapping. Unlike many other approaches, our algorithm can also generate code from mappings corresponding to loop blocking. We address the important trade-off between reducing control overhead and duplicating code},
	keywords = {code generation, Computer science, Concurrent computing, control overhead, Educational institutions, iteration reordering transformations, Law, Legal factors, loop blocking, multiple mappings, optimisation, optimising compilers, Optimizing compilers, PARALLEL PROCESSING, Performance analysis, program compilers},
	isbn = {0-8186-6965-9},
	doi = {10.1109/FMPC.1995.380437},
	author = {Kelly,W. and Pugh, William and Rosser,E.}
}
@article {16314,
	title = {Comparing detection methods for software requirements inspections: a replicated experiment},
	journal = {IEEE Transactions on Software Engineering},
	volume = {21},
	year = {1995},
	month = {1995/06//},
	pages = {563 - 575},
	abstract = {Software requirements specifications (SRS) are often validated manually. One such process is inspection, in which several reviewers independently analyze all or part of the specification and search for faults. These faults are then collected at a meeting of the reviewers and author(s). Usually, reviewers use Ad Hoc or Checklist methods to uncover faults. These methods force all reviewers to rely on nonsystematic techniques to search for a wide variety of faults. We hypothesize that a Scenario-based method, in which each reviewer uses different, systematic techniques to search for different, specific classes of faults, will have a significantly higher success rate. We evaluated this hypothesis using a 3{\texttimes}24 partial factorial, randomized experimental design. Forty eight graduate students in computer science participated in the experiment. They were assembled into sixteen, three-person teams. Each team inspected two SRS using some combination of Ad Hoc, Checklist or Scenario methods. For each inspection we performed four measurements: (1) individual fault detection rate, (2) team fault detection rate, (3) percentage of faults first identified at the collection meeting (meeting gain rate), and (4) percentage of faults first identified by an individual, but never reported at the collection meeting (meeting loss rate). The experimental results are that (1) the Scenario method had a higher fault detection rate than either Ad Hoc or Checklist methods, (2) Scenario reviewers were more effective at detecting the faults their scenarios are designed to uncover, and were no less effective at detecting other faults than both Ad Hoc or Checklist reviewers, (3) Checklist reviewers were no more effective than Ad Hoc reviewers, and (4) Collection meetings produced no net improvement in the fault detection rate-meeting gains were offset by meeting losses},
	keywords = {Assembly, Computer science, Design for experiments, detection methods, Fault detection, fault detection rate, Fault diagnosis, formal specification, formal verification, Gain measurement, individual fault detection rate, Inspection, Loss measurement, nonsystematic techniques, performance evaluation, Performance gain, replicated experiment, scenario-based method, Software development management, software requirements inspections, software requirements specifications, team fault detection rate},
	isbn = {0098-5589},
	doi = {10.1109/32.391380},
	author = {Porter, Adam and Votta,L. G. and Basili, Victor R.}
}
@conference {12787,
	title = {Efficient on-the-fly model checking for CTL},
	booktitle = {, Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS {\textquoteright}95. Proceedings},
	year = {1995},
	month = {1995/06/26/29},
	pages = {388 - 397},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper gives an on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL. The time complexity of our algorithm matches that of the best existing {\textquotedblleft}global algorithm{\textquotedblright} for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast with these approaches, however, our routine constructs the state space of the system under consideration in a need-driven fashion and will therefore perform better in practice},
	keywords = {Algorithm design and analysis, Automata, computational complexity, Computer science, CTL, Encoding, finite automata, finite-state system, global algorithm, Logic, LTL, on-the-fly model checking, Performance analysis, Safety, State-space methods, sublogic, temporal logic, time complexity},
	isbn = {0-8186-7050-9},
	doi = {10.1109/LICS.1995.523273},
	author = {Bhat,G. and Cleaveland, Rance and Grumberg,O.}
}
@conference {13769,
	title = {Experimental investigation of high performance cognitive and interactive text filtering},
	booktitle = {, IEEE International Conference on Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century},
	volume = {5},
	year = {1995},
	month = {1995/10/22/25},
	pages = {4398-4403 vol.5 - 4398-4403 vol.5},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Text filtering has become increasingly important as the volume of networked information has exploded in recent years. This paper reviews recent progress in that field and reports on the development of a testbed for experimental investigation of cognitive and interactive text selection based on a history of user evaluations. An interactive filtering system model is presented and a new cognitive filtering technique which the authors call the Gaussian User Model is described. Because development of analytic measures of text selection effectiveness has proven intractable, the authors have modified the Cornell SMART text retrieval system to create a flexible text filtering testbed for experimental determination of filtering effectiveness. The paper concludes with a description of the design of this testbed system},
	keywords = {Cause effect analysis, Computer science, Contracts, Cornell SMART text retrieval system, Educational institutions, Gaussian User Model, high performance cognitive interactive text filtering, History, Information filtering, Information filters, Information retrieval, information retrieval system evaluation, Libraries, Matched filters, online front-ends, Query processing, System testing, text selection effectiveness, user evaluations, User interfaces, user modelling},
	isbn = {0-7803-2559-1},
	doi = {10.1109/ICSMC.1995.538486},
	author = {Oard, Douglas and DeClaris,N. and Dorr, Bonnie J and Faloutsos,C. and Marchionini,G.}
}
@conference {14168,
	title = {Global rigidity constraints in image displacement fields},
	booktitle = {, Fifth International Conference on Computer Vision, 1995. Proceedings},
	year = {1995},
	month = {1995/06/20/23},
	pages = {245 - 250},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Image displacement fields-optical flow fields, stereo disparity fields, normal flow fields-due to rigid motion possess a global geometric structure which is independent of the scene in view. Motion vectors of certain lengths and directions are constrained to lie on the imaging surface at particular loci whose location and form depends solely on the 3D motion parameters. If optical flow fields or stereo disparity fields are considered, then equal vectors are shown to lie on conic sections. Similarly, for normal motion fields, equal vectors lie within regions whose boundaries also constitute conics. By studying various properties of these curves and regions and their relationships, a characterization of the structure of rigid motion fields is given. The goal of this paper is to introduce a concept underlying the global structure of image displacement fields. This concept gives rise to various constraints that could form the basis of algorithms for the recovery of visual information from multiple views},
	keywords = {3D motion parameters, algorithms, Automation, Computer science, Computer vision, conic sections, curves, equal vectors, Fluid flow measurement, global geometric structure, global rigidity constraints, image displacement fields, Image motion analysis, Image segmentation, Image sequences, imaging surface, Laboratories, Layout, Motion estimation, Motion measurement, motion vectors, multiple views, normal flow fields, optical flow fields, regions, rigid motion, stereo disparity fields, Stereo vision, vectors, visual information recovery},
	isbn = {0-8186-7042-8},
	doi = {10.1109/ICCV.1995.466779},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {11982,
	title = {Global rigidity constraints in image displacement fields},
	booktitle = {Proceedings of Fifth International Conference on Computer Vision, 1995},
	year = {1995},
	month = {1995/06/20/23},
	pages = {245 - 250},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Image displacement fields-optical flow fields, stereo disparity fields, normal flow fields-due to rigid motion possess a global geometric structure which is independent of the scene in view. Motion vectors of certain lengths and directions are constrained to lie on the imaging surface at particular loci whose location and form depends solely on the 3D motion parameters. If optical flow fields or stereo disparity fields are considered, then equal vectors are shown to lie on conic sections. Similarly, for normal motion fields, equal vectors lie within regions whose boundaries also constitute conics. By studying various properties of these curves and regions and their relationships, a characterization of the structure of rigid motion fields is given. The goal of this paper is to introduce a concept underlying the global structure of image displacement fields. This concept gives rise to various constraints that could form the basis of algorithms for the recovery of visual information from multiple views},
	keywords = {3D motion parameters, algorithms, Automation, Computer science, Computer vision, conic sections, curves, equal vectors, Fluid flow measurement, global geometric structure, global rigidity constraints, image displacement fields, Image motion analysis, Image segmentation, Image sequences, imaging surface, Laboratories, Layout, Motion estimation, Motion measurement, motion vectors, multiple views, normal flow fields, optical flow fields, regions, rigid motion, stereo disparity fields, Stereo vision, vectors, visual information recovery},
	isbn = {0-8186-7042-8},
	doi = {10.1109/ICCV.1995.466779},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@article {16378,
	title = {Going beyond integer programming with the Omega test to eliminate false data dependences},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {6},
	year = {1995},
	month = {1995/02//},
	pages = {204 - 211},
	abstract = {Array data dependence analysis methods currently in use generate false dependences that can prevent useful program transformations. These false dependences arise because the questions asked are conservative approximations to the questions we really should be asking. Unfortunately, the questions we really should be asking go beyond integer programming and require decision procedures for a subclass of Presburger formulas. In this paper, we describe how to extend the Omega test so that it can answer these queries and allow us to eliminate these false data dependences. We have implemented the techniques described here and believe they are suitable for use in production compilers},
	keywords = {Algorithm design and analysis, Arithmetic, Computer science, Data analysis, false data dependences, integer programming, Linear programming, Omega test, Privatization, Production, production compilers, program compilers, Program processors, program testing, program transformations, Testing},
	isbn = {1045-9219},
	doi = {10.1109/71.342135},
	author = {Pugh, William and Wonnacott,D.}
}
@book {13298,
	title = {Image Analysis and Processing: 8th International Conference, Iciap {\textquoteright}95, San Remo, Italy, September 13-15, 1995 : Proceedings},
	year = {1995},
	month = {1995/09/28/},
	publisher = {Springer},
	organization = {Springer},
	abstract = {This book presents the proceedings of the 8th International Conference on Image Analysis and Processing, ICIAP {\textquoteright}95, held in Sanremo, Italy in September 1995 under the sponsorship of the International Association of Pattern Recognition IAPR.The volume presents 108 papers selected from more than 180 submissions together with six invited contributions. The papers are written by a total of 265 contributing authors and give a comprehensive state-of-the-art report on all current issues of image analysis and processing. Theoretical aspects are addressed as well as systems design and advanced applications, particularly in medical imaging.},
	keywords = {Artificial intelligence, COMPUTER AIDED DESIGN, Computer Graphics, Computer science, Computer vision, Computers / CAD-CAM, Computers / Computer Graphics, Computers / Computer Science, Computers / Computer Vision \& Pattern Recognition, Computers / Image Processing, Computers / Intelligence (AI) \& Semantics, Computers / Optical Data Processing, Computers / Software Development \& Engineering / General, Electronic books, IMAGE PROCESSING, Image processing/ Congresses, Imaging systems, Optical data processing, Optical pattern recognition, software engineering},
	isbn = {9783540602989},
	author = {Braccini,Carlo and De Floriani, Leila and Vernazza,Gianni}
}
@conference {17660,
	title = {Splitters and near-optimal derandomization},
	booktitle = {, 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings},
	year = {1995},
	month = {1995/10/23/25},
	pages = {182 - 191},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2k configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal ΣIIΣ threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits},
	keywords = {Boosting, Circuit testing, computational complexity, computational linguistics, Computer science, Contracts, derandomization, deterministic constructions, Educational institutions, Engineering profession, exhaustive testing, fairly general method, fixed-subgraph finding algorithms, hardness of approximation, Information systems, k-restrictions, learning, local-coloring protocol, MATHEMATICS, near-optimal constructions, near-optimal derandomization, Parallel algorithms, probabilistic bound, probability, Protocols, randomised algorithms, Set cover, splitters},
	isbn = {0-8186-7183-1},
	doi = {10.1109/SFCS.1995.492475},
	author = {Naor,M. and Schulman,L. J and Srinivasan, Aravind}
}
@conference {13837,
	title = {On automatic filtering of multilingual texts},
	booktitle = {, 1994 IEEE International Conference on Systems, Man, and Cybernetics, 1994. {\textquoteright}Humans, Information and Technology{\textquoteright}},
	volume = {2},
	year = {1994},
	month = {1994/10/02/5},
	pages = {1645-1650 vol.2 - 1645-1650 vol.2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {An emerging requirement to sift through the increasing flood of text information has led to the rapid development of information filtering technology in the past five years. This study introduces novel approaches for filtering texts regardless of their source language. We begin with a brief description of related developments in text filtering and multilingual information retrieval. We then present three alternative approaches to selecting texts from a multilingual information stream which represent a logical evolution from existing techniques in related disciplines. Finally, a practical automated performance evaluation technique is proposed},
	keywords = {automated performance evaluation, Business communication, Computer science, Discussion forums, Displays, Educational institutions, Floods, Government, Information filtering, Information filters, Information retrieval, multilingual information retrieval, multilingual text filtering, natural languages, performance evaluation},
	isbn = {0-7803-2129-4},
	doi = {10.1109/ICSMC.1994.400083},
	author = {Oard, Douglas and DeClaris,N. and Dorr, Bonnie J and Faloutsos,C.}
}
@conference {17577,
	title = {Computing with very weak random sources},
	booktitle = {, 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings},
	year = {1994},
	month = {1994/11/20/22},
	pages = {264 - 275},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {For any fixed ε>0, we show how to simulate RP algorithms in time nO(log n) using the output of a δ-source with min-entropy R(ε). Such a weak random source is asked once for R(ε) bits; it outputs an R-bit string such that any string has probability at most 2-R(ε). If ε>1-1/(k+1), our BPP simulations take time nO(log(k n)) (log(k) is the logarithm iterated k times). We also give a polynomial-time BPP simulation using Chor-Goldreich sources of min-entropy RΩ(1), which is optimal. We present applications to time-space tradeoffs, expander constructions, and the hardness of approximation. Also of interest is our randomness-efficient Leftover Hash Lemma, found independently by Goldreich and Wigderson},
	keywords = {Application software, BPP simulations, Chor-Goldreich sources, computational complexity, Computational modeling, Computer science, Computer simulation, cryptography, distributed algorithms, expander constructions, hardness, MATHEMATICS, min-entropy, Physics computing, Polynomials, probability, R-bit string, randomness-efficient Leftover Hash Lemma, RP algorithms simulation, Testing, time-space tradeoffs, very weak random sources},
	isbn = {0-8186-6580-7},
	doi = {10.1109/SFCS.1994.365688},
	author = {Srinivasan, Aravind and Zuckerman,D.}
}
@conference {14579,
	title = {A SIMD solution to the sequence comparison problem on the MGAP},
	booktitle = {International Conference on Application Specific Array Processors, 1994. Proceedings},
	year = {1994},
	month = {1994/08/22/24},
	pages = {336 - 345},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Molecular biologists frequently compare an unknown biosequence with a set of other known biosequences to find the sequence which is maximally similar, with the hope that what is true of one sequence, either physically or functionally, could be true of its analogue. Even though efficient dynamic programming algorithms exist for the problem, when the size of the database is large, the time required is quite long, even for moderate length sequences. In this paper, we present an efficient pipelined SIMD solution to the sequence alignment problem on the Micro-Grain Array Processor (MGAP), a fine-grained massively parallel array of processors with nearest-neighbor connections. The algorithm compares K sequences of length O(M) with the actual sequence of length N, in O(M+N+K) time with O(MN) processors, which is AT-optimal. The implementation on the MGAP computes at the rate of about 0.1 million comparisons per second for sequences of length 128},
	keywords = {AT-optimal algorithm, Biological information theory, biology computing, biosequence comparison problem, computational complexity, Computer science, Costs, database size, Databases, DNA computing, dynamic programming, dynamic programming algorithms, fine-grained massively parallel processor array, Genetics, Heuristic algorithms, maximally similar sequence, MGAP parallel computer, Micro-Grain Array Processor, Military computing, molecular biology, molecular biophysics, Nearest neighbor searches, nearest-neighbor connections, Parallel algorithms, pipeline processing, pipelined SIMD solution, sequence alignment problem, sequences},
	isbn = {0-8186-6517-3},
	doi = {10.1109/ASAP.1994.331791},
	author = {Borah,M. and Bajwa,R. S and Hannenhalli, Sridhar and Irwin,M. J}
}
@inbook {18691,
	title = {Software reliability analysis of three successive generations of a Switching System},
	booktitle = {Dependable Computing {\textemdash} EDCC-1},
	series = {Lecture Notes in Computer Science},
	volume = {852},
	year = {1994},
	month = {1994///},
	pages = {471 - 490},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Most current approaches to software reliability evaluation are based on data collected on a single generation of products. However, many applications are developed through improvements of the existing software: to the families of products are added various generations as the need for new functionalities arises. Experimental studies dealing with the analysis of data collected on families of products are seldom reported. In this paper, we analyze the data (failure and correction reports) collected on the software of three successive generations of the Brazilian Switching System {\textemdash} TROPICO-R, during validation and operation. A comparative analysis of the three products is done and the main results are outlined. Emphasis is placed on the evolution of the software and the corresponding failures and corrected faults. The analysis addresses: i) the modifications introduced on system components, ii) the distribution of failures and corrected faults in the components and the functions fulfilled by the system, and iii) the evolution of the failure intensity functions.},
	keywords = {Computer science},
	isbn = {978-3-540-58426-1},
	url = {http://www.springerlink.com/content/f71g30v177521471/abstract/},
	author = {Ka{\^a}niche,M. and Kanoun,K. and Michel Cukier and Martini,M.},
	editor = {Echtle,Klaus and Hammer,Dieter and Powell,David}
}
@conference {14576,
	title = {A distributed algorithm for ear decomposition},
	booktitle = {, Fifth International Conference on Computing and Information, 1993. Proceedings ICCI {\textquoteright}93},
	year = {1993},
	month = {1993/05/27/29},
	pages = {180 - 184},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A distributed algorithm for finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented. At the completion of the algorithm either the ears are correctly labeled or the nodes are informed that there exists no ear decomposition. First we present a novel algorithm to check the existence of an ear decomposition which uses O(m) messages. We also present two other algorithms, one which is time-optimal and the other which is message-optimal to determine the actual ears and their corresponding numbers after determining the existence of an ear decomposition},
	keywords = {Asynchronous communication, asynchronous communication network, Automata, Communication networks, computational complexity, Computer networks, Computer science, decomposition graph, distributed algorithm, distributed algorithms, Distributed computing, Ear, ear decomposition, graph theory, message-optimal, network decomposition, sorting, Testing, time-optimal},
	isbn = {0-8186-4212-2},
	doi = {10.1109/ICCI.1993.315382},
	author = {Hannenhalli, Sridhar and Perumalla,K. and Chandrasekharan,N. and Sridhar,R.}
}
@conference {14587,
	title = {Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs},
	booktitle = {, Fourth International Conference on Computing and Information, 1992. Proceedings. ICCI {\textquoteright}92},
	year = {1992},
	month = {1992/05/28/30},
	pages = {42 - 45},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The authors present efficient algorithms for computing the matching polynomial and chromatic polynomial of a series-parallel graph in O(n3) and O(n2) time respectively. Their algorithm for computing the matching polynomial generalizes an existing result from Lovasz, Plummer (1986) and the chromatic polynomial algorithm improves the result given by Hunt, Ravi, Stearn (1988) from O(n4) time},
	keywords = {chromatic polynomials, computational complexity, Computer science, graph colouring, graph theory, matching polynomial, Polynomials, series-parallel graphs, Terminology, Tree data structures, Tree graphs},
	isbn = {0-8186-2812-X},
	doi = {10.1109/ICCI.1992.227709},
	author = {Chandrasekharan,N. and Hannenhalli, Sridhar}
}
@conference {12020,
	title = {Exploratory active vision: theory},
	booktitle = {Proceedings of 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992},
	year = {1992},
	month = {1992/06/15/18},
	pages = {10 - 15},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {An active approach to the integration of shape from x modules-here shape from shading and shape from texture-is proposed. The question of what constitutes a good motion for the active observer is addressed. Generally, the role of the visual system is to provide depth information to an autonomous robot; a trajectory module will then interpret it to determine a motion for the robot, which in turn will affect the visual information received. It is suggested that the motion can also be chosen so as to improve the performance of the visual system},
	keywords = {active observer, Active shape model, active vision, Automation, autonomous robot, CAMERAS, Computer science, Computer vision, depth information, Laboratories, Layout, Mobile robots, Motion analysis, optical flow, Robots, shape from shading, shape from texture, shape from x modules, trajectory module, Visual system},
	isbn = {0-8186-2855-3},
	doi = {10.1109/CVPR.1992.223234},
	author = {Herve,J. -Y and Aloimonos, J.}
}
@conference {16781,
	title = {An algebra and calculus for relational multidatabase systems},
	booktitle = {, First International Workshop on Interoperability in Multidatabase Systems, 1991. IMS {\textquoteright}91. Proceedings},
	year = {1991},
	month = {1991/04//},
	pages = {118 - 124},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {With the existence of many autonomous databases widely accessible through computer networks, users will require the capability to jointly manipulate data in different databases. A multidatabase system provides such a capability through a multidatabase manipulation language. The authors propose a theoretical foundation for such languages by presenting a multirelational algebra and calculus based on the relational algebra and calculus. The proposal is illustrated by various queries on an example multidatabase},
	keywords = {Algebra, autonomous databases, Calculus, Computer networks, Computer science, Data models, Data structures, Database systems, database theory, distributed databases, Military computing, multidatabase manipulation language, multidatabase system, multirelational algebra, query languages, relational algebra, Relational databases, Spatial databases, theoretical foundation},
	isbn = {0-8186-2205-9},
	doi = {10.1109/IMS.1991.153694},
	author = {Grant,J. and Litwin,W. and Roussopoulos, Nick and Sellis,T.}
}
@article {16764,
	title = {Incremental implementation model for relational databases with transaction time},
	journal = {IEEE Transactions on Knowledge and Data Engineering},
	volume = {3},
	year = {1991},
	month = {1991/12//},
	pages = {461 - 473},
	abstract = {An implementation model for the standard relational data model extended with transaction time is presented. The implementation model integrates techniques of view materialization, differential computation, and deferred update into a coherent whole. It is capable of storing any view (reflecting past or present states) and subsequently using stored views as outsets for incremental and decremental computations of requested views, making it more flexible than previously proposed partitioned storage models. The working and the expressiveness of the model are demonstrated by sample queries that show how historical data are retrieved},
	keywords = {Computational modeling, Computer science, Data models, data retrieval, Database languages, Database systems, database theory, decremental computations, deferred update, Degradation, differential computation, historical data, History, incremental computations, Information retrieval, partitioned storage models, queries, relational data model, Relational databases, stored views, Transaction databases, transaction time, view materialization},
	isbn = {1041-4347},
	doi = {10.1109/69.109107},
	author = {Jensen,C. S and Mark,L. and Roussopoulos, Nick}
}
@conference {14575,
	title = {Parallel transitive closure computations using topological sort},
	booktitle = {, Proceedings of the First International Conference on Parallel and Distributed Information Systems, 1991},
	year = {1991},
	month = {1991/12/04/6},
	pages = {122 - 129},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Deals with parallel transitive closure computations. The sort-based approaches introduced sorts the tuples of the relation into topological order, and the sorted relation is then horizontally partitioned and distributed across several processing nodes of a message passing multiprocessor system. This data partitioning strategy allows the transitive closure computation of the local data fragments to be computed in parallel with no interprocessor communication. The construction of the final result then requires only a small number of joins. Extensive analytical results are included in the paper as well. They show that the proposed techniques leads to a speedup that is essentially linear with the number of processors. Its performance is significantly better than the recently published hashless parallel algorithm},
	keywords = {Computer science, Concurrent computing, data partitioning, Database systems, database theory, deductive databases, File systems, horizontal partitioning, joins, local data fragments, message passing multiprocessor system, Multiprocessing systems, Parallel algorithms, PARALLEL PROCESSING, parallel programming, parallel transitive closure, processing nodes, relation tuples, Relational databases, sorting, topological sort},
	isbn = {0-8186-2295-4},
	doi = {10.1109/PDIS.1991.183079},
	author = {Hua,K. A and Hannenhalli, Sridhar}
}
@conference {12836,
	title = {A theory of testing for real-time},
	booktitle = {, Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, 1991. LICS {\textquoteright}91},
	year = {1991},
	month = {1991/07/15/18},
	pages = {110 - 119},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A framework for generating testing preorders that relate processes on the basis of their timing behavior as well as their degree of relative nondeterminism is developed. The basic concepts of transition systems and testing are reviewed, and timed testing, which takes account of the delay exhibited by a process as it attempts to pass a test, is introduced. The framework is then applied to two different scenarios. In the first, relations are constructed that relate processes on the basis of all timing considerations. In the second, relations are constructed that relate processes on the basis of their relative speeds. In both cases, alternative denotational characterizations of the resulting preorders are presented, and examples are given to illustrate the utility of the approach},
	keywords = {Algebra, Character generation, Computer science, Delay, formal logic, Licenses, nondeterminism, Process control, Protocols, Real time systems, real-time, System testing, testing preorders, testing theory, timed testing, Timing, timing behavior, transition systems},
	isbn = {0-8186-2230-X},
	doi = {10.1109/LICS.1991.151635},
	author = {Cleaveland, Rance and Zwarico,A. E}
}
@article {17430,
	title = {Touch screens now offer compelling uses},
	journal = {IEEE Software},
	volume = {8},
	year = {1991},
	month = {1991/03//},
	pages = {93 - 94},
	abstract = {Research on improving the user interfaces of touch screen applications is described. The advantages of touch screens are discusses, their current capabilities are examined, and possible future developments are considered.<>},
	keywords = {Application software, Computer aided instruction, Computer displays, Computer science, Cultural differences, Fingers, future developments, information resources, Marketing and sales, Mice, Psychology, touch screen applications, touch sensitive screens, User interfaces},
	isbn = {0740-7459},
	doi = {10.1109/52.73754},
	author = {Shneiderman, Ben}
}
@conference {17438,
	title = {Tree-maps: a space-filling approach to the visualization of hierarchical information structures},
	booktitle = {, IEEE Conference on Visualization, 1991. Visualization {\textquoteright}91, Proceedings},
	year = {1991},
	month = {1991/10/22/25},
	pages = {284 - 291},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100\% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children},
	keywords = {Computer displays, Computer Graphics, Computer science, Data analysis, display space, Educational institutions, Feedback, hierarchical information structures, HUMANS, Laboratories, Libraries, Marine vehicles, rectangular region, semantic information, space-filling approach, tree-map visualization technique, trees (mathematics), Two dimensional displays, Visualization},
	isbn = {0-8186-2245-8},
	doi = {10.1109/VISUAL.1991.175815},
	author = {Johnson,B. and Shneiderman, Ben}
}
@article {16743,
	title = {Trie hashing with controlled load},
	journal = {IEEE Transactions on Software Engineering},
	volume = {17},
	year = {1991},
	month = {1991/07//},
	pages = {678 - 691},
	abstract = {Trie hashing (TH), a primary key access method for storing and accessing records of dynamic files, is discussed. The key address is computed through a trie. A key search usually requires only one disk access when the trie is in core and two disk accesses for very large files when the trie must be on disk. A refinement to trie hashing, trie hashing with controlled load (THCL), is presented. It is designed to control the load factor of a TH file as tightly as that of a B-tree file, allows high load factor of up to 100\% for ordered insertions, and increases the load factor for random insertions from 70\% to over 85\%. It is shown that these properties make trie hashing preferable to a B-tree},
	keywords = {B-tree file, Computer science, controlled load, Databases, disk access, dynamic files, file organisation, high load factor, information retrieval systems, key search, load factor, Military computing, ordered insertions, Predictive models, primary key access method, Protocols, random insertions, TH file, THCL, Tree data structures, trees (mathematics), trie hashing},
	isbn = {0098-5589},
	doi = {10.1109/32.83904},
	author = {Litwin,W. A and Roussopoulos, Nick and Levy,G. and Hong,W.}
}
@conference {12797,
	title = {When is {\textquoteleft}partial{\textquoteright} adequate? A logic-based proof technique using partial specifications},
	booktitle = {Logic in Computer Science, 1990. LICS {\textquoteright}90, Proceedings., Fifth Annual IEEE Symposium on e},
	year = {1990},
	month = {1990/06/04/7},
	pages = {440 - 449},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A technique is presented for ascertaining when a (finite-state) partial process specification is adequate, in the sense of being specified enough, for contexts in which it is to be used. The method relies on the automatic generation of a modal formula from the partial specification; if the remainder of the network satisfies this formula, then any process that meets the specification is guaranteed to ensure correct behavior of the overall system. Using the results, the authors develop compositional proof rules for establishing the correctness of networks of parallel processes and illustrate their use with several examples},
	keywords = {Calculus, Carbon capture and storage, compositional proof rules, Computer science, Concurrent computing, Context, correctness, formal specification, logic-based proof technique, modal formula, parallel processes, partial process specification, partial specifications, specification adequacy, State-space methods, Technological innovation},
	isbn = {0-8186-2073-0},
	doi = {10.1109/LICS.1990.113768},
	author = {Cleaveland, Rance and Steffen,B.}
}
@conference {18307,
	title = {3D object recognition via simulated particles diffusion},
	booktitle = {IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1989. Proceedings CVPR {\textquoteright}89},
	year = {1989},
	month = {1989/06//},
	pages = {442 - 449},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A novel approach for 3D object recognition is presented. This approach is model-based, and assumes either 3D or 21/2 D scene acquisition. Transformation detection is accomplished along with an object identification (six degrees of freedom, three rotational and three translational, are assumed). The diffusion-like simulation recently introduced as a means for characterization of shape is used in the extraction of point features. The point features represent regions on the object{\textquoteright}s surface that are extreme in curvature (i.e. concavities and convexities). Object matching is carried out by examining the correspondence between the object{\textquoteright}s set of point features and the model{\textquoteright}s set of point features, using an alignment strategy. Triangles are constructed between all possible triples of object{\textquoteright}s point features, and then are aligned to candidate corresponding triangles of the model{\textquoteright}s point features. 21/2 range images are transformed into a volumetric representation through a parallel projection onto the 3-D space. The resultant volume is suitable for processing by the diffusion-like simulation},
	keywords = {3D object recognition, alignment strategy, Computational modeling, Computer science, data mining, Gold, Layout, Noise shaping, Object detection, Object recognition, parallel projection, pattern recognition, point features, radio access networks, scene acquisition, shape characterisation, Shape measurement, simulated particles diffusion, transformation detection},
	isbn = {0-8186-1952-x},
	doi = {10.1109/CVPR.1989.37886},
	author = {Yacoob,Yaser and Gold,Y. I}
}
@article {16791,
	title = {An efficient pictorial database system for PSQL},
	journal = {IEEE Transactions on Software Engineering},
	volume = {14},
	year = {1988},
	month = {1988/05//},
	pages = {639 - 650},
	abstract = {Pictorial databases require efficient and direct spatial search based on the analog form of spatial objects and relationships instead of search based on some cumbersome alphanumeric encodings of the pictures. A description is given of PSQL, a query language that allows pictorial domains to be presented to the user in their analog form and allows him or her to do direct manipulation on the objects found on those domains. Direct spatial search and computation on the pictures is done using efficient data structures, R- and R+-trees (multidimensional B-trees), which are excellent devices for searching spatial objects and relationships found on pictures},
	keywords = {alphanumeric encodings, Computer science, Data structures, Database languages, database management systems, Database systems, Encoding, Image coding, Image databases, multidimensional B-trees, Object oriented databases, pictorial database system, PSQL, query language, query languages, R+-trees, Relational databases, Spatial databases, spatial objects, spatial search, User interfaces},
	isbn = {0098-5589},
	doi = {10.1109/32.6141},
	author = {Roussopoulos, Nick and Faloutsos,C. and Sellis,T.}
}
@article {16737,
	title = {The Logical Access Path Schema of a Database},
	journal = {IEEE Transactions on Software Engineering},
	volume = {SE-8},
	year = {1982},
	month = {1982/11//},
	pages = {563 - 573},
	abstract = {A new schema which models the usage of the logical access paths of the database is proposed. The schema models all database activities (i.e., retrievals and updates), and integrates their logical access paths by recognizing common subpaths and increasing the "weight" of the shared subpaths. The logical access path schema provides a comprehensive picture of the logical access paths, and the cumulative usage of the shared subpaths and/or intermediate results. The schema serves a dual purpose. Firstly, it is used as a model of the access requirements during the database design, and secondly, as the basis for optimization during the operation of the database.},
	keywords = {Aggregation hierarchy, Calculus, Computer science, Data structures, Databases, Design optimization, external logical subschema, generalization hierarchy, Information retrieval, Joining processes, logical access path, propositional calculus, views},
	isbn = {0098-5589},
	doi = {10.1109/TSE.1982.235886},
	author = {Roussopoulos, Nick}
}
