@article {20300, title = {High-Throughput DNA Sequencing To Profile Microbial Water Quality Of Potable Reuse}, year = {2018}, url = {https://www.wateronline.com/doc/high-throughput-dna-sequencing-to-profile-microbial-water-quality-of-potable-reuse-0001}, author = {Menu B. Leddy and Megan H. Plumlee and Rose S. Kantor and Kara L. Nelson and Scott E. Miller and Lauren C. Kennedy and Blake W. Stamps and John R. Spear and Nur A. Hasan and Rita R Colwell} } @article {20322, title = {Hydroclimatic sustainability assessment of changing climate on cholera in the Ganges-Brahmaputra basin}, journal = {Advances in Water Resources}, volume = {108}, year = {2017}, month = {Jan-10-2017}, pages = {332 - 344}, abstract = {The association of cholera and climate has been extensively documented. However, determining the effects of changing climate on the occurrence of disease remains a challenge. Bimodal peaks of cholera in Bengal Delta are hypothesized to be linked to asymmetric flow of the Ganges and Brahmaputra rivers. Spring cholera is related to intrusion of bacteria-laden coastal seawater during low flow seasons, while autumn cholera results from cross-contamination of water resources when high flows in the rivers cause massive inundation. Coarse resolution of General Circulation Model (GCM) output (usually at 100 {\textendash} 300 km)cannot be used to evaluate variability at the local scale(10{\textendash}20 km),hence the goal of this study was to develop a framework that could be used to understand impacts of climate change on occurrence of cholera. Instead of a traditional approach of downscaling precipitation, streamflow of the two rivers was directly linked to GCM outputs, achieving reasonable accuracy (R2 = 0.89 for the Ganges and R2 = 0.91 for the Brahmaputra)using machine learning algorithms (Support Vector Regression-Particle Swarm Optimization). Copula methods were used to determine probabilistic risks of cholera under several discharge conditions. Key results, using model outputs from ECHAM5, GFDL, andHadCM3for A1B and A2 scenarios, suggest that the combined low flow of the two rivers may increase in the future, with high flows increasing for first half of this century, decreasing thereafter. Spring and autumn cholera, assuming societal conditions remain constant e.g., at the current rate, may decrease. However significant shifts were noted in the magnitude of river discharge suggesting that cholera dynamics of the delta may well demonstrate an uncertain predictable pattern of occurrence over the next century.}, issn = {03091708}, doi = {10.1016/j.advwatres.2016.11.018}, url = {https://linkinghub.elsevier.com/retrieve/pii/S030917081630728X}, author = {Nasr-Azadani, Fariborz and Khan, Rakibul and Rahimikollu, Javad and Unnikrishnan, Avinash and Akanda, Ali and Alam, Munirul and Huq, Anwar and Jutla, Antarpreet and Rita R Colwell} } @article {20347, title = {Hybrid Vibrio~cholerae El Tor Lacking SXT Identified as the Cause of a Cholera Outbreak in the Philippines}, journal = {mBio}, year = {2015}, month = {Jan-05-2015}, abstract = {Cholera continues to be a global threat, with high rates of morbidity and mortality. In 2011, a cholera outbreak occurred in Palawan, Philippines, affecting more than 500 people, and 20 individuals died. Vibrio cholerae O1 was confirmed as the etiological agent. Source attribution is critical in cholera outbreaks for proper management of the disease, as well as to control spread. In this study, three V. cholerae O1 isolates from a Philippines cholera outbreak were sequenced and their genomes analyzed to determine phylogenetic relatedness to V. cholerae O1 isolates from recent outbreaks of cholera elsewhere. The Philippines V. cholerae O1 isolates were determined to be V. cholerae O1 hybrid El Tor belonging to the seventh-pandemic clade. They clustered tightly, forming a monophyletic clade closely related to V. cholerae O1 hybrid El Tor from Asia and Africa. The isolates possess a unique multilocus variable-number tandem repeat analysis (MLVA) genotype (12-7-9-18-25 and 12-7-10-14-21) and lack SXT. In addition, they possess a novel 15-kb genomic island (GI-119) containing a predicted type I restriction-modification system. The CTXΦ-RS1 array of the Philippines isolates was similar to that of V. cholerae O1 MG116926, a hybrid El Tor strain isolated in Bangladesh in 1991. Overall, the data indicate that the Philippines V. cholerae O1 isolates are unique, differing from recent V. cholerae O1 isolates from Asia, Africa, and Haiti. Furthermore, the results of this study support the hypothesis that the Philippines isolates of V. cholerae O1 are indigenous and exist locally in the aquatic ecosystem of the Philippines.}, doi = {10.1128/mBio.00047-15}, url = {http://mbio.asm.org/lookup/doi/10.1128/mBio.00047-15}, author = {Klinzing, David C. and Choi, Seon Young and Hasan, Nur A. and Matias, Ronald R. and Tayag, Enrique and Geronimo, Josefina and Skowronski, Evan and Rashed, Shah M. and Kawashima, Kent and Rosenzweig, C. Nicole and Gibbons, Henry S. and Torres, Brian C. and Liles, Veni and Alfon, Alicia C. and Juan, Maria Luisa and Natividad, Filipinas F. and Cebula, Thomas A. and Rita R Colwell} } @article {19315, title = {A Hybrid System for Error Detection in Electronic Dictionaries}, number = {CASL-1308-2}, year = {2012}, abstract = {A progress report on CASL{\textquoteright}s research on error detection in electronic dictionaries, including a hybrid system, application and evaluation on a second dictionary and a graphical user interface. }, author = {Zajic, David and David Doermann and Bloodgood,Michael and Rodrigues,Paul and Ye,Peng and Zotkina,Elena} } @article {16273, title = {Hawkeye and AMOS: Visualizing and Assessing the Quality of Genome Assemblies}, journal = {Briefings in Bioinformatics}, year = {2011}, month = {2011/12/23/}, abstract = {Since its launch in 2004, the open-source AMOS project has released several innovative DNA sequence analysis applications including: Hawkeye, a visual analytics tool for inspecting the structure of genome assemblies; the Assembly Forensics and FRCurve pipelines for systematically evaluating the quality of a genome assembly; and AMOScmp, the first comparative genome assembler. These applications have been used to assemble and analyze dozens of genomes ranging in complexity from simple microbial species through mammalian genomes. Recent efforts have been focused on enhancing support for new data characteristics brought on by second- and now third-generation sequencing. This review describes the major components of AMOS in light of these challenges, with an emphasis on methods for assessing assembly quality and the visual analytics capabilities of Hawkeye. These interactive graphical aspects are essential for navigating and understanding the complexities of a genome assembly, from the overall genome structure down to individual bases. Hawkeye and AMOS are available open source at http://amos.sourceforge.net.}, keywords = {assembly forensics, DNA Sequencing, genome assembly, visual analytics}, isbn = {1467-5463, 1477-4054}, doi = {10.1093/bib/bbr074}, url = {http://bib.oxfordjournals.org/content/early/2011/12/23/bib.bbr074}, author = {Schatz,Michael C and Phillippy,Adam M and Sommer,Daniel D and Delcher,Arthur L. and Puiu,Daniela and Narzisi,Giuseppe and Salzberg,Steven L. and Pop, Mihai} } @conference {17184, title = {HCI for peace: from idealism to concrete steps}, booktitle = {PART 2 {\textemdash}{\textemdash}{\textemdash}{\textendash} Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {613 - 616}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This panel will contribute diverse perspectives on the use of computer technology to promote peace and prevent armed conflict. These perspectives include: the use of social media to promote democracy and citizen participation, the role of computers in helping people communicate across division lines in zones of conflict, how persuasive technology can promote peace, and how interaction design can play a role in post-conflict reconciliation.}, keywords = {cyprus, peace, persuasive technology, post-conflict reconciliation, social media, value sensitive design, war}, doi = {10.1145/1979482.1979493}, url = {http://doi.acm.org/10.1145/1979482.1979493}, author = {Hourcade,Juan Pablo and Bullock-Rest,Natasha E. and Friedman,Batya and Nelson,Mark and Shneiderman, Ben and Zaphiris,Panayiotis} } @conference {19452, title = {Helping Users Shop for ISPs with Internet Nutrition Labels}, booktitle = {ACM SIGCOMM Workshop on Home Networks {\textquoteright}11}, series = {HomeNets {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {13 - 18}, publisher = {ACM}, organization = {ACM}, abstract = {When purchasing home broadband access from Internet service providers (ISPs), users must decide which service plans are most appropriate for their needs. Today, ISPs advertise their available service plans using only generic upload and download speeds. Unfortunately, these metrics do not always accurately reflect the varying performance that home users will experience for a wide range of applications. In this paper, we propose that each ISP service plan carry a "nutrition label" that conveys more comprehensive information about network metrics along many dimensions, including various aspects of throughput, latency, loss rate, and jitter. We first justify why these metrics should form the basis of a network nutrition label. Then, we demonstrate that current plans that are superficially similar with respect to advertised download rates may have different performance according to the label metrics. We close with a discussion of the challenges involved in presenting a nutrition label to users in a way that is both accurate and easy to understand.}, keywords = {access networks, benchmarking, bismark, broadband networks, gateway measurements}, isbn = {978-1-4503-0798-7}, url = {http://doi.acm.org/10.1145/2018567.2018571}, author = {Sundaresan, Srikanth and Feamster, Nick and Teixeira, Renata and Tang, Anthony and Edwards, W. Keith and Grinter, Rebecca E. and Marshini Chetty and de Donato, Walter} } @inbook {19277, title = {Heterogeneous Design in Functional DIF}, booktitle = {Transactions on High-Performance Embedded Architectures and Compilers IV}, series = {Lecture Notes in Computer Science}, year = {2011}, month = {2011}, pages = {391 - 408}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Dataflow formalisms have provided designers of digital signal processing (DSP) systems with analysis and optimizations for many years. As system complexity increases, designers are relying on more types of dataflow models to describe applications while retaining these implementation benefits. The semantic range of DSP-oriented dataflow models has expanded to cover heterogeneous models and dynamic applications, but efficient design, simulation, and scheduling of such applications has not. To facilitate implementing heterogeneous applications, we utilize a new dataflow model of computation and show how actors designed in other dataflow models are directly supported by this framework, allowing system designers to immediately compose and simulate actors from different models. Using examples, we show how this approach can be applied to quickly describe and functionally simulate a heterogeneous dataflow-based application such that a designer may analyze and tune trade-offs among different models and schedules for simulation time, memory consumption, and schedule size.}, keywords = {Arithmetic and Logic Structures, Computer Communication Networks, Dataflow, heterogeneous, Input/Output and Data Communications, Logic Design, Processor Architectures, Programming Languages, Compilers, Interpreters, Signal processing}, isbn = {978-3-642-24567-1, 978-3-642-24568-8}, url = {http://link.springer.com/chapter/10.1007/978-3-642-24568-8_20}, author = {Plishker,William and Sane, Nimish and Kiemb, Mary and Bhattacharyya, Shuvra S.}, editor = {Stenstr{\"o}m, Per} } @article {13942, title = {A Hierarchical Algorithm for Fast Debye Summation with Applications to Small Angle Scattering}, journal = {Technical Reports from UMIACS}, year = {2011}, month = {2011/09/01/}, abstract = {Debye summation, which involves the summation of sinc functions of distances between all pair of atoms in three dimensional space, arises in computations performed in crystallography, small/wide angle X-ray scattering (SAXS/WAXS) and small angle neutron scattering (SANS). Direct evaluation of Debye summation has quadratic complexity, which results in computational bottleneck when determining crystal properties, or running structure refinement protocols that involve SAXS or SANS, even for moderately sized molecules. We present a fast approximation algorithm that efficiently computes the summation to any prescribed accuracy epsilon in linear time. The algorithm is similar to the fast multipole method (FMM), and is based on a hierarchical spatial decomposition of the molecule coupled with local harmonic expansions and translation of these expansions. An even more efficient implementation is possible when the scattering profile is all that is required, as in small angle scattering reconstruction (SAS) of macromolecules. We examine the relationship of the proposed algorithm to existing approximate methods for profile computations, and provide detailed description of the algorithm, including error bounds and algorithms for stable computation of the translation operators. Our theoretical and computational results show orders of magnitude improvement in computation complexity over existing methods, while maintaining prescribed accuracy.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/11857}, author = {Gumerov, Nail A. and Berlin,Konstantin and Fushman, David and Duraiswami, Ramani} } @article {19588, title = {Higher-Order Symbolic Execution via Contracts}, journal = {arXiv:1103.1362 [cs]}, year = {2011}, month = {2011/03/07/}, abstract = {We present a new approach to automated reasoning about higher-order programs by extending symbolic execution to use behavioral contracts as symbolic values, enabling symbolic approximation of higher-order behavior. Our approach is based on the idea of an abstract reduction semantics that gives an operational semantics to programs with both concrete and symbolic components. Symbolic components are approximated by their contract and our semantics gives an operational interpretation of contracts-as-values. The result is a executable semantics that soundly predicts program behavior, including contract failures, for all possible instantiations of symbolic components. We show that our approach scales to an expressive language of contracts including arbitrary programs embedded as predicates, dependent function contracts, and recursive contracts. Supporting this feature-rich language of specifications leads to powerful symbolic reasoning using existing program assertions. We then apply our approach to produce a verifier for contract correctness of components, including a sound and computable approximation to our semantics that facilitates fully automated contract verification. Our implementation is capable of verifying contracts expressed in existing programs, and of justifying valuable contract-elimination optimizations.}, keywords = {Computer Science - Programming Languages}, url = {http://arxiv.org/abs/1103.1362}, author = {Tobin-Hochstadt, Sam and David Van Horn} } @article {15505, title = {Homage to Michael Gelfond on His 65 th Birthday}, journal = {Logic programming, knowledge representation, and nonmonotonic reasoning}, year = {2011}, month = {2011///}, pages = {1 - 11}, abstract = {Michael Gelfond is one of the world leading scientists in the field of logic programming and nonmonotonic reasoning. This essay covers several aspects of Michael{\textquoteright}s personal life, starting from his birth in the USSR, through his experiences in the USSR up to the time he emigrated to the United States (U.S.). This is followed by his first experiences in the U.S.: how he became involved in logic programming and nonmonotonic reasoning and some of his major scientific achievements. Michael is a warm, generous person, and I discuss his impact on some colleagues and students. In the concluding section, I observe that starting his career with impediments in the FSU, he overcame them to become one of the top computer scientists in logic programming and nonmonotonic reasoning.}, doi = {10.1007/978-3-642-20832-4_1}, author = {Minker, Jack} } @article {18514, title = {How Many Tiers? Pricing in the Internet Transit Market}, journal = {SIGCOMM-Computer Communication Review}, volume = {41}, year = {2011}, month = {2011///}, pages = {194 - 194}, abstract = {ISPs are increasingly selling {\textquotedblleft}tiered{\textquotedblright} contracts, which offer Inter-net connectivity to wholesale customers in bundles, at rates based on the cost of the links that the traffic in the bundle is traversing. Although providers have already begun to implement and deploy tiered pricing contracts, little is known about how to structure them. Although contracts that sell connectivity on finer granularities im- prove market efficiency, they are also more costly for ISPs to im- plement and more difficult for customers to understand. Our goal is to analyze whether current tiered pricing practices in the whole- sale transit market yield optimal profits for ISPs and whether better bundling strategies might exist. In the process, we offer two contri- butions: (1) we develop a novel way of mapping traffic and topol- ogy data to a demand and cost model; and (2) we fit this model on three large real-world networks: an European transit ISP, a content distribution network, and an academic research network, and run counterfactuals to evaluate the effects of different bundling strate- gies. Our results show that the common ISP practice of structuring tiered contracts according to the cost of carrying the traffic flows (e.g., offering a discount for traffic that is local) can be suboptimal and that dividing contracts based on both traffic demand and the cost of carrying it into only three or four tiers yields near-optimal profit for the ISP. }, author = {Valancius,V. and Lumezanu,C. and Feamster, Nick and Johari,R. and Vazirani,V. V} } @conference {18677, title = {How secure are networked office devices?}, year = {2011}, month = {2011/06//}, pages = {465 - 472}, abstract = {Many office devices have a history of being networked (such as printers) and others without the same past are increasingly becoming networked (such as photocopiers). The modern networked versions of previously non-networked devices have much in common with traditional networked servers in terms of features and functions. While an organization may have policies and procedures for securing traditional network servers, securing networked office devices providing similar services can easily be overlooked. In this paper we present an evaluation of privacy and security risks found when examining over 1,800 networked office devices connected to a large university network. We use the STRIDE threat model to categorize threats and vulnerabilities and then we group the devices according to assessed risk from the perspective of the university. We found that while steps had been taken to secure some devices, many were using default or unsecured configurations.}, keywords = {computer network security, data privacy, networked office device security, privacy risk assessment, Risk management, security risk assessment, STRIDE threat model, university network}, doi = {10.1109/DSN.2011.5958259}, author = {Condon,E. and Cummins,E. and Afoulki,Z. and Michel Cukier} } @book {19354, title = {Handbook of Signal Processing Systems}, year = {2010}, month = {2010}, pages = {1099}, publisher = {Springer}, organization = {Springer}, abstract = {The Handbook is organized in four parts. The first part motivates representative applications that drive and apply state-of-the art methods for design and implementation of signal processing systems; the second part discusses architectures for implementing these applications; the third part focuses on compilers and simulation tools; and the fourth part describes models of computation and their associated design tools and methodologies.}, keywords = {Computers / Information Theory, Technology \& Engineering / Electrical, Technology \& Engineering / Signals \& Signal Processing}, isbn = {9781441963451}, author = {Bhattacharyya, Shuvra S. and Deprettere, Ed F.} } @conference {13564, title = {Handwritten Arabic text line segmentation using affinity propagation}, booktitle = {Proceedings of the 9th IAPR International Workshop on Document Analysis Systems}, series = {DAS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {135 - 142}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps - Coarse text line estimation using primary components which define the line and assignment of diacritic components which are more difficult to associate with a given line. We first estimate local orientation at each primary component to build a sparse similarity graph. We then, use a shortest path algorithm to compute similarities between non-neighboring components. From this graph, we obtain coarse text lines using two estimates obtained from Affinity propagation and Breadth-first search. In the second step, we assign secondary components to each text line. The proposed method is very fast and robust to non-uniform skew and character size variations, normally present in handwritten text lines. We evaluate our method using a pixel-matching criteria, and report 96\% accuracy on a dataset of 125 Arabic document images. We also present a proximity analysis on datasets generated by artificially decreasing the spacings between text lines to demonstrate the robustness of our approach.}, keywords = {affinity propagation, arabic, arabic documents, breadth-first search, clustering, dijkstra{\textquoteright}s shortest path algorithm, handwritten documents, line detection, text line segmentation}, isbn = {978-1-60558-773-8}, doi = {10.1145/1815330.1815348}, url = {http://doi.acm.org/10.1145/1815330.1815348}, author = {Kumar,Jayant and Abd-Almageed, Wael and Kang,Le and David Doermann} } @article {14426, title = {Higher-order graphical models for classification in social and affiliation networks}, journal = {NIPS 2010 Workshop on Networks Across Disciplines: Theory and Applications, Whistler BC, Canada}, year = {2010}, month = {2010///}, abstract = {In this work we explore the application of higher-order Markov Random Fields(MRF) to classification in social and affiliation networks. We consider both friend- ship links and group membership for inferring hidden attributes in a collective inference framework. We explore different ways of using the social groups as ei- ther node features or to construct the graphical model structure. The bottleneck in applying higher-order MRFs to a domain with many overlapping large cliques is the complexity of inference which is exponential in the size of the largest clique. To circumvent the slow inference problem, we borrow recent advancements in the computer vision community to achieve fast approximate inference results. We provide preliminary results using a dataset from facebook which suggest that our higher-order MRF models are capturing the structural dependencies in the net- works and they yield higher accuracy than linear classifiers. }, author = {Zheleva,E. and Getoor, Lise and Sarawagi,S.} } @conference {12403, title = {Holistic sentiment analysis across languages: multilingual supervised latent Dirichlet allocation}, booktitle = {Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing}, series = {EMNLP {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {45 - 55}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {In this paper, we develop multilingual supervised latent Dirichlet allocation (MlSLDA), a probabilistic generative model that allows insights gleaned from one language{\textquoteright}s data to inform how the model captures properties of other languages. MlSLDA accomplishes this by jointly modeling two aspects of text: how multilingual concepts are clustered into thematically coherent topics and how topics associated with text connect to an observed regression variable (such as ratings on a sentiment scale). Concepts are represented in a general hierarchical framework that is flexible enough to express semantic ontologies, dictionaries, clustering constraints, and, as a special, degenerate case, conventional topic models. Both the topics and the regression are discovered via posterior inference from corpora. We show MlSLDA can build topics that are consistent across languages, discover sensible bilingual lexical correspondences, and leverage multilingual corpora to better predict sentiment.}, url = {http://dl.acm.org/citation.cfm?id=1870658.1870663}, author = {Jordan Boyd-Graber and Resnik, Philip} } @article {14622, title = {Hopx and Hdac2 Interact to Modulate Gata4 Acetylation and Embryonic Cardiac Myocyte Proliferation}, journal = {Developmental Cell}, volume = {19}, year = {2010}, month = {2010/09/14/}, pages = {450 - 459}, abstract = {SummaryRegulation of chromatin structure via histone modification has recently received intense attention. Here,~we demonstrate that the chromatin-modifying enzyme histone deacetylase 2 (Hdac2) functions with a small homeodomain factor, Hopx, to mediate deacetylation of Gata4, which is expressed by cardiac progenitor cells and plays critical roles in the regulation of cardiogenesis. In the absence of Hopx and Hdac2 in mouse embryos, Gata4 hyperacetylation is associated with a marked increase in~cardiac myocyte proliferation, upregulation of Gata4 target genes, and perinatal lethality. Hdac2 physically interacts with Gata4, and this interaction is stabilized by Hopx. The ability of Gata4 to transactivate cell cycle genes is impaired by Hopx/Hdac2-mediated deacetylation, and this effect is abrogated by loss of Hdac2-Gata4 interaction. These results suggest that Gata4 is a nonhistone target of Hdac2-mediated deacetylation and that Hdac2, Hopx, and Gata4 coordinately regulate cardiac myocyte proliferation during embryonic development. }, isbn = {1534-5807}, doi = {10.1016/j.devcel.2010.08.012}, url = {http://www.sciencedirect.com/science/article/pii/S1534580710003874}, author = {Trivedi,Chinmay M. and Zhu,Wenting and Wang,Qiaohong and Jia,Cheng and Kee,Hae Jin and Li,Li and Hannenhalli, Sridhar and Epstein,Jonathan A.} } @article {14553, title = {Hat guessing games}, journal = {SIAM review}, volume = {51}, year = {2009}, month = {2009///}, pages = {399 - 413}, author = {Butler,S. and Hajiaghayi, Mohammad T. and Kleinberg,R. D and Leighton,T.} } @article {17186, title = {HEALTH AND WELLBEING}, journal = {The fourth paradigm: data-intensive scientific discovery}, year = {2009}, month = {2009///}, pages = {57 - 57}, author = {Gillam,M. and Feied,C. and MOODY,E. and Shneiderman, Ben and Smith,M. and DICKASON,J.} } @article {18222, title = {High-Fidelity Data Embedding for Image Annotation}, journal = {Image Processing, IEEE Transactions on}, volume = {18}, year = {2009}, month = {2009/02//}, pages = {429 - 435}, abstract = {High fidelity is a demanding requirement for data hiding, especially for images with artistic or medical value. This correspondence proposes a high-fidelity image watermarking for annotation with robustness to moderate distortion. To achieve the high fidelity of the embedded image, we introduce a visual perception model that aims at quantifying the local tolerance to noise for arbitrary imagery. Based on this model, we embed two kinds of watermarks: a pilot watermark that indicates the existence of the watermark and an information watermark that conveys a payload of several dozen bits. The objective is to embed 32 bits of metadata into a single image in such a way that it is robust to JPEG compression and cropping. We demonstrate the effectiveness of the visual model and the application of the proposed annotation technology using a database of challenging photographic and medical images that contain a large amount of smooth regions.}, keywords = {Automated;Product Labeling;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted;, Computer-Assisted;Information Storage and Retrieval;Pattern Recognition, JPEG compression;JPEG cropping;arbitrary imagery;data hiding;high-fidelity data embedding;image annotation;image watermarking;medical images;photographic images;data compression;image coding;watermarking;Algorithms;Computer Graphics;Documentation;Image En}, isbn = {1057-7149}, doi = {10.1109/TIP.2008.2008733}, author = {He,Shan and Kirovski,D. and M. Wu} } @book {19497, title = {HotSWUp {\textquoteright}09: Proceedings of the 2Nd International Workshop on Hot Topics in Software Upgrades}, year = {2009}, month = {2009///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {978-1-60558-723-3} } @conference {13892, title = {How children search the internet with keyword interfaces}, booktitle = {Proceedings of the 8th International Conference on Interaction Design and Children}, year = {2009}, month = {2009///}, pages = {89 - 96}, author = {Druin, Allison and Foss,E. and Hatley,L. and Golub,E. and Guha,M.L. and Fails,J. and Hutchinson,H.} } @conference {12509, title = {How would you look as you age ?}, booktitle = {Image Processing (ICIP), 2009 16th IEEE International Conference on}, year = {2009}, month = {2009/11//}, pages = {53 - 56}, abstract = {Facial appearances change with increase in age. While generic growth patterns that are characteristic of different age groups can be identified, facial growth is also observed to be influenced by individual-specific attributes such as one{\textquoteright}s gender, ethnicity, life-style etc. In this paper, we propose a facial growth model that comprises of transformation models for facial shape and texture. We collected empirical data pertaining to facial growth from a database of age-separated face images of adults and used the same in developing the aforementioned transformation models. The proposed model finds applications in predicting one{\textquoteright}s appearance across ages and in performing face verification across ages.}, keywords = {age-separated, appearances;facial, database;face, Face, growth, image, model;face, model;facial, models;facial, recognition;image, SHAPE, TEXTURE, texture;, transformation, verification;facial}, doi = {10.1109/ICIP.2009.5413998}, author = {Ramanathan,N. and Chellapa, Rama} } @conference {13099, title = {Human detection using partial least squares analysis}, booktitle = {Computer Vision, 2009 IEEE 12th International Conference on}, year = {2009}, month = {2009/10/29/2}, pages = {24 - 31}, abstract = {Significant research has been devoted to detecting people in images and videos. In this paper we describe a human detection method that augments widely used edge-based features with texture and color information, providing us with a much richer descriptor set. This augmentation results in an extremely high-dimensional feature space (more than 170,000 dimensions). In such high-dimensional spaces, classical machine learning algorithms such as SVMs are nearly intractable with respect to training. Furthermore, the number of training samples is much smaller than the dimensionality of the feature space, by at least an order of magnitude. Finally, the extraction of features from a densely sampled grid structure leads to a high degree of multicollinearity. To circumvent these data characteristics, we employ Partial Least Squares (PLS) analysis, an efficient dimensionality reduction technique, one which preserves significant discriminative information, to project the data onto a much lower dimensional subspace (20 dimensions, reduced from the original 170,000). Our human detection system, employing PLS analysis over the enriched descriptor set, is shown to outperform state-of-the-art techniques on three varied datasets including the popular INRIA pedestrian dataset, the low-resolution gray-scale DaimlerChrysler pedestrian dataset, and the ETHZ pedestrian dataset consisting of full-length videos of crowded scenes.}, doi = {10.1109/ICCV.2009.5459205}, author = {Schwartz,William Robson and Kembhavi,Aniruddha and Harwood,David and Davis, Larry S.} } @conference {14321, title = {HydroSense: infrastructure-mediated single-point sensing of whole-home water activity}, booktitle = {Proceedings of the 11th international conference on Ubiquitous computing, September}, year = {2009}, month = {2009///}, author = {Jon Froehlich and Larson,E. and Campbell,T. and Haggerty,C. and Fogarty,J. and Patel,S.N.} } @article {14135, title = {H (div) preconditioning for a mixed finite element formulation of the stochastic diffusion problem}, year = {2008}, month = {2008///}, institution = {Citeseer}, author = {Elman, Howard and Furnival, D. G and Powell, C. E} } @article {15123, title = {Handling expected polynomial-time strategies in simulation-based security proofs}, journal = {Journal of Cryptology}, volume = {21}, year = {2008}, month = {2008///}, pages = {303 - 349}, abstract = {The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also considered. For example, there are many zero-knowledge protocols for which the only known simulation techniques run in expected (and not strict) polynomial time. In addition, it has been shown that expected polynomial-time simulation is essential for achieving constant-round black-box zero-knowledge protocols. This reliance on expected polynomial-time simulation introduces a number of conceptual and technical difficulties. In this paper, we develop techniques for dealing with expected polynomial-time adversaries in simulation-based security proofs.}, doi = {10.1007/s00145-007-9004-8}, author = {Katz, Jonathan and Lindell,Y.} } @book {13565, title = {Handwritten Document Image Processing}, year = {2008}, month = {2008///}, publisher = {VDMVerlang Dr. Muller}, organization = {VDMVerlang Dr. Muller}, author = {Yefeng Zheng and David Doermann and Huiping Li} } @article {12565, title = {Hardware and Software Systems for Image and Video Processing-Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering}, journal = {IEEE Transactions on Image Processing}, volume = {17}, year = {2008}, month = {2008///}, pages = {737 - 748}, author = {Sankaranarayanan,A. C and Srivastava, A. and Chellapa, Rama} } @article {14788, title = {Hardware monitors for dynamic page migration}, journal = {Journal of Parallel and Distributed Computing}, volume = {68}, year = {2008}, month = {2008/09//}, pages = {1186 - 1200}, abstract = {In this paper, we first introduce a profile-driven online page migration scheme and investigate its impact on the performance of multithreaded applications. We use centralized lightweight, inexpensive plug-in hardware monitors to profile the memory access behavior of an application, and then migrate pages to memory local to the most frequently accessing processor. We also investigate the use of several other potential sources of data gathered from hardware monitors and compare their effectiveness to using data from centralized hardware monitors. In particular, we investigate the effectiveness of using cache miss profiles, Translation Lookaside Buffer (TLB) miss profiles and the content of the on-chip TLBs using the valid bit information. Moreover, we also introduce a modest hardware feature, called Address Translation Counters (ATC), and compare its effectiveness with other sources of hardware profiles.Using the Dyninst runtime instrumentation combined with hardware monitors, we were able to add page migration capabilities to a Sun Fire 6800 server without having to modify the operating system kernel, or to re-compile application programs. Our dynamic page migration scheme reduced the total number of non-local memory accesses of applications by up to 90\% and improved the execution times up to 16\%. We also conducted a simulation based study and demonstrated that cache miss profiles gathered from on-chip CPU monitors, which are typically available in current microprocessors, can be effectively used to guide dynamic page migrations in applications. }, keywords = {Address translation counters, cc-NUMA systems, Dynamic page migration, Full system simulation, Hardware performance monitors, High performance computing, Multiprocessor systems, OpenMP applications, Runtime optimization}, isbn = {0743-7315}, doi = {16/j.jpdc.2008.05.006}, url = {http://www.sciencedirect.com/science/article/pii/S0743731508001020}, author = {Tikir, Mustafa M. and Hollingsworth, Jeffrey K} } @conference {19450, title = {Hci for community and international development}, booktitle = {SIGCHI EA {\textquoteright}08}, series = {CHI EA {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {3909 - 3912}, publisher = {ACM}, organization = {ACM}, abstract = {This workshop explores the challenges in applying, extending and inventing appropriate methods and contributions of Human Computer Interaction (HCI) to International economic and community Development. We address interaction design for parts of the world that are often marginalized by the Global North as well as people in the Global North who are themselves similarly marginalized by poverty or other barriers. We hope to extend the boundaries of the field of Human Computer Interaction by spurring a discussion on how existing methods and practices can be adapted and modified, and how new practices can be developed, to deal with the unique challenges posed by these contexts.}, keywords = {community design, ict4d, information and communication technology, international development, participatory design, ucd4id, User centered design}, isbn = {978-1-60558-012-8}, url = {http://doi.acm.org/10.1145/1358628.1358954}, author = {Thomas, John and Dearden, Andy and Dray, Susan and Light, Ann and Best, Michael and Arkin, Nuray and Maunder, Andrew and Kam, Mathew and Marshini Chetty and Sambasivan, Nithya and Buckhalter, Celeste and Krishnan, Gaurishankar} } @article {16844, title = {Hierarchical infrastructure for internet mapping services}, journal = {Geospatial Services and Applications for the Internet}, year = {2008}, month = {2008///}, pages = {1 - 30}, doi = {10.1007/978-0-387-74674-6_1}, author = {Brabec,F. and Samet, Hanan} } @conference {13263, title = {A hierarchical spatial index for triangulated surfaces}, booktitle = {Int. Conf. on Computer Graphics Theory and Applications (GRAPP)}, year = {2008}, month = {2008///}, pages = {86 - 91}, abstract = {We present the PM2-Triangle quadtree (PM2T-quadtree), a new hierarchical spatial index for triangle mesheswhich has been designed for performing spatial queries on triangle-based terrain models. The PM2T-quadtree is based on a recursive space decomposition into square blocks. Here, we propose a highly compact data structure encoding a PM2T-quadtree, which decouples the spatial indexing structure from the combinatorial description of the mesh. We compare the PM2T-quadtree against other spatial indexes by considering the structure of the underlying domain subdivision, the storage costs of their data structures and the performance in geometric queries. }, author = {De Floriani, Leila and Facinoli,M. and Magillo,P. and Dimitri,D.} } @article {14970, title = {High Performance Computing Algorithms for Land Cover}, year = {2008}, month = {2008///}, institution = {CiteSeerX}, abstract = {Global and regional land cover studies require the ability to apply complex models on selected subsets of large amounts of multi-sensor and multi-temporal data sets that have been derived from raw instrument measurements using widely accepted pre-processing algorithms. The computational and storage requirements of most such studies far exceed what is possible on a single workstation environment. We have been pursuing a new approach that couples scalable and open distributed heterogeneous hardware with the development of high performance software for processing, indexing, and organizing remotely sensed data. Hierarchical data management tools are used to ingest raw data, create metadata, and organize the archived data so as to automatically achieve computational load balancing among the available nodes and minimize I/O overheads. We illustrate our approach with four specific examples. The first is the development of the first fast operational scheme for the atmospheric correction of Landsat TM scenes, while the second example focuses on image segmentation using a novel hierarchical connected components algorithm. Retrieval of global BRDF (Bidirectional Reflectance Distribution Function) in the red and near infrared wavelengths using four years (1983 to 1986) of Pathfinder AVHRR Land (PAL) data set is the focus of our third example. The fourth example is the development of a hierarchical data organization scheme that allows on-demand processing and retrieval of regional and global AVHRR data sets. Our results show that substantial improvements in computational times can be achieved by using the high performance computing technology.}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.4213}, author = {Dynamics Using Remote and Satya Kalluri and Bader,David A. and John Townshend and JaJa, Joseph F. and Zengyan Zhang and Fallah-adl,Hassan} } @conference {16836, title = {High-Dimensional Similarity Retrieval Using Dimensional Choice}, booktitle = {Similarity Search and Applications, 2008. SISAP 2008. First International Workshop on}, year = {2008}, month = {2008/04//}, pages = {35 - 42}, abstract = {There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information is the distribution of the data itself but the use of dimensional choice based on the information in the query as well as the parameters of the distribution can provide an effective improvement in the query processing speed and storage. The use of this method can produce dimension reduction by as much as a factor of n, the number of data points in the database, over sequential search. We demonstrate that the curse of dimensionality is not based on the dimension of the data itself, but primarily upon the effective dimension of the distance function. We also introduce a new distance function that utilizes fewer dimensions of the higher dimensional space to produce a maximal lower bound distance in order to approximate the full distance function. This work has demonstrated significant dimension reduction, up to 70\% reduction with an improvement in accuracy or over 99\% with only a 6\% loss in accuracy on a prostate cancer data set.}, keywords = {data, database, function;high-dimensional, management, processing;, processing;sequential, reduction;database, reduction;distance, retrieval;query, search;data, search;similarity, similarity, system;dimension, systems;query}, doi = {10.1109/SISAP.2008.20}, author = {Tahmoush,D. and Samet, Hanan} } @article {18492, title = {Hosting virtual networks on commodity hardware}, volume = {GT-CS-07-10}, year = {2008}, month = {2008///}, institution = {Georgia Institute of Technology}, abstract = {This paper describes Trellis, a software platform for hostingmultiple virtual networks on shared commodity hardware. Trellis allows each virtual network to define its own topol- ogy, control protocols, and forwarding tables, which low- ers the barrier for deploying custom services on an isolated, reconfigurable, and programmable network, while amor- tizing costs by sharing the physical infrastructure. Trellis synthesizes two container-based virtualization technologies, VServer and NetNS, as well as a new tunneling mechanism, EGRE, into a coherent platform that enables high-speed vir- tual networks. We describe the design and implementation, of Trellis, including kernel-level performance optimizations, and evaluate its supported packet-forwarding rates against other virtualization technologies. We are in the process of upgrading the VINI facility to use Trellis. We also plan to release Trellis as part of MyVINI, a standalone software dis- tribution that allows researchers and application developers to deploy their own virtual network hosting platforms. }, author = {Bhatia,S. and Motiwala,M. and Muhlbauer,W. and Valancius,V. and Bavier,A. and Feamster, Nick and Peterson,L. and Rexford,J.} } @book {19496, title = {HotSWUp {\textquoteright}08: Proceedings of the 1st International Workshop on Hot Topics in Software Upgrades}, year = {2008}, month = {2008///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {978-1-60558-304-4} } @article {15324, title = {How Do Users Find Things with PubMed? Towards Automatic Utility Evaluation with User Simulations}, year = {2008}, month = {2008/02//}, institution = {Human-Computer Interaction Lab, University of Maryland, College Park}, abstract = {In the context of document retrieval in the biomedical domain, this paper explores the complex relationship between the quality of initial query results and the overall utility of an interactive system. We demonstrate that a content-similarity browsing tool can compensate for poor retrieval results, and that the relationship between retrieval performance and overall utility is non-linear. Arguments are advanced with user simulations, which characterize the relevance of documents that a user might encounter with different browsing strategies. With broader implications to IR, this work provides a case study of how user simulations can be exploited as a formative tool for automatic utility evaluation. Simulation-based studies provide researchers with an additional evaluation tool to complement interactive and Cranfield-style experiments.}, keywords = {*BIOMEDICAL INFORMATION SYSTEMS, *BROWSING, *INFORMATION RETRIEVAL, *PUBMED, *SIMILARITY, *SIMULATION, *USER NEEDS, DOCUMENTS, FIND-SIMILAR, HUMAN FACTORS ENGINEERING \& MAN MACHINE SYSTEM, INFORMATION SCIENCE, MAN COMPUTER INTERFACE, QUALITY, queries, searching, TEST AND EVALUATION, UTILITY}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA478703}, author = {Jimmy Lin and Smucker,Mark D.} } @article {14514, title = {How friendship links and group memberships affect the privacy of individuals in social networks}, volume = {UMIACS-TR-2008-16}, year = {2008}, month = {2008/07/01/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In order to address privacy concerns, many social media websites allow users to hide their personal profiles from the public. In this work, we show how an adversary can exploit a social network with a mixture of public and private user profiles to predict the private attributes of users. We map this problem to a relational classification problem and we propose a simple yet powerful model that uses group features and group memberships of users to perform multi-value classification. We compare its efficacy against several other classification approaches. Our results show that even in the case when there is an option for making profile attributes private, if links and group affiliations are known, users{\textquoteright} privacy in social networks may be compromised. On a dataset from a well-known social-media website, we could easily recover the sensitive attributes for half of the private-profile users with a high accuracy when as much as half of the profiles are private. To the best of our knowledge, this is the first work that uses link-based and group-based classification to study privacy implications in social networks. We conclude with a discussion of our findings and the broader applicability of our proposed model.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/8691}, author = {Zheleva,Elena and Getoor, Lise} } @article {15102, title = {How to encrypt with a malicious random number generator}, journal = {Fast Software Encryption}, year = {2008}, month = {2008///}, pages = {303 - 315}, abstract = {Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that are generated uniformly at random and independently of anything else. This leaves open the possibility of attacks in case the random coins are poorly generated (e.g., using a faulty random number generator), or are under partial adversarial control (e.g., when encryption is done by lightweight devices that may be captured and tampered with).We introduce new notions of security modeling such attacks, propose two concrete schemes meeting our definitions, and show generic transformations for achieving security in this context. }, doi = {10.1007/978-3-540-71039-4_19}, author = {Kamara,S. and Katz, Jonathan} } @article {13438, title = {How to succeed in graduate school: a guide for students and advisors}, journal = {Crossroads}, volume = {14}, year = {2008}, month = {2008/06//}, pages = {5 - 9}, isbn = {1528-4972}, doi = {10.1145/1375972.1375975}, url = {http://doi.acm.org/10.1145/1375972.1375975}, author = {desJardins, Marie} } @conference {13124, title = {Human detection using iterative feature selection and logistic principal component analysis}, booktitle = {Robotics and Automation, 2008. ICRA 2008. IEEE International Conference on}, year = {2008}, month = {2008/05//}, pages = {1691 - 1697}, abstract = {We present a fast feature selection algorithm suitable for object detection applications where the image being tested must be scanned repeatedly to detected the object of interest at different locations and scales. The algorithm iteratively estimates the belongness probability of image pixels to foreground of the image. To prove the validity of the algorithm, we apply it to a human detection problem. The edge map is filtered using a feature selection algorithm. The filtered edge map is then projected onto an eigen space of human shapes to determine if the image contains a human. Since the edge maps are binary in nature, Logistic Principal Component Analysis is used to obtain the eigen human shape space. Experimental results illustrate the accuracy of the human detector.}, keywords = {algorithm;logistic, analysis;edge, analysis;probability;, applications;principal, belongness, component, DETECTION, detection;feature, detection;iterative, detection;principal, extraction;filtering, feature, filtering;human, MAP, methods;object, PCA;object, probability;edge, selection, theory;iterative}, doi = {10.1109/ROBOT.2008.4543444}, author = {Abd-Almageed, Wael and Davis, Larry S.} } @article {17183, title = {Hawkeye: an interactive visual analytics tool for genome assemblies}, journal = {Genome Biology}, volume = {8}, year = {2007}, month = {2007/03/09/}, pages = {R34 - R34}, abstract = {Genome sequencing remains an inexact science, and genome sequences can contain significant errors if they are not carefully examined. Hawkeye is our new visual analytics tool for genome assemblies, designed to aid in identifying and correcting assembly errors. Users can analyze all levels of an assembly along with summary statistics and assembly metrics, and are guided by a ranking component towards likely mis-assemblies. Hawkeye is freely available and released as part of the open source AMOS project http://amos.sourceforge.net/hawkeye.}, isbn = {1465-6906}, doi = {10.1186/gb-2007-8-3-r34}, url = {http://genomebiology.com/2007/8/3/R34}, author = {Schatz,Michael C and Phillippy,Adam M and Shneiderman, Ben and Salzberg,Steven L.} } @conference {19451, title = {HCI4D: hci challenges in the global south}, booktitle = {SIGCHI EA {\textquoteright}07}, series = {CHI EA {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {2327 - 2332}, publisher = {ACM}, organization = {ACM}, abstract = {While researchers have designed user-centered systems for the Global South, fewer have discussed the unique challenges facing HCI projects. In this paper, we describe methodological and practical challenges for HCI research and practice in the Global South.}, keywords = {global south, hci, methodologies}, isbn = {978-1-59593-642-4}, url = {http://doi.acm.org/10.1145/1240866.1241002}, author = {Marshini Chetty and Grinter, Rebecca E.} } @article {13437, title = {Heuristic Search and Information Visualization Methods for School Redistricting}, journal = {AI Magazine}, volume = {28}, year = {2007}, month = {2007/09/15/}, pages = {59 - 59}, abstract = {We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a county or school district. This is a multicriteria optimization problem in which competing objectives, such as school capacity, busing costs, and socioeconomic distribution, must be considered. Because of the complexity of the decision-making problem, tools are needed to help end users generate, evaluate, and compare alternative school assignment plans. A key goal of our research is to aid users in finding multiple qualitatively different redistricting plans that represent different trade-offs in the decision space. We present heuristic search methods that can be used to find a set of qualitatively different plans, and give empirical results of these search methods on population data from the school district of Howard County, Maryland. We show the resulting plans using novel visualization methods that we have developed for summarizing and comparing alternative plans.}, isbn = {0738-4602}, doi = {10.1609/aimag.v28i3.2055}, url = {https://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/2055}, author = {desJardins, Marie and Bulka,Blazej and Carr,Ryan and Jordan,Eric and Rheingans,Penny} } @conference {13139, title = {Hierarchical Part-Template Matching for Human Detection and Segmentation}, booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on}, year = {2007}, month = {2007/10//}, pages = {1 - 8}, abstract = {Local part-based human detectors are capable of handling partial occlusions efficiently and modeling shape articulations flexibly, while global shape template-based human detectors are capable of detecting and segmenting human shapes simultaneously. We describe a Bayesian approach to human detection and segmentation combining local part-based and global template-based schemes. The approach relies on the key ideas of matching a part-template tree to images hierarchically to generate a reliable set of detection hypotheses and optimizing it under a Bayesian MAP framework through global likelihood re-evaluation and fine occlusion analysis. In addition to detection, our approach is able to obtain human shapes and poses simultaneously. We applied the approach to human detection and segmentation in crowded scenes with and without background subtraction. Experimental results show that our approach achieves good performance on images and video sequences with severe occlusion.}, keywords = {analysis;global, approach;background, articulations;video, Bayesian, detection;human, detectors;hierarchical, detectors;partial, framework;Bayesian, human, likelihood, MAP, matching;human, matching;image, methods;image, occlusion, occlusions;shape, part-based, part-template, re-evaluation;global, segmentation;image, segmentation;local, sequences;, sequences;Bayes, SHAPE, subtraction;fine, template-based}, doi = {10.1109/ICCV.2007.4408975}, author = {Zhe Lin and Davis, Larry S. and David Doermann and DeMenthon,D.} } @article {14002, title = {High frequency acoustic simulations via FMM accelerated BEM}, journal = {19th Internal congress on acoustics}, volume = {159}, year = {2007}, month = {2007///}, abstract = {High frequency simulations of acoustics are among the most expensive problems to simulate. Inpractice 6 to 10 points per wavelength are required. Since the wavenumber k is inversely proportional to wavelength, if a numerical method is a surface based method (such as the BEM), then problem size scales as O(k2D2), where D is the size of the domain. Dense matrices appear and typical iter- ative solution can be achieved for O(k4D4) memory and O(k4D4) per iteration cost. We employ an algorithm based on the fast multipole method (FMM) using coaxial and diagonal translation operators based on the frequency of simulation to reduce the memory requirements and per iteration cost to O(k2D2 log kD) for larger kD (kD ~250). The number of iterations needed depend upon the condition of the matrix, and preconditioning chosen. Preconditioned Krylov methods such as the flexible gen- eralized minimum residual method (FGMRES), with preconditioning based upon a lower accuracy FMM, usually ensure a convergent iteration. Example calculations are presented. }, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {17905, title = {High-throughput sequence alignment using Graphics Processing Units}, journal = {BMC Bioinformatics}, volume = {8}, year = {2007}, month = {2007///}, pages = {474 - 474}, isbn = {1471-2105}, doi = {10.1186/1471-2105-8-474}, url = {http://www.biomedcentral.com/1471-2105/8/474}, author = {Schatz,Michael C and Trapnell,Cole and Delcher,Arthur L. and Varshney, Amitabh} } @article {15959, title = {HIV risk behaviors among female IDUs in developing and transitional countries}, journal = {BMC Public Health}, volume = {7}, year = {2007}, month = {2007///}, author = {Charles,C. and Des Jarlais Don,P. T and Gerry,S.} } @conference {18573, title = {Holding the Internet Accountable}, booktitle = {Proc. 6th ACM Workshop on Hot Topics in Networks (Hotnets-VI)}, year = {2007}, month = {2007/11/01/}, abstract = {Today{\textquoteright}s IP network layer provides little to no protection against misconfiguration or malice. Despite some progress in improving the robustness and security of the IP layer, misconfigurations and attacks still occur frequently. We show how a network layer that provides accountability, i.e., the ability to associate each action with the responsible entity, provides a firm foundation for defenses against misconfiguration and malice. We present the design of a network layer that incorporates accountability called AIP (Accountable Internet Protocol) and show how its features{\textemdash}notably, its use of self-certifying addresses{\textemdash} can improve both source accountability (the ability to trace actions to a particular end host and stop that host from misbehaving) and control-plane accountability (the ability to pinpoint and prevent attacks on routing).}, url = {http://repository.cmu.edu/compsci/66}, author = {Andersen,David and Balakrishnan,Hari and Feamster, Nick and Koponen,Teemu and Moon,Daekyong and Shenker,Scott} } @conference {15986, title = {Hood College, Master of Business Administration, 2005 Hood College, Master of Science (Computer Science), 2001 Hood College, Bachelor of Science (Computer Science), 1998 Frederick Community College, Associate in Arts (Business Administration), 1993}, booktitle = {Proceedings of the Workshop on Metareasoning in Agent-Based Systems}, year = {2007}, month = {2007///}, author = {Anderson,M. L and Schmill,M. and Oates,T. and Perlis, Don and Josyula,D. and Wright,D. and Human,S. W.T.D.N and Metacognition,L. and Fults,S. and Josyula,D. P} } @inbook {19453, title = {How Smart Homes Learn: The Evolution of the Networked Home and Household}, booktitle = {UbiComp 2007: Ubiquitous Computing}, series = {Lecture Notes in Computer Science}, year = {2007}, month = {2007/01/01/}, pages = {127 - 144}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Despite a growing desire to create smart homes, we know little about how networked technologies interact with a house{\textquoteright}s infrastructure. In this paper, we begin to close this gap by presenting findings from a study that examined the relationship between home networking and the house itself{\textemdash}and the work that results for householders as a consequence of this interaction. We discuss four themes that emerged: an ambiguity in understanding the virtual boundaries created by wireless networks, the home network control paradox, a new home network access paradox, and the relationship between increased responsibilities and the possibilities of wireless networking.}, keywords = {Computer Communication Networks, computers and society, home networking, Information Systems Applications (incl.Internet), infrastructure, smart home, software engineering, Systems and Data Security, User Interfaces and Human Computer Interaction}, isbn = {978-3-540-74852-6, 978-3-540-74853-3}, url = {http://link.springer.com/chapter/10.1007/978-3-540-74853-3_8}, author = {Marshini Chetty and Sung, Ja-Young and Grinter, Rebecca E.}, editor = {Krumm, John and Abowd, Gregory D. and Seneviratne, Aruna and Strang, Thomas} } @article {18574, title = {How to lease the internet in your spare time}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {37}, year = {2007}, month = {2007/01//}, pages = {61 - 64}, abstract = {Today{\textquoteright}s Internet Service Providers (ISPs) serve two roles: managing their network infrastructure and providing (arguably limited) services to end users. We argue that coupling these roles impedes the deployment of new protocols and architectures, and that the future Internet should support two separate entities: infrastructure providers (who manage the physical infrastructure) and service providers (who deploy network protocols and offer end-to-end services). We present a high-level design for Cabo, an architecture that enables this separation; we also describe challenges associated with realizing this architecture.}, isbn = {0146-4833}, doi = {10.1145/1198255.1198265}, url = {http://doi.acm.org/10.1145/1198255.1198265}, author = {Feamster, Nick and Gao,Lixin and Rexford,Jennifer} } @article {13151, title = {Human activity understanding using visibility context}, journal = {IEEE/RSJ IROS Workshop: From sensors to human spatial concepts (FS2HSC)}, year = {2007}, month = {2007///}, abstract = {Visibility in architectural layouts affects humannavigation, so a suitable representation of visibility context is useful in understanding human activity. Motivated by studies of spatial behavior, we use a set of features from visibility analysis to represent spatial context in the interpretation of human activity. An agent{\textquoteright}s goal, belief about the world, trajectory and visible layout are considered to be random variables that evolve with time during the agent{\textquoteright}s movement, and are modeled in a Bayesian framework. We design a search-based task in a sprite-world, and compare the results of our framework to those of human subject experiments. Our findings confirm that knowledge of spatial layout improves human interpretations of the trajectories (implying that visibility context is useful in this task). Since our framework demonstrates performance close to that of human subjects with knowledge of spatial layout, our findings confirm that our model makes adequate use of visibility context. In addition, the representation we use for visibility context allows our model to generalize well when presented with new scenes. }, author = {Morariu,V.I. and Prasad,V. S.N and Davis, Larry S.} } @conference {13144, title = {Human Appearance Change Detection}, booktitle = {Image Analysis and Processing, 2007. ICIAP 2007. 14th International Conference on}, year = {2007}, month = {2007/09//}, pages = {536 - 541}, abstract = {We present a machine learning approach to detect changes in human appearance between instances of the same person that may be taken with different cameras, but over short periods of time. For each video sequence of the person, we approximately align each frame in the sequence and then generate a set of features that captures the differences between the two sequences. The features are the occupancy difference map, the codeword frequency difference map (based on a vector quantization of the set of colors and frequencies) at each aligned pixel and the histogram intersection map. A boosting technique is then applied to learn the most discriminative set of features, and these features are then used to train a support vector machine classifier to recognize significant appearance changes. We apply our approach to the problem of left package detection. We train the classifiers on a laboratory database of videos in which people are seen with and without common articles that people carry - backpacks and suitcases. We test the approach on some real airport video sequences. Moving to the real world videos requires addressing additional problems, including the view selection problem and the frame selection problem.}, keywords = {(artificial, appearance, approach;occupancy, change, changes, classification;support, classifier;vector, detection;image, detection;machine, difference, Frequency, intelligence);pattern, intersection, learning, machine, machines;vector, map;histogram, map;human, map;support, package, quantisation;video, quantization;video, recognition;boosting, recognition;image, sequence;left, sequences;image, sequences;learning, surveillance;, technique;codeword, vector}, doi = {10.1109/ICIAP.2007.4362833}, author = {Ghanem,N.M. and Davis, Larry S.} } @article {13149, title = {Human appearance modeling for matching across video sequences}, journal = {Machine Vision and Applications}, volume = {18}, year = {2007}, month = {2007///}, pages = {139 - 149}, abstract = {We present an appearance model for establishing correspondence between tracks of people which may be taken at different places, at different times or across different cameras. The appearance model is constructed by kernel density estimation. To incorporate structural information and to achieve invariance to motion and pose, besides color features, an additional feature of path-length is used. To achieve illumination invariance, two types of illumination insensitive color features are discussed: brightness color feature and RGB rank feature. The similarity between a test image and an appearance model is measured by the information gain or Kullback{\textendash}Leibler distance. To thoroughly represent the information contained in a video sequence with as little data as possible, a key frame selection and matching scheme is proposed. Experimental results demonstrate the important role of the path-length feature in the appearance model and the effectiveness of the proposed appearance model and matching method.}, author = {Yu,Y. and Harwood,D. and Yoon,K. and Davis, Larry S.} } @conference {12585, title = {Human Identification using Gait and Face}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 2}, abstract = {In general the visual-hull approach for performing integrated face and gait recognition requires at least two cameras. In this paper we present experimental results for fusion of face and gait for the single camera case. We considered the NIST database which contains outdoor face and gait data for 30 subjects. In the NIST database, subjects walk along an inverted Sigma pattern. In (A. Kale, et al., 2003), we presented a view-invariant gait recognition algorithm for the single camera case along with some experimental evaluations. In this chapter we present the results of our view-invariant gait recognition algorithm in (A. Kale, et al., 2003) on the NIST database. The algorithm is based on the planar approximation of the person which is valid when the person walks far away from the camera. In (S. Zhou et al., 2003), an algorithm for probabilistic recognition of human faces from video was proposed and the results were demonstrated on the NIST database. Details of these methods can be found in the respective papers. We give an outline of the fusion strategy here.}, keywords = {algorithm;visual-hull, analysis;image, approach;cameras;face, approximation;probabilistic, database;camera;face, databases;, fusion;face, fusion;human, fusion;probability;video, Gait, identification;planar, NIST, processing;visual, recognition, recognition;gait, recognition;view-invariant, signal}, doi = {10.1109/CVPR.2007.383523}, author = {Chellapa, Rama and Roy-Chowdhury, A.K. and Kale, A.} } @article {17203, title = {Human Responsibility for Autonomous Agents}, journal = {IEEE Intelligent Systems}, volume = {22}, year = {2007}, month = {2007/04//March}, pages = {60 - 61}, abstract = {Automated or autonomous systems can sometimes fail harmlessly, but they can also destroy data, compromise privacy, and consume resources, such as bandwidth or server capacity. What{\textquoteright}s more troubling is that automated systems embedded in vital systems can cause financial losses, destruction of property, and loss of life. Controlling these dangers will increase trust while enabling broader use of these systems with higher degrees of safety. Obvious threats stem from design errors and software bugs, but we can{\textquoteright}t overlook mistaken assumptions by designers, unanticipated actions by humans, and interference from other computerized systems. This article is part of a special issue on Interacting with Autonomy.}, keywords = {Automatic control, Autonomous agents, autonomous systems, Bandwidth, Computer bugs, Computer errors, Control systems, data privacy, Human-computer interaction, HUMANS, Robots, Safety, Software design}, isbn = {1541-1672}, doi = {10.1109/MIS.2007.32}, author = {Shneiderman, Ben} } @inbook {17208, title = {Human Values for Shaping the Made World}, booktitle = {Human-Computer Interaction {\textendash} INTERACT 2007Human-Computer Interaction {\textendash} INTERACT 2007}, series = {Lecture Notes in Computer Science}, volume = {4662}, year = {2007}, month = {2007///}, pages = {1 - 1}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Interface design principles have been effective in shaping new desktop applications, web-based resources, and mobile devices. Usability and sociability promote successful online communities and social network services. The contributions of human-computer interaction researchers have been effective in raising the quality of design of many products and services. As our influence grows, we can play an even more profound role in guaranteeing that enduring human values are embedded in the next generation of technology. This talk identifies which goals are realistic, such as universality, responsibility, trust, empathy, and privacy, and how we might ensure that they become part of future services and systems.}, isbn = {978-3-540-74794-9}, url = {http://dx.doi.org/10.1007/978-3-540-74796-3_1}, author = {Shneiderman, Ben}, editor = {Baranauskas,C{\'e}cilia and Palanque,Philippe and Abascal,Julio and Barbosa,Simone} } @article {12573, title = {Hybrid Detectors for Subpixel Targets}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {29}, year = {2007}, month = {2007/11//}, pages = {1891 - 1903}, abstract = {Subpixel detection is a challenging problem in hyperspectral imagery analysis. Since the target size is smaller than the size of a pixel, detection algorithms must rely solely on spectral information. A number of different algorithms have been developed over the years to accomplish this task, but most detectors have taken either a purely statistical or a physics-based approach to the problem. We present two new hybrid detectors that take advantage of these approaches by modeling the background using both physics and statistics. Results demonstrate improved performance over the well-known AMSD and ACE subpixel algorithms in experiments that include multiple targets, images, and area types - especially when dealing with weak targets in complex backgrounds.}, keywords = {ACE subpixel algorithm;AMSD subpixel algorithm;hybrid detectors;hyperspectral imagery analysis;physics;statistics;subpixel target detection;subspace detection;object detection;spectral analysis;statistical analysis;target tracking;Algorithms;Artificial In, Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted;, Computer-Assisted;Models, Computer-Assisted;Pattern Recognition, Statistical;Image Enhancement;Image Interpretation, Statistical;Numerical Analysis}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2007.1104}, author = {Broadwater, J. and Chellapa, Rama} } @article {12590, title = {Hyperstereo algorithms for the perception of terrain drop-offs}, journal = {Proceedings of SPIE}, volume = {6557}, year = {2007}, month = {2007/04/27/}, pages = {65570L-65570L-10 - 65570L-65570L-10}, abstract = {The timely detection of terrain drop-offs is critical for safe and efficient off-road mobility, whether with human drivers or with terrain navigation systems that use autonomous machine-vision. In this paper, we propose a joint tracking and detection machine-vision approach for accurate and efficient terrain drop-off detection and localization. We formulate the problem using a hyperstereo camera system and build an elevation map using the range map obtained from a stereo algorithm. A terrain drop-off is then detected with the use of optimal drop-off detection filters applied to the range map. For more robust results, a method based on multi-frame fusion of terrain drop-off evidence is proposed. Also presented is a fast, direct method that does not employ stereo disparity mapping. We compared our algorithm{\textquoteright}s detection of terrain drop-offs with time-code data from human observers viewing the same video clips in stereoscopic 3D. The algorithm detected terrain drop-offs an average of 9 seconds sooner, or 12m farther, than the human observers. This suggests that passive image-based hyperstereo machine-vision may be useful as an early warning system for off-road mobility.}, isbn = {0277786X}, doi = {doi:10.1117/12.721066}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/6557/1/65570L_1?isAuthorized=no}, author = {Mohananchettiar,Arunkumar and Cevher,Volkan and CuQlock-Knopp,Grayson and Chellapa, Rama and Merritt,John} } @conference {14007, title = {Headphone-Based Reproduction of 3D Auditory Scenes Captured by Spherical/Hemispherical Microphone Arrays}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {5}, year = {2006}, month = {2006/05//}, pages = {V - V}, abstract = {We propose a method to reproduce 3D auditory scenes captured by spherical microphone arrays over headphones. This algorithm employs expansions of the captured sound and the head related transfer function over the sphere and uses the orthonormality of the spherical harmonics. Using a spherical microphone array, we first record the 3D auditory scene, then the recordings are spatially filtered and reproduced through headphones in the orthogonal beam-space of the head related transfer functions (HRTFs). We use the KEMAR HRTF measurements to verify our algorithm}, keywords = {3D, analysis;headphones;microphone, arrays;orthogonal, arrays;spatial, auditory, beam-space;spatial, filter;spherical, filters;, function;headphone-based, harmonics;array, microphone, processing;audio, processing;harmonic, related, reproduction;hemispherical, scenes;head, signal, transfer}, doi = {10.1109/ICASSP.2006.1661281}, author = {Zhiyun Li and Duraiswami, Ramani} } @article {14012, title = {Head-related transfer functions via the fast multipole accelerated boundary element method}, journal = {The Journal of the Acoustical Society of America}, volume = {120}, year = {2006}, month = {2006///}, pages = {3342 - 3343}, abstract = {Computation of head-related transfer functions (HRTF) via geometrical meshes and numerical methods has been suggested by a number of authors. An issue facing this approach is the large computational time needed for high frequencies, where the discretization must include hundreds of thousands of elements. Conventional computational methods are unable to achieve such computations without excessive time or memory. We use a newly developed fast multipole accelerated boundary element method (FMM/BEM) that scales linearly both in time and memory. The method is applied to the mesh of the widely used KEMAR manikin and its HRTF computed up to 20 kHz. The results are compared with available experimental measurements.}, url = {http://link.aip.org/link/?JAS/120/3342/6}, author = {Gumerov, Nail A. and Duraiswami, Ramani and Zotkin,Dmitry N} } @conference {13436, title = {Heuristic search and information visualization methods for school redistricting}, booktitle = {Proceedings of the 18th conference on Innovative applications of artificial intelligence - Volume 2}, series = {IAAI{\textquoteright}06}, year = {2006}, month = {2006///}, pages = {1774 - 1781}, publisher = {AAAI Press}, organization = {AAAI Press}, abstract = {We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a county or school district. This is a multicriteria optimization problem in which competing objectives must be considered, such as school capacity, busing costs, and socioeconomic distribution. Because of the complexity of the decision-making problem, tools are needed to help end users generate, evaluate, and compare alternative school assignment plans. A key goal of our research is to aid users in finding multiple qualitatively different redistricting plans that represent different tradeoffs in the decision space.We present heuristic search methods that can be used to find a set of qualitatively different plans, and give empirical results of these search methods on population data from the school district of Howard County, Maryland. We show the resulting plans using novel visualization methods that we have developed for summarizing and comparing alternative plans. }, isbn = {978-1-57735-281-5}, url = {http://dl.acm.org/citation.cfm?id=1597122.1597136}, author = {desJardins, Marie and Bulka,Blazej and Carr,Ryan and Hunt,Andrew and Rathod,Priyang and Rheingans,Penny} } @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} } @article {12814, title = {High-confidence medical device software and systems}, journal = {Computer}, volume = {39}, year = {2006}, month = {2006/04//}, pages = {33 - 38}, abstract = {Given the shortage of caregivers and the increase in an aging US population, the future of US healthcare quality does not look promising and definitely is unlikely to be cheaper. Advances in health information systems and healthcare technology offer a tremendous opportunity for improving the quality of care while reducing costs. The development and production of medical device software and systems is a crucial issue, both for the US economy and for ensuring safe advances in healthcare delivery. As devices become increasingly smaller in physical terms but larger in software terms, the design, testing, and eventual Food and Drug Administration (FDA) device approval is becoming much more expensive for medical device manufacturers both in terms of time and cost. Furthermore, the number of devices that have recently been recalled due to software and hardware problems is increasing at an alarming rate. As medical devices are becoming increasingly networked, ensuring even the same level of health safety seems a challenge.}, keywords = {Aging, biomedical equipment, Clinical software engineering, Costs, FDA device, Food and Drug Administration device, health and safety, health care, health information system, health safety, healthcare delivery, Healthcare technology, Information systems, medical computing, medical device manufacturing, medical device software development, medical device systems development, medical information systems, Medical services, Medical software, Medical tests, networked medical devices, Production systems, Software design, Software safety, Software systems, Software testing, US healthcare quality}, isbn = {0018-9162}, doi = {10.1109/MC.2006.127}, author = {Lee,I. and Pappas,G. J and Cleaveland, Rance and Hatcliff,J. and Krogh,B. H and Lee,P. and Rubin,H. and Sha,L.} } @mastersthesis {14185, title = {A holistic approach to structure from motion}, year = {2006}, month = {2006///}, school = {University of Maryland at College Park}, address = {College Park, MD, USA}, abstract = {This dissertation investigates the general structure from motion problem. That is, how to compute in an unconstrained environment 3D scene structure, camera motion and moving objects from video sequences. We present a framework which uses concatenated feed-back loops to overcome the main difficulty in the structure from motion problem: the chicken-and-egg dilemma between scene segmentation and structure recovery. The idea is that we compute structure and motion in stages by gradually computing 3D scene information of increasing complexity and using processes which operate on increasingly large spatial image areas. Within this framework, we developed three modules. First, we introduce a new constraint for the estimation of shape using image features from multiple views. We analyze this constraint and show that noise leads to unavoidable mis-estimation of the shape, which also predicts the erroneous shape perception in human. This insight provides a clear argument for the need for feed-back loops. Second, a novel constraint on shape is developed which allows us to connect multiple frames in the estimation of camera motion by matching only small image patches. Third, we present a texture descriptor for matching areas of extended sizes. The advantage of this texture descriptor, which is based on fractal geometry, lies in its invariance to any smooth mapping (Bi-Lipschitz transform) including changes of viewpoint, illumination and surface distortion. Finally, we apply our framework to the problem of super-resolution imaging. We use the 3D motion estimation together with a novel wavelet-based reconstruction scheme to reconstruct a high-resolution image from a sequence of low-resolution images.}, author = {Hui Ji} } @article {19661, title = {How Multirobot Systems Research will Accelerate our Understanding of Social Animal Behavior}, journal = {Proceedings of the IEEE}, volume = {94}, year = {2006}, month = {2006/07//}, pages = {1445 - 1463}, abstract = {Our understanding of social insect behavior has significantly influenced artificial intelligence (AI) and multirobot systems{\textquoteright} research (e.g., ant algorithms and swarm robotics). In this work, however, we focus on the opposite question: "How can multirobot systems research contribute to the understanding of social animal behavior?" As we show, we are able to contribute at several levels. First, using algorithms that originated in the robotics community, we can track animals under observation to provide essential quantitative data for animal behavior research. Second, by developing and applying algorithms originating in speech recognition and computer vision, we can automatically label the behavior of animals under observation. In some cases the automatic labeling is more accurate and consistent than manual behavior identification. Our ultimate goal, however, is to automatically create, from observation, executable models of behavior. An executable model is a control program for an agent that can run in simulation (or on a robot). The representation for these executable models is drawn from research in multirobot systems programming. In this paper we present the algorithms we have developed for tracking, recognizing, and learning models of social animal behavior, details of their implementation, and quantitative experimental results using them to study social insects}, keywords = {Acceleration, Animal behavior, ant movement tracking, Artificial intelligence, biology computing, Computer vision, control engineering computing, Insects, Intelligent robots, Labeling, monkey movement tracking, multi-robot systems, multirobot systems, robotics algorithms, Robotics and automation, social animal behavior, social animals, social insect behavior, Speech recognition, tracking}, isbn = {0018-9219}, author = {Balch, T. and Dellaert, F. and Feldman, A. and Guillory, A. and Isbell, C.L. and Zia Khan and Pratt, S.C. and Stein, A.N. and Wilde, H.} } @article {11976, title = {Human activity language: Grounding concepts with a linguistic framework}, journal = {Semantic Multimedia}, year = {2006}, month = {2006///}, pages = {86 - 100}, author = {Guerra-Filho,G. and Aloimonos, J.} } @book {12628, title = {Human identification based on gait}, year = {2006}, month = {2006///}, publisher = {Springer Science \& Business}, organization = {Springer Science \& Business}, abstract = {Biometrics now affect many people{\textquoteright}s lives, and is the focus of much academic research and commercial development. Gait is one of the most recent biometrics, with its own unique advantages. Gait recognizes people by the way they walk and run, analyzes movement, which in turn implies analyzing sequences of images. This professional book introduces developments from the laboratories of very distinguished researchers within this relatively new area of biometrics and clearly establishes human gait as a biometric. Human Identification Based on Gait provides a snapshot of all the biometric work in human identification by gait (all major centers for research are indicated in this book). To complete the picture, studies are included from medicine, psychology and other areas wherein we find not only justification for the use of gait as a biometric, but also pointers to techniques and to analysis. Human Identification Based on Gait is designed for a professional audience, composed of researchers and practitioners in industry. This book is also suitable as a secondary text for graduate-level students in computer science.}, keywords = {Biometric identification, Computers / Computer Graphics, Computers / Computer Science, Computers / Computer Vision \& Pattern Recognition, Computers / General, Computers / Information Technology, Computers / Programming / Software Development, Computers / Software Development \& Engineering / Systems Analysis \& Design, Gait in humans, Medical / Physiology, Social Science / Anthropology / Physical}, isbn = {9780387244242}, author = {Nixon,Mark S. and Tan,Tieniu and Chellapa, Rama} } @conference {13335, title = {The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes}, booktitle = {Shape Modeling and Applications, 2005 International Conference}, year = {2005}, month = {2005/06//}, pages = {332 - 337}, abstract = {We propose a new data structure for the compact encoding of a level-of detail (LOD) model of a three-dimensional scalar field based on unstructured tetrahedral meshes. Such data structure, called a half-edge tree (HET), is built through the iterative application of a half-edge collapse, i.e. by contracting an edge to one of its endpoints. We also show that selective refined meshes extracted from an HET contain on average about 34\% and up to 75\% less tetrahedra than those extracted from an LOD model built through a general edge collapse.}, keywords = {application;, compact, computational, data, detection;, edge, encoding;, generation;, geometry;, half-edge, iterative, level-of-detail, mesh, meshes;, methods;, model;, structure;, structures;, tetrahedral, tree, tree;}, doi = {10.1109/SMI.2005.47}, author = {Danovaro,E. and De Floriani, Leila and Magillo,P. and Puppo,E. and Sobrero,D. and Sokolovsky,N.} } @article {18221, title = {Handling uneven embedding capacity in binary images: a revisit}, journal = {Proceedings of SPIE}, volume = {5681}, year = {2005}, month = {2005/03/21/}, pages = {194 - 205}, abstract = {Hiding data in binary images can facilitate the authentication and annotation of important document images in digital domain. A representative approach is to first identify pixels whose binary color can be flipped without introducing noticeable artifacts, and then embed one bit in each non-overlapping block by adjusting the flippable pixel values to obtain the desired block parity. The distribution of these flippable pixels is highly uneven across the image, which is handled by random shuffling in the literature. In this paper, we revisit the problem of data embedding for binary images and investigate the incorporation of a most recent steganography framework known as the wet paper coding to improve the embedding capacity. The wet paper codes naturally handle the uneven embedding capacity through randomized projections. In contrast to the previous approach, where only a small portion of the flippable pixels are actually utilized in the embedding, the wet paper codes allow for a high utilization of pixels that have high flippability score for embedding, thus giving a significantly improved embedding capacity than the previous approach. The performance of the proposed technique is demonstrated on several representative images. We also analyze the perceptual impact and capacity-robustness relation of the new approach.}, isbn = {0277786X}, doi = {doi:10.1117/12.587379}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/5681/1/194_1?isAuthorized=no}, author = {M. Wu and Fridrich,Jessica and Goljan,Miroslav and Gou,Hongmei} } @conference {13563, title = {Handwriting matching and its application to handwriting synthesis}, booktitle = {Document Analysis and Recognition, 2005. Proceedings. Eighth International Conference on}, year = {2005}, month = {2005/09/01/aug}, pages = {861 - 865 Vol. 2 - 861 - 865 Vol. 2}, abstract = {Since it is extremely expensive to collect a large volume of handwriting samples, synthesized data are often used to enlarge the training set. We argue that, in order to generate good handwriting samples, a synthesis algorithm should learn the shape deformation characteristics of handwriting from real samples. In this paper, we present a point matching algorithm to learn the deformation, and apply it to handwriting synthesis. Preliminary experiments show the advantages of our approach.}, keywords = {(artificial, deformation, deformation;, handwriting, image, intelligence);, learning, learning;, matching;, point, recognition;, sampling;, SHAPE, synthesis;}, doi = {10.1109/ICDAR.2005.122}, author = {Yefeng Zheng and David Doermann} } @article {13784, title = {Headline Generation for Written and Broadcast News}, year = {2005}, month = {2005/03//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This technical report is an overview of work done on Headline Generation for written and broadcast news. The report covers HMM Hedge, a statistical approach based on the noisy channel model, Hedge Trimmer, a parse-and-trim approach using linguistically motivated trimming rules, and Topiary, a combination of Trimmer and Unsupervised Topic Discovery. Automatic evaluation of summaries using ROUGE and BLEU is described and used to evaluate the Headline Generation systems.}, keywords = {*INFORMATION RETRIEVAL, *RADIO BROADCASTING, AUTOMATIC, AUTOMATIC SUMMARIZATION, HEDGE TRIMMER, INFORMATION SCIENCE, RADIO COMMUNICATIONS, STATISTICAL PROCESSES, TEST AND EVALUATION, WORDS(LANGUAGE)}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA454198}, author = {Zajic, David and Dorr, Bonnie J and Schwartz,Richard} } @article {17187, title = {Help! I{\textquoteright}m Lost: User Frustration in Web Navigation (2003)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Computers can be valuable tools, and networked resources via the Internet can be beneficial to many different populations and communities. Unfortunately, when people are unable to reach their task goals due to frustrating experiences, this can hinder the effectiveness of technology. This research summary provides information about the user frustration research that has been performed at the University of Maryland and Towson University. Causes of user frustration are discussed in this research summary, along with the surprising finding that nearly one-third to one-half of the time spent in front of the computer is wasted due to frustrating experiences. Furthermore, when interfaces are planned to be deceptive and confusing, this}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6508}, author = {Lazar,Jonathan and Bessiere,Katie and Ceaparu,Irina and Robinson,John and Shneiderman, Ben} } @conference {18872, title = {A hierarchical task-network planner based on symbolic model checking}, year = {2005}, month = {2005///}, pages = {300 - 309}, abstract = {Although several approaches have been developed for planning in nondeterministic domains, solving large planning problems is still quite difficult. In this work, we present a novel algorithm, called YoYo, for planning in nondeterministic domains under the assumption of full observability. This algorithm enables us to combine the power of search-control strategies as in Planning with Hierarchical Task Networks (HTNs) with tech- niques from the Planning via Symbolic Model-Checking (SMC). Our experimental evaluation confirms the po- tentialities of our approach, demonstrating that it com- bines the advantages of these paradigms.}, url = {https://www.aaai.org/Papers/ICAPS/2005/ICAPS05-031.pdf}, author = {Kuter,U. and Nau, Dana S. and Pistore,M. and Traverso,P.} } @conference {16668, title = {The Hiero machine translation system: Extensions, evaluation, and analysis}, booktitle = {Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing}, year = {2005}, month = {2005///}, pages = {779 - 786}, author = {Chiang,D. and Lopez,A. and Madnani,N. and Monz,C. and Resnik, Philip and Subotin,M.} } @article {14031, title = {High Order Spatial Audio Capture and Binaural Head-Tracked Playback over Headphones with HRTF Cues}, journal = {Proceedings 119th convention of AES}, year = {2005}, month = {2005///}, abstract = {A theory and a system for capturing an audio scene and then rendering it remotely are developed andpresented. The sound capture is performed with a spherical microphone array. The sound field at the location of the array is deduced from the captured sound and is represented using either spherical wave-functions or plane-wave expansions. The sound field representation is then transmitted to a remote location for immediate rendering or stored for later use. The sound renderer, coupled with the head tracker, reconstructs the acoustic field using individualized head-related transfer functions to preserve the perceptual spatial structure of the audio scene. Rigorous error bounds and Nyquist-like sampling criterion for the representation of the sound field are presented and verified. }, author = {Duraiswami, Ramani and Zotkin,Dmitry N and Li,Z. and Grassi,E. and Gumerov, Nail A. and Davis, Larry S.} } @conference {13199, title = {High Order Spatial Audio Capture and Its Binaural Head-Tracked Playback Over Headphones with HRTF Cues}, booktitle = {Audio Engineering Society Convention 119}, year = {2005}, month = {2005///}, url = {http://www.aes.org/e-lib/browse.cfm?elib=13369}, author = {Zotkin,Dmitry N and Davis, Larry S. and Duraiswami, Ramani and Grassi,Elena and Gumerov, Nail A. and Zhiyun,Li} } @conference {14021, title = {High Order Spatial Audio Capture and Its Binaural Head-Tracked Playback Over Headphones with HRTF Cues}, booktitle = {Audio Engineering Society Convention 119}, year = {2005}, month = {2005/10//}, url = {http://www.aes.org/e-lib/browse.cfm?elib=13369}, author = {Zotkin,Dmitry N} } @conference {18482, title = {High Order Spatial Audio Capture and Its Binaural Head-Tracked Playback Over Headphones with HRTF Cues}, booktitle = {Audio Engineering Society Convention 119}, year = {2005}, month = {2005///}, abstract = {A theory and a system for capturing an audio scene and then rendering it remotely are developed and presented. The sound capture is performed with a spherical microphone array. The sound field at the location, and in a region of space in the neighborhood, of the array is deduced from the captured sound and represented using either spherical wave-functions or plane-wave expansions. The representation is then transmitted to a remote location for immediate rendering or stored for later reproduction. The sound renderer, coupled with the head tracker, reconstructs the acoustic field using individualized head-related transfer functions to preserve the perceptual spatial structure of the audio scene. Rigorous error bounds and a Nyquist-like sampling criterion for the representation of the sound field are presented and verified.}, author = {Davis, Larry S. and Duraiswami, Ramani and Grassi,E. and Gumerov, Nail A. and Li,Z. and Zotkin,Dmitry N} } @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} } @article {15757, title = {HOPE: A Homotopy Optimization Method for Protein Structure Prediction}, journal = {Journal of Computational Biology}, volume = {12}, year = {2005}, month = {2005/12//}, pages = {1275 - 1288}, abstract = {We use a homotopy optimization method, HOPE, to minimize the potential energy associated with a protein model. The method uses the minimum energy conformation of one protein as a template to predict the lowest energy structure of a query sequence. This objective is achieved by following a path of conformations determined by a homotopy between the potential energy functions for the two proteins. Ensembles of solutions are produced by perturbing conformations along the path, increasing the likelihood of predicting correct structures. Successful results are presented for pairs of homologous proteins, where HOPE is compared to a variant of Newton{\textquoteright}s method and to simulated annealing.}, isbn = {1066-5277, 1557-8666}, doi = {10.1089/cmb.2005.12.1275}, url = {http://www.liebertonline.com/doi/abs/10.1089/cmb.2005.12.1275}, author = {Dunlavy,Daniel M. and O{\textquoteright}Leary, Dianne P. and Klimov,Dmitri and Thirumalai,D.} } @article {13927, title = {How do I find blue books about dogs? The errors and frustrations of young digital library users}, journal = {Proceedings of HCII 2005}, year = {2005}, month = {2005///}, author = {Hutchinson,H. and Druin, Allison and Bederson, Benjamin B. and Reuter,K. and Rose,A. and Weeks,A. C} } @article {12658, title = {Human action-recognition using mutual invariants}, journal = {Computer Vision and Image Understanding}, volume = {98}, year = {2005}, month = {2005/05//}, pages = {294 - 324}, abstract = {Static and temporally varying 3D invariants are proposed for capturing the spatio-temporal dynamics of a general human action to enable its representation in a compact, view-invariant manner. Two variants of the representation are presented and studied: (1) a restricted-3D version, whose theory and implementation are simple and efficient but which can be applied only to a restricted class of human action, and (2) a full-3D version, whose theory and implementation are more complex but which can be applied to any general human action. A detailed analysis of the two representations is presented. We show why a straightforward implementation of the key ideas does not work well in the general case, and present strategies designed to overcome inherent weaknesses in the approach. What results is an approach for human action modeling and recognition that is not only invariant to viewpoint, but is also robust enough to handle different people, different speeds of action (and hence, frame rate) and minor variabilities in a given action, while encoding sufficient distinction among actions. Results on 2D projections of human motion capture and on manually segmented real image sequences demonstrate the effectiveness of the approach.}, keywords = {Human action-recognition, Model based invariants, Mutual invariants, View invariance}, isbn = {1077-3142}, doi = {10.1016/j.cviu.2004.09.002}, url = {http://www.sciencedirect.com/science/article/pii/S107731420400147X}, author = {Parameswaran,Vasu and Chellapa, Rama} } @conference {17214, title = {Human-computer interaction themes in digital government: web site comprehension and statistics visualization}, booktitle = {Proceedings of the 2005 national conference on Digital government research}, series = {dg.o {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {7 - 8}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {Digital government applications often involve web sites to provide information for citizens and visitors from essential services such as passport application or motor vehicle registration to discretionary, but highly popular applications such as recreation and parks information. Another aspect of government web sites is the delivery of statistical reports with summary tables, aggregated data resources, and extensive raw data files. This review focuses on human-computer interaction themes to improve designs of web sites and statistics visualization, ??? specifically as they relate to digital government sites. It also addresses research methods that are appropriate for digital government interfaces.}, url = {http://dl.acm.org/citation.cfm?id=1065226.1065230}, author = {Shneiderman, Ben} } @mastersthesis {13372, title = {Handling estimation errors in database query processing}, year = {2004}, month = {2004///}, school = {University of California at Berkeley}, address = {Berkeley, CA, USA}, abstract = {A query optimizer is among the core pieces of a modern database management system, responsible for choosing a query execution plan for a user-provided declarative query. Query optimizers typically employ a cost estimation procedure to compare costs of different execution plans. Errors in this estimation process are quite common and arise due to reasons such as incomplete and insufficient statistical information about the data, and highly variable runtime environments that can affect the plan costs in unpredictable manners. Two approaches have been previously proposed for handling such estimation errors: (1)~building sophisticated synopsis techniques that succintly summarize the data in the database and thus provide more statistical information to the query optimizer, and (2)~aggressive reoptimization schemes that attempt to change the execution plans chosen to execute queries, on-the-fly. In the first part of this dissertation, we focus on building and using sophisticated synopsis techniques in the context of a traditional query optimizer. We propose a class of synopsis techniques called DEPENDENCY-B ASED Histograms that use statistical interaction models to exploit the correlations in the data, and to estimate selectivities efficiently. We also develop an efficient algorithm to search through the class of statistical models that we employ. Using sophisticated synopsis techniques such as these in the context of a traditional query optimizer poses interesting computational challenges; a naive approach to doing this could make the query optimization process so expensive as to be ineffective. This naturally leads to an {\textquotedblleft}estimation planning{\textquotedblright} problem that asks for the best strategy to compute all the estimates required by an optimizer using the synopses at its disposal. We analyze this problem, its solution space, and propose algorithms to efficiently find good estimation plans. There are many scenarios where sophisticated synopsis techniques may not be applicable; examples include wide area and web based data sources, data streams and complex data domains. In the second part of this dissertation, we explore a highly-adaptive query processing technique called eddies that treats query processing as routing of tuples through operators, and adapts to changing data and runtime characteristics by continuously changing the order in which tuples are routed. We analyze the eddies architecture and identify a fundamental flaw in the basic design of the architecture: the burden of history in routing. (Abstract shortened by UMI.)}, author = {Deshpande, Amol} } @article {13783, title = {Headline evaluation experiment results}, year = {2004}, month = {2004///}, institution = {University of Maryland, College Park, MD. UMIACS-TR-2004-18}, abstract = {This technical report describes an experiment intending to show that different summarizationtechniques have an effect on human performance of an extrinsic task. The task is document selection in the context of information retrieval. We conclude that the task was too difficult and ambiguous for subjects to perform at the level required in order to make statistically significant claims about the relationship between summarization techniques and human performance. An alternate interpretation of the experimental results is described and plans for future experiments are discussed. }, author = {Zajic, David and Dorr, Bonnie J and Schwartz,R. and President,S.} } @article {16753, title = {Hierarchical in-network data aggregation with quality guarantees}, journal = {Advances in Database Technology-EDBT 2004}, year = {2004}, month = {2004///}, pages = {577 - 578}, author = {Deligiannakis,A. and Kotidis,Y. and Roussopoulos, Nick} } @conference {12287, title = {Hierarchical routing with soft-state replicas in TerraDir}, booktitle = {Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International}, year = {2004}, month = {2004/04//}, pages = {48 - 48}, abstract = {Summary form only given. Recent work on peer-to-peer systems has demonstrated the ability to deliver low latencies and good load balance when demand for data is relatively uniform. We describe an adaptive replication protocol that delivers low latencies, good load balance even when demand is heavily skewed. The protocol can withstand arbitrary and instantaneous changes in demand distribution. Our approach also addresses classical concerns related to topological constraints of asymmetrical namespaces, such as hierarchical bottlenecks in the context of hierarchical namespaces. The protocol replicates routing state in an ad-hoc manner based on profiled information, is lightweight, scalable, and requires no replica consistency guarantees.}, keywords = {ad-hoc, adaptive, allocation;, asymmetrical, balancing;, bottlenecks;, consistency, constraints;, delivering;, demand, distribution;, guarantees;, hierarchical, latency, load, low, namespaces;, peer-to-peer, protocol;, protocols;, replica, replicas;, replication, resource, routing;, soft-state, systems;, TerraDir;, topological}, doi = {10.1109/IPDPS.2004.1302967}, author = {Silaghi,B. and Gopalakrishnan,Vijay and Bhattacharjee, Bobby and Kelcher,P.} } @article {16239, title = {Hierarchical Scaffolding With Bambus}, journal = {Genome Research}, volume = {14}, year = {2004}, month = {2004/01/01/}, pages = {149 - 159}, abstract = {The output of a genome assembler generally comprises a collection of contiguous DNA sequences (contigs) whose relative placement along the genome is not defined. A procedure called scaffolding is commonly used to order and orient these contigs using paired read information. This ordering of contigs is an essential step when finishing and analyzing the data from a whole-genome shotgun project. Most recent assemblers include a scaffolding module; however, users have little control over the scaffolding algorithm or the information produced. We thus developed a general-purpose scaffolder, called Bambus, which affords users significant flexibility in controlling the scaffolding parameters. Bambus was used recently to scaffold the low-coverage draft dog genome data. Most significantly, Bambus enables the use of linking data other than that inferred from mate-pair information. For example, the sequence of a completed genome can be used to guide the scaffolding of a related organism. We present several applications of Bambus: support for finishing, comparative genomics, analysis of the haplotype structure of genomes, and scaffolding of a mammalian genome at low coverage. Bambus is available as an open-source package from our Web site.}, doi = {10.1101/gr.1536204}, url = {http://genome.cshlp.org/content/14/1/149.abstract}, author = {Pop, Mihai and Kosack,Daniel S. and Salzberg,Steven L.} } @article {14184, title = {A hierarchy of cameras for 3D photography}, journal = {Computer Vision and Image Understanding}, volume = {96}, year = {2004}, month = {2004/12//}, pages = {274 - 293}, abstract = {The view-independent visualization of 3D scenes is most often based on rendering accurate 3D models or utilizes image-based rendering techniques. To compute the 3D structure of a scene from a moving vision sensor or to use image-based rendering approaches, we need to be able to estimate the motion of the sensor from the recorded image information with high accuracy, a problem that has been well-studied. In this work, we investigate the relationship between camera design and our ability to perform accurate 3D photography, by examining the influence of camera design on the estimation of the motion and structure of a scene from video data. By relating the differential structure of the time varying plenoptic function to different known and new camera designs, we can establish a hierarchy of cameras based upon the stability and complexity of the computations necessary to estimate structure and motion. At the low end of this hierarchy is the standard planar pinhole camera for which the structure from motion problem is non-linear and ill-posed. At the high end is a camera, which we call the full field of view polydioptric camera, for which the motion estimation problem can be solved independently of the depth of the scene which leads to fast and robust algorithms for 3D Photography. In between are multiple view cameras with a large field of view which we have built, as well as omni-directional sensors.}, keywords = {Camera design, Multi-view geometry, Polydioptric cameras, Spatio-temporal image analysis, structure from motion}, isbn = {1077-3142}, doi = {10.1016/j.cviu.2004.03.013}, url = {http://www.sciencedirect.com/science/article/pii/S1077314204000505}, author = {Neumann, Jan and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @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} } @article {18905, title = {HTN planning for Web Service composition using SHOP2}, journal = {Web Semantics: Science, Services and Agents on the World Wide Web}, volume = {1}, year = {2004}, month = {2004/10//}, pages = {377 - 396}, abstract = {Automated composition of Web Services can be achieved by using AI planning techniques. Hierarchical Task Network (HTN) planning is especially well-suited for this task. In this paper, we describe how HTN planning system SHOP2 can be used with OWL-S Web Service descriptions. We provide a sound and complete algorithm to translate OWL-S service descriptions to a SHOP2 domain. We prove the correctness of the algorithm by showing the correspondence to the situation calculus semantics of OWL-S. We implemented a system that plans over sets of OWL-S descriptions using SHOP2 and then executes the resulting plans over the Web. The system is also capable of executing information-providing Web Services during the planning process. We discuss the challenges and difficulties of using planning in the information-rich and human-oriented context of Web Services.}, keywords = {HTN planning, OWL-S, SHOP2, Web Service composition, Web services}, isbn = {1570-8268}, doi = {10.1016/j.websem.2004.06.005}, url = {http://www.sciencedirect.com/science/article/pii/S1570826804000113}, author = {Sirin,Evren and Parsia,Bijan and Wu,Dan and Hendler,James and Nau, Dana S.} } @conference {17202, title = {Human needs and mobile technologies: small, fast, and fun}, booktitle = {Proceedings of the 2nd international conference on Mobile systems, applications, and services}, series = {MobiSys {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {1 - 1}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The central thesis of "Leonardo{\textquoteright}s Laptop" (MIT Press, 2002) is that designers who are sensitive to human needs are more likely to make the breakthroughs that yield new technologies successes. Therefore, a theory of mobile devices would focus on compact devices that support human relationships, provide salient information, and enable creative expression. The foundations are not only the megahertz of connectivity, but also the usability and universality of interfaces. Demonstrations include digital photo applications, personal info, healthcare, and e-commerce.}, isbn = {1-58113-793-1}, doi = {10.1145/990064.990065}, url = {http://doi.acm.org/10.1145/990064.990065}, author = {Shneiderman, Ben} } @conference {12691, title = {A hybrid algorithm for subpixel detection in hyperspectral imagery}, booktitle = {Geoscience and Remote Sensing Symposium, 2004. IGARSS {\textquoteright}04. Proceedings. 2004 IEEE International}, volume = {3}, year = {2004}, month = {2004/09//}, pages = {1601 -1604 vol.3 - 1601 -1604 vol.3}, abstract = {Numerous subpixel detection algorithms utilizing structured backgrounds have been developed over the past few years. These range from detection schemes based on spectral unmixing to generalized likelihood ratio tests. Spectral unmixing algorithms such as the Fully Constrained Least Squares (FCLS) algorithm have the advantage of physically modeling the interactions of spectral signatures based on reflectance/emittance spectroscopy. Generalized likelihood ratio tests like the Adaptive Matched Subspace Detector (AMSD) have the advantage of identifying targets that are statistically different from the background. Therefore, a hybrid detector based on both AMSD and FCLS was developed to take advantage of each detector{\textquoteright}s strengths. Results demonstrate that the hybrid detector achieved the lowest false alarm rates while also producing meaningful abundance estimates}, keywords = {alarm, algorithm;abundance, algorithm;Fully, algorithm;hybrid, algorithm;statistical, AMSD;Adaptive, analysis;structured, approximations;maximum, backgrounds;subpixel, constrained, detection;alarm, detection;target, Detector;FCLS, detector;hyperspectral, estimation;, estimation;emittance, identification;adaptive, imagery;reflectance, least, likelihood, Matched, matching;least, processing;geophysical, rate;generalized, ratio, signal, signatures;spectral, spectra;false, spectra;spectral, squares, subspace, systems;geophysical, techniques;image, tests;hybrid, unmixing}, doi = {10.1109/IGARSS.2004.1370633}, author = {Broadwater, J. and Meth, R. and Chellapa, Rama} } @article {17185, title = {HCIL Technical Report Listing (1993-2002)}, journal = {The craft of information visualization: readings and reflections}, volume = {27}, year = {2003}, month = {2003///}, pages = {393 - 393}, author = {Ceaparu,I. and Druin, Allison and Guimbretiere,F. and Manipulation,D. and Shneiderman, Ben and Westerlurid,B. and Keogh,E. and Hochheiser,H. and Shrieidemian,B. and Shneidemiari,B. and others} } @conference {13785, title = {Hedge Trimmer: a parse-and-trim approach to headline generation}, booktitle = {Proceedings of the HLT-NAACL 03 on Text summarization workshop - Volume 5}, series = {HLT-NAACL-DUC {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 8}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper presents Hedge Trimmer, a HEaDline GEneration system that creates a headline for a newspaper story using linguistically-motivated heuristics to guide the choice of a potential headline. We present feasibility tests used to establish the validity of an approach that constructs a headline by selecting words in order from a story. In addition, we describe experimental results that demonstrate the effectiveness of our linguistically-motivated approach over a HMM-based model, using both human evaluation and automatic metrics for comparing the two approaches.}, doi = {10.3115/1119467.1119468}, url = {http://dx.doi.org/10.3115/1119467.1119468}, author = {Dorr, Bonnie J and Zajic, David and Schwartz,Richard} } @article {17188, title = {Help! I{\textquoteright}m lost: User frustration in web navigation}, journal = {IT \& Society}, volume = {1}, year = {2003}, month = {2003///}, pages = {18 - 26}, abstract = {Computers can be valuable tools, and networked resources via the Internet can be beneficial to many different populations and communities. Unfortunately, when people are unable to reach their task goals due to frustrating experiences, this can hinder the effectiveness of technology. This research summary provides information about the user frustration research that has been performed at the University of Maryland and Towson University. Causes of user frustration are discussed in this research summary, along with the surprising finding that nearly one-third to one-half of the time spent in front of the computer is wasted due to frustrating experiences. Furthermore, when interfaces are planned to be deceptive and confusing, this can lead to increased frustration. Implications for designers and users are discussed.}, author = {Lazar,J. and Bessiere,K. and Ceaparu,I. and Robinson,J. and Shneiderman, Ben} } @conference {16138, title = {Helping users get started with visual interfaces: multi-layered interfaces, integrated initial guidance and video demonstrations}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 1}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {We are investigating new ways to help users learn to use public access interactive tools, in particular for the visual exploration of government statistics. Our work led to a series of interfaces using multi-layered design, a new help method called Integrated Initial Guidance, and video demonstrations. Multi-layer designs structure an interface so that a simpler interface is available for users to get started and more complex features are accessed as users move through the more advanced layers. Integrated Initial Guidance provides help within the working interface, right at the start of the application. Using the metaphor of "sticky notes" overlaid on top of the functional interface locates the main widgets, demonstrates their manipulation, and explains the resulting actions using preset activations of the interface.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123257}, author = {Kang,Hyunmo and Plaisant, Catherine and Shneiderman, Ben} } @conference {12720, title = {A hidden Markov model based framework for recognition of humans from gait sequences}, booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on}, volume = {2}, year = {2003}, month = {2003/09//}, pages = {II - 93-6 vol.3 - II - 93-6 vol.3}, abstract = {In this paper we propose a generic framework based on hidden Markov models (HMMs) for recognition of individuals from their gait. The HMM framework is suitable, because the gait of an individual can be visualized as his adopting postures from a set, in a sequence which has an underlying structured probabilistic nature. The postures that the individual adopts can be regarded as the states of the HMM and are typical to that individual and provide a means of discrimination. The framework assumes that, during gait, the individual transitions between N discrete postures or states but it is not dependent on the particular feature vector used to represent the gait information contained in the postures. The framework, thus, provides flexibility in the selection of the feature vector. The statistical nature of the HMM lends robustness to the model. In this paper we use the binarized background-subtracted image as the feature vector and use different distance metrics, such as those based on the L1 and L2 norms of the vector difference, and the normalized inner product of the vectors, to measure the similarity between feature vectors. The results we obtain are better than the baseline recognition rates reported before.}, keywords = {analysis;, background-subtracted, binarized, discrete, distance, feature, Gait, hidden, human, image, image;, Markov, metrics;, model;, models;, postures;, recognition;, sequences;, vector;}, doi = {10.1109/ICIP.2003.1246624}, author = {Sundaresan,Aravind and RoyChowdhury,Amit and Chellapa, Rama} } @conference {16758, title = {Hierarchical dwarfs for the rollup cube}, booktitle = {Proceedings of the 6th ACM international workshop on Data warehousing and OLAP - DOLAP {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {17 - 17}, address = {New Orleans, Louisiana, USA}, doi = {10.1145/956060.956064}, url = {http://dl.acm.org/citation.cfm?id=956064}, author = {Sismanis,Yannis and Deligiannakis,Antonios and Kotidis,Yannis and Roussopoulos, Nick} } @conference {17892, title = {A high performance multi-perspective vision studio}, booktitle = {Proceedings of the 17th annual international conference on Supercomputing}, series = {ICS {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {348 - 357}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe a multi-perspective vision studio as a flexible high performance framework for solving complex image processing and machine vision problems on multi-view image sequences. The studio abstracts multi-view image data from image sequence acquisition facilities, stores and catalogs sequences in a high performance distributed database, allows customization of back-end processing services, and can serve custom client applications, thus helping make multi-view video sequence processing efficient and generic. To illustrate our approach, we describe two multi-perspective studio applications, and discuss performance and scalability results.}, keywords = {database, distributed system, high-performance, IMAGE PROCESSING, multi-perspective, VISION, volumetric reconstruction}, isbn = {1-58113-733-8}, doi = {10.1145/782814.782862}, url = {http://doi.acm.org/10.1145/782814.782862}, author = {Borovikov,Eugene and Sussman, Alan} } @conference {13236, title = {HRTF personalization using anthropometric measurements}, booktitle = {Applications of Signal Processing to Audio and Acoustics, 2003 IEEE Workshop on.}, year = {2003}, month = {2003/10//}, pages = {157 - 160}, abstract = {Individualized head related transfer functions (HRTFs) are needed for accurate rendering of spatial audio, which is important in many applications. Since these are relatively tedious to acquire, they may not be acceptable for some applications. A number of studies have sought to perform simple customization of the HRTF. We propose and test a strategy for HRTF personalization, based on matching certain anthropometric ear parameters with the HRTF database, and the incorporation of a low-frequency "head-and-torso" model. We present preliminary tests aimed at evaluation of this customization. Results show that the approach improves both the accuracy of the localization and subjective perception of the virtual auditory scene.}, keywords = {acoustic, anthropometric, audio, audio;, auditory, Ear, functions;, Head, head-and-torso, HRTF, individualized, localization;, measurements;, model;, models;, parameters;, perception;, personalization;, physiological, processing;, related, scattering;, scene;, signal, sound, spatial, subjective, transfer, virtual, wave}, doi = {10.1109/ASPAA.2003.1285855}, author = {Zotkin,Dmitry N and Hwang,J. and Duraiswami, Ramani and Davis, Larry S.} } @conference {13243, title = {Human body pose estimation using silhouette shape analysis}, booktitle = {Proceedings. IEEE Conference on Advanced Video and Signal Based Surveillance, 2003.}, year = {2003}, month = {2003/07//}, pages = {263 - 270}, abstract = {We describe a system for human body pose estimation from multiple views that is fast and completely automatic. The algorithm works in the presence of multiple people by decoupling the problems of pose estimation of different people. The pose is estimated based on a likelihood function that integrates information from multiple views and thus obtains a globally optimal solution. Other characteristics that make our method more general than previous work include: (1) no manual initialization; (2) no specification of the dimensions of the 3D structure; (3) no reliance on some learned poses or patterns of activity; (4) insensitivity to edges and clutter in the background and within the foreground. The algorithm has applications in surveillance and promising results have been obtained.}, keywords = {3D, analysis;, body, classification;, clutter;, detection;, estimation;, extraction;, feature, function;, human, image, likelihood, multiple, object, parameter, parameters;, Pixel, pose, probability;, segmentation;, segmentations;, SHAPE, silhouette, structure;, surveillance;, views;}, doi = {10.1109/AVSS.2003.1217930}, author = {Mittal,A. and Liang Zhao and Davis, Larry S.} } @article {18223, title = {Human visual model for data hiding}, volume = {:~09/691,544}, year = {2003}, month = {2003/08/26/}, abstract = {A method and apparatus of hiding identification data in visual media. When image or video data is received, frequency masking is performed to divide the image or video data into blocks of smooth regions and blocks of non-smooth regions and to obtain preliminary just-noticeable-difference. Edge detection is performed to divide the non-smooth region of the image or video data into texture blocks and edge blocks. Then blocks of regions that are substantially proximate to blocks of smooth regions of the image or video data are determined. The image or video data is then adjusted by applying different strength of watermark in association with the type of each block.}, url = {http://www.google.com/patents?id=aNgOAAAAEBAJ}, author = {M. Wu and Yu,Hong Heather}, editor = {Matsushita Electric Industrial Co., Ltd.} } @article {13786, title = {Hybrid Natural Language Generation from Lexical Conceptual Structures}, journal = {Machine Translation}, volume = {18}, year = {2003}, month = {2003///}, pages = {81 - 128}, abstract = {This paper describes Lexogen, a system for generating natural-languagesentences from Lexical Conceptual Structure, an interlingualrepresentation. The system has been developed as part of aChinese{\textendash}English Machine Translation (MT) system; however, it isdesigned to be used for many other MT language pairs and naturallanguage applications. The contributions of this work include: (1)development of a large-scale Hybrid Natural Language Generation system withlanguage-independent components; (2) enhancements to an interlingualrepresentation and associated algorithm forgeneration from ambiguous input; (3) development of an efficientreusable language-independent linearization module with a grammardescription language that can be used with other systems; (4)improvements to an earlier algorithm forhierarchically mapping thematic roles to surface positions; and (5)development of a diagnostic tool for lexicon coverage and correctnessand use of the tool for verification of English, Spanish, and Chineselexicons. An evaluation of Chinese{\textendash}English translation quality showscomparable performance with a commercial translation system. Thegeneration system can also be extended to other languages and this isdemonstrated and evaluated for Spanish.}, isbn = {0922-6567}, url = {http://dx.doi.org/10.1023/B:COAT.0000020960.27186.18}, author = {Habash,Nizar and Dorr, Bonnie J and Traum,David} } @conference {13295, title = {Half-edge Multi-Tessellation: a compact representations for multiresolution tetrahedral meshes}, booktitle = {Proceedings 1st International Symposium on 3D Data Processing Visualization and Transmission}, year = {2002}, month = {2002///}, pages = {494 - 499}, abstract = {This paper deals with the problem of analyzing and vi-sualizing volume data sets of large size. To this aim, we define a three-dimensional multi-resolution model based on unstructured tetrahedral meshes, and built through a half- edge-collapse simplification strategy, that we call a Half- Edge Multi-Tessellation (MT). We propose a new compact data structure for a half-edge MT, and we analyze it with respect to both its space requirements and its efficiency in supporting Level-Of-Detail (LOD) queries based on selec- tive refinement. }, author = {Danovaro,E. and De Floriani, Leila} } @inbook {13782, title = {Handling Translation Divergences: Combining Statistical and Symbolic Techniques in Generation-Heavy Machine Translation}, booktitle = {Machine Translation: From Research to Real UsersMachine Translation: From Research to Real Users}, series = {Lecture Notes in Computer Science}, volume = {2499}, year = {2002}, month = {2002///}, pages = {84 - 93}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper describes a novel approach to handling translation divergences in a Generation-Heavy Hybrid Machine Translation (GHMT) system. The translation divergence problem is usually reserved for Transfer and Interlingual MT because it requires a large combination of complex lexical and structural mappings. A major requirement of these approaches is the accessibility of large amounts of explicit symmetric knowledge for both source and target languages. This limitation renders Transfer and Interlingual approaches ineffective in the face of structurally-divergent language pairs with asymmetric resources. GHMT addresses the more common form of this problem, source-poor/targetrich, by fully exploiting symbolic and statistical target-language resources. This non-interlingual non-transfer approach is accomplished by using target-language lexical semantics, categorial variations and subcategorization frames to overgenerate multiple lexico-structural variations from a target-glossed syntactic dependency of the source-language sentence. The symbolic overgeneration, which accounts for different possible translation divergences, is constrained by a statistical target-language model.}, isbn = {978-3-540-44282-0}, url = {http://dx.doi.org/10.1007/3-540-45820-4_9}, author = {Habash,Nizar and Dorr, Bonnie J}, editor = {Richardson,Stephen} } @conference {13566, title = {Hidden loop recovery for handwriting recognition}, booktitle = {Frontiers in Handwriting Recognition, 2002. Proceedings. Eighth International Workshop on}, year = {2002}, month = {2002///}, pages = {375 - 380}, abstract = {One significant challenge in the recognition of off-line handwriting is in the interpretation of loop structures. Although this information is readily available in online representation, close proximity of strokes often merges their centers making them difficult to identify. In this paper a novel approach to the recovery of hidden loops in off-line scanned document images is presented. The proposed algorithm seeks blobs that resemble truncated ellipses. We use a sophisticated form analysis method based on mutual distance measurements between the two sides of a symmetric shape. The experimental results are compared with the ground truth of the online representations of each off-line word image. More than 86\% percent of the meaningful loops are handled correctly.}, keywords = {analysis;, character, contour, cursive, detection;, distance, edge, ellipses;, form, handwritten, hidden, loop, measurements;, mutual, partitioning;, recognition;, recovery;, SHAPE, shape;, sophisticated, strokes;, symmetric, truncated, word}, doi = {10.1109/IWFHR.2002.1030939}, author = {David Doermann and Intrator,N. and Rivin,E. and Steinherz,T.} } @conference {11894, title = {Hidden Markov models for silhouette classification}, booktitle = {Automation Congress, 2002 Proceedings of the 5th Biannual World}, volume = {13}, year = {2002}, month = {2002///}, pages = {395 - 402}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, a new technique for object classification from silhouettes is presented. Hidden Markov models are used as a classification mechanism. Through a set of experiments, we show the validity of our approach and show its invariance under severe rotation conditions. Also, a comparison with other techniques that use hidden Markov models for object classification from silhouettes is presented.}, keywords = {Computer vision, Feature extraction, Fourier transforms, hidden Markov models, HMM, image classification, Neural networks, object classification, Object recognition, parameter estimation, pattern recognition, Probability distribution, Shape measurement, silhouette classification, Wavelet transforms}, isbn = {1-889335-18-5}, doi = {10.1109/WAC.2002.1049575}, author = {Abd-Almageed, Wael and Smith,C.} } @conference {12746, title = {A hierarchical approach for obtaining structure from two-frame optical flow}, booktitle = {Motion and Video Computing, 2002. Proceedings. Workshop on}, year = {2002}, month = {2002/12//}, pages = {214 - 219}, abstract = {A hierarchical iterative algorithm is proposed for extracting structure from two-frame optical flow. The algorithm exploits two facts: one is that in many applications, such as face and gesture recognition, the depth variation of the visible surface of an object in a scene is small compared to the distance between the optical center and the object; the other is that the time aliasing problem is alleviated at the coarse level for any two-frame optical flow estimate so that the estimate tends to be more accurate. A hierarchical representation for the relationship between the optical flow, depth, and the motion parameters is derived, and the resulting non-linear system is iteratively solved through two linear subsystems. At the coarsest level, the surface of the object tends to be flat, so that the inverse depth tends to be a constant, which is used as the initial depth map. Inverse depth and motion parameters are estimated by the two linear subsystems at each level and the results are propagated to finer levels. Error analysis and experiments using both computer-rendered images and real images demonstrate the correctness and effectiveness of our algorithm.}, keywords = {algorithm;, aliasing;, analysis;, computer-rendered, depth, depth;, error, estimation;, extraction;, Face, feature, flow;, gesture, hierarchical, image, images;, inverse, iterative, methods;, MOTION, nonlinear, optical, parameter, processing;, real, recognition;, sequences;, signal, structure-from-motion;, system;, systems;, TIME, two-frame, variation;, video}, doi = {10.1109/MOTION.2002.1182239}, author = {Liu,Haiying and Chellapa, Rama and Rosenfeld, A.} } @article {12386, title = {High-level synthesis of DSP applications using adaptive negative cycle detection}, journal = {EURASIP J. Appl. Signal Process.}, volume = {2002}, year = {2002}, month = {2002/01//}, pages = {893 - 907}, abstract = {The problem of detecting negative weight cycles in a graph is examined in the context of the dynamic graph structures that arise in the process of high level synthesis (HLS). The concept of adaptive negative cycle detection is introduced, in which a graph changes over time and negative cycle detection needs to be done periodically, but not necessarily after every individual change. We present an algorithm for this problem, based on a novel extension of the well-known Bellman-Ford algorithm that allows us to adapt existing cycle information to the modified graph, and show by experiments that our algorithm significantly outperforms previous incremental approaches for dynamic graphs. In terms of applications, the adaptive technique leads to a very fast implementation of Lawlers algorithm for the computation of the maximum cycle mean (MCM) of a graph, especially for a certain form of sparse graph. Such sparseness often occurs in practical circuits and systems, as demonstrated, for example, by the ISCAS 89/93 benchmarks. The application of the adaptive technique to design-space exploration (synthesis) is also demonstrated by developing automated search techniques for scheduling iterative data-flow graphs.}, keywords = {adaptive performance estimation, dynamic graphs, maximum cycle mean, negative cycle detection}, isbn = {1110-8657}, url = {http://dl.acm.org/citation.cfm?id=1283100.1283192}, author = {Chandrachoodan,Nitin and Bhattacharyya, Shuvra S. and Liu,K. J.R} } @conference {16331, title = {A history-based test prioritization technique for regression testing in resource constrained environments}, booktitle = {Proceedings of the 24th international conference on Software engineering - ICSE {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {119 - 119}, address = {Orlando, Florida}, doi = {10.1145/581339.581357}, url = {http://dl.acm.org/citation.cfm?id=581357}, author = {Kim,Jung-Min and Porter, Adam} } @conference {13931, title = {How young can our design partners be}, booktitle = {Proceedings of the Participatory Design Conference}, year = {2002}, month = {2002///}, pages = {272 - 277}, author = {Farber,A. and Druin, Allison and Chipman,G. and Julian,D. and Somashekhar,S.} } @article {18906, title = {HTN Planning in Answer Set Programming}, volume = {UMIACS-TR-2002-18}, year = {2002}, month = {2002/05/22/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this paper we introduce a formalism for solving Hierarchical Task NEtwork(HTN) Planning using Answer Set Programming (ASP). The ASP paradigm evolved out of the stable semantics for logic programs in recent years and is strongly related to nonmonotonic logics. We consider the formulation of HTM planning as described in the SHOP planning system and define a systematic translation method from SHOP{\textquoteright}s representation of the planning problems into logic programs with negation. We show that our translation is sound and complete: answer sets of the logic programs obtained by our translation correspond exactly to the solutions of the planning problems. Our approach does not rly on a particular system for computing answer sets. It can therefore serve as a means to evaluate ASP systems by using well-established benchmarks from the planning community. We tested our method on various such benchmarks and used smodels and DLV for computing answer sets. We compared 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 closer to that of SHOP, when we are using ASP systems which allow for nonground programs. (Also UMIACS-TR-2002-18) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/1182}, author = {Dix,Jurgen and Kuter,Ugur and Nau, Dana S.} } @conference {15949, title = {Handling uncertainty with active logic}, booktitle = {In Proceedings, AAAI Fall Symposium on Uncertainty in Computation}, year = {2001}, month = {2001///}, author = {Bhatia,M. and Chi,P. and Chong,W. and Josyula,D. P and Okamoto,Y. and Perlis, Don and Purang,K.} } @article {17903, title = {Haptic and aural rendering of a virtual milling process}, journal = {ASME 2001 Design Engineering Technical Conference and Computers and Information in Engineering Conference, Pittsburgh, PA}, year = {2001}, month = {2001///}, pages = {105 - 113}, author = {Chang,C. F and Varshney, Amitabh and Ge,Q. J} } @conference {16736, title = {Hashing moving objects}, booktitle = {Mobile Data Management}, year = {2001}, month = {2001///}, pages = {161 - 172}, author = {Song,Z. and Roussopoulos, Nick} } @article {15473, title = {Hierarchical GUI test case generation using automated planning}, journal = {Software Engineering, IEEE Transactions on}, volume = {27}, year = {2001}, month = {2001/02//}, pages = {144 - 155}, abstract = {The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity come challenges in testing the correctness of a GUI and its underlying software. We present a new technique to automatically generate test cases for GUIs that exploits planning, a well-developed and used technique in artificial intelligence. Given a set of operators, an initial state, and a goal state, a planner produces a sequence of the operators that will transform the initial state to the goal state. Our test case generation technique enables efficient application of planning by first creating a hierarchical model of a GUI based on its structure. The GUI model consists of hierarchical planning operators representing the possible events in the GUI. The test designer defines the preconditions and effects of the hierarchical operators, which are input into a plan-generation system. The test designer also creates scenarios that represent typical initial and goal states for a GUI user. The planner then generates plans representing sequences of GUI interactions that a user might employ to reach the goal state from the initial state. We implemented our test case generation system, called Planning Assisted Tester for Graphical User Interface Systems (PATHS) and experimentally evaluated its practicality and effectiveness. We describe a prototype implementation of PATHS and report on the results of controlled experiments to generate test cases for Microsoft{\textquoteright}s WordPad}, keywords = {Artificial intelligence, automated planning, automatic test case generation, Automatic testing, correctness testing, goal state, Graphical user interfaces, hierarchical GUI test case generation, initial state, Microsoft WordPad, operators, plan-generation system, planning (artificial intelligence), Planning Assisted Tester for Graphical User Interface Systems, program testing, software}, isbn = {0098-5589}, doi = {10.1109/32.908959}, author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L} } @inbook {17921, title = {Hierarchical image-based and polygon-based rendering for large-scale visualizations}, booktitle = {Hierarchical and Geometrical Methods in Scientific VisualizationHierarchical and Geometrical Methods in Scientific Visualization}, year = {2001}, month = {2001///}, publisher = {Springer}, organization = {Springer}, isbn = {9783540433132}, author = {Chang,C. F and Varshney, Amitabh and Ge,Q. J} } @conference {12359, title = {Hybrid global/local search strategies for dynamic voltage scaling in embedded multiprocessors}, booktitle = {Hardware/Software Codesign, 2001. CODES 2001. Proceedings of the Ninth International Symposium on}, year = {2001}, month = {2001///}, pages = {243 - 248}, author = {Bambha,N. K and Bhattacharyya, Shuvra S. and Teich,J. and Zitzler,E.} } @conference {17858, title = {A hypergraph-based workload partitioning strategy for parallel data aggregation}, booktitle = {Proceedings of the Eleventh SIAM Conference on Parallel Processing for Scientific Computing}, year = {2001}, month = {2001///}, author = {Chang,C. and Kurc, T. and Sussman, Alan and Catalyurek,U. and Saltz, J.} } @conference {13567, title = {Hidden Markov Models for Images}, booktitle = {ICPR}, year = {2000}, month = {2000///}, pages = {147 - 150}, abstract = {In this paper we investigate how speech recognition techniques can be extended to image processing. We describe a method for learning statistical models of images using a second order hidden Markov mesh model. First, an image can be segmented in a way that best matches its statistical model by an approach related to the dynamic programming used for segmenting Markov chains. Second, given an image segmentation a statistical model (3D state transition matrix and observation distributions within states) can be estimated. These two steps are repeated until convergence to provide both a segmentation and a statistical model of the image. We also describe a semi-Markov modeling technique in which the distributions of widths and heights of segmented regions are modeled explicitly by gamma distributions in a way related to explicit duration modeling in HMMs. Finally, we propose a statistical distance measure between images based on the similarity of their statistical models for classication and retrieval tasks.}, author = {DeMenthon,D. and Stuckelberg,M. Vuilleumier and David Doermann} } @article {14971, title = {High performance computing algorithms for land cover dynamics using remote sensing data}, journal = {International Journal of Remote Sensing}, volume = {21}, year = {2000}, month = {2000///}, pages = {1513 - 1536}, abstract = {Global and regional land cover studies need to apply complex models on selected subsets of large volumes of multi-sensor and multi-temporal data sets that have been derived from raw instrument measurements using widely accepted pre-processing algorithms. The computational and storage requirements of most of these studies far exceed what is possible on a single workstation environment. We have been pursuing a new approach that couples scalable and open distributed heterogeneous hardware with the development of high performance software for processing, indexing and organizing remotely sensed data. Hierarchical data management tools are used to ingest raw data, create metadata and organize the archived data so as to automatically achieve computational load balancing among the available nodes and minimize input/output overheads. We illustrate our approach with four specific examples. The first is the development of the first fast operational scheme for the atmospheric correction of Landsat Thematic Mapper scenes, while the second example focuses on image segmentation using a novel hierarchical connected components algorithm. Retrieval of the global Bidirectional Reflectance Distribution Function in the red and near-infrared wavelengths using four years (1983 to 1986) of Pathfinder Advanced Very High Resolution Radiometer (AVHRR) Land data is the focus of our third example. The fourth example is the development of a hierarchical data organization scheme that allows on-demand processing and retrieval of regional and global AVHRR data sets. Our results show that substantial reductions in computational times can be achieved by the high performance computing technology.}, isbn = {0143-1161}, doi = {10.1080/014311600210290}, url = {http://www.tandfonline.com/doi/abs/10.1080/014311600210290}, author = {Kalluri, SNV and JaJa, Joseph F. and Bader, D.A. and Zhang,Z. and Townshend,J.R.G. and Fallah-Adl,H.} } @conference {14927, title = {A hierarchical data archiving and processing system to generate custom tailored products from AVHRR data}, booktitle = {Geoscience and Remote Sensing Symposium, 1999. IGARSS {\textquoteright}99 Proceedings. IEEE 1999 International}, volume = {5}, year = {1999}, month = {1999///}, pages = {2374 -2376 vol.5 - 2374 -2376 vol.5}, abstract = {A novel indexing scheme is described to catalogue satellite data on a pixel basis. The objective of this research is to develop an efficient methodology to archive, retrieve and process satellite data, so that data products can be generated to meet the specific needs of individual scientists. When requesting data, users can specify the spatial and temporal resolution, geographic projection, choice of atmospheric correction, and the data selection methodology. The data processing is done in two stages. Satellite data is calibrated, navigated and quality flags are appended in the initial processing. This processed data is then indexed and stored. Secondary processing such as atmospheric correction and projection are done after a user requests the data to create custom made products. By dividing the processing in to two stages saves time, since the basic processing tasks such as navigation and calibration which are common to all requests are not repeated when different users request satellite data. The indexing scheme described can be extended to allow fusion of data sets from different sensors}, keywords = {archiving;image, AVHRR;GIS;PACS;custom, data, image;land, image;remote, mapping;, mapping;PACS;geophysical, measurement, PROCESSING, processing;geophysical, product;data, remote, scheme;infrared, sensing;optical, sensing;terrain, signal, surface;multispectral, system;indexing, tailored, technique;hierarchical, techniques;remote}, doi = {10.1109/IGARSS.1999.771514}, author = {Kalluri, SNV and Zhang,Z. and JaJa, Joseph F. and Bader, D.A. and Song,H. and El Saleous,N. and Vermote,E. and Townshend,J.R.G.} } @article {17207, title = {Human values and the future of technology: a declaration of responsibility}, journal = {ACM SIGCAS Computers and Society}, volume = {29}, year = {1999}, month = {1999/09//}, pages = {5 - 9}, abstract = {We can make a difference in shaping the future by ensuring that computers "serve human needs (Mumford, 1934)." By making explicit the enduring values that we hold dear we can guide computer system designers and developers for the next decade, century, and thereafter. After setting our high-level goals we can pursue the components and seek the process for fulfilling them. High-level goals might include peace, excellent health care, adequate nutrition, accessible education, communication, freedom of expression, support for creative exploration, safety, and socially constructive entertainment. Computer technology can help attain these high-level goals if we clearly state measurable objectives, obtain participation of professionals, and design effective human-computer interfaces. Design considerations include adequate attention to individual differences among users, support of social and organizational structures, design for reliability and safety, provision of access by the elderly, handicapped, or illiterate, and appropriate user controlled adaptation. With suitable theories and empirical research we can achieve ease of learning, rapid performance, low error rates, and good retention over time, while preserving high subjective satisfaction. To raise the consciousness of designers and achieve these goals, we must generate an international debate, stimulate discussions within organizations, and interact with other intellectual communities. This paper calls for a focus on the "you" and "I" in developing improved user interface (UI) research and systems, offers a Declaration of Responsibility, and proposes a Social Impact Statement for major computing projects.}, isbn = {0095-2737}, doi = {10.1145/572183.572185}, url = {http://doi.acm.org/10.1145/572183.572185}, author = {Shneiderman, Ben} } @article {17209, title = {Human-centered computing, online communities, and virtual environments}, journal = {IEEE Computer Graphics and Applications}, volume = {19}, year = {1999}, month = {1999/12//Nov}, pages = {70 - 74}, abstract = {This report summarizes results of the first EC/NSF joint Advanced Research Workshop, which identified key research challenges and opportunities in information technology. The group agreed that the first joint research workshop should concentrate on the themes of human-centered computing and VEs. Human-centered computing is perceived as an area of strategic importance because of the move towards greater decentralization and decomposition in the location and provision of computation. The area of VEs is one where increased collaboration should speed progress in solving some of the more intractable problems in building effective applications}, keywords = {Books, Collaboration, Collaborative work, Conferences, EC/NSF joint Advanced Research Workshop, Feeds, Human computer interaction, human-centered computing, Internet, Joining materials, Laboratories, Online communities, Research initiatives, USA Councils, User interfaces, Virtual environment, virtual environments, Virtual reality}, isbn = {0272-1716}, doi = {10.1109/38.799742}, author = {Brown,J. R and van Dam,A. and Earnshaw,R. and Encarnacao,J. and Guedj,R. and Preece,J. and Shneiderman, Ben and Vince,J.} } @article {13442, title = {Hybrid planning: An approach to integrating generative and case-based planning}, journal = {Working Notes of the AAAI-98 Workshop on Case-Based Reasoning Integrations}, year = {1998}, month = {1998///}, author = {desJardins, Marie and Francis,A. and Wolverton,M.} } @article {15362, title = {Hydrodynamic Device Simulation with New State Variables Specially Chosen a Block Gummel Iterative Approach}, journal = {VLSI DESIGN}, volume = {6}, year = {1998}, month = {1998///}, pages = {191 - 195}, abstract = {A new numerical formulation for solving the hydrodynamic model of semiconductor devicesis presented. Themethod is based on using new variables to transform the conventional hydrodynamic equations into forms which facilitatenumerical evaluation with a block Gum- mel approach. To demonstrate the new method, we apply it to model a 0.35 wn 2-D LDD MOSFET, where robust convergence properties are observed. }, author = {Liang,W. and Kerr,D. C. and Goldsman,N. and Mayergoyz, Issak D} } @article {17712, title = {On hyperbolic triangularization: Stability and pivoting}, journal = {SIAM journal on matrix analysis and applications}, volume = {19}, year = {1998}, month = {1998///}, pages = {847 - 860}, abstract = {This paper treats the problem of triangularizing a matrix by hyperbolic Householdertransformations. The stability of this method, which finds application in block updating and fast algorithms for Toeplitz-like matrices, has been analyzed only in special cases. Here we give a gen- eral analysis which shows that two distinct implementations of the individual transformations are relationally stable. The analysis also shows that pivoting is required for the entire triangularization algorithm to be stable. }, author = {Stewart,M. and Stewart, G.W.} } @article {14571, title = {Hardness of flip-cut problems from optical mapping}, journal = {Journal of Computational Biology}, volume = {4}, year = {1997}, month = {1997///}, pages = {119 - 125}, author = {DAN{\v C}{\'I}K,V. and Hannenhalli, Sridhar and Muthukrishnan,S.} } @conference {14621, title = {Hardness of flip-cut problems from optical mapping [DNA molecules application]}, booktitle = {Compression and Complexity of Sequences 1997. Proceedings}, year = {1997}, month = {1997/06/11/13}, pages = {275 - 284}, publisher = {IEEE}, organization = {IEEE}, abstract = {Optical mapping is a new technology for constructing restriction maps. Associated computational problems include aligning multiple partial restriction maps into a single {\textquotedblleft}consensus{\textquotedblright} restriction map, and determining the correct orientation of each molecule, which was formalized as the exclusive binary flip cut (EBFC) problem by Muthukrishnan and Parida (see Proc. of the First ACM Conference on Computational Molecular Biology (RECOMB), Santa Fe, p.209-19, 1997). Here, the authors prove that the EBFC problem, as well as a number of its variants, are NP-complete. They also identify another problem formalized as binary shift cut (BSC) problem motivated by the fact that there might be missing fragments at the beginnings and/or the ends of the molecules, and prove it to be NP-complete. Therefore, they do not have efficient, that is, polynomial time solutions unless P=NP}, keywords = {binary shift cut, Biochemistry, Bioinformatics, biological techniques, Biology, biomedical optical imaging, combinatorial mathematics, combinatorial problem, computational complexity, computational problems, DNA, DNA molecule, exclusive binary flip cut, flip-cut problem hardness, Genetic engineering, Genomics, MATHEMATICS, molecular biology, molecular biophysics, molecule orientation, multiple partial restriction maps, NP-complete problem, optical mapping, polynomial time solutions, Polynomials, sequences}, isbn = {0-8186-8132-2}, doi = {10.1109/SEQUEN.1997.666922}, author = {Dancik,V. and Hannenhalli, Sridhar and Muthukrishnan,S.} } @article {15952, title = {How to (plan to) meet a deadline between now and then}, journal = {Journal of Logic and Computation}, volume = {7}, year = {1997}, month = {1997///}, pages = {109 - 109}, author = {Nirkhe,M. and Kraus,S. and Miller,M. and Perlis, Don} } @conference {17860, title = {A high performance image database system for remotely sensed imagery}, booktitle = {Euro-Par{\textquoteright}96 Parallel Processing}, year = {1996}, month = {1996///}, pages = {109 - 122}, author = {Shock,C. and Chang,C. and Davis, Larry S. and Goward,S. and Saltz, J. and Sussman, Alan} } @article {16206, title = {Hybrid network management (communication systems)}, journal = {16th AIAA International Communications Satellite Systems Conference}, year = {1996}, month = {1996///}, abstract = {We describe our collaborative efforts towards the design and implementation of a next-generation integrated network management system for hybrid networks (INMS/HN). We describe the overall software architecture of the system at its current stage of development. This NMS is specifically designed to address issues relevant to complex heterogeneous networks consisting of seamlessly interoperable terrestrial and satellite networks. NMSs are a key element for interoperability in such networks. We describe the integration of configuration management and performance management. The next step in this integration is fault management. In particular, we describe the object model, issues concerning the graphical user interface, browsing tools, performance data graphical widget displays, and management information database organization issues.}, author = {Baras,J. S and Ball,M. and Karne,R. K and Kelley,S. and Jang,K.D. and Plaisant, Catherine and Roussopoulos, Nick and Stathatos,K. and Vakhutinsky,A. and Valluri,J.} } @article {13439, title = {How to succeed in graduate school: A guide for students and advisors}, journal = {International Amateur-Professional Photoelectric Photometry Communications}, volume = {58}, year = {1995}, month = {1995///}, pages = {15 - 15}, author = {desJardins, Marie} } @article {13441, title = {How to succeed in graduate school: a guide for students and advisors: part II of II}, journal = {Crossroads}, volume = {1}, year = {1995}, month = {1995/02//}, pages = {1 - 6}, isbn = {1528-4972}, doi = {10.1145/197892.197895}, url = {http://doi.acm.org/10.1145/197892.197895}, author = {desJardins, Marie} } @article {17204, title = {HUMAN VALUE AND THE FUTURE OF TECHNOLOGY}, journal = {Human factors in information systems: emerging theoretical bases}, year = {1995}, month = {1995///}, pages = {355 - 355}, author = {Shneiderman, Ben} } @book {17211, title = {Human-Computer Interaction Laboratory 1995 Video Reports}, year = {1995}, month = {1995///}, publisher = {University of Maryland at College Park, Human/Computer Interaction Laboratory}, organization = {University of Maryland at College Park, Human/Computer Interaction Laboratory}, author = {Plaisant, Catherine and Morrison,S. and Skokowski,C. and Reesch,J. and Shneiderman, Ben and Laboratory,University of Maryland at College Park. Human/Computer Interaction and Channel,F.} } @conference {13568, title = {Hybrid thinning through reconstruction}, booktitle = {Document Analysis and Recognition, 1995., Proceedings of the Third International Conference on}, volume = {2}, year = {1995}, month = {1995/08//}, pages = {632 -635 vol.2 - 632 -635 vol.2}, abstract = {One difficulty with many pixel-wise thinning algorithms is that they produce unacceptable results at junction points, or in the presence of contour noise. The authors present a novel approach to detecting ambiguous regions in a thinned image. The method uses the reconstructability properties of appropriate thinning algorithms to reverse the thinning process and automatically detect those pixels which may have resulted from more then one stroke in the image. The ambiguous regions are then interpreted and reconstructed using domain specific or derived contextual information. The approach has the advantage of using local methods to rapidly identify strokes (or regions) which have been thinned correctly and allowing more detailed analysis based on non-local methods in the remaining regions}, keywords = {algorithms;edge, ambiguous, detection;automatic, detection;contextual, detection;image, information;contour, methods;nonlocal, methods;pixel-wise, noise;hybrid, Pixel, points;local, reconstruction;image, region, segmentation;noise;, stroke;junction, thinning, thinning;image}, doi = {10.1109/ICDAR.1995.601975}, author = {David Doermann and Kia,O.} } @conference {17876, title = {High performance computing for land cover dynamics}, booktitle = {Pattern Recognition, 1994. Vol. 3-Conference C: Signal Processing, Proceedings of the 12th IAPR International Conference on}, year = {1994}, month = {1994///}, pages = {234 - 238}, author = {Parulekar,R. and Davis, Larry S. and Chellapa, Rama and Saltz, J. and Sussman, Alan and Townshend,J.} } @article {16623, title = {High-specificity neurological localization using a connectionist model}, journal = {Artificial Intelligence in Medicine}, volume = {6}, year = {1994}, month = {1994///}, pages = {521 - 532}, author = {Tuhrim,S. and Reggia, James A. and Peng,Y.} } @article {12019, title = {How normal flow constrains relative depth for an active observer}, journal = {Image and vision computing}, volume = {12}, year = {1994}, month = {1994///}, pages = {435 - 445}, author = {Huang, L. and Aloimonos, J.} } @article {13440, title = {How to succeed in graduate school: a guide for students and advisors: part I of II}, journal = {Crossroads}, volume = {1}, year = {1994}, month = {1994/12//}, pages = {3 - 9}, abstract = {This paper attempts to raise some issues that are important for graduate students to be successful and to get as much out of the process as possible, and for advisors who wish to help their students be successful. The intent is not to provide prescriptive advice -- no formulas for finishing a thesis or twelve-step programs for becoming a better advisor are given -- but to raise awareness on both sides of the advisor-student relationship as to what the expectations are and should be for this relationship, what a graduate student should expect to accomplish, common problems, and where to go if the advisor is not forthcoming.}, isbn = {1528-4972}, doi = {10.1145/197149.197154}, url = {http://doi.acm.org/10.1145/197149.197154}, author = {desJardins, Marie} } @article {18319, title = {Human Emotion Recognition From Motion Using A Radial Basis Function Network Architecture}, journal = {University Of Maryland}, year = {1994}, month = {1994///}, author = {Mark,R. and Yaser,Y. and Larry,D.} } @conference {14169, title = {Hierarchical curve representation}, booktitle = {, 11th IAPR International Conference on Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings}, year = {1992}, month = {1992/09/30/Aug-3}, pages = {143 - 146}, publisher = {IEEE}, organization = {IEEE}, abstract = {Presents a robust method for describing planar curves in multiple resolution using curvature information. The method is developed by taking into account the discrete nature of digital images as well as the discrete aspect of a multiresolution structure (pyramid). The authors deal with the robustness of the technique, which is due to the additional information that is extracted from observing the behavior of corners in the pyramid. Furthermore the resulting algorithm is conceptually simple and easily parallelizable. They develop theoretical results, analyzing the curvature of continuous curves in scale-space, which show the behavior of curvature extrema under varying scale. These results are used to eliminate any ambiguities that might arise from sampling problems due to the discreteness of the representation. Finally, experimental results demonstrate the potential of the method}, keywords = {Automation, continuous curves, curvature, data mining, digital images, Educational institutions, Feature extraction, hierarchical curve representation, IMAGE PROCESSING, image recognition, image resolution, Image segmentation, multiresolution structure, Object recognition, planar curves, pyramid, Robustness, Sampling methods, Smoothing methods}, isbn = {0-8186-2920-7}, doi = {10.1109/ICPR.1992.201947}, author = {Ferm{\"u}ller, Cornelia and Kropatsch,W.} } @article {17190, title = {High precision touchscreens: design strategies and comparisons with a mouse}, journal = {International Journal of Man-Machine Studies}, volume = {34}, year = {1991}, month = {1991/04//}, pages = {593 - 613}, abstract = {Three studies were conducted comparing speed of performance, error rates and user preference ratings for three selection devices. The devices tested were a touchscreen, a touchscreen with stabilization (stabilization software filters and smooths raw data from hardware), and a mouse. The task was the selection of rectangular targets 1, 4, 16 and 32 pixels per side (0{\textperiodcentered}4 {\texttimes} 0{\textperiodcentered}6, 1{\textperiodcentered}7 {\texttimes} 2{\textperiodcentered}2, 6{\textperiodcentered}9 {\texttimes} 9{\textperiodcentered}0, 13{\textperiodcentered}8 {\texttimes} 17{\textperiodcentered}9 mm respectively). Touchscreen users were able to point at single pixel targets, thereby countering widespread expectations of poor touchscreen resolution. The results show no difference in performance between the mouse and touchscreen for targets ranging from 32 to 4 pixels per side. In addition, stabilization significantly reduced the error rates for the touchscreen when selecting small targets. These results imply that touchscreens, when properly used, have attractive advantages in selecting targets as small as 4 pixels per size (approximately one-quarter of the size of a single character). A variant of Fitts{\textquoteright} Law is proposed to predict touchscreen pointing times. Ideas for future research are also presented.}, isbn = {0020-7373}, doi = {10.1016/0020-7373(91)90037-8}, url = {http://www.sciencedirect.com/science/article/pii/0020737391900378}, author = {Sears,Andrew and Shneiderman, Ben} } @article {17206, title = {Human values and the future of technology: a declaration of responsibility}, journal = {ACM SIGCHI Bulletin}, volume = {23}, year = {1991}, month = {1991/01//}, pages = {11 - 16}, abstract = {"We must learn to balance the material wonders of technology with the spiritual demands of our human nature."---John Naisbitt (1982).We can make a difference in shaping the future by ensurin g that computers "serve human needs (Mumford, 1934)." By making explicit the enduring values that we hold dear we can guide computer system designers and developers for the next decade, century, and thereafter. After setting our high-level goals we can pursue the components and seek the process for fulfilling them.High-level goals might include peace, excellent health care, adequate nutrition, accessible education, communication, freedom of expression, support for creative exploration, safety, and socially constructive entertainment. Computer technology can help attain these high-level goals if we clearly state measurable objectives, obtain participation of professionals, and design effective human-computer interfaces. Design considerations include adequate attention to individual differences among users, support of social and organizational structures, design for reliability and safety, provision of access by the elderly, handicapped, or illiterate, and appropriate user controlled adaptation. With suitable theories and empirical research we can achieve ease of learning, rapid performance, low error rates, and good retention over time, while preserving high subjective satisfaction.To raise the consciousness of designers and achieve these goals, we must generate an international debate, stimulate discussions within organizations, and interact with other intellectual communities. This paper calls for a focus on the "you" and "I" in developing improved user interface (UI) research and systems, offers a Declaration of Responsibility, and proposes a Social Impact Statement for major computing projects.}, isbn = {0736-6906}, doi = {10.1145/122672.122674}, url = {http://doi.acm.org/10.1145/122672.122674}, author = {Shneiderman, Ben} } @conference {17205, title = {Human values and the future of technology: a declaration of empowerment}, booktitle = {Proceedings of the conference on Computers and the quality of life}, series = {CQL {\textquoteright}90}, year = {1990}, month = {1990///}, pages = {1 - 6}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-403-1}, doi = {10.1145/97344.97360}, url = {http://doi.acm.org/10.1145/97344.97360}, author = {Shneiderman, Ben} } @conference {17210, title = {Human-computer interaction lab, University of Maryland}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind}, series = {CHI {\textquoteright}89}, year = {1989}, month = {1989///}, pages = {309 - 310}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-301-9}, doi = {10.1145/67449.67509}, url = {http://doi.acm.org/10.1145/67449.67509}, author = {Shneiderman, Ben} } @article {17212, title = {Human-Computer Interaction Laboratory, University of Maryland, Center for Automation Research}, journal = {CHI}, volume = {89}, year = {1989}, month = {1989///}, pages = {309 - 310}, author = {Shneiderman, Ben} } @conference {17215, title = {Hypertext and software engineering}, booktitle = {Proceedings of the second annual ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}89}, year = {1989}, month = {1989///}, pages = {395 - 396}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The purpose of this panel is to bring together researchers in software engineering and hypertext and help identify the major issues in the application of hypertext technology and concepts to software engineering and vice versa.}, isbn = {0-89791-339-6}, doi = {10.1145/74224.74259}, url = {http://doi.acm.org/10.1145/74224.74259}, author = {Balzer,R. and Begeman,M. and Garg,P. K. and Schwartz,M. and Shneiderman, Ben} } @article {17216, title = {Hypertext hands-on!}, journal = {Tech Report HCIL-89-06}, year = {1989}, month = {1989///}, abstract = {This innovative book/software package provides the first hands-on nontechnical introduction to hypertext. Hypertext is a computer technology for manipulating information; in a grander sense, it is a new way of reading and writing. With the IBM-PC disket tes provided in this package, you will learn about hypertext by experiencing it. You will discover what it is like to read interactively, to find information according to your own needs and interests. Both the book and the software versions cover the basic concepts of hypertext, typical hypertext applications, and currently available authoring systems. They also raise important design and implementations issues. The book is self-contained an can be read from beginning to end without a computer. The software is also self-contained and, presenting hypertext in hypertext form, can be read in any order you choose. Since the two versions contain largely similar material, they provide an interesting basis for comparison between conventional text presentation and hypertext.}, author = {Shneiderman, Ben and Kearsley,G.} } @book {17217, title = {Hypertext on hypertext: IBM PC \& compatibles}, year = {1988}, month = {1988///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-280-2}, editor = {Shneiderman, Ben} } @conference {15934, title = {How can a program mean}, booktitle = {Proceedings of the 10th Int{\textquoteright}l Joint Conference on Artificial Intelligence}, year = {1987}, month = {1987///}, pages = {163 - 166}, author = {Perlis, Don} } @article {17213, title = {Human-computer interaction research at the University of Maryland}, journal = {ACM SIGCHI Bulletin}, volume = {17}, year = {1986}, month = {1986/01//}, pages = {27 - 32}, abstract = {The Human-Computer Interaction Laboratory (HCIL) is a unit of the Center for Automation Research at the Univesity of Maryland. HCIL is an interdisciplinary research group whose participants are faculty in the Departments of Computer Science and Psychology and the Colleges of Library and Information Services, Business, and Education. In addition, staff scienctists, graduate students, and undergraduates contribute to this small, but lively community that pursues empirical studies of people using computers.Our support comes from industrial research projects, government grants, the State of Maryland, and the University of Maryland. Projects often become interrelated in surprising ways enabling individuals to cooperate constructively. Some of our efforts during the past year are described below.}, isbn = {0736-6906}, doi = {10.1145/15671.15673}, url = {http://doi.acm.org/10.1145/15671.15673}, author = {Shneiderman, Ben} } @article {14131, title = {A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations}, journal = {SIAM Journal on Scientific and Statistical ComputingSIAM J. Sci. and Stat. Comput.}, volume = {7}, year = {1986}, month = {1986///}, pages = {840 - 840}, isbn = {01965204}, doi = {10.1137/0907057}, url = {http://link.aip.org/link/SJOCE3/v7/i3/p840/s1\&Agg=doi}, author = {Elman, Howard and Saad, Youcef and Saylor, Paul E.} } @article {14928, title = {A High-Level Interactive System for Designing VLSI Signal Processors}, volume = {ISR-TR-1985-7}, year = {1985}, month = {1985///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {This paper describes a high-level interactive system that can be used to generate VLSI designs for various operations in signal processing such as filtering, convolution and computing the discrete Fourier transform. The overall process is fully automated and requires that the user specifies only a few parameters such as operation, precision, size and architecture type. The built-in architectures are new digit-on-line bit-serial architectures that are based on recently derived fast algorithms for the above operations. The basic elements are compact and have a very small gate delay. We feel that our system will offer a flexible and easy to use tool that can produce practical designs which are easy to test, efficient and fast.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/4383}, author = {Owens,R. M. and JaJa, Joseph F.} } @article {17198, title = {Human factors issues of manuals, online help, and tutorials}, journal = {Empirical foundations of information and software science}, volume = {1984}, year = {1985}, month = {1985///}, pages = {107 - 107}, author = {Shneiderman, Ben} } @article {17196, title = {Human Factors in Interactive Medical Systems}, journal = {Proceedings of the Annual Symposium on Computer Application in Medical CareProc Annu Symp Comput Appl Med Care}, year = {1984}, month = {1984/11/07/}, pages = {96 - 96}, isbn = {0195-4210}, author = {Shneiderman, Ben} } @article {17191, title = {High-tech can stimulate creative action: the increased ease-of-use of computers supports individual competence and productive work}, journal = {SIGCHI Bull.}, volume = {14}, year = {1983}, month = {1983/04//}, pages = {6 - 7}, abstract = {Jokes about the complexity and error-prone use of computer systems reflect the experience of many people. Computer anxiety, terminal terror, and network neurosis are modern maladies - but help is on the way!}, isbn = {0736-6906}, doi = {10.1145/1044188.1044189}, url = {http://doi.acm.org/10.1145/1044188.1044189}, author = {Shneiderman, Ben} } @article {17193, title = {Human engineering management plan for interactive systems}, journal = {Proceedings COMPCON}, volume = {83}, year = {1983}, month = {1983///}, author = {Shneiderman, Ben} } @inbook {17199, title = {Human factors of interactive software}, booktitle = {Enduser Systems and Their Human FactorsEnduser Systems and Their Human Factors}, series = {Lecture Notes in Computer Science}, volume = {150}, year = {1983}, month = {1983///}, pages = {9 - 29}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {There is intense interest about human factors issues in interactive computer systems for life-critical applications, industrial/commercial uses, and personal computing in the office or home. Primary design goals include proper functionality, adequate reliability, suitable cost, and adherence to schedule. Measurable human factors issues include time to learn, speed of performance, rate of errors, subjective satisfaction, and retention over time. Specific human factors acceptance tests are described as a natural complement to hardware and software acceptance tests. Project management ideas, information resources, and potential research directions are presented.}, isbn = {978-3-540-12273-9}, url = {http://dx.doi.org/10.1007/3-540-12273-7_16}, author = {Shneiderman, Ben}, editor = {Blaser,Albrecht and Zoeppritz,Magdalena} } @article {17192, title = {Human Aspects of Computing Editor Control Flow and Data Structure Documentation: Two Experiments}, journal = {Human factors in software development}, year = {1981}, month = {1981///}, pages = {365 - 365}, author = {Shneiderman, Ben} } @article {17197, title = {HUMAN FACTORS ISSUES IN DESIGNING INTERACTIVE SYSTEMS}, journal = {Proceedings-Compcon}, volume = {25}, year = {1981}, month = {1981///}, pages = {116 - 116}, author = {Shneiderman, Ben} } @article {17201, title = {Human factors studies with system message styles (abstract only)}, journal = {ACM SIGSOC Bulletin}, volume = {13}, year = {1981}, month = {1981/05//}, pages = {138{\textendash} - 138{\textendash}}, abstract = {Computer systems often contain messages which are imprecise ({\textquoteright}SYNTAX ERROR{\textquoteright}), hostile ({\textquoteright}FATAL ERROR, RUN ABORTED{\textquoteright}), cryptic ({\textquoteright}IEH291H{\textquoteright}), or obscure ({\textquoteright}CTL DAMAGE, TRANS ERR{\textquoteright}). Such messages may be acceptable to computer professionals who regularly use a specific system, but they lead to frustration for novices and for professionals who are using new features or facilities.We have conducted five studies using COBOL compiler syntax errors and text editor command errors to measure the impact of improving the wording of system messages. The results indicate that increased specificity, more positive tone, and greater clarity can improve correction rates and user satisfaction.An overview of the experimental results will be presented along with guidelines for writing system messages.}, isbn = {0163-5794}, doi = {10.1145/1015579.810979}, url = {http://doi.acm.org/10.1145/1015579.810979}, author = {Shneiderman, Ben} } @article {17182, title = {Hardware options, evaluation metrics, and a design sequence for interactive information systems}, journal = {Information \& Management}, volume = {3}, year = {1980}, month = {1980///}, pages = {3 - 18}, abstract = {Interactive information systems must satisfy a wide variety of users, serve a broad range of tasks, and be suited to diverse hardware environments. This paper concentrates on three aspects of interactive information systems design: hardware options, evaluation metrics, and a possible design sequence. Rigorous pilot studies are emphasized, and supporting experimental evidence is offered.}, keywords = {casual users, design sequence, evaluation metrics, ferminal design, human factor, Interactive information systems}, isbn = {0378-7206}, doi = {10.1016/0378-7206(80)90026-9}, url = {http://www.sciencedirect.com/science/article/pii/0378720680900269}, author = {Shneiderman, Ben} } @article {17194, title = {HUMAN FACTORS EXPERIMENTS FOR REFINING INTERACTIVE SYSTEM DESIGNS}, journal = {Proceedings-Compcon}, volume = {21}, year = {1980}, month = {1980///}, pages = {123 - 123}, author = {Shneiderman, Ben} } @article {17200, title = {Human Factors of Software Design and Development}, journal = {Software Configuration Management}, year = {1980}, month = {1980///}, pages = {67 - 67}, author = {Weiser,M. and Shneiderman, Ben} } @article {17195, title = {Human Factors Experiments in Designing Interactive Systems}, journal = {Computer}, volume = {12}, year = {1979}, month = {1979/12//}, pages = {9 - 19}, abstract = {Successful industrial design gracefully unites esthetics and function at minimum cost. However, designers face special problems when they apply their skills to interactive computer systems.}, keywords = {Application software, Computer languages, Design engineering, Home computing, human factors, interactive systems, Process design, Testing}, isbn = {0018-9162}, doi = {10.1109/MC.1979.1658571}, author = {Shneiderman, Ben} }