@article {20391, title = {Metagenome sequencing-based strain-level and functional characterization of supragingival microbiome associated with dental caries in children}, journal = {Journal of Oral Microbiology}, year = {2019}, month = {12/2018}, pages = {1557986}, abstract = {Studies of the microbiome associated with dental caries have largely relied on 16S rRNA sequence analysis, which is associated with PCR biases, low taxonomic resolution, and inability to accurately study functions. Here, we employed whole metagenome shotgun sequencing, coupled with high-resolution analysis algorithm, to analyze supragingival microbiomes from 30 children with or without dental caries. A total of 726 bacterial strains belonging to 406 species, in addition to 34 bacteriophages were identified. A core bacteriome was identified at the species and strain levels. Species of Prevotella, Veillonella, as yet unnamed Actinomyces, and Atopobium showed strongest association with caries; Streptococcus sp. AS14 and Leptotrichia sp. Oral taxon 225, among others, were overabundant in caries-free. For several species, the association was strain-specific. Furthermore, for some species, e.g. Streptococcus mitis and Streptococcus sanguinis, sister strains showed differential associations. Noteworthy, associations were also identified for phages: Streptococcus phage M102 with caries and Haemophilus phage HP1 with caries-free. Functionally, potentially relevant features were identified including urate, vitamin K2, and polyamine biosynthesis in association with caries; and three deiminases and lactate dehydrogenase with health. The results demonstrate new associations between the microbiome and dental caries at the strain and functional levels that need further investigation.}, doi = {10.1080/20002297.2018.1557986}, url = {https://www.tandfonline.com/doi/full/10.1080/20002297.2018.1557986}, author = {Al-Hebshi, Nezar Noor and Baraniya, Divyashri and Chen, Tsute and Hill, Jennifer and Puri, Sumant and Tellez, Marisol and Hassan, Nur A. and Rita R Colwell and Ismail, Amid} } @article {20283, title = {A Metagenomic Approach to Evaluating Surface Water Quality in Haiti}, journal = {International Journal of Environmental Research and Public Health}, volume = {1542}, year = {2018}, month = {Jan-10-2018}, pages = {2211}, abstract = {The cholera epidemic that occurred in Haiti post-earthquake in 2010 has resulted in over 9000 deaths during the past eight years. Currently, morbidity and mortality rates for cholera have declined, but cholera cases still occur on a daily basis. One continuing issue is an inability to accurately predict and identify when cholera outbreaks might occur. To explore this surveillance gap, a metagenomic approach employing environmental samples was taken. In this study, surface water samples were collected at two time points from several sites near the original epicenter of the cholera outbreak in the Central Plateau of Haiti. These samples underwent whole genome sequencing and subsequent metagenomic analysis to characterize the microbial community of bacteria, fungi, protists, and viruses, and to identify antibiotic resistance and virulence associated genes. Replicates from sites were analyzed by principle components analysis, and distinct genomic profiles were obtained for each site. Cholera toxin converting phage was detected at one site, and Shiga toxin converting phages at several sites. Members of the Acinetobacter family were frequently detected in samples, including members implicated in waterborne diseases. These results indicate a metagenomic approach to evaluating water samples can be useful for source tracking and the surveillance of pathogens such as Vibrio cholerae over time, as well as for monitoring virulence factors such as cholera toxin.}, url = {https://www.ncbi.nlm.nih.gov/pubmed/30309013}, author = {Roy, Monika and Arnaud, Jean and Jasmin, Paul and Hamner, Steve and Hasan, Nur and Rita R Colwell and Ford, Timothy} } @article {20312, title = {Membrane Bioreactor-Based Wastewater Treatment Plant in Saudi Arabia: Reduction of Viral Diversity, Load, and Infectious Capacity}, journal = {Water}, volume = {96046Volume 70}, year = {2017}, month = {Jan-07-2017}, pages = {534}, doi = {10.3390/w9070534}, url = {http://www.mdpi.com/2073-4441/9/7/534}, author = {Jumat, Muhammad and Hasan, Nur and Subramanian, Poorani and Heberling, Colin and Rita R Colwell and Hong, Pei-Ying} } @article {20309, title = {The microbiomes of blowflies and houseflies as bacterial transmission reservoirs}, journal = {Scientific Reports}, year = {2017}, month = {Jan-12-2017}, abstract = {Blowflies and houseflies are mechanical vectors inhabiting synanthropic environments around the world. They feed and breed in fecal and decaying organic matter, but the microbiome they harbour and transport is largely uncharacterized. We sampled 116 individual houseflies and blowflies from varying habitats on three continents and subjected them to high-coverage, whole-genome shotgun sequencing. This allowed for genomic and metagenomic analyses of the host-associated microbiome at the species level. Both fly host species segregate based on principal coordinate analysis of their microbial communities, but they also show an overlapping core microbiome. Legs and wings displayed the largest microbial diversity and were shown to be an important route for microbial dispersion. The environmental sequencing approach presented here detected a stochastic distribution of human pathogens, such as Helicobacter pylori, thereby demonstrating the potential of flies as proxies for environmental and public health surveillance.}, doi = {10.1038/s41598-017-16353-x}, url = {http://www.nature.com/articles/s41598-017-16353-x}, author = {Junqueira, AC and Ratan, Aakrosh and Acerbi, Enzo and Drautz-Moses, Daniela I. and Premkrishnan, BNV and Costea, PI and Linz, Bodo and Purbojati, Rikky W. and Paulo, Daniel F. and Gaultier, Nicolas E. and Subramanian, Poorani and Hasan, Nur A. and Rita R Colwell and Bork, Peer and Azeredo-Espin, Ana Maria L. and Bryant, Donald A. and Schuster, Stephan C.} } @article {20321, title = {Modeling Sustainability: Population, Inequality, Consumption, and Bidirectional Coupling of the Earth and Human Systems}, journal = {National Science Review}, year = {2016}, month = {Nov-12-2016}, pages = {nww081}, abstract = {Over the last two centuries, the impact of the Human System has grown dramatically, becoming strongly dominant within the Earth System in many different ways. Consumption, inequality, and population have increased extremely fast, especially since about 1950, threatening to overwhelm the many critical functions and ecosystems of the Earth System. Changes in the Earth System, in turn, have important feedback effects on the Human System, with costly and potentially serious consequences. However, current models do not incorporate these critical feedbacks. We argue that in order to understand the dynamics of either system, Earth System Models must be coupled with Human System Models through bidirectional couplings representing the positive, negative, and delayed feedbacks that exist in the real systems. In particular, key Human System variables, such as demographics, inequality, economic growth, and migration, are not coupled with the Earth System but are instead driven by exogenous estimates, such as United Nations population projections. This makes current models likely to miss important feedbacks in the real Earth{\textendash}Human system, especially those that may result in unexpected or counterintuitive outcomes, and thus requiring different policy interventions from current models. The importance and imminence of sustainability challenges, the dominant role of the Human System in the Earth System, and the essential roles the Earth System plays for the Human System, all call for collaboration of natural scientists, social scientists, and engineers in multidisciplinary research and modeling to develop coupled Earth{\textendash}Human system models for devising effective science-based policies and measures to benefit current and future generations.}, issn = {2095-5138}, doi = {10.1093/nsr/nww081}, url = {https://academic.oup.com/nsr/article-lookup/doi/10.1093/nsr/nww081}, author = {Motesharrei, Safa and Rivas, Jorge and Kalnay, Eugenia and Asrar, Ghassem R. and Busalacchi, Antonio J. and Cahalan, Robert F. and Cane, Mark A. and Rita R Colwell and Feng, Kuishuang and Franklin, Rachel S. and Hubacek, Klaus and Miralles-Wilhelm, Fernando and Miyoshi, Takemasa and Ruth, Matthias and Sagdeev, Roald and Shirmohammadi, Adel and Shukla, Jagadish and Srebric, Jelena and Yakovenko, Victor M. and Zeng, Ning} } @article {20345, title = {Molecular tools in understanding the evolution of Vibrio cholerae}, journal = {Frontiers in Microbiology}, year = {2015}, month = {Jun-10-2015}, abstract = {Vibrio cholerae, the etiological agent of cholera, has been a scourge for centuries. Cholera remains a serious health threat for developing countries and has been responsible for millions of deaths globally over the past 200 years. Identification of V. cholerae has been accomplished using a variety of methods, ranging from phenotypic strategies to DNA based molecular typing and currently whole genomic approaches. This array of methods has been adopted in epidemiological investigations, either singly or in the aggregate, and more recently for evolutionary analyses of V. cholerae. Because the new technologies have been developed at an ever increasing pace, this review of the range of fingerprinting strategies, their relative advantages and limitations, and cholera case studies was undertaken. The task was challenging, considering the vast amount of the information available. To assist the study, key references representative of several areas of research are provided with the intent to provide readers with a comprehensive view of recent advances in the molecular epidemiology of V. cholerae. Suggestions for ways to obviate many of the current limitations of typing techniques are also provided. In summary, a comparative report has been prepared that includes the range from traditional typing to whole genomic strategies.}, doi = {10.3389/fmicb.2015.01040}, url = {http://journal.frontiersin.org/Article/10.3389/fmicb.2015.01040/abstract}, author = {Rahaman, Md. Habibur and Islam, Tarequl and Rita R Colwell and Alam, Munirul} } @article {20361, title = {Microbial Community Profiling of Human Saliva Using Shotgun Metagenomic Sequencing}, journal = {PLoS ONE}, year = {2014}, month = {Aug-05-2015}, pages = {e97699}, abstract = {Human saliva is clinically informative of both oral and general health. Since next generation shotgun sequencing (NGS) is now widely used to identify and quantify bacteria, we investigated the bacterial flora of saliva microbiomes of two healthy volunteers and five datasets from the Human Microbiome Project, along with a control dataset containing short NGS reads from bacterial species representative of the bacterial flora of human saliva. GENIUS, a system designed to identify and quantify bacterial species using unassembled short NGS reads was used to identify the bacterial species comprising the microbiomes of the saliva samples and datasets. Results, achieved within minutes and at greater than 90\% accuracy, showed more than 175 bacterial species comprised the bacterial flora of human saliva, including bacteria known to be commensal human flora but also Haemophilus influenzae, Neisseria meningitidis, Streptococcus pneumoniae, and Gamma proteobacteria. Basic Local Alignment Search Tool (BLASTn) analysis in parallel, reported ca. five times more species than those actually comprising the in silico sample. Both GENIUS and BLAST analyses of saliva samples identified major genera comprising the bacterial flora of saliva, but GENIUS provided a more precise description of species composition, identifying to strain in most cases and delivered results at least 10,000 times faster. Therefore, GENIUS offers a facile and accurate system for identification and quantification of bacterial species and/or strains in metagenomic samples.}, doi = {10.1371/journal.pone.0097699}, url = {https://dx.plos.org/10.1371/journal.pone.0097699}, author = {Hasan, Nur A. and Young, Brian A. and Minard-Smith, Angela T. and Saeed, Kelly and Li, Huai and Heizer, Esley M. and McMillan, Nancy J. and Isom, Richard and Abdullah, Abdul Shakur and Bornman, Daniel M. and Faith, Seth A. and Choi, Seon Young and Dickens, Michael L. and Cebula, Thomas A. and Rita R Colwell}, editor = {Ahmed, Niyaz} } @inbook {19639, title = {On Minimal Assumptions for Sender-Deniable Public Key Encryption}, booktitle = {Public-Key Cryptography {\textendash} PKC 2014}, series = {Lecture Notes in Computer Science}, year = {2014}, month = {2014/01/01/}, pages = {574 - 591}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {The primitive of deniable encryption was introduced by Canetti et al. (CRYPTO, 1997). Deniable encryption is an encryption scheme with the added feature that after transmitting a message m, both sender and receiver may produce random coins showing that the transmitted ciphertext was an encryption of any message m' in the message space. Deniable encryption is a key tool for constructing incoercible protocols, since it allows a party to send one message and later provide apparent evidence to a coercer that a different message was sent. In addition, deniable encryption may be used to obtain adaptively-secure multiparty computation (MPC) protocols and is secure under selective-opening attacks. Different flavors such as sender-deniable and receiver-deniable encryption, where only the sender or receiver produce fake random coins, have been considered. Recently, over 15 years after the primitive was first introduced, Sahai and Waters (IACR Cryptology ePrint Archive, 2013), gave the first construction of sender-deniable encryption schemes with super-polynomial security, where an adversary has negligible advantage in distinguishing real and fake openings. Their construction is based on the construction of an indistinguishability obfuscator for general programs recently introduced in a breakthrough result of Garg et al. (FOCS, 2013). Although feasibility has now been demonstrated, the question of determining the minimal assumptions necessary for sender-deniable encryption with super-polynomial security remains open. The primitive of simulatable public key encryption (PKE), introduced by Damg{\r a}rd and Nielsen (CRYPTO, 2000), is a public key encryption scheme with additional properties that allow oblivious sampling of public keys and ciphertexts. It is one of the low-level primitives used to construct adaptively-secure MPC protocols and was used by O{\textquoteright}Neill et al. in their construction of bi-deniable encryption in the multi-distributional model (CRYPTO, 2011). Moreover, the original construction of sender-deniable encryption with polynomial security given by Canetti et al. can be instantiated with simulatable PKE. Thus, a natural question to ask is whether it is possible to construct sender-deniable encryption with super-polynomial security from simulatable PKE. In this work, we investigate the possibility of constructing sender-deniable public key encryption from simulatable PKE in a black-box manner. We show that there is no black-box construction of sender-deniable public key encryption with super-polynomial security from simulatable PKE. This indicates that improving on the original construction of Canetti et al. requires the use of non-black-box techniques, stronger assumptions, or interaction, thus giving some evidence that strong assumptions such as those used by Sahai and Waters are necessary.}, keywords = {Algorithm Analysis and Problem Complexity, black-box separation, Coding and Information Theory, Data Encryption, sender-deniable encryption, simulatable PKE, Systems and Data Security}, isbn = {978-3-642-54630-3, 978-3-642-54631-0}, url = {http://link.springer.com/chapter/10.1007/978-3-642-54631-0_33}, author = {Dana Dachman-Soled}, editor = {Krawczyk, Hugo} } @article {20362, title = {Molecular diversity and predictability of Vibrio parahaemolyticus along the Georgian coastal zone of the Black Sea}, journal = {Frontiers in Microbiology}, volume = {5}, year = {2014}, month = {Jan-01-2014}, abstract = {Vibrio parahaemolyticus is a leading cause of seafood-related gastroenteritis and is also an autochthonous member of marine and estuarine environments worldwide. One-hundred seventy strains of V. parahaemolyticus were isolated from water and plankton samples collected along the Georgian coast of the Black Sea during 28 months of sample collection. All isolated strains were tested for presence of tlh, trh, and tdh. A subset of strains were serotyped and tested for additional factors and markers of pandemicity. Twenty-six serotypes, five of which are clinically relevant, were identified. Although all 170 isolates were negative for tdh, trh, and the Kanagawa Phenomenon, 7 possessed the GS-PCR sequence and 27 the 850 bp sequence of V. parahaemolyticus pandemic strains. The V. parahaemolyticus population in the Black Sea was estimated to be genomically heterogeneous by rep-PCR and the serodiversity observed did not correlate with rep-PCR genomic diversity. Statistical modeling was used to predict presence of V. parahaemolyticus as a function of water temperature, with strongest concordance observed for Green Cape site samples (Percent of total variance = 70, P < 0.001). Results demonstrate a diverse population of V. parahaemolyticus in the Black Sea, some of which carry pandemic markers, with increased water temperature correlated to an increase in abundance of V. parahaemolyticus.}, doi = {10.3389/fmicb.2014.00045}, url = {http://journal.frontiersin.org/article/10.3389/fmicb.2014.00045}, author = {Haley, Bradd J. and Kokashvili, Tamar and Tskshvediani, Ana and Janelidze, Nino and Mitaishvili, Nino and Grim, Christopher J. and Constantin_de_Magny, Guillaume and Chen, Arlene J. and Taviani, Elisa and Eliashvili, Tamar and Tediashvili, Marina and Whitehouse, Chris A. and Rita R Colwell and Huq, Anwar} } @conference {19213, title = {Mind the Theoretical Gap: Interpreting, Using, and Developing Behavioral Theory in HCI Research}, booktitle = {CHI 2013 To Appear}, year = {2013}, month = {2013}, author = {Hekler, E. B. and Klasnja,P. and Jon Froehlich and Buman, M. P.} } @article {19686, title = {Modeling topic control to detect influence in conversations using nonparametric topic models}, journal = {Machine Learning}, year = {2013}, month = {2013/00/01}, pages = {1 - 41}, publisher = {Springer US}, abstract = {Abstract Identifying influential speakers in multi-party conversations has been the focus of research in communication, sociology, and psychology for decades. It has been long acknowledged qualitatively that controlling the topic of a conversation is a sign of ...}, doi = {10.1007/s10994-013-5417-9/fulltext.html}, url = {http://link.springer.com/article/10.1007/s10994-013-5417-9/fulltext.html}, author = {Nguyen, Viet-An and Jordan Boyd-Graber and Resnik, Philip and Cai, Deborah A and Midberry, Jennifer E and Wang, Yuanxin} } @conference {19170, title = {Making Recommendations in a Microblog to Improve the Impact of a Focal User}, booktitle = {6th ACM Conference on Recommender Systems (RecSys)}, year = {2012}, abstract = {We present a microblog recommendation system that can help monitor users, track conversations, and potentially improve diffusion impact. Given a Twitter network of active users and their followers, and historical activity of tweets, retweets and mentions, we build upon a prediction tool to predict the Top K users who will retweet or mention a focal user, in the future [10]. We develop personalized recommendations for each focal user. We identify characteristics of focal users such as the size of the follower network, or the level of sentiment averaged over all tweets; both have an impact on the quality of personalized recommendations. We use (high) betweenness centrality as a proxy of attractive users to target when making recommendations. Our recommendations successfully identify a greater fraction of users with higher betweenness centrality, in comparison to the overall distribution of betweenness centrality of the ground truth users for some focal user. }, author = {Wu,Shanchan and Gong, Leanna and Rand, William and Raschid, Louiqa} } @article {19275, title = {Mapping Parameterized Cyclo-static Dataflow Graphs onto Configurable Hardware}, journal = {Journal of Signal Processing Systems}, volume = {66}, year = {2012}, month = {2012}, pages = {285 - 301}, abstract = {In recent years, parameterized dataflow has evolved as a useful framework for modeling synchronous and cyclo-static graphs in which arbitrary parameters can be changed dynamically. Parameterized dataflow has proven to have significant expressive power for managing dynamics of DSP applications in important ways. However, efficient hardware synthesis techniques for parameterized dataflow representations are lacking. This paper addresses this void; specifically, the paper investigates efficient field programmable gate array (FPGA)-based implementation of parameterized cyclo-static dataflow (PCSDF) graphs. We develop a scheduling technique for throughput-constrained minimization of dataflow buffering requirements when mapping PCSDF representations of DSP applications onto FPGAs. The proposed scheduling technique is integrated with an existing formal schedule model, called the generalized schedule tree, to reduce schedule cost. To demonstrate our new, hardware-oriented PCSDF scheduling technique, we have designed a real-time base station emulator prototype based on a subset of long-term evolution (LTE), which is a key cellular standard.}, keywords = {4G communication systems, Circuits and Systems, Computer Imaging, Vision, Pattern Recognition and Graphics, Dataflow modeling, Electrical Engineering, FPGA implementation, Image Processing and Computer Vision, Parameterized dataflow, pattern recognition, scheduling, Signal, Image and Speech Processing}, isbn = {1939-8018, 1939-8115}, url = {http://link.springer.com/article/10.1007/s11265-011-0599-5}, author = {Kee, Hojin and Chung-Ching Shen and Bhattacharyya, Shuvra S. and Wong, Ian and Yong Rao and Kornerup, Jacob} } @article {19168, title = {Media, Aggregators and the Link Economy: Strategic Hyperlink Formation in Content Networks}, journal = {Management Science}, year = {2012}, abstract = {A key property of the World Wide Web is the possibility for firms to place virtually costless links to third-party content as a substitute or complement to their own content. This ability to hyperlink has enabled new types of players, such as search engines and content aggregators, to successfully enter content ecosystems, attracting traffic and revenues by hosting links to the content of others. This, in turn, has sparked a heated controversy between content producers and aggregators regarding the legitimacy and social costs/benefits of uninhibited free linking. This work is the first to model the implications of interrelated and strategic hyper-linking and content investments. Our results provide a nuanced view of the much-touted {\textquotedblleft}link economy,{\textquotedblright} highlighting both the beneficial consequences and the drawbacks of free hyperlinks for content producers and consumers. We show that content sites can reduce competition and improve profits by forming links to each other; in such networks one site makes high investments in content and other sites link to it. Interestingly, competitive dynamics often preclude the formation of link networks, even in settings where they would improve everyone{\textquoteright}s profits. Furthermore, such networks improve economic efficiency only when all members have similar abilities to produce content; otherwise the less capable nodes can free-ride on the content of the more capable nodes, reducing profits for the capable nodes as well as the average content quality available to consumers. Within these networks, aggregators have both positive and negative effects. By making it easier for consumers to access good quality content they increase the appeal of the entire content ecosystem relative to the alternatives. To the extent that this increases the total traffic flowing into the content ecosystem, aggregators can help increase the profits of the highest quality content sites. At the same time, however, the market entry of aggregators takes away some of the revenue that would otherwise go to content sites. Finally, by placing links to only a subset of available content, aggregators further increase competitive pressure on content sites. Interestingly, this can increase the likelihood that such sites will then attempt to alleviate the competitive pressure by forming link networks. }, author = {Dellarocas, Chris and Katona,Zsolt and Rand, William} } @article {17673, title = {Mobile Data Offloading through Opportunistic Communications and Social Participation}, journal = {Mobile Computing, IEEE Transactions on}, volume = {11}, year = {2012}, month = {2012/05//}, pages = {821 - 834}, abstract = {3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communications is a promising solution to partially solve this problem, because there is almost no monetary cost for it. We propose to exploit opportunistic communications to facilitate information dissemination in the emerging Mobile Social Networks (MoSoNets) and thus reduce the amount of mobile data traffic. As a case study, we investigate the target-set selection problem for information delivery. In particular, we study how to select the target set with only k users, such that we can minimize the mobile data traffic over cellular networks. We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. Our simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload mobile data traffic by up to 73.66 percent for a real-world mobility trace. Moreover, to investigate the feasibility of opportunistic communications for mobile phones, we implement a proof-of-concept prototype, called Opp-off, on Nokia N900 smartphones, which utilizes their Bluetooth interface for device/service discovery and content transfer.}, keywords = {3G mobile communication, 3G networks, Bluetooth interface, cellular networks, cellular radio, content transfer, device/service discovery, graph theory, greedy algorithm, heuristic algorithm, information delivery, information dissemination, mobile data offloading, mobile data traffic, mobile phones, mobile social networks, MoSoNets, Nokia N900 smartphones, Opp-off, opportunistic communications, random algorithm, real-world mobility traces, smart phones, social networking (online), social participation, target-set selection problem, telecommunication network routing, Telecommunication traffic, trace-driven simulation study}, isbn = {1536-1233}, doi = {10.1109/TMC.2011.101}, author = {Han,Bo and Hui,Pan and Kumar,V. S.A and Marathe,M. V and Shao,Jianhua and Srinivasan, Aravind} } @article {13829, title = {Modality and Negation in SIMT Use of Modality and Negation in Semantically-Informed Syntactic MT}, journal = {Computational Linguistics}, year = {2012}, month = {2012///}, pages = {1 - 48}, abstract = {This paper describes the resource- and system-building efforts of an eight-week Johns Hopkins University Human Language Technology Center of Excellence Summer Camp for Applied Language Exploration (SCALE-2009) on Semantically-Informed Machine Translation (SIMT). We describe a new modality/negation (MN) annotation scheme, the creation of a (publicly available) MN lexicon, and two automated MN taggers that we built using the annotation scheme and lexicon. Our annotation scheme isolates three components of modality and negation: a trigger (a word that conveys modality or negation), a target (an action associated with modality or negation) and a holder (an experiencer of modality). We describe how our MN lexicon was semi-automatically produced and we demonstrate that a structure-based MN tagger results in precision around 86\% (depending on genre) for tagging of a standard LDC data set.}, isbn = {0891-2017}, doi = {10.1162/COLI_a_00099}, url = {http://dx.doi.org/10.1162/COLI_a_00099}, author = {Baker,Kathryn and Bloodgood,Michael and Dorr, Bonnie J and Callison-Burch,Chris and Filardo,Nathaniel W. and Piatko,Christine and Levin,Lori and Miller,Scott} } @conference {12423, title = {Modeling Images using Transformed Indian Buffet Processes}, booktitle = {International Conference of Machine Learning}, year = {2012}, month = {2012///}, abstract = {Latent feature models are attractive for image modeling, since images generally contain mul- tiple objects. However, many latent feature models ignore that objects can appear at dif- ferent locations or require pre-segmentation of images. While the transformed Indian buffet process (tIBP) provides a method for modeling transformation-invariant features in unsegmented binary images, its current form is inappropriate for real images because of its computational cost and modeling assumptions. We combine the tIBP with likelihoods appropriate for real images and develop an efficient inference, using the cross- correlation between images and features, that is theoretically and empirically faster than existing inference techniques. Our method discovers rea- sonable components and achieve effective image reconstruction in natural images.}, author = {Zhai,Ke and Hu,Yuening and Williamson,Sinead and Jordan Boyd-Graber} } @conference {12418, title = {Mr. LDA: A Flexible Large Scale Topic Modeling Package using Variational Inference in MapReduce}, booktitle = {Proceedings of ACM International Conference on World Wide Web, 2012}, year = {2012}, month = {2012///}, abstract = {Latent Dirichlet Allocation (LDA) is a popular topic modeling tech- nique for exploring document collections. Because of the increasing prevalence of large datasets, there is a need to improve the scal- ability of inference for LDA. In this paper, we introduce a novel and flexible large scale topic modeling package in MapReduce (Mr. LDA). As opposed to other techniques which use Gibbs sampling, our proposed framework uses variational inference, which easily fits into a distributed environment. More importantly, this variational implementation, unlike highly tuned and specialized implementa- tions based on Gibbs sampling, is easily extensible. We demonstrate two extensions of the models possible with this scalable framework: informed priors to guide topic discovery and extracting topics from a multilingual corpus. We compare the scalability of Mr. LDA against Mahout, an existing large scale topic modeling package. Mr. LDA out-performs Mahout both in execution speed and held-out likelihood.}, author = {Zhai,Ke and Jordan Boyd-Graber and Asadi,Nima and Alkhouja,Mohamad} } @inbook {13822, title = {Machine Translation Evaluation and Optimization}, booktitle = {Handbook of Natural Language Processing and Machine TranslationHandbook of Natural Language Processing and Machine Translation}, year = {2011}, month = {2011///}, pages = {745 - 843}, publisher = {Springer New York}, organization = {Springer New York}, abstract = {The evaluation of machine translation (MT) systems is a vital field of research, both for determining the effectiveness of existing MT systems and for optimizing the performance of MT systems. This part describes a range of different evaluation approaches used in the GALE community and introduces evaluation protocols and methodologies used in the program. We discuss the development and use of automatic, human, task-based and semi-automatic (human-in-the-loop) methods of evaluating machine translation, focusing on the use of a human-mediated translation error rate HTER as the evaluation standard used in GALE. We discuss the workflow associated with the use of this measure, including post editing, quality control, and scoring. We document the evaluation tasks, data, protocols, and results of recent GALE MT Evaluations. In addition, we present a range of different approaches for optimizing MT systems on the basis of different measures. We outline the requirements and specific problems when using different optimization approaches and describe how the characteristics of different MT metrics affect the optimization. Finally, we describe novel recent and ongoing work on the development of fully automatic MT evaluation metrics that have the potential to substantially improve the effectiveness of evaluation and optimization of MT systems.}, isbn = {978-1-4419-7713-7}, url = {http://dx.doi.org/10.1007/978-1-4419-7713-7_5}, author = {Dorr, Bonnie J and Olive,Joseph and McCary,John and Christianson,Caitlin}, editor = {Olive,Joseph and Christianson,Caitlin and McCary,John} } @booklet {19456, title = {Making infrastructure visible: a case study of home networking}, year = {2011}, month = {2011/06/24/}, abstract = {In this dissertation, I examine how making infrastructure visible affects users{\textquoteright} engagement with that infrastructure, through the case study of home networking. I present empirical evidence of the visibility issues that home networks present to users and how these results informed the design of a prototype called Kermit to visualize aspects of the home network. Through my implementation and evaluation of Kermit, I derive implications for making infrastructure visible in ways that enable end-users to manage and understand the systems they use everyday. I conclude with suggestions for future work for making home networks, and infrastructure more generally, more visible.}, keywords = {Home computer networks, home networking, Human computer interaction, Human-computer interaction, infrastructure, Inspectability, Local area networks (Computer networks), visibility}, doi = {Dissertation}, url = {https://smartech.gatech.edu/handle/1853/41152}, author = {Marshini Chetty} } @conference {13595, title = {Maryland at FIRE 2011: Retrieval of OCRed Bengali}, booktitle = {FIRE}, year = {2011}, month = {2011///}, abstract = {In this year{\textquoteright}s Forum for Information Retrieval Evaluation (FIRE), the University of Maryland participated in the Retrieval of Indic Script OCRed Text (RISOT) task to experiment with the retrieval of Bengali script OCR{\textquoteright}d documents. The experiments focused on evaluating a retrieval strategy motivated by recent work on Cross-Language Information Retrieval (CLIR), but which makes use of OCR error modeling rather than parallel text alignment. The approach obtains a probability distribution over substitutions for the actual query terms that possibly correspond to terms in the document representation. The results reported indicate that this is a promising way of using OCR error modeling to improve CLIR.}, author = {Garain,Utpal and David Doermann and Oard,Douglas D.} } @conference {14470, title = {Materializing multi-relational databases from the web using taxonomic queries}, booktitle = {Proceedings of the fourth ACM international conference on Web search and data mining}, series = {WSDM {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {355 - 364}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Recently, much attention has been given to extracting tables from Web data. In this problem, the column definitions and tuples (such as what "company" is headquartered in what "city,") are extracted from Web text, structured Web data such as lists, or results of querying the deep Web, creating the table of interest. In this paper, we examine the problem of extracting and discovering multiple tables in a given domain, generating a truly multi-relational database as output. Beyond discovering the relations that define single tables, our approach discovers and leverages "within column" set membership relations, and discovers relations across the extracted tables (e.g., joins). By leveraging within-column relations our method can extract table instances that are ambiguous or rare, and by discovering joins, our method generates truly multi-relational output. Further, our approach uses taxonomic queries to bootstrap the extraction, rather than the more traditional "seed instances." Creating seeds often requires more domain knowledge than taxonomic queries, and previous work has shown that extraction methods may be sensitive to which input seeds they are given. We test our approach on two real world domains: NBA basketball and cancer information. Our results demonstrate that our approach generates databases of relevant tables from disparate Web information, and discovers the relations between them. Further, we show that by leveraging the "within column" relation our approach can identify a significant number of relevant tuples that would be difficult to do so otherwise.}, keywords = {discovering multi-relational data, multirelational data}, isbn = {978-1-4503-0493-1}, doi = {10.1145/1935826.1935885}, url = {http://doi.acm.org/10.1145/1935826.1935885}, author = {Michelson,Matthew and Macskassy,Sofus A. and Minton,Steven N. and Getoor, Lise} } @conference {13383, title = {Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems}, booktitle = {2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS)}, year = {2011}, month = {2011/10/22/25}, pages = {797 - 806}, publisher = {IEEE}, organization = {IEEE}, abstract = {We study the stochastic versions of a broad class of combinatorial problems where the weights of the elements in the input dataset are uncertain. The class of problems that we study includes shortest paths, minimum weight spanning trees, and minimum weight matchings over probabilistic graphs, and other combinatorial problems like knapsack. We observe that the expected value is inadequate in capturing different types of risk averse or risk-prone behaviors, and instead we consider a more general objective which is to maximize the expected utility of the solution for some given utility function, rather than the expected weight (expected weight becomes a special case). We show that we can obtain a polynomial time approximation algorithm with additive error ϵ for any ϵ >; 0, if there is a pseudopolynomial time algorithm for the exact version of the problem (This is true for the problems mentioned above) and the maximum value of the utility function is bounded by a constant. Our result generalizes several prior results on stochastic shortest path, stochastic spanning tree, and stochastic knapsack. Our algorithm for utility maximization makes use of the separability of exponential utility and a technique to decompose a general utility function into exponential utility functions, which may be useful in other stochastic optimization problems.}, keywords = {Approximation algorithms, Approximation methods, combinatorial problems, Fourier series, knapsack problems, optimisation, OPTIMIZATION, polynomial approximation, polynomial time approximation algorithm, Polynomials, Random variables, stochastic combinatorial optimization, stochastic knapsack, stochastic shortest path, stochastic spanning tree, vectors}, isbn = {978-1-4577-1843-4}, doi = {10.1109/FOCS.2011.33}, author = {Li,Jian and Deshpande, Amol} } @article {17622, title = {Maximum bipartite flow in networks with adaptive channel width}, journal = {Theoretical Computer Science}, volume = {412}, year = {2011}, month = {2011/05/27/}, pages = {2577 - 2587}, abstract = {Traditionally, network optimization problems assume that each link in the network has a fixed capacity. Recent research in wireless networking has shown that it is possible to design networks where the capacity of the links can be changed adaptively to suit the needs of specific applications. In particular, one gets a choice of having a few high capacity outgoing links or many low capacity ones at any node of the network. This motivates us to have a re-look at classical network optimization problems and design algorithms to solve them in this new framework. In particular, we consider the problem of maximum bipartite flow, which has been studied extensively in the fixed-capacity network model. One of the motivations for studying this problem arises from the need to maximize the throughput of an infrastructure wireless network comprising base-stations (one set of vertices in the bipartition) and clients (the other set of vertices in the bipartition). We show that this problem has a significantly different combinatorial structure in this new network model from the fixed-capacity one. While there are several polynomial time algorithms for the maximum bipartite flow problem in traditional networks, we show that the problem is NP-hard in the new model. In fact, our proof extends to showing that the problem is APX-hard. We complement our lower bound by giving two algorithms for solving the problem approximately. The first algorithm is deterministic and achieves an approximation factor of O ( log N ) , where N is the number of nodes in the network, while the second algorithm is randomized and achieves an approximation factor of e e - 1 .}, keywords = {Adaptive channel width, graph algorithm, Linear program rounding, Maximum flow, Wireless networks}, isbn = {0304-3975}, doi = {10.1016/j.tcs.2010.10.023}, url = {http://www.sciencedirect.com/science/article/pii/S0304397510005852}, author = {Azar,Yossi and M{\k a}dry,Aleksander and Moscibroda,Thomas and Panigrahi,Debmalya and Srinivasan, Aravind} } @conference {17904, title = {MDMap: A system for data-driven layout and exploration of molecular dynamics simulations}, booktitle = {Biological Data Visualization (BioVis), 2011 IEEE Symposium on}, year = {2011}, month = {2011/10//}, pages = {111 - 118}, abstract = {Contemporary molecular dynamics simulations result in a glut of simulation data, making analysis and discovery a difficult and burdensome task. We present MDMap, a system designed to summarize long-running molecular dynamics (MD) simulations. We represent a molecular dynamics simulation as a state transition graph over a set of intermediate (stable and semi-stable) states. The transitions amongst the states together with their frequencies represent the flow of a biomolecule through the trajectory space. MDMap automatically determines potential intermediate conformations and the transitions amongst them by analyzing the conformational space explored by the MD simulation. MDMap is an automated system to visualize MD simulations as state-transition diagrams, and can replace the current tedious manual layouts of biomolecular folding landscapes with an automated tool. The layout of the representative states and the corresponding transitions among them is presented to the user as a visual synopsis of the long-running MD simulation. We compare and contrast multiple presentations of the state transition diagrams, such as conformational embedding, and spectral, hierarchical, and force-directed graph layouts. We believe this system could provide a road-map for the visualization of other stochastic time-varying simulations in a variety of different domains.}, keywords = {computing;digital, driven, DYNAMICS, exploration;data, folding, graph;stochastic, landscapes;data, layout;molecular, MDMap;biomolecular, method;stochastic, processes;, simulation;graph, simulations;state, simulations;trajectory, space;biology, theory;molecular, time-varying, transition}, doi = {10.1109/BioVis.2011.6094055}, author = {Patro,R. and Ip, Cheuk Yiu and Bista,S. and Cho,S.S. and Thirumalai,D. and Varshney, Amitabh} } @article {16039, title = {Medication Reconciliation: Work Domain Ontology, Prototype Development, and a Predictive Model}, journal = {AMIA Annual Symposium ProceedingsAMIA Annu Symp Proc}, volume = {2011}, year = {2011}, month = {2011///}, pages = {878 - 887}, abstract = {Medication errors can result from administration inaccuracies at any point of care and are a major cause for concern. To develop a successful Medication Reconciliation (MR) tool, we believe it necessary to build a Work Domain Ontology (WDO) for the MR process. A WDO defines the explicit, abstract, implementation-independent description of the task by separating the task from work context, application technology, and cognitive architecture. We developed a prototype based upon the WDO and designed to adhere to standard principles of interface design. The prototype was compared to Legacy Health System{\textquoteright}s and Pre-Admission Medication List Builder MR tools via a Keystroke-Level Model analysis for three MR tasks. The analysis found the prototype requires the fewest mental operations, completes tasks in the fewest steps, and completes tasks in the least amount of time. Accordingly, we believe that developing a MR tool, based upon the WDO and user interface guidelines, improves user efficiency and reduces cognitive load.}, isbn = {1942-597X}, author = {Markowitz,Eliz and Bernstam,Elmer V. and Herskovic,Jorge and Zhang,Jiajie and Shneiderman, Ben and Plaisant, Catherine and Johnson,Todd R.} } @article {12859, title = {Metagenomic 16S rDNA Targeted PCR-DGGE in Determining Bacterial Diversity in Aquatic Ecosystem}, journal = {Bangladesh Journal of Microbiology}, volume = {27}, year = {2011}, month = {2011/12/13/}, abstract = {Bacterial numbers in surface water samples, collected randomly from six different water bodies, were estimated by acridine orange direct counting (AODC) and conventional culture-based heterotrophic plate counting (HPC). Bacterial genomic DNA was prepared from water samples by employing methods used for stool samples, including the population dynamics, were determined by primer extension of the 16S rDNA (V6/V8 region) using polymerase chain reaction (PCR), followed by denaturing gradient gel electrophoresis (DGGE), a metagenomic tool that is capable of separating unrelated DNAs based on the differences in their sequences and GC contents. The bacterial numbers in water samples ranged from 103 {\textendash} 106 CFU/ mL for HPC and 104 {\textendash} 107 cells/ mL for AODC, showing that a great majority of bacteria prevail as uncultivable which do not respond to culture methods that are used widely for tracking bacterial pathogens. The acridine orange-stained bacteria varied in sizes and shapes, and appeared either as planktonic (solitary) cells or as clusters of biofilms, showing the presence of diverse community under the epifluorescence microscope. The DGGE of the ca. 457 bp amplicons, as confirmed by agarose gel electrophoresis, produced bands that ranged in intensities and numbers from 18 to 31, with each band possibly indicating the presence of one or more closely related bacterial species. The enrichment of pathogenic bacteria in the aquatic ecosystem is known to precede the seasonal diarrhoeal outbreaks; therefore, bacterial community dynamics determined by Metagenomic 16S PCR-DGGE during pre-epidemic enrichment appears promising in predicting the upcoming diarrheal outbreaks.}, isbn = {1011-9981}, doi = {10.3329/bjm.v27i2.9171}, url = {http://www.banglajol.info/bd/index.php/BJM/article/view/9171}, author = {Hasan,Nur A. and Chowdhury,W Bari and Rahim,Niaz and Sultana,Marzia and Shabnam,S Antara and Mai,Volker and Ali,Afsar and Morris,Glen J and Sack,R. Bradley and Huq,Anwar and Rita R Colwell and Endtz,Hubert Ph and Cravioto,Alejandro and Alam,Munirul} } @article {19117, title = {MetaPath: identifying differentially abundant metabolic pathways in metagenomic datasets}, journal = {BMC proceedings}, volume = {5}, year = {2011}, month = {2011}, author = {Liu,B. and Pop, Mihai} } @article {13944, title = {Method and System for Dereverberation of Signals Propagating in ...}, volume = {13/047,311}, year = {2011}, month = {2011/03//}, abstract = {The dereverberation of signals in reverberating environments is carried out via acquiring the representation (image) of spatial distribution of the signals in space of interest and automatic identification of reflections of the source signal in the reverberative space. The technique relies on identification of prominent features at the image, as well as corresponding directions of propagation of signals manifested by the prominent features at the image, and computation of similarity metric between signals corresponding to the prominent features in the image. The time delays between the correlated signals (i.e., source signal and related reflections) are found and the signals are added coherently. Multiple beamformers operate on the source signal and corresponding reflections, enabling one to improve the signal-to-noise ratio in multi-path environments.}, url = {http://www.google.com/patents?id=gBHuAQAAEBAJ}, author = {O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Zotkin,Dmitry N}, editor = {University of Maryland} } @article {12443, title = {Method and system for markerless motion capture using multiple cameras}, volume = {11/937,834}, year = {2011}, month = {2011/09/20/}, abstract = {Completely automated end-to-end method and system for markerless motion capture performs segmentation of articulating objects in Laplacian Eigenspace and is applicable to handling of the poses of some complexity. 3D voxel representation of acquired images are mapped to a higher dimensional space (k), where k depends on the number of articulated chains of the subject body, so as to extract the 1-D representations of the articulating chains. A bottom-up approach is suggested in order to build a parametric (spline-based) representation of a general articulated body in the high dimensional space followed by a top-down probabilistic approach that registers the segments to an average human body model. The parameters of the model are further optimized using the segmented and registered voxels.}, url = {http://www.google.com/patents?id=-THwAQAAEBAJ}, author = {Sundaresan,Aravind and Chellapa, Rama}, editor = {University of Maryland} } @article {14413, title = {A method for the detection of meaningful and reproducible group signatures from gene expression profiles}, journal = {Journal of Bioinformatics and Computational Biology}, volume = {9}, year = {2011}, month = {2011///}, pages = {431 - 451}, abstract = {Gene expression microarrays are commonly used to detect the biological signature of a disease or to gain a better understanding of the underlying mechanism of how a group of drugs treat a specific disease. The outcome of such experiments, e.g. the signature, is a list of differentially expressed genes. Reproducibility across independent experiments remains a challenge. We are interested in creating a method that can detect the shared signature of a group of expression profiles, e.g. a group of samples from individuals with the same disease or a group of drugs that treat the same therapeutic indication. We have developed a novel Weighted Influence {\textemdash} Rank of Ranks (WIMRR) method, and we demonstrate its ability to produce both meaningful and reproducible group signatures.}, author = {Licamele,L. and Getoor, Lise} } @conference {19262, title = {Methods for design and implementation of dynamic signal processing systems}, booktitle = {2011 International Conference on Embedded Computer Systems (SAMOS)}, year = {2011}, month = {2011}, pages = {i - i}, abstract = {Summary form only given. Dynamic signal processing systems, where significant changes in functionality and computational structure must be achieved while applications are running, are becoming increasingly important as computational platforms become more powerful, and feature-sets of DSP-powered products become more sophisticated. This talk covers two new, complementary dataflow models of computation that are being developed in the Maryland DSPCAD Research Group to help address the challenges of structured design, simulation, and synthesis of dynamic signal processing systems. The first of these models, called enable-invoke dataflow (EIDF), is aimed improving the predictability of actor invocation and the efficiency with which dynamic scheduling techniques can be realized. The second model, called the dataflow schedule graph (DSG), provides a formal framework for representing and analyzing dataflow graph schedules that is rooted in formal dataflow semantics, and accommodates a wide range of schedule classes, including static, quasi-static, and dynamic schedules, as well as both sequential and parallel schedule formats. In this talk, I will present the EIDF and DSG models and discuss their potential to improve the processes by which dynamic signal processing systems are developed.}, keywords = {actor invocation predictability, complementary dataflow models, Computational modeling, computational structure, COMPUTERS, data flow graphs, dataflow schedule graph, DSG models, DSP-powered products, Dynamic scheduling, dynamic scheduling techniques, dynamic signal processing systems, Educational institutions, EIDF models, enable-invoke dataflow, formal dataflow semantics, functionality structure, Laboratories, Maryland DSPCAD Research Group, quasi-static schedules, Schedules, scheduling, Signal processing, static schedules}, author = {Bhattacharyya, Shuvra S.} } @conference {13454, title = {Model AI Assignments 2011}, booktitle = {Second AAAI Symposium on Educational Advances in Artificial Intelligence}, year = {2011}, month = {2011/04/08/}, abstract = {The Model AI Assignments session seeks to gather and disseminate the best assignment designs of the Artificial Intelligence (AI) Education community. Recognizing that assignments form the core of student learning experience, we here present abstracts of three AI assignments from the 2011 session that are easily adoptable, playfully engaging, and flexible for a variety of instructor needs.}, url = {http://www.aaai.org/ocs/index.php/EAAI/EAAI11/paper/viewPaper/3452}, author = {Neller,Todd William and desJardins, Marie and Oates,Tim and Taylor,Matthew E} } @article {19276, title = {Model-based precision analysis and optimization for digital signal processors}, journal = {Proceedings of the European Signal Processing Conference}, year = {2011}, month = {2011}, pages = {506 - 510}, abstract = {Embedded signal processing has witnessed explosive growth in re-cent years in both scientific and consumer applications, driving the need for complex, high-performance signal processing systems that are largely application driven. In order to efficiently implement these systems on programmable platforms such as digital signal processors (DSPs), it is important to analyze and optimize the ap- plication design from early stages of the design process. A key per- formance concern for designers is choosing the data format. In this work, we propose a systematic and efficient design flow involving model-based design to analyze application data sets and precision requirements. We demonstrate this design flow with an exploration study into the required precision for eigenvalue decomposition (EVD) using the Jacobi algorithm. We demonstrate that with a high degree of structured analysis and automation, we are able to analyze the data set to derive an efficient data format, and optimize important parts of the algorithm with respect to precision. }, author = {Kedilaya, Soujanya and Plishker,William and Purkovic, Aleksandar and Johnson, Brian and Bhattacharyya, Shuvra S.} } @conference {19270, title = {A Model-Based Schedule Representation for Heterogeneous Mapping of Dataflow Graphs}, booktitle = {2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)}, year = {2011}, month = {2011}, pages = {70 - 81}, abstract = {Dataflow-based application specifications are widely used in model-based design methodologies for signal processing systems. In this paper, we develop a new model called the dataflow schedule graph (DSG) for representing a broad class of dataflow graph schedules. The DSG provides a graphical representation of schedules based on dataflow semantics. In conventional approaches, applications are represented using dataflow graphs, whereas schedules for the graphs are represented using specialized notations, such as various kinds of sequences or looping constructs. In contrast, the DSG approach employs dataflow graphs for representing both application models and schedules that are derived from them. Our DSG approach provides a precise, formal framework for unambiguously representing, analyzing, manipulating, and interchanging schedules. We develop detailed formulations of the DSG representation, and present examples and experimental results that demonstrate the utility of DSGs in the context of heterogeneous signal processing system design.}, keywords = {Computational modeling, data flow graphs, dataflow schedule graph, dataflow semantics, dataflow-based application specifications, Dynamic scheduling, heterogeneous mapping, heterogeneous signal processing system design, model-based design methodologies, model-based schedule representation, Processor scheduling, Program processors, Schedules, semantics, Signal processing, synchronization}, author = {Wu, Hsiang-Huang and Chung-Ching Shen and Sane, N. and Plishker,W. and Bhattacharyya, Shuvra S.} } @article {18242, title = {Modeling and Analysis of Correlated Binary Fingerprints for Content Identification}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {6}, year = {2011}, month = {2011/09//}, pages = {1146 - 1159}, abstract = {Multimedia identification via content fingerprints is used in many applications, such as content filtering on user-generated content websites, and automatic multimedia identification and tagging. A compact $\#$x201C;fingerprint $\#$x201D; is computed for each multimedia signal that captures robust and unique properties of the perceptual content, which is later used for identifying the multimedia. Several different multimedia fingerprinting schemes have been proposed in the literature and have been evaluated through experiments. To complement these experimental evaluations and provide guidelines for choosing system parameters and designing better schemes, this paper develops models for content fingerprinting and provides an analysis of the identification performance under these models. As a first step, bounds on the identification accuracy and the required fingerprint length for the simplest case when the fingerprint bits are modeled as i.i.d. are summarized. Markov Random Fields are then used to address more realistic settings of fingerprints with correlated components. The optimal likelihood ratio detector is derived and a statistical physics inspired approach for computing the probability of detection and probability of false alarm is described. The analysis shows that the commonly used Hamming distance detection criterion is susceptible to correlations among fingerprint bits, whereas the optimal log-likelihood ratio decision rule yields 5-20\% improvement in the accuracy over a range of correlations. Simulation results demonstrate the validity of the theoretical predictions.}, keywords = {alarm, approach;user, binary, computing;, content, criterion;Markov, decision, DETECTION, detector;statistical, distance, fields;content, filtering;content, filtering;multimedia, fingerprinting, fingerprints;detection, generated, Hamming, identification;correlated, identification;optimal, inspired, likelihood, Physics, probability;false, probability;log, processes;Web, random, ratio, rule;multimedia, schemes;multimedia, sites;information, Websites;Markov}, isbn = {1556-6013}, doi = {10.1109/TIFS.2011.2152394}, author = {Varna,A.L. and M. Wu} } @conference {19261, title = {Modeling and optimization of dynamic signal processing in resource-aware sensor networks}, booktitle = {2011 8th IEEE International Conference on Advanced Video and Signal-Based Surveillance (AVSS)}, year = {2011}, month = {2011}, pages = {449 - 454}, abstract = {Sensor node processing in resource-aware sensor networks is often critically dependent on dynamic signal processing functionality - i.e., signal processing functionality in which computational structure must be dynamically assessed and adapted based on time-varying environmental conditions, operating constraints or application requirements. In dynamic signal processing systems, it is important to provide flexibility for run-time adaptation of application behavior and execution characteristics, but in the domain of resource-aware sensor networks, such flexibility cannot come with significant costs in terms of power consumption overhead or reduced predictability. In this paper, we review a variety of complementary models of computation that are being developed as part of the dataflow interchange format (DIF) project to facilitate efficient and reliable implementation of dynamic signal processing systems. We demonstrate these methods in the context of resource-aware sensor networks.}, keywords = {Adaptation models, Aerodynamics, Computational modeling, data flow graphs, dataflow interchange format, Dynamic scheduling, dynamic signal processing, power consumption overhead, Program processors, resource-aware sensor networks, run-time adaptation, Schedules, sensor node processing, Signal processing, Wireless sensor networks}, author = {Bhattacharyya, Shuvra S. and Plishker,W. and Sane, N. and Chung-Ching Shen and Wu, Hsiang-Huang} } @conference {12406, title = {Modeling diverse standpoints in text classification: learning to be human by modeling human values}, booktitle = {Proceedings of the 2011 iConference}, series = {iConference {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {672 - 673}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {An annotator{\textquoteright}s classification of a text not only tells us something about the intent of the text{\textquoteright}s author, it also tells us something about the annotator{\textquoteright}s standpoint. To understand authorial intent, we can consider all of these diverse standpoints, as well as the extent to which the annotators{\textquoteright} standpoints affect their perceptions of authorial intent. To model human behavior, it is important to model humans{\textquoteright} unique standpoints. Human values play an especially important role in determining human behavior and how people perceive the world around them, so any effort to model human behavior and perception can benefit from an effort to understand and model human values. Instead of training humans to obscure their standpoints and act like computers, we should teach computers to have standpoints of their own.}, keywords = {diversity, framing theory, machine learning, standpoint epistemology, value sensitive computing}, isbn = {978-1-4503-0121-3}, doi = {10.1145/1940761.1940863}, url = {http://doi.acm.org/10.1145/1940761.1940863}, author = {Fleischmann,Kenneth R. and Templeton,Thomas Clay and Jordan Boyd-Graber} } @article {13303, title = {Modeling Multiresolution 3D Scalar Fields through Regular Simplex Bisection}, journal = {Scientific Visualization: Interactions, Features, Metaphors}, volume = {2}, year = {2011}, month = {2011///}, pages = {360 - 377}, abstract = {We review modeling techniques for multiresolution three-dimensional scalar fields based on a dis-cretization of the field domain into nested tetrahedral meshes generated through regular simplex bisection. Such meshes are described through hierarchical data structures and their representa- tion is characterized by the modeling primitive used. The primary conceptual distinction among the different approaches proposed in the literature is whether they treat tetrahedra or clusters of tetrahedra, called diamonds, as the modeling primitive. We first focus on representations for the modeling primitive and for nested meshes. Next, we survey the applications of these meshes to modeling multiresolution 3D scalar fields, with an emphasis on interactive visualization. We also consider the relationship of such meshes to octrees. Finally, we discuss directions for further research }, author = {Weiss,K. and De Floriani, Leila and Hagen,H.} } @conference {18245, title = {Modeling temporal correlations in content fingerprints}, booktitle = {Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on}, year = {2011}, month = {2011/05//}, pages = {1860 - 1863}, abstract = {Previous analysis of content fingerprints has mainly focused on the case of independent and identically distributed finger prints. Practical fingerprints, however, exhibit correlations between components computed from successive frames. In this paper, a Markov chain based model is used to capture the temporal correlations, and the suitability of this model is evaluated through experiments on a video database. The results indicate that the Markov chain model is a good fit only in a certain regime. A hybrid model is then developed to account for this behavior and a corresponding adaptive detector is derived. The adaptive detector achieves better identification accuracy at a small computational expense.}, keywords = {chain, correlations;video, database;Markov, databases;, databases;video, detection;fingerprint, detector;certain, fingerprints;hybrid, identification;temporal, Markov, model;adaptive, model;temporal, processes;adaptive, regime;content, signal}, doi = {10.1109/ICASSP.2011.5946868}, author = {Varna,A.L. and M. Wu} } @article {18587, title = {Modeling Tiered Pricing in the Internet Transit Market}, journal = {Arxiv preprint arXiv:1112.3740}, year = {2011}, month = {2011/12/16/}, abstract = {ISPs are increasingly selling "tiered" contracts, which offer Internet 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 such pricing affects ISPs and their customers. While contracts that sell connectivity on finer granularities improve market efficiency, they are also more costly for ISPs to implement and more difficult for customers to understand. In this work we present two contributions: (1) we develop a novel way of mapping traffic and topology 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 pricing strategies on both the ISP profit and the consumer surplus. We highlight three core findings. First, ISPs gain most of the profits with only three or four pricing tiers and likely have little incentive to increase granularity of pricing even further. Second, we show that consumer surplus follows closely, if not precisely, the increases in ISP profit with more pricing tiers. Finally, 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.}, keywords = {Computer Science - Networking and Internet Architecture}, url = {http://arxiv.org/abs/1112.3740}, author = {Valancius,Vytautas and Lumezanu,Cristian and Feamster, Nick and Johari,Ramesh and Vazirani,Vijay V.} } @conference {19621, title = {MOMMIE Knows Best: Systematic Optimizations for Verifiable Distributed Algorithms}, booktitle = {HotOS{\textquoteright}13 Proceedings of the 13th USENIX Conference on Hot Topics in Operating Systems }, series = {HotOS{\textquoteright}13}, year = {2011}, month = {2011///}, pages = {30 - 30}, publisher = {USENIX Association}, organization = {USENIX Association}, url = {http://dl.acm.org/citation.cfm?id=1991596.1991636}, author = {Maniatis, Petros and Dietz, Michael and Charalampos Papamanthou} } @conference {17299, title = {Motivation for Participation in Online Neighborhood Watch Communities: An Empirical Study Involving Invitation Letters}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {760 - 765}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents a three-part experiment designed to investigate the motivations of users of a community safety and neighborhood watch social networking website. The experiment centers around an intervention into the invitation system that current users employ to invite nonmembers to join the site, and involves several versions of an invitation email which differ by expressing one of four possible motivations for using such a site. The research presented investigates how potential users{\textquoteright} choice of whether or not to join the site is affected by the use case presented by the invitation. It also includes an investigation of the motivations of current users of the site, as reported in an online survey. The experiment yielded no significant difference in responses to the emails. Overall, invitations that included a specific motivation slightly outperformed those which did not, but not to a statistically significant degree. We conclude that although users have specific motivations for using the site, as reported in the survey, attempting to increase response rates to invitation emails by suggesting use cases of the site is surprisingly unlikely to be successful.}, keywords = {Art, Communities, community safety, Electronic mail, Interviews, invitation email, invitations, motivation, neighborhood watch, Online communities, online neighborhood watch communities, online survey, participation, Safety, Security, social media, Social network services, social networking (online), social networking Website}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.108}, author = {Violi,N. and Shneiderman, Ben and Hanson,A. and Rey,P. J} } @conference {13075, title = {Multi-agent event recognition in structured scenarios}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {3289 - 3296}, abstract = {We present a framework for the automatic recognition of complex multi-agent events in settings where structure is imposed by rules that agents must follow while performing activities. Given semantic spatio-temporal descriptions of what generally happens (i.e., rules, event descriptions, physical constraints), and based on video analysis, we determine the events that occurred. Knowledge about spatio-temporal structure is encoded using first-order logic using an approach based on Allen{\textquoteright}s Interval Logic, and robustness to low-level observation uncertainty is provided by Markov Logic Networks (MLN). Our main contribution is that we integrate interval-based temporal reasoning with probabilistic logical inference, relying on an efficient bottom-up grounding scheme to avoid combinatorial explosion. Applied to one-on-one basketball, our framework detects and tracks players, their hands and feet, and the ball, generates event observations from the resulting trajectories, and performs probabilistic logical inference to determine the most consistent sequence of events. We demonstrate our approach on 1hr (100,000 frames) of outdoor videos.}, keywords = {Allen, analysis;Markov, descriptions;video, event, grounding, inference;semantic, interval, Logic, logic;interval-based, logic;Markov, logic;multi-agent, logical, networks;bottom-up, processes;formal, processing;, reasoning;multiagent, reasoning;video, recognition;probabilistic, recognition;temporal, scheme;first-order, signal, spatio-temporal, systems;object, temporal}, doi = {10.1109/CVPR.2011.5995386}, author = {Morariu,V.I. and Davis, Larry S.} } @conference {18861, title = {Multi-material compliant mechanisms for mobile millirobots}, year = {2011}, month = {2011/05//}, pages = {3169 - 3174}, abstract = {This paper describes a new process for fabricating planar, multi-material, compliant mechanisms, intended for use in small scale robotics. The process involves laser cutting the mechanism geometry from a rigid material, and refilling the joint areas with a second, elastomeric material. This method allows for a large set of potential materials, with a wide range of material properties, to be used in combination to create mechanisms with highly tailored mechanical properties. These multi-material compliant mechanisms have minimum feature sizes of approximately 100 $\#$x00B5;m and have demonstrated long lifetimes, easily surviving 100,000 bending cycles. We also present the first use of these compliant mechanisms in a 2.5cm $\#$x00D7; 2.5cm $\#$x00D7; 7.5cm, 6g hexapod. This hexapod has been demonstrated moving at speeds up to 6 cm/s, with a predicted maximum speed of up to 17 cm/s.}, doi = {10.1109/ICRA.2011.5980543}, author = {Vogtmann,Dana E. and Gupta, Satyandra K. and Bergbreiter,Sarah} } @article {14709, title = {MultiOtter: Multiprocess Symbolic Execution}, journal = {Technical Reports of the Computer Science Department}, year = {2011}, month = {2011///}, abstract = {Symbolic execution can be an effective technique for exploring large numbers of program paths, but it has generally been applied to programs running in isolation, whose inputs are files or command-line arguments. Programs that take inputs from other programs---servers, for example---have been beyond the reach of symbolic execution. To address this, we developed a multiprocess symbolic executor called MultiOtter, along with an implementation of many of the POSIX functions, such as socket and select, that interactive programs usually rely on. However, that is just a first step. Next, we must determine what symbolic inputs to feed to an interactive program to make multiprocess symbolic execution effective. Providing completely unconstrained symbolic values causes symbolic execution to spend too much time exploring uninteresting paths, such as paths to handle invalid inputs. MultiOtter allows us to generate inputs that conform to a context-free grammar, similar to previous work, but it also enables new input generation capabilities because we can now run arbitrary programs concurrently with the program being studied. As examples, we symbolically executed a key-value store server, redis, and an FTP server, vsftpd, each with a variety of inputs, including symbolic versions of tests from redis{\textquoteright}s test suite and wget as a client for vsftpd. We report the coverage provided by symbolic execution with various forms of symbolic input, showing that different testing goals require different degrees of symbolic inputs.}, author = {Turpie,J. and Reisner,E. and Foster, Jeffrey S. and Hicks, Michael W.} } @article {19268, title = {Multithreaded Simulation for Synchronous Dataflow Graphs}, journal = {ACM Trans. Des. Autom. Electron. Syst.}, volume = {16}, year = {2011}, month = {2011}, pages = {25:1 - 25:23}, abstract = {For system simulation, Synchronous DataFlow (SDF) has been widely used as a core model of computation in design tools for digital communication and signal processing systems. The traditional approach for simulating SDF graphs is to compute and execute static schedules in single-processor desktop environments. Nowadays, however, multicore processors are increasingly popular desktop platforms for their potential performance improvements through thread-level parallelism. Without novel scheduling and simulation techniques that explicitly explore thread-level parallelism for executing SDF graphs, current design tools gain only minimal performance improvements on multicore platforms. In this article, we present a new multithreaded simulation scheduler, called MSS, to provide simulation runtime speedup for executing SDF graphs on multicore processors. MSS strategically integrates graph clustering, intracluster scheduling, actor vectorization, and intercluster buffering techniques to construct InterThread Communication (ITC) graphs at compile-time. MSS then applies efficient synchronization and dynamic scheduling techniques at runtime for executing ITC graphs in multithreaded environments. We have implemented MSS in the Advanced Design System (ADS) from Agilent Technologies. On an Intel dual-core, hyper-threading (4 processing units) processor, our results from this implementation demonstrate up to 3.5 times speedup in simulating modern wireless communication systems (e.g., WCDMA3G, CDMA 2000, WiMax, EDGE, and Digital TV).}, keywords = {multithreaded simulation, scheduling, Synchronous dataflow}, isbn = {1084-4309}, url = {http://doi.acm.org/10.1145/1970353.1970358}, author = {Chia-Jui Hsu and Pino, Jos{\'e} Luis and Bhattacharyya, Shuvra S.} } @article {16050, title = {Making sense of archived e-mail: Exploring the Enron collection with NetLens}, journal = {Journal of the American Society for Information Science and Technology}, volume = {61}, year = {2010}, month = {2010/04/01/}, pages = {723 - 744}, abstract = {Informal communications media pose new challenges for information-systems design, but the nature of informal interaction offers new opportunities as well. This paper describes NetLens-E-mail, a system designed to support exploration of the content-actor network in large e-mail collections. Unique features of NetLens-E-mail include close coupling of orientation, specification, restriction, and expansion, and introduction and incorporation of a novel capability for iterative projection between content and actor networks within the same collection. Scenarios are presented to illustrate the intended employment of NetLens-E-mail, and design walkthroughs with two domain experts provide an initial basis for assessment of the suitability of the design by scholars and analysts.}, isbn = {1532-2890}, doi = {10.1002/asi.21275}, url = {http://onlinelibrary.wiley.com/doi/10.1002/asi.21275/full}, author = {Kang,Hyunmo and Plaisant, Catherine and Elsayed,Tamer and Oard, Douglas} } @conference {16055, title = {ManyNets: an interface for multiple network analysis and visualization}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, series = {CHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {213 - 222}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Traditional network analysis tools support analysts in studying a single network. ManyNets offers these analysts a powerful new approach that enables them to work on multiple networks simultaneously. Several thousand networks can be presented as rows in a tabular visualization, and then inspected, sorted and filtered according to their attributes. The networks to be displayed can be obtained by subdivision of larger networks. Examples of meaningful subdivisions used by analysts include ego networks, community extraction, and time-based slices. Cell visualizations and interactive column overviews allow analysts to assess the distribution of attributes within particular sets of networks. Details, such as traditional node-link diagrams, are available on demand. We describe a case study analyzing a social network geared towards film recommendations by means of decomposition. A small usability study provides feedback on the use of the interface on a set of tasks issued from the case study.}, keywords = {exploratory analysis, graphical user interface, Information Visualization, interaction, network analysis, table interface}, isbn = {978-1-60558-929-9}, doi = {10.1145/1753326.1753358}, url = {http://doi.acm.org/10.1145/1753326.1753358}, author = {Freire,Manuel and Plaisant, Catherine and Shneiderman, Ben and Golbeck,Jen} } @conference {12223, title = {Maranello: practical partial packet recovery for 802.11}, booktitle = {Proceedings of the 7th USENIX conference on Networked systems design and implementation}, series = {NSDI{\textquoteright}10}, year = {2010}, month = {2010///}, pages = {14 - 14}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {Partial packet recovery protocols attempt to repair corrupted packets instead of retransmitting them in their entirety. Recent approaches have used physical layer confidence estimates or additional error detection codes embedded in each transmission to identify corrupt bits, or have applied forward error correction to repair without such explicit knowledge. In contrast to these approaches, our goal is a practical design that simultaneously: (a) requires no extra bits in correct packets, (b) reduces recovery latency, except in rare instances, (c) remains compatible with existing 802.11 devices by obeying timing and backoff standards, and (d) can be incrementally deployed on widely available access points and wireless cards. In this paper, we design, implement, and evaluate Maranello, a novel partial packet recovery mechanism for 802.11. In Maranello, the receiver computes checksums over blocks in corrupt packets and bundles these checksums into a negative acknowledgment sent when the sender expects to receive an acknowledgment. The sender then retransmits only those blocks for which the checksum is incorrect, and repeats this partial retransmission until it receives an acknowledgment. Successful transmissions are not burdened by additional bits and the receiver needs not infer which bits were corrupted. We implemented Maranello using OpenFWWF (open source firmware for Broadcom wireless cards) and deployed it in a small testbed. We compare Maranello to alternative recovery protocols using a trace-driven simulation and to 802.11 using a live implementation under various channel conditions. To our knowledge, Maranello is the first partial packet recovery design to be implemented in commonly available firmware.}, url = {http://dl.acm.org/citation.cfm?id=1855711.1855725}, author = {Han,Bo and Schulman,Aaron and Gringoli,Francesco and Spring, Neil and Bhattacharjee, Bobby and Nava,Lorenzo and Ji,Lusheng and Lee,Seungjoon and Miller,Robert} } @conference {12405, title = {Measuring transitivity using untrained annotators}, booktitle = {Proceedings of the NAACL HLT 2010 Workshop on Creating Speech and Language Data with Amazon{\textquoteright}s Mechanical Turk}, series = {CSLDAMT {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {188 - 194}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Hopper and Thompson (1980) defined a multi-axis theory of transitivity that goes beyond simple syntactic transitivity and captures how much "action" takes place in a sentence. Detecting these features requires a deep understanding of lexical semantics and real-world pragmatics. We propose two general approaches for creating a corpus of sentences labeled with respect to the Hopper-Thompson transitivity schema using Amazon Mechanical Turk. Both approaches assume no existing resources and incorporate all necessary annotation into a single system; this is done to allow for future generalization to other languages. The first task attempts to use language-neutral videos to elicit human-composed sentences with specified transitivity attributes. The second task uses an iterative process to first label the actors and objects in sentences and then annotate the sentences{\textquoteright} transitivity. We examine the success of these techniques and perform a preliminary classification of the transitivity of held-out data.}, url = {http://dl.acm.org/citation.cfm?id=1866696.1866726}, author = {Madnani,Nitin and Jordan Boyd-Graber and Resnik, Philip} } @article {14820, title = {Mesh saliency and human eye fixations}, journal = {ACM Transactions on Applied Perception (TAP)}, volume = {7}, year = {2010}, month = {2010/02//}, pages = {12:1{\textendash}12:13 - 12:1{\textendash}12:13}, abstract = {Mesh saliency has been proposed as a computational model of perceptual importance for meshes, and it has been used in graphics for abstraction, simplification, segmentation, illumination, rendering, and illustration. Even though this technique is inspired by models of low-level human vision, it has not yet been validated with respect to human performance. Here, we present a user study that compares the previous mesh saliency approaches with human eye movements. To quantify the correlation between mesh saliency and fixation locations for 3D rendered images, we introduce the normalized chance-adjusted saliency by improving the previous chance-adjusted saliency measure. Our results show that the current computational model of mesh saliency can model human eye movements significantly better than a purely random model or a curvature-based model.}, keywords = {eye-tracker, mesh saliency, Visual perception}, isbn = {1544-3558}, doi = {10.1145/1670671.1670676}, url = {http://doi.acm.org/10.1145/1670671.1670676}, author = {Kim,Youngmin and Varshney, Amitabh and Jacobs, David W. and Guimbreti{\`e}re,Fran{\c c}ois} } @conference {16025, title = {The Metacognitive Loop: An Architecture for Building Robust Intelligent Systems}, booktitle = {2010 AAAI Fall Symposium Series}, year = {2010}, month = {2010/03/11/}, abstract = {The Metacognitive Loop: An Architecture for Building Robust Intelligent Systems}, keywords = {commonsense, ontologies, robust intelligent systems}, url = {http://www.aaai.org/ocs/index.php/FSS/FSS10/paper/view/2161}, author = {Shahri,Hamid Haidarian and Dinalankara,Wikum and Fults,Scott and Wilson,Shomir and Perlis, Don and Schmill,Matt and Oates,Tim and Josyula,Darsana and Anderson,Michael} } @conference {16278, title = {MetaPhyler: Taxonomic profiling for metagenomic sequences}, booktitle = {2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)}, year = {2010}, month = {2010/12/18/21}, pages = {95 - 100}, publisher = {IEEE}, organization = {IEEE}, abstract = {A major goal of metagenomics is to characterize the microbial diversity of an environment. The most popular approach relies on 16S rRNA sequencing, however this approach can generate biased estimates due to differences in the copy number of the 16S rRNA gene between even closely related organisms, and due to PCR artifacts. The taxonomic composition can also be determined from whole-metagenome sequencing data by matching individual sequences against a database of reference genes. One major limitation of prior methods used for this purpose is the use of a universal classification threshold for all genes at all taxonomic levels. We propose that better classification results can be obtained by tuning the taxonomic classifier to each matching length, reference gene, and taxonomic level. We present a novel taxonomic profiler MetaPhyler, which uses marker genes as a taxonomic reference. Results on simulated datasets demonstrate that MetaPhyler outperforms other tools commonly used in this context (CARMA, Megan and PhymmBL). We also present interesting results obtained by applying MetaPhyler to a real metagenomic dataset.}, keywords = {Bioinformatics, CARMA comparison, Databases, Genomics, Linear regression, marker genes, matching length, Megan comparison, metagenomic sequences, metagenomics, MetaPhyler, microbial diversity, microorganisms, molecular biophysics, molecular configurations, Pattern classification, pattern matching, phylogenetic classification, Phylogeny, PhymmBL comparison, reference gene database, Sensitivity, sequence matching, taxonomic classifier, taxonomic level, taxonomic profiling, whole metagenome sequencing data}, isbn = {978-1-4244-8306-8}, doi = {10.1109/BIBM.2010.5706544}, author = {Liu,Bo and Gibbons,T. and Ghodsi,M. and Pop, Mihai} } @article {18238, title = {Method for concealing data in curves of an image}, volume = {:~11/221,727}, year = {2010}, month = {2010/10/19/}, abstract = {A method of concealing data in images imperceptibly alters curves therein, such as through adding a value representing the data to be hidden to each of a number of B-spline control points representing the original curve. The altered control points characterize the imperceptibly altered curve, which replaces the original curve in the image. The altered control points may be later extracted from the image and compared with the original control points to determine the hidden value. Prudent selection of the values altering the control points as well as an iterative alignment-minimization algorithm in the detection process provides protection against numerous techniques for preventing the hidden values from being recovered.}, url = {http://www.google.com/patents?id=USnYAAAAEBAJ}, author = {M. Wu and Gou,Hongmei}, editor = {University of Maryland} } @article {18239, title = {Method for fingerprinting multimedia content}, volume = {11/326,313}, year = {2010}, month = {2010/10/12/}, abstract = {To identify participants in collusion directed to altering a digital fingerprint embedded in multimedia content, an ECC based fingerprinting technique establishes a code symbol for each of a plurality of segments of digital data forming the multimedia content. The code symbols are concatenated to form a fingerprint signal, which is subdivided into a plurality of subsegments for each segment in the digital data. The subsegments are permuted and embedded into the digital data. When a suspicious copy of the multimedia content is discovered, the permuted fingerprint signal is extracted from the content and inversely permuted to form a test fingerprint. The identity of one of the colluders is determined by correlation with characteristics of the codeword originally assigned to the user. The determination of identity may be enhanced by the addition of group data embedded as an additional fingerprint in the digital data. Joint consideration of coding and embedding provide benefits over...}, url = {http://www.google.com/patents?id=GXnXAAAAEBAJ}, author = {He,Shan and M. Wu}, editor = {University of Maryland} } @article {13951, title = {Method for measurement of head related transfer functions}, volume = {10/702,465}, year = {2010}, month = {2010/05/18/}, abstract = {Head Related Transfer Functions (HRTFs) of an individual are measured in rapid fashion in an arrangement where a sound source is positioned in the individual{\textquoteright}s ear channel, while microphones are arranged in the microphone array enveloping the individual{\textquoteright}s head. The pressure waves generated by the sounds emanating from the sound source reach the microphones and are converted into corresponding electrical signals which are further processed in a processing system to extract HRTFs, which may then be used to synthesize a spatial audio scene. The acoustic field generated by the sounds from the sound source can be evaluated at any desired point inside or outside the microphone array.}, url = {http://www.google.com/patents?id=JHrQAAAAEBAJ}, author = {Duraiswami, Ramani and Gumerov, Nail A.}, editor = {University of Maryland} } @conference {19286, title = {Methods for efficient implementation of Model Predictive Control on multiprocessor systems}, booktitle = {2010 IEEE International Conference on Control Applications (CCA)}, year = {2010}, month = {2010}, pages = {1357 - 1362}, abstract = {Model Predictive Control (MPC) has been used in a wide range of application areas including chemical engineering, food processing, automotive engineering, aerospace, and metallurgy. An important limitation on the application of MPC is the difficulty in completing the necessary computations within the sampling interval. Recent trends in computing hardware towards greatly increased parallelism offer a solution to this problem. This paper describes modeling and analysis tools to facilitate implementing the MPC algorithms on parallel computers, thereby greatly reducing the time needed to complete the calculations. The use of these tools is illustrated by an application to a class of MPC problems.}, keywords = {Computational modeling, COMPUTERS, Equations, Hardware, Linear systems, Mathematical model, model predictive control, MPC algorithms, Multiprocessing systems, Multiprocessor systems, parallel computers, predictive control, Program processors}, author = {Gu, Ruirui and Bhattacharyya, Shuvra S. and Levine,W. S} } @article {14629, title = {Mimosa: Mixture model of co-expression to detect modulators of regulatory interaction}, journal = {Algorithms for Molecular Biology}, volume = {5}, year = {2010}, month = {2010/01/04/}, pages = {4 - 4}, abstract = {Functionally related genes tend to be correlated in their expression patterns across multiple conditions and/or tissue-types. Thus co-expression networks are often used to investigate functional groups of genes. In particular, when one of the genes is a transcription factor (TF), the co-expression-based interaction is interpreted, with caution, as a direct regulatory interaction. However, any particular TF, and more importantly, any particular regulatory interaction, is likely to be active only in a subset of experimental conditions. Moreover, the subset of expression samples where the regulatory interaction holds may be marked by presence or absence of a modifier gene, such as an enzyme that post-translationally modifies the TF. Such subtlety of regulatory interactions is overlooked when one computes an overall expression correlation.}, isbn = {1748-7188}, doi = {10.1186/1748-7188-5-4}, url = {http://www.almob.org/content/5/1/4}, author = {Hansen,Matthew and Everett,Logan and Singh,Larry and Hannenhalli, Sridhar} } @conference {14316, title = {Mining Public Transport Usage for Personalised Intelligent Transport Systems}, booktitle = {2010 IEEE 10th International Conference on Data Mining (ICDM)}, year = {2010}, month = {2010}, pages = {887 - 892}, publisher = {IEEE}, organization = {IEEE}, abstract = {Traveller information, route planning, and service updates have become essential components of public transport systems: they help people navigate built environments by providing access to information regarding delays and service disruptions. However, one aspect that these systems lack is a way of tailoring the information they offer in order to provide personalised trip time estimates and relevant notifications to each traveller. Mining each user{\textquoteright}s travel history, collected by automated ticketing systems, has the potential to address this gap. In this work, we analyse one such dataset of travel history on the London underground. We then propose and evaluate methods to (a) predict personalised trip times for the system users and (b) rank stations based on future mobility patterns, in order to identify the subset of stations that are of greatest interest to the user and thus provide useful travel updates.}, keywords = {automated ticketing systems, data mining, Intelligent Transport Systems, London underground, mobility patterns, personalised intelligent transport systems, personalised trip times, Personalization, public administration, public information systems, public transport systems, rapid transit systems, route planning, service disruptions, service updates, traffic information systems, travel history, traveller information}, isbn = {978-1-4244-9131-5}, doi = {10.1109/ICDM.2010.46}, author = {Lathia,N. and Jon Froehlich and Capra,L.} } @conference {14279, title = {Mixing type checking and symbolic execution}, booktitle = {ACM SIGPLAN Notices}, volume = {45}, year = {2010}, month = {2010///}, pages = {436 - 447}, author = {Khoo,Y.P. and Chang,B.Y.E. and Foster, Jeffrey S.} } @conference {13896, title = {Mobile collaboration: collaboratively reading and creating children{\textquoteright}s stories on mobile devices}, booktitle = {Proceedings of the 9th International Conference on Interaction Design and Children}, year = {2010}, month = {2010///}, pages = {20 - 29}, author = {Fails,J. A and Druin, Allison and Guha,M.L.} } @article {17625, title = {Mobile data offloading in metropolitan area networks}, journal = {SIGMOBILE Mob. Comput. Commun. Rev.}, volume = {14}, year = {2010}, month = {2010/11//}, pages = {28 - 30}, abstract = {Cellular networks, especially 3G networks, are currently overloaded with mobile data traffic. It is thus imperative to develop novel communication architectures and protocols for this problem. In this paper, we propose to exploit the delay-tolerant nature of non-realtime applications to offload mobile data traffic through opportunistic communications and WiFi networks. We argue that it is necessary for cellular network operators, WiFi service providers, and end-users to cooperate to make the offloading more effective. We also present several preliminary experiment results about the work we have been conducting, which show that it is promising to offload mobile data traffic in metropolitan area networks.}, isbn = {1559-1662}, doi = {10.1145/1942268.1942279}, url = {http://doi.acm.org/10.1145/1942268.1942279}, author = {Han,Bo and Hui,Pan and Srinivasan, Aravind} } @inbook {13600, title = {Mobile Visual Aid Tools for Users with Visual Impairments}, booktitle = {Mobile Multimedia ProcessingMobile Multimedia Processing}, year = {2010}, month = {2010///}, pages = {21 - 36}, publisher = {LNSC 5960}, organization = {LNSC 5960}, abstract = {In this chapter we describe {\textquotedblleft}MobileEye{\textquotedblright}, a software suite which converts a camera enabled mobile device into a multi-function vision tool that can assist the visually impaired in their daily activities. MobileEye consists of four subsystems, each customized for a specific type of visual disabilities: A color channel mapper which can tell the visually impaired different colors; a software based magnifier which provides image magnification as well as enhancement; a pattern recognizer which can read currencies; and a document retriever which allows access to printed materials. We developed cutting edge computer vision and image processing technologies, and tackled the challenges of implementing them on mobile devices with limited computational resources and low image quality. The system minimizes keyboard operation for the usability of users with visual impairments. Currently the software suite runs on Symbian and Windows Mobile handsets. In this chapter we provides a high level overview of the system, and then discuss the pattern recognizer in detail. The challenge is how to build a real-time recognition system on mobile devices and we present our detailed solutions.}, author = {Liu,Xu and David Doermann and Huiping Li} } @article {13708, title = {A modality lexicon and its use in automatic tagging}, journal = {Proceedings of the Seventh conference on International Language Resources and Evaluation (LREC{\textquoteright}10)}, year = {2010}, month = {2010///}, pages = {1402 - 1407}, abstract = {This paper describes our resource-building results for an eight-week JHU Human Language Technology Center of Excellence SummerCamp for Applied Language Exploration (SCALE-2009) on Semantically-Informed Machine Translation. Specifically, we describe the construction of a modality annotation scheme, a modality lexicon, and two automated modality taggers that were built using the lexicon and annotation scheme. Our annotation scheme is based on identifying three components of modality: a trigger, a target and a holder. We describe how our modality lexicon was produced semi-automatically, expanding from an initial hand-selected list of modality trigger words and phrases. The resulting expanded modality lexicon is being made publicly available. We demonstrate that one tagger{\textemdash}a structure-based tagger{\textemdash}results in precision around 86\% (depending on genre) for tagging of a standard LDC data set. In a machine translation application, using the structure-based tagger to annotate English modalities on an English-Urdu training corpus improved the translation quality score for Urdu by 0.3 Bleu points in the face of sparse training data. }, author = {Baker,K. and Bloodgood,M. and Dorr, Bonnie J and Filardo,N.W. and Levin,L. and Piatko,C.} } @conference {13301, title = {Modeling and generalization of discrete Morse terrain decompositions}, booktitle = {Proc. 20th Int. Conf. on Pattern Recognition, ICPR}, volume = {10}, year = {2010}, month = {2010///}, pages = {999 - 1002}, abstract = {We address the problem of morphological analysis ofreal terrains. We describe a morphological model for a terrain by considering extensions of Morse theory to the discrete case. We propose a two-level model of the morphology of a terrain based on a graph joining the critical points of the terrain through integral lines. We present a new set of generalization operators specific for discrete piece-wise linear terrain models, which are used to reduce noise and the size of the morphological representation. We show results of our approach on real terrains. }, author = {De Floriani, Leila and Magillo,P. and Vitali,M.} } @conference {12407, title = {Modeling perspective using adaptor grammars}, booktitle = {Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing}, series = {EMNLP {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {284 - 292}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Strong indications of perspective can often come from collocations of arbitrary length; for example, someone writing get the government out of my X is typically expressing a conservative rather than progressive viewpoint. However, going beyond unigram or bigram features in perspective classification gives rise to problems of data sparsity. We address this problem using nonparametric Bayesian modeling, specifically adaptor grammars (Johnson et al., 2006). We demonstrate that an adaptive na{\"\i}ve Bayes model captures multiword lexical usages associated with perspective, and establishes a new state-of-the-art for perspective classification results using the Bitter Lemons corpus, a collection of essays about mid-east issues from Israeli and Palestinian points of view.}, url = {http://dl.acm.org/citation.cfm?id=1870658.1870686}, author = {Hardisty,Eric A. and Jordan Boyd-Graber and Resnik, Philip} } @inbook {15770, title = {Modelling Type 1a Supernova Light Curves}, booktitle = {Exponential Data Fitting and Its ApplicationsExponential Data Fitting and Its Applications}, year = {2010}, month = {2010///}, pages = {169 - 186}, publisher = {Bentham Science Publishers Ltd.}, organization = {Bentham Science Publishers Ltd.}, url = {http://www.bentham.org/ebooks/9781608050482/http://www.bentham.org/ebooks/9781608050482/}, author = {Rust,Bert W. and O{\textquoteright}Leary, Dianne P. and Mullen,Katharine M.}, editor = {Pereyra,V. and Scherer,G.} } @conference {14989, title = {Monitoring distributed collections using the Audit Control Environment (ACE)}, booktitle = {Proceedings of the 2010 Roadmap for Digital Preservation Interoperability Framework Workshop}, series = {US-DPIF {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {13:1{\textendash}13:5 - 13:1{\textendash}13:5}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The Audit Control Environment (ACE) is a system which provides a scalable, auditable platform that actively monitors collections to ensure their integrity over the lifetime of an archive. It accomplishes this by using a small integrity token issued for each monitored item. This token is part of a larger externally auditable cryptographic system. We will describe how this system has been implemented for a set of applications designed to run in an archive or library environment. ACE has been used for almost two years by the Chronopolis Preservation Environment to monitor the integrity of collections replicated between the three independent archive partners. During this time, ACE has been expanded to better support the requirements of this distributed archive. We will describe how ACE has been used and expanded to support the Chronopolis preservation requirements. We conclude by discussing several future requirements for integrity monitoring that have been identified by users of ACE. These include securely monitoring remote data, monitoring offline data, and scaling monitoring activities in a way that does not impact the normal operational activity of an archive.}, keywords = {digital, preservation}, isbn = {978-1-4503-0109-1}, doi = {10.1145/2039274.2039287}, url = {http://doi.acm.org/10.1145/2039274.2039287}, author = {Smorul,Michael and Song,Sangchul and JaJa, Joseph F.} } @conference {12479, title = {Moving vistas: Exploiting motion for describing scenes}, booktitle = {2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)}, year = {2010}, month = {2010/06/13/18}, pages = {1911 - 1918}, publisher = {IEEE}, organization = {IEEE}, abstract = {Scene recognition in an unconstrained setting is an open and challenging problem with wide applications. In this paper, we study the role of scene dynamics for improved representation of scenes. We subsequently propose dynamic attributes which can be augmented with spatial attributes of a scene for semantically meaningful categorization of dynamic scenes. We further explore accurate and generalizable computational models for characterizing the dynamics of unconstrained scenes. The large intra-class variation due to unconstrained settings and the complex underlying physics present challenging problems in modeling scene dynamics. Motivated by these factors, we propose using the theory of chaotic systems to capture dynamics. Due to the lack of a suitable dataset, we compiled a dataset of {\textquoteleft}in-the-wild{\textquoteright} dynamic scenes. Experimental results show that the proposed framework leads to the best classification rate among other well-known dynamic modeling techniques. We also show how these dynamic features provide a means to describe dynamic scenes with motion-attributes, which then leads to meaningful organization of the video data.}, keywords = {Application software, Automation, Chaos, chaotic system, Computational modeling, Computer vision, dynamic scene categorization, Educational institutions, HUMANS, image recognition, in the wild dynamic scene, Layout, motion attribute, natural scenes, Physics, probability, scene recognition, Snow, video data}, isbn = {978-1-4244-6984-0}, doi = {10.1109/CVPR.2010.5539864}, author = {Shroff, N. and Turaga,P. and Chellapa, Rama} } @article {13093, title = {Multi-Camera Tracking with Adaptive Resource Allocation}, journal = {International Journal of Computer Vision}, year = {2010}, month = {2010///}, pages = {1 - 14}, author = {Han,B. and Joo, S.W. and Davis, Larry S.} } @inbook {16823, title = {Multidimensional data structures for spatial applications}, booktitle = {Algorithms and theory of computation handbookAlgorithms and theory of computation handbook}, year = {2010}, month = {2010///}, pages = {6 - 6}, publisher = {Chapman \& Hall/CRC}, organization = {Chapman \& Hall/CRC}, abstract = {An overview is presented of a number of representations of multidimensional data that arise in spatial applications. Multidimensional spatial data consists of points as well as objects that have extent such as line segments, rectangles, regions, and volumes. The points may have locational as well as nonlocational attributes. The focus is on spatial data which is a subset of multidimensional data consisting of points with locational attributes and objects with extent. The emphasis is on hierarchical representations based on the "divide-and-conquer" problem-solving paradigm. They are of interest because they enable focusing computational resources on the interesting subsets of data. Thus, there is no need to expend work where the payoff is small. These representations are of use in operations such as range searching and finding nearest neighbors.}, isbn = {978-1-58488-822-2}, url = {http://dl.acm.org/citation.cfm?id=1882757.1882763}, author = {Samet, Hanan}, editor = {Atallah,Mikhail J. and Blanton,Marina} } @article {18252, title = {Multimedia forensic hash based on visual words}, journal = {IEEE Computer Society International Conference on Image Processing}, year = {2010}, month = {2010///}, pages = {989 - 992}, abstract = {In recent years, digital images and videos have become in-creasingly popular over the internet and bring great social im- pact to a wide audience. In the meanwhile, technology ad- vancement allows people to easily alter the content of dig- ital multimedia and brings serious concern on the trustwor- thiness of online multimedia information. Forensic hash is a short signature attached to an image before transmission and acts as side information for analyzing the processing history and trustworthiness of the received image. In this paper, we propose a new construction of forensic hash based on visual words representation. We encode SIFT features into a com- pact visual words representation for robust estimation of geo- metric transformations and propose a hybrid construction us- ing both SIFT and block-based features to detect and localize image tampering. The proposed hash construction achieves more robust and accurate forensic analysis than prior work. }, author = {Lu,W. and Wu,M.} } @conference {13313, title = {Multiresolution analysis of 3D images based on discrete distortion}, booktitle = {International Conference on Pattern Recognition (ICPR)}, year = {2010}, month = {2010///}, pages = {4093 - 4096}, abstract = {We consider a model of a 3D image obtained bydiscretizing it into a multiresolution tetrahedral mesh known as a hierarchy of diamonds. This model enables us to extract crack-free approximations of the 3D image at any uniform or variable resolution, thus reducing the size of the data set without reducing the accuracy. A 3D intensity image is a scalar field (the intensity field) defined at the vertices of a 3D regular grid and thus the graph of the image is a hypersurface in R4. We measure the discrete distortion, a generalization of the notion of curvature, of the transformation which maps the tetrahedralized 3D grid onto its graph in R4. We evaluate the use of a hierarchy of diamonds to analyze properties of a 3D image, such as its discrete distortion, directly on lower resolution approximations. Our results indicate that distortion-guided extractions focus the resolution of approximated images on the salient features of the intensity image. }, author = {Weiss,K. and De Floriani, Leila and Mesmoudi,M. M.} } @conference {13315, title = {Multiresolution morse triangulations}, booktitle = {Proceedings of the 14th ACM Symposium on Solid and Physical Modeling}, series = {SPM {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {183 - 188}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We address the problem of representing the geometry and the morphology of a triangulated surface endowed with a scalar field in a combined geometric and topological multiresolution model. The model, called a Multiresolution Morse Triangulation (MMT), is composed of a multiresolution triangle mesh, and of a multiresolution Morse complex describing the morphology of the field. The MMT is built through a combined morphological and geometrical generalization, and supports queries to extract consistent geometrical and morphological representations of the field at both uniform and variable resolutions.}, isbn = {978-1-60558-984-8}, doi = {10.1145/1839778.1839806}, url = {http://doi.acm.org/10.1145/1839778.1839806}, author = {Danovaro,Emanuele and De Floriani, Leila and Magillo,Paola and Vitali,Maria} } @article {12488, title = {Multiscale directional filtering of noisy InSAR phase images}, journal = {Proceedings of SPIE}, volume = {7703}, year = {2010}, month = {2010/04/05/}, pages = {770308-770308-9 - 770308-770308-9}, abstract = {In this work, we present a new approach for the problem of interferometric phase noise reduction in synthetic aperture radar interferometry based on the shearlet representation. Shearlets provide a multidirectional and multiscale decomposition that have advantages when dealing with noisy phase fringes over standard filtering methods. Using a shearlet decomposition of a noisy phase image, we can adaptively estimate a phase representation in a multiscale and anisotropic fashion. Such denoised phase interferograms can be used to provide much better digital elevation maps (DEM). Experiments show that this method performs significantly better than many competitive methods.}, isbn = {0277786X}, doi = {doi:10.1117/12.849576}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/7703/1/770308_1?isAuthorized=no}, author = {Patel, Vishal M. and Easley,Glenn R and Chellapa, Rama} } @conference {13456, title = {Multi-view clustering with constraint propagation for learning with an incomplete mapping between views}, booktitle = {Proceedings of the 19th ACM international conference on Information and knowledge management}, series = {CIKM {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {389 - 398}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, many applications provide only a partial mapping between the views, creating a challenge for current methods. To address this problem, we propose a multi-view algorithm based on constrained clustering that can operate with an incomplete mapping. Given a set of pairwise constraints in each view, our approach propagates these constraints using a local similarity measure to those instances that can be mapped to the other views, allowing the propagated constraints to be transferred across views via the partial mapping. It uses co-EM to iteratively estimate the propagation within each view based on the current clustering model, transfer the constraints across views, and update the clustering model, thereby learning a unified model for all views. We show that this approach significantly improves clustering performance over several other methods for transferring constraints and allows multi-view clustering to be reliably applied when given a limited mapping between the views.}, keywords = {constrained clustering, multi-view learning, semi-supervised learning}, isbn = {978-1-4503-0099-5}, doi = {10.1145/1871437.1871489}, url = {http://doi.acm.org/10.1145/1871437.1871489}, author = {Eaton,Eric and desJardins, Marie and Jacob,Sara} } @article {15552, title = {Maintaining nets and net trees under incremental motion}, journal = {Algorithms and Computation}, year = {2009}, month = {2009///}, pages = {1134 - 1143}, abstract = {The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point motion is continuous and predictable, but in practice, motion is typically presented incrementally in discrete time steps and may not be predictable. We consider the problem of maintaining a data structure for a set of points undergoing such incremental motion. We present a simple online model in which two agents cooperate to maintain the structure. One defines the data structure and provides a collection of certificates, which guarantee the structure{\textquoteright}s correctness. The other checks that the motion over time satisfies these certificates and notifies the first agent of any violations.We present efficient online algorithms for maintaining both nets and net trees for a point set undergoing incremental motion in a space of constant dimension. We analyze our algorithms{\textquoteright} efficiencies by bounding their competitive ratios relative to an optimal algorithm. We prove a constant factor competitive ratio for maintaining a slack form of nets, and our competitive ratio for net trees is proportional to the square of the tree{\textquoteright}s height. }, doi = {10.1007/978-3-642-10631-6_114}, author = {Cho,M. and Mount, Dave and Park,E.} } @conference {13049, title = {Markov random topic fields}, booktitle = {Proceedings of the ACL-IJCNLP 2009 Conference Short Papers}, year = {2009}, month = {2009///}, pages = {293 - 296}, author = {Daum{\'e}, Hal} } @article {13895, title = {The Maryland Modular Method: An Approach to Doctoral Education in Information Studies}, journal = {Journal of education for library and information science}, volume = {50}, year = {2009}, month = {2009///}, pages = {293 - 301}, author = {Druin, Allison and Jaeger,P. T and Golbeck,J. and Fleischmann,K.R. and Jimmy Lin and Qu,Y. and Wang,P. and Xie,B.} } @conference {15896, title = {Matching person names through name transformation}, booktitle = {Proceedings of the 18th ACM conference on Information and knowledge management}, series = {CIKM {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1875 - 1878}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Matching person names plays an important role in many applications, including bibliographic databases and indexing systems. Name variations and spelling errors make exact string matching problematic; therefore, it is useful to develop methodologies that can handle variant forms for the same named entity. In this paper, a novel person name matching model is presented. Common name variations in the English speaking world are formalized, and the concept of name transformation paths is introduced; name similarity is measured after the best transformation path has been selected. Supervised techniques are used to learn a similarity function and a decision rule. Experiments with three datasets show the method to be effective.}, keywords = {name matching, string distance metrics, string similarity}, isbn = {978-1-60558-512-3}, doi = {10.1145/1645953.1646253}, url = {http://doi.acm.org/10.1145/1645953.1646253}, author = {Gong,Jun and Wang,Lidan and Oard, Douglas} } @article {12146, title = {Maturing Software Engineering Knowledge through Classifications: A Case Study on Unit Testing Techniques}, journal = {Software Engineering, IEEE Transactions on}, volume = {35}, year = {2009}, month = {2009/08//july}, pages = {551 - 565}, abstract = {Classification makes a significant contribution to advancing knowledge in both science and engineering. It is a way of investigating the relationships between the objects to be classified and identifies gaps in knowledge. Classification in engineering also has a practical application; it supports object selection. They can help mature software engineering knowledge, as classifications constitute an organized structure of knowledge items. Till date, there have been few attempts at classifying in software engineering. In this research, we examine how useful classifications in software engineering are for advancing knowledge by trying to classify testing techniques. The paper presents a preliminary classification of a set of unit testing techniques. To obtain this classification, we enacted a generic process for developing useful software engineering classifications. The proposed classification has been proven useful for maturing knowledge about testing techniques, and therefore, SE, as it helps to: 1) provide a systematic description of the techniques, 2) understand testing techniques by studying the relationships among techniques (measured in terms of differences and similarities), 3) identify potentially useful techniques that do not yet exist by analyzing gaps in the classification, and 4) support practitioners in testing technique selection by matching technique characteristics to project characteristics.}, keywords = {characteristic;project, characteristic;software, classification;matching, engineering, engineering;, knowledge;software, technique, techniques;program, Testing, testing;software, testing;unit}, isbn = {0098-5589}, doi = {10.1109/TSE.2009.13}, author = {Vegas,S. and Juristo,N. and Basili, Victor R.} } @article {14352, title = {On maximum coverage in the streaming model \& application to multi-topic blog-watch}, journal = {2009 SIAM International Conference on Data Mining (SDM09)}, year = {2009}, month = {2009///}, abstract = {We generalize the graph streaming model to hypergraphs.In this streaming model, hyperedges are arriving online and any computation has to be done on-the-fly using a small amount of space. Each hyperedge can be viewed as a set of elements (nodes), so we refer to our proposed model as the {\textquotedblleft}set-streaming{\textquotedblright} model of computation. We consider the problem of {\textquotedblleft}maximum coverage{\textquotedblright}, in which k sets have to be selected that maximize the total weight of the covered elements. In the set-streaming model of computation, we show that our algorithm for maximum- coverage achieves an approximation factor of 1 . When multiple passes are allowed, we also provide a Θ(log n) approximation algorithm for the set-cover. We next consider a multi-topic blog-watch application, an extension of blog- alert like applications for handling simultaneous multiple- topic requests. We show how the problems of maximum- coverage and set-cover in the set-streaming model can be utilized to give efficient online solutions to this problem. We verify the effectiveness of our methods both on synthetic and real weblog data. }, author = {Saha,B. and Getoor, Lise} } @conference {18581, title = {Measurement methods for fast and accurate blackhole identification with binary tomography}, booktitle = {Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference}, series = {IMC {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {254 - 266}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Binary tomography - the process of identifying faulty network links through coordinated end-to-end probes - is a promising method for detecting failures that the network does not automatically mask (e.g., network "blackholes"). Because tomography is sensitive to the quality of the input, however, na{\"\i}ve end-to-end measurements can introduce inaccuracies. This paper develops two methods for generating inputs to binary tomography algorithms that improve their inference speed and accuracy. Failure confirmation is a per-path probing technique to distinguish packet losses caused by congestion from persistent link or node failures. Aggregation strategies combine path measurements from unsynchronized monitors into a set of consistent observations. When used in conjunction with existing binary tomography algorithms, our methods identify all failures that are longer than two measurement cycles, while inducing relatively few false alarms. In two wide-area networks, our techniques decrease the number of alarms by as much as two orders of magnitude. Compared to the state of the art in binary tomography, our techniques increase the identification rate and avoid hundreds of false alarms.}, keywords = {diagnosis, network tomography, troubleshooting}, isbn = {978-1-60558-771-4}, doi = {10.1145/1644893.1644924}, url = {http://doi.acm.org/10.1145/1644893.1644924}, author = {Cunha,{\'I}talo and Teixeira,Renata and Feamster, Nick and Diot,Christophe} } @article {14228, title = {MEASURING 1ST ORDER STRETCH WITH A SINGLE FILTER}, journal = {Relation}, volume = {10}, year = {2009}, month = {2009///}, pages = {691 - 691}, abstract = {We analytically develop a filter that is able to measurethe linear stretch of the transformation around a point, and present results of applying it to real signals. We show that this method is a real-time alternative solution for measuring local signal transformations. Experimentally, this method can accurately measure stretch, however, it is sensitive to shift. }, author = {Bitsakos,K. and Domke, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {19664, title = {Measuring differential gene expression by short read sequencing: quantitative comparison to 2-channel gene expression microarrays}, journal = {BMC Genomics}, volume = {10}, year = {2009}, month = {2009/12/01/}, pages = {1 - 10}, abstract = {Background High-throughput cDNA synthesis and sequencing of poly(A)-enriched RNA is rapidly emerging as a technology competing to replace microarrays as a quantitative platform for measuring gene expression. Results Consequently, we compared full length cDNA sequencing to 2-channel gene expression microarrays in the context of measuring differential gene expression. Because of its comparable cost to a gene expression microarray, our study focused on the data obtainable from a single lane of an Illumina 1 G sequencer. We compared sequencing data to a highly replicated microarray experiment profiling two divergent strains of S. cerevisiae. Conclusion Using a large number of quantitative PCR (qPCR) assays, more than previous studies, we found that neither technology is decisively better at measuring differential gene expression. Further, we report sequencing results from a diploid hybrid of two strains of S. cerevisiae that indicate full length cDNA sequencing can discover heterozygosity and measure quantitative allele-specific expression simultaneously.}, keywords = {Animal Genetics and Genomics, Life Sciences, general, Microarrays, Microbial Genetics and Genomics, Plant Genetics \& Genomics, proteomics}, isbn = {1471-2164}, url = {http://link.springer.com/article/10.1186/1471-2164-10-221}, author = {Bloom, Joshua S. and Zia Khan and Kruglyak, Leonid and Singh, Mona and Caudy, Amy A.} } @conference {13453, title = {Measuring General Relational Structure Using the Block Modularity Clustering Objective}, booktitle = {Twenty-Second International FLAIRS Conference}, year = {2009}, month = {2009/03/16/}, abstract = {The performance of all relational learning techniques has an implicit dependence on the underlying connectivity structure of the relations that are used as input. In this paper, we show how clustering can be used to develop an efficient optimization strategy can be used to effectively measure the structure of a graph in the absence of labeled instances.}, url = {http://www.aaai.org/ocs/index.php/FLAIRS/2009/paper/viewPaper/46}, author = {Anthony,Adam Paul and desJardins, Marie and Lombardi,Michael} } @conference {18513, title = {Measuring vlan-induced dependencies on a campus network}, booktitle = {Proceedings of the ACM SIGCOMM Internet measurement conference}, year = {2009}, month = {2009///}, abstract = {Many enterprise, campus, and data-center networks have complexlayer-2 virtual LANs ({\textquotedblleft}VLANs{\textquotedblright}) underlying the layer-3 network. The interac- tion between layer-2 and layer-3 topologies can introduce dependencies that are not visible when analyzed solely from layer 3; this paper studies the extent and impact of these dependencies. We first present EtherTrace, a tool that infers the layer-2 topology using data passively collected from Ethernet switches. Using this tool, we infer the layer-2 topology for a large campus network and compare the two topologies. Our comparison yields some striking initial findings: almost 70\% of layer-2 edges are shared by 10 or more IP edges, and a single layer-2 edge may be shared by as many as 34 different IP edges. This sharing has significant implications for both robustness and for network tomography. Applying network tomography to the IP topology to diagnose failures caused by layer-2 devices results in only 54\% accuracy, compared to 100\% accuracy when tomography is performed at layer 2. }, author = {Mansy,A. and Tariq,M.B. and Feamster, Nick and Ammar,M.} } @article {17990, title = {Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallelism}, journal = {Very Large Scale Integration (VLSI) Systems, IEEE Transactions on}, volume = {17}, year = {2009}, month = {2009/10//}, pages = {1419 - 1432}, abstract = {In single-chip parallel processors, it is crucial to implement a high-throughput low-latency interconnection network to connect the on-chip components, especially the processing units and the memory units. In this paper, we propose a new mesh of trees (MoT) implementation of the interconnection network and evaluate it relative to metrics such as wire complexity, total register count, single switch delay, maximum throughput, tradeoffs between throughput and latency, and post-layout performance. We show that on-chip interconnection networks can provide higher bandwidth between processors and shared first-level cache than previously considered possible, facilitating greater scalability of memory architectures that require that. MoT is also compared, both analytically and experimentally, to some other traditional network topologies, such as hypercube, butterfly, fat trees and butterfly fat trees. When we evaluate a 64-terminal MoT network at 90-nm technology, concrete results show that MoT provides higher throughput and lower latency especially when the input traffic (or the on-chip parallelism) is high, at comparable area. A recurring problem in networking and communication is that of achieving good sustained throughput in contrast to just high theoretical peak performance that does not materialize for typical work loads. Our quantitative results demonstrate a clear advantage of the proposed MoT network in the context of single-chip parallel processing.}, keywords = {90, cache;single, complexity;multiprocessor, delay;single-chip, first-level, high-throughput, interconnection, low-latency, network;memory, network;shared, networks;network-on-chip;parallel, nm;wire, Parallel, parallelism;size, processing;, processor;single-chip, switch, topologies;on-chip, units;mesh-of-trees;network}, isbn = {1063-8210}, doi = {10.1109/TVLSI.2008.2003999}, author = {Balkan,A.O. and Gang Qu and Vishkin, Uzi} } @article {17753, title = {Method and system for optimal data diagnosis}, volume = {10/774,516}, year = {2009}, month = {2009/01/06/}, abstract = {In the method and system for automated data diagnosis, a relational data base is formed of attributes characterizing an entity. The framework computes optimal diagnosis for a diagnostic inference problem which separates the desirable attributes from the undesirable attributes. The user of the system is permitted to specify certain parameters based on which the system computes a set of optimal or near optimal association rules between the attributes of a specific process, product, or other entity. The system and method of the present invention considers the simplicity of conditions in addition to support and confidence when ordering them, contributes the notion of tight conditions and semi-equivalence to remove redundant rules, uses the concept of the top fringes which allows near optimal conditions to be found, in addition to optimal conditions. Numeric as well as non-numeric attributes can be analyzed.}, url = {http://www.google.com/patents?id=fHnVAAAAEBAJ}, author = {V.S. Subrahmanian and Ernst,Jason}, editor = {University of Maryland} } @article {12888, title = {Microbial oceanography in a sea of opportunity}, journal = {Nature}, volume = {459}, year = {2009}, month = {2009/05/13/}, pages = {180 - 184}, abstract = {Plankton use solar energy to drive the nutrient cycles that make the planet habitable for larger organisms. We can now explore the diversity and functions of plankton using genomics, revealing the gene repertoires associated with survival in the oceans. Such studies will help us to appreciate the sensitivity of ocean systems and of the ocean{\textquoteright}s response to climate change, improving the predictive power of climate models.}, keywords = {Astronomy, astrophysics, Biochemistry, Bioinformatics, Biology, biotechnology, cancer, cell cycle, cell signalling, climate change, Computational Biology, development, developmental biology, DNA, drug discovery, earth science, ecology, environmental science, Evolution, evolutionary biology, functional genomics, Genetics, Genomics, geophysics, immunology, interdisciplinary science, life, marine biology, materials science, medical research, medicine, metabolomics, molecular biology, molecular interactions, nanotechnology, Nature, neurobiology, neuroscience, palaeobiology, pharmacology, Physics, proteomics, quantum physics, RNA, Science, science news, science policy, signal transduction, structural biology, systems biology, transcriptomics}, isbn = {0028-0836}, doi = {10.1038/nature08056}, url = {http://www.nature.com/nature/journal/v459/n7244/abs/nature08056.html}, author = {Bowler,Chris and Karl,David M. and Rita R Colwell} } @conference {14628, title = {Mimosa: mixture model of co-expression to detect modulators of regulatory interaction}, booktitle = {Proceedings of the 9th international conference on Algorithms in bioinformatics}, series = {WABI{\textquoteright}09}, year = {2009}, month = {2009///}, pages = {133 - 144}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {Functionally related genes tend to be correlated in their expression patterns across multiple conditions and/or tissue-types. Thus co-expression networks are often used to investigate functional groups of genes. In particular, when one of the genes is a transcription factor (TF), the co-expression-based interaction is interpreted, with caution, as a direct regulatory interaction. However, any particular TF, and more importantly, any particular regulatory interaction, is likely to be active only in a subset of experimental conditions. Moreover, the subset of expression samples where the regulatory interaction holds may be marked by presence or absence of a modifier gene, such as an enzyme that post-translationally modifies the TF. Such subtlety of regulatory interactions is overlooked when one computes an overall expression correlation. Here we present a novel mixture modeling approach where a TF-Gene pair is presumed to be significantly correlated (with unknown coefficient) in a (unknown) subset of expression samples. The parameters of the model are estimated using a Maximum Likelihood approach. The estimated mixture of expression samples is then mined to identify genes potentially modulating the TF-Gene interaction. We have validated our approach using synthetic data and on three biological cases in cow and in yeast. While limited in some ways, as discussed, the work represents a novel approach to mine expression data and detect potential modulators of regulatory interactions.}, isbn = {3-642-04240-6, 978-3-642-04240-9}, url = {http://dl.acm.org/citation.cfm?id=1812906.1812918}, author = {Hansen,Matthew and Everett,Logan and Singh,Larry and Hannenhalli, Sridhar} } @conference {13385, title = {Minimizing Communication Cost in Distributed Multi-query Processing}, booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09}, year = {2009}, month = {2009/04/29/March}, pages = {772 - 783}, publisher = {IEEE}, organization = {IEEE}, abstract = {Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in the area of distributed query processing and optimization. In this paper we address a general, distributed multi-query processing problem motivated by the need to minimize the communication cost in these environments. Specifically we address the problem of optimally sharing data movement across the communication edges in a distributed communication network given a set of overlapping queries and query plans for them (specifying the operations to be executed). Most of the problem variations of our general problem can be shown to be NP-Hard by a reduction from the Steiner tree problem. However, we show that the problem can be solved optimally if the communication network is a tree, and present a novel algorithm for finding an optimal data movement plan. For general communication networks, we present efficient approximation algorithms for several variations of the problem. Finally, we present an experimental study over synthetic datasets showing both the need for exploiting the sharing of data movement and the effectiveness of our algorithms at finding such plans.}, keywords = {Approximation algorithms, Communication networks, Computer science, Cost function, Data engineering, distributed communication network, distributed databases, distributed multi-query processing, grid computing, Large-scale systems, NP-hard, optimisation, Polynomials, Publish-subscribe, publish-subscribe systems, Query optimization, Query processing, sensor networks, Steiner tree problem, Tree graphs, trees (mathematics)}, isbn = {978-1-4244-3422-0}, doi = {10.1109/ICDE.2009.85}, author = {Li,Jian and Deshpande, Amol and Khuller, Samir} } @article {17755, title = {Mining Online Opinions}, journal = {Computer}, volume = {42}, year = {2009}, month = {2009///}, pages = {88 - 90}, abstract = {Emerging opinion-mining technology makes it possible to aggregate and financially leverage the opinions of vast numbers of people.}, doi = {10.1109/MC.2009.229}, author = {V.S. Subrahmanian} } @conference {14337, title = {Mobile Living Labs 09: Methods and Tools for Evaluation in the Wild}, booktitle = {Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services}, series = {MobileHCI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {107:1{\textendash}107:2 - 107:1{\textendash}107:2}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In a Mobile Living Lab, mobile devices are used to evaluate concepts and prototypes in real-life settings. In other words, the lab is brought to the people. This workshop provides a forum for researchers and practitioners to share experiences and issues with methods and tools for Mobile Living Labs. In particular, we seek to bring together people who have applied methods for Mobile Living Labs and people who build tools for those methods.The aim of the workshop is twofold. First, to make an up-to-date overview of current methods and tools for conducting user studies in Mobile Living Labs -- highlighting their individual strengths and weaknesses. Second, to uncover challenges that are not adequately addressed by current methods and tools and to come up with ideas and requirements that could fill this gap thus serving as beacons for further research and development in this area. }, keywords = {field study, in-situ evaluation, living labs, methods, mobile, tools, user experience}, isbn = {978-1-60558-281-8}, doi = {10.1145/1613858.1613981}, url = {http://doi.acm.org/10.1145/1613858.1613981}, author = {ter Hofte,Henri and Jensen,Kasper L{\o}vborg and Nurmi,Petteri and Jon Froehlich} } @conference {13970, title = {Modal expansion of HRTFs: Continuous representation in frequency-range-angle}, booktitle = {Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on}, year = {2009}, month = {2009/04//}, pages = {285 - 288}, abstract = {This paper proposes a continuous HRTF representation in both 3D spatial and frequency domains. The method is based on the acoustic reciprocity principle and a modal expansion of the wave equation solution to represent the HRTF variations with different variables in separate basis functions. The derived spatial basis modes can achieve HRTF near-field and far-field representation in one formulation. The HRTF frequency components are expanded using Fourier Spherical Bessel series for compact representation. The proposed model can be used to reconstruct HRTFs at any arbitrary position in space and at any frequency point from a finite number of measurements. Analytical simulated and measured HRTFs from a KEMAR are used to validate the model.}, keywords = {analysis;signal, bessel, domains;frequency-range-angle;head, expansion;modal, Fourier, function;modal, functions;, reconstruction;signal, related, representation;transfer, series;HRTF;frequency, spherical, transfer}, doi = {10.1109/ICASSP.2009.4959576}, author = {Zhang,Wen and Abhayapala,T.D. and Kennedy,R.A. and Duraiswami, Ramani} } @article {12968, title = {Model-based quality assessment and base-calling for second-generation sequencing data}, journal = {Johns Hopkins University, Dept. of Biostatistics Working Papers}, year = {2009}, month = {2009///}, pages = {184 - 184}, author = {Irizarry,R. A and Corrada Bravo, Hector} } @article {15293, title = {Modeling actions of PubMed users with n-gram language models}, journal = {Information retrieval}, volume = {12}, year = {2009}, month = {2009///}, pages = {487 - 503}, abstract = {Transaction logs from online search engines are valuable for two reasons: First, they provide insight into human information-seeking behavior. Second, log data can be used to train user models, which can then be applied to improve retrieval systems. This article presents a study of logs from PubMed{\textregistered}, the public gateway to the MEDLINE{\textregistered} database of bibliographic records from the medical and biomedical primary literature. Unlike most previous studies on general Web search, our work examines user activities with a highly-specialized search engine. We encode user actions as string sequences and model these sequences using n-gram language models. The models are evaluated in terms of perplexity and in a sequence prediction task. They help us better understand how PubMed users search for information and provide an enabler for improving users{\textquoteright} search experience.}, doi = {10.1007/s10791-008-9067-7}, author = {Jimmy Lin and Wilbur,W. J} } @conference {18241, title = {Modeling and analysis of content identification}, booktitle = {Multimedia and Expo, 2009. ICME 2009. IEEE International Conference on}, year = {2009}, month = {2009/07/28/3}, pages = {1528 - 1531}, abstract = {Content fingerprinting provides a compact content-based representation of a multimedia document. An important application of fingerprinting is the identification of modified copies of the original media content. These modifications may be incidental changes that occur during the usage of multimedia, or intentional modifications made by an adversary to avoid detection. Currently, the effectiveness of content identification techniques is often assessed through benchmark databases. To complement these experimental performance evaluations, this paper develops a theoretical framework for analyzing content identification techniques. Beneficial aspects from decision theory and game theory are exploited to gain insights toward optimal system design and parameter selection.}, keywords = {benchmark, databases;content, design;decision, document;optimal, identification, identification;game, representation;decision, system, systems;, techniques;content-based, theory;fingerprint, theory;fingerprinting, theory;multimedia}, doi = {10.1109/ICME.2009.5202795}, author = {Varna,A.L. and M. Wu} } @conference {18243, title = {Modeling and analysis of ordinal ranking in content fingerprinting}, booktitle = {Information Forensics and Security, 2009. WIFS 2009. First IEEE International Workshop on}, year = {2009}, month = {2009/12//}, pages = {116 - 120}, abstract = {Content fingerprinting provides a compact representation of multimedia objects for copy detection. This paper analyzes the robustness of the ordinal ranking module frequently used in content fingerprinting by examining the changes in ranks as local variations are introduced in feature values. Closed-form expressions to measure such sensitivity are derived when feature values are jointly Gaussian-distributed. The results show that sensitivity depends on the strength of local variation, the total number of blocks, and the correlations among block-based feature values. Experiments with both synthesized data and image data validate the analysis and provide interesting insights, inspiring an approach to reduce the sensitivity.}, keywords = {detection;, detection;multimedia, fingerprinting;copy, Gaussian-distributed;content, identification;multimedia, objects;ordinal, processes;fingerprint, ranking;Gaussian, systems;object}, doi = {10.1109/WIFS.2009.5386472}, author = {Chuang,Wei-Hong and Varna,A.L. and M. Wu} } @article {15390, title = {Modeling and Testing of Ethernet Transformers}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/10//}, pages = {4793 - 4796}, abstract = {In this paper, novel techniques for the testing and identification of lumped parameters of equivalent circuits for Ethernet transformers are presented. It is demonstrated experimentally and theoretically that resonance phenomena may occur in the loop formed by leakage inductances and cross-winding capacitance. This resonance may corrupt the pass band of the transformers transfer characteristic for differential-mode signals.}, keywords = {area, capacitance;differential-mode, characteristic;local, Ethernet, identification;lumped, inductances;lumped, networks;transformers;, PARAMETERS, phenomena;transformers, signals;leakage, testing;resonance, transfer, transformers;cross-winding}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2023918}, author = {Bowen,D. and Mayergoyz, Issak D and Zhang,Zhenyu and McAvoy,P. and Krafft,C. and Kroop,D.} } @article {17917, title = {Modeling and visualization of human activities for multicamera networks}, journal = {EURASIP Journal on Image and Video Processing}, volume = {2009}, year = {2009}, month = {2009///}, author = {Sankaranarayanan,A. C and Patro,R. and Turaga,P. and Varshney, Amitabh and Chellapa, Rama} } @conference {18244, title = {Modeling content fingerprints using markov random fields}, booktitle = {Information Forensics and Security, 2009. WIFS 2009. First IEEE International Workshop on}, year = {2009}, month = {2009/12//}, pages = {111 - 115}, abstract = {Content fingerprints are widely employed for identifying multimedia in various applications. A {\^A}{\textquestiondown}fingerprint{\^A}{\textquestiondown} of a video or audio is a short signature that captures unique characteristics of the signal and can be used to perform robust identification. Several fingerprinting techniques have been proposed in the literature and are often evaluated using benchmark databases. To complement these experimental evaluations, this paper develops a theoretical model for content fingerprints and evaluates the identification accuracy. Fingerprints and the noise are modeled as Markov random fields and the optimal decision rule for matching is derived. An algorithm to compute the probability of correct detection and the false alarm rate by estimating the density of states is described. Numerical results are provided for a model of a block based binary fingerprinting scheme and the influence of the fingerprint correlation and the noise on the detection accuracy is studied.}, keywords = {based, binary, correlation;multimedia;noise;optimal, data;, decision, field;block, fingerprint;fingerprint, fingerprinting;content, Markov, of, processes;multimedia, random, rule;Markov, systems;probability;security}, doi = {10.1109/WIFS.2009.5386471}, author = {Varna,A.L. and M. Wu} } @conference {16683, title = {More than words: Syntactic packaging and implicit sentiment}, booktitle = {Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics}, year = {2009}, month = {2009///}, pages = {503 - 511}, author = {Greene,S. and Resnik, Philip} } @conference {13305, title = {Morphology analysis of 3D scalar fields based on morse theory and discrete distortion}, booktitle = {Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}, series = {GIS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {187 - 196}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We investigate a morphological approach to the analysis and understanding of 3D scalar fields defined by volume data sets. We consider a discrete model of the 3D field obtained by discretizing its domain into a tetrahedral mesh. We use Morse theory as the basic mathematical tool which provides a segmentation of the graph of the scalar field based on relevant morphological features (such as critical points). Since the graph of a discrete 3D field is a tetrahedral hypersurface in 4D space, we measure the distortion of the transformation which maps the tetrahedral decomposition of the domain of the scalar field into the tetrahedral mesh representing its graph in R4, and we call it discrete distortion. We develop a segmentation algorithm to produce a Morse decompositions associated with the scalar field and its discrete distortion. We use a merging procedure to control the number of 3D regions in the segmentation output. Experimental results show the validity of our approach.}, keywords = {curvature, morphological analysis, Morse theory, segmentation}, isbn = {978-1-60558-649-6}, doi = {10.1145/1653771.1653799}, url = {http://doi.acm.org/10.1145/1653771.1653799}, author = {Mesmoudi,Mohammed Mostefa and De Floriani, Leila and Magillo,Paola} } @article {14630, title = {Motifs and cis-regulatory modules mediating the expression of genes co-expressed in presynaptic neurons}, journal = {Genome Biology}, volume = {10}, year = {2009}, month = {2009/07/01/}, pages = {R72 - R72}, abstract = {Hundreds of proteins modulate neurotransmitter release and synaptic plasticity during neuronal development and in response to synaptic activity. The expression of genes in the pre- and post-synaptic neurons is under stringent spatio-temporal control, but the mechanism underlying the neuronal expression of these genes remains largely unknown.}, isbn = {1465-6906}, doi = {10.1186/gb-2009-10-7-r72}, url = {http://genomebiology.com/2009/10/7/R72}, author = {Liu,Rui and Hannenhalli, Sridhar and Bucan,Maja} } @article {12524, title = {Moving Object Verification in Airborne Video Sequences}, journal = {Circuits and Systems for Video Technology, IEEE Transactions on}, volume = {19}, year = {2009}, month = {2009/01//}, pages = {77 - 89}, abstract = {This paper presents an end-to-end system for moving object verification in airborne video sequences. Using a sample selection module, the system first selects frames from a short sequence and stores them in an exemplar database. To handle appearance change due to potentially large aspect angle variations, a homography-based view synthesis method is then used to generate a novel view of each image in the exemplar database at the same pose as the testing object in each frame of a testing video segment. A rotationally invariant color matcher and a spatial-feature matcher based on distance transforms are combined using a weighted average rule to compare the novel view and the testing object. After looping over all testing frames, the set of match scores is passed to a temporal analysis module to examine the behavior of the testing object, and calculate a final likelihood. Very good verification performance is achieved over thousands of trials for both color and infrared video sequences using the proposed system.}, keywords = {airborne, database;homography-based, databases;, matcher;color, matcher;image, matching;image, method;infrared, object, sequences;color, sequences;distance, sequences;moving, sequences;video, synthesis, system;exemplar, transforms;end-to-end, verification;spatial-feature, video, view}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2008.2009243}, author = {Yue,Zhanfeng and Guarino, D. and Chellapa, Rama} } @article {12513, title = {Multicamera Tracking of Articulated Human Motion Using Shape and Motion Cues}, journal = {Image Processing, IEEE Transactions on}, volume = {18}, year = {2009}, month = {2009/09//}, pages = {2114 - 2126}, abstract = {We present a completely automatic algorithm for initializing and tracking the articulated motion of humans using image sequences obtained from multiple cameras. A detailed articulated human body model composed of sixteen rigid segments that allows both translation and rotation at joints is used. Voxel data of the subject obtained from the images is segmented into the different articulated chains using Laplacian eigenmaps. The segmented chains are registered in a subset of the frames using a single-frame registration technique and subsequently used to initialize the pose in the sequence. A temporal registration method is proposed to identify the partially segmented or unregistered articulated chains in the remaining frames in the sequence. The proposed tracker uses motion cues such as pixel displacement as well as 2-D and 3-D shape cues such as silhouettes, motion residue, and skeleton curves. The tracking algorithm consists of a predictor that uses motion cues and a corrector that uses shape cues. The use of complementary cues in the tracking alleviates the twin problems of drift and convergence to local minima. The use of multiple cameras also allows us to deal with the problems due to self-occlusion and kinematic singularity. We present tracking results on sequences with different kinds of motion to illustrate the effectiveness of our approach. The pose of the subject is correctly tracked for the duration of the sequence as can be verified by inspection.}, keywords = {2D shape cues, 3D shape cues, algorithms, Anatomic;Models, articulated human motion, automatic algorithm, Biological;Movement;Posture;Skeleton;Video Recording;, Computer-Assisted;Models, Eigenvalues and eigenfunctions, human pose estimation, HUMANS, Image motion analysis, IMAGE PROCESSING, image registration, Image segmentation, Image sequences, kinematic singularity, Laplacian eigenmaps, multicamera tracking algorithm, pixel displacement, pose estimation, single-frame registration technique, temporal registration method, tracking}, isbn = {1057-7149}, doi = {10.1109/TIP.2009.2022290}, author = {Sundaresan, A. and Chellapa, Rama} } @article {17300, title = {Multidimensional Analysis and Visualization on Large Biomedical Data}, journal = {Statistical Bioinformatics}, year = {2009}, month = {2009///}, pages = {157 - 184}, author = {Seo,J. and Shneiderman, Ben} } @article {13058, title = {Multi-label prediction via sparse infinite CCA}, journal = {Advances in Neural Information Processing Systems}, volume = {22}, year = {2009}, month = {2009///}, pages = {1518 - 1526}, author = {Rai,P. and Daum{\'e}, Hal} } @conference {12408, title = {Multilingual topic models for unaligned text}, booktitle = {Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence}, series = {UAI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {75 - 82}, publisher = {AUAI Press}, organization = {AUAI Press}, address = {Arlington, Virginia, United States}, abstract = {We develop the multilingual topic model for unaligned text (MuTo), a probabilistic model of text that is designed to analyze corpora composed of documents in two languages. From these documents, MuTo uses stochastic EM to simultaneously discover both a matching between the languages and multilingual latent topics. We demonstrate that MuTo is able to find shared topics on real-world multilingual corpora, successfully pairing related documents across languages. MuTo provides a new framework for creating multilingual topic models without needing carefully curated parallel corpora and allows applications built using the topic model formalism to be applied to a much wider class of corpora.}, isbn = {978-0-9749039-5-8}, url = {http://dl.acm.org/citation.cfm?id=1795114.1795124}, author = {Jordan Boyd-Graber and Blei,David M.} } @conference {13113, title = {Multiple instance Feature for robust part-based object detection}, booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on}, year = {2009}, month = {2009///}, pages = {405 - 412}, author = {Lin,Z. and Hua,G. and Davis, Larry S.} } @article {12542, title = {Machine Recognition of Human Activities: A Survey}, journal = {Circuits and Systems for Video Technology, IEEE Transactions on}, volume = {18}, year = {2008}, month = {2008/11//}, pages = {1473 - 1488}, abstract = {The past decade has witnessed a rapid proliferation of video cameras in all walks of life and has resulted in a tremendous explosion of video content. Several applications such as content-based video annotation and retrieval, highlight extraction and video summarization require recognition of the activities occurring in the video. The analysis of human activities in videos is an area with increasingly important consequences from security and surveillance to entertainment and personal archiving. Several challenges at various levels of processing-robustness against errors in low-level processing, view and rate-invariant representations at midlevel processing and semantic representation of human activities at higher level processing-make this problem hard to solve. In this review paper, we present a comprehensive survey of efforts in the past couple of decades to address the problems of representation, recognition, and learning of human activities from video and related applications. We discuss the problem at two major levels of complexity: 1) "actions" and 2) "activities." "Actions" are characterized by simple motion patterns typically executed by a single human. "Activities" are more complex and involve coordinated actions among a small number of humans. We will discuss several approaches and classify them according to their ability to handle varying degrees of complexity as interpreted above. We begin with a discussion of approaches to model the simplest of action classes known as atomic or primitive actions that do not require sophisticated dynamical modeling. Then, methods to model actions with more complex dynamics are discussed. The discussion then leads naturally to methods for higher level representation of complex activities.}, keywords = {activity;low-level, annotation;human, cameras;video, content-based, factors;image, processing;machine, processing;rate-invariant, recognition;image, recognition;midlevel, representation;image, representation;video, representations;semantic, retrieval;human, sequences;, summarization;content-based, video}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2008.2005594}, author = {Turaga,P. and Chellapa, Rama and V.S. Subrahmanian and Udrea,O.} } @inbook {12915, title = {The marine environment and human health: the cholera model}, booktitle = {Global Climate Change and Extreme Weather Events: Understanding the Contributions to Infectious Disease EmergenceGlobal Climate Change and Extreme Weather Events: Understanding the Contributions to Infectious Disease Emergence}, year = {2008}, month = {2008///}, publisher = {National Academies Press}, organization = {National Academies Press}, isbn = {9780309124027}, author = {Rita R Colwell}, editor = {Relman,David} } @article {14921, title = {The Maryland Large-Scale Integrated Neurocognitive Architecture}, year = {2008}, month = {2008/03//}, institution = {University of Maryland College Park}, abstract = {Recent progress in neural computation, high performance computing, neuroscience and cognitive science suggests that an effort to produce a general-purpose, adaptive machine intelligence is likely to yield a qualitatively more powerful system than those currently existing. Here we outline our progress in developing a framework for creating such a large-scale machine intelligence, or neurocognitive architecture that is based on the modularity, dynamics and plasticity of the human brain. We successfully implemented three intermediate-scale parts of such a system, and these are described. Based on this experience, we concluded that for the short term, optimal results would be obtained by using a hybrid design including neural, symbolic AI, and artificial life methods. We propose a three-tiered architecture that integrates these different methods, and describe a prototype mini-Roboscout that we implemented and evaluated based on this architecture. We also examined, via computational experiments, the effectiveness of genetic programming as a design tool for recurrent neural networks, and the speed-up obtained for adaptive neural networks when they are executed on a graphical processing unit. We conclude that the implementation of a large-scale neurocognitive architecture is feasible, and outline a roadmap for proceeding.}, keywords = {*COMPUTATIONS, *HYBRID SYSTEMS, *NEURAL NETS, *NEUROCOGNITIVE ARCHITECTURE, ADAPTIVE SYSTEMS, Artificial intelligence, BRAIN, Cognition, COMPUTER PROGRAMMING, COMPUTER PROGRAMMING AND SOFTWARE, HYBRID AI, Machine intelligence, MECHANICAL ORGANS, MODULAR CONSTRUCTION, NERVOUS SYSTEM, PE61101E, PLASTIC PROPERTIES, PROCESSING EQUIPMENT, RECURRENT NEURAL NETWORK}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA481261}, author = {Reggia, James A. and Tagamets,M. and Contreras-Vidal,J. and Jacobs, David W. and Weems,S. and Naqvi,W. and Yang,C.} } @conference {12244, title = {Matchmaking and implementation issues for a P2P desktop grid}, booktitle = {Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on}, year = {2008}, month = {2008/04//}, pages = {1 - 5}, abstract = {We present some recent and ongoing work in our decentralized desktop computing grid project. Specifically, we discuss matching jobs with compute nodes in a peer-to-peer grid of heterogeneous platforms, and the implementation of our algorithms in a concrete system.}, keywords = {computing, computing;, computing;peer-to-peer, desktop, grid;decentralized, grid;grid, grid;peer-to-peer, P2P}, doi = {10.1109/IPDPS.2008.4536388}, author = {Marsh,M. and Kim,Jik-Soo and Nam,Beomseok and Jaehwan Lee and Ratanasanya,S. and Bhattacharjee, Bobby and Keleher,P. and Richardson,D. and Wellnitz,D.} } @article {14569, title = {Maternal depletion of CTCF reveals multiple functions during oocyte and preimplantation embryo development}, journal = {Development}, volume = {135}, year = {2008}, month = {2008///}, pages = {2729 - 2738}, abstract = {CTCF is a multifunctional nuclear factor involved in epigenetic regulation. Despite recent advances that include the systematic discovery of CTCF-binding sites throughout the mammalian genome, the in vivo roles of CTCF in adult tissues and during embryonic development are largely unknown. Using transgenic RNAi, we depleted maternal stores of CTCF from growing mouse oocytes, and identified hundreds of misregulated genes. Moreover, our analysis suggests that CTCF predominantly activates or derepresses transcription in oocytes. CTCF depletion causes meiotic defects in the egg, and mitotic defects in the embryo that are accompanied by defects in zygotic gene expression, and culminate in apoptosis. Maternal pronuclear transfer and CTCF mRNA microinjection experiments indicate that CTCF is a mammalian maternal effect gene, and that persistent transcriptional defects rather than persistent chromosomal defects perturb early embryonic development. This is the first study detailing a global and essential role for CTCF in mouse oocytes and preimplantation embryos.}, doi = {10.1242/dev.024539}, url = {http://dev.biologists.org/content/135/16/2729.abstract}, author = {Wan,Le-Ben and Pan,Hua and Hannenhalli, Sridhar and Cheng,Yong and Ma,Jun and Fedoriw,Andrew and Lobanenkov,Victor and Latham,Keith E. and Schultz,Richard M. and Bartolomei,Marisa S.} } @conference {17536, title = {Measurement Manipulation and Space Selection in Network Coordinates}, booktitle = {Distributed Computing Systems, International Conference on}, year = {2008}, month = {2008///}, pages = {361 - 368}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. However, most coordinate systems have been evaluated solely on data sets built by their authors from measurements gathered over large periods of time. Although they show good prediction results, it is unclear whether the accuracy is the result of the system design properties or is more connected to the characteristics of the data sets. In this paper, we revisit a simple question: how do the features of the embedding space and the inherent attributes of the data sets interact in producing good embeddings? We adapt the Vivaldi algorithm to use Hyperbolic space for embedding and evaluate both Euclidean and Hyperbolic Vivaldi on seven sets of real-world latencies. Our results show that node filtering and latency distributions can significantly influence the accuracy of the predictions. For example, although Euclidean Vivaldi performs well on data sets that were chosen, constructed and filtered by the designers of the algorithm, its performance and robustness decrease considerably when run on third party data sets that were not filtered a priori. Our results offer important insight into designing and building coordinate systems that are both robust and accurate in Internet-like environments.}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.2008.27}, author = {Lumezanu,Cristian and Spring, Neil} } @article {12147, title = {Measures and Risk Indicators for Early Insight into Software Safety. Development of Fault-Tolerant Systems}, year = {2008}, month = {2008/10//}, institution = {ABERDEEN TEST CENTER MD}, abstract = {Software contributes an ever-increasing level of functionality and control in today{\textquoteright}s systems. This increased use of software can dramatically increase the complexity and time needed to evaluate the safety of a system. Although the actual system safety cannot be verified during its development, measures can reveal early insights into potential safety problems and risks. An approach for developing early software safety measures is presented in this article. The approach and the example software measures presented are based on experience working with the safety engineering group on a large Department of Defense program.}, keywords = {*SOFTWARE ENGINEERING, *SYSTEM SAFETY, COMPUTER PROGRAMMING AND SOFTWARE, fault tolerant computing, INDICATORS, measurement, REPRINTS, risk, SAFETY ENGINEERING}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA487120}, author = {Basili, Victor R. and Marotta,Frank and Dangle,Kathleen and Esker,Linda and Rus,Ioana} } @conference {14229, title = {Measuring 1st order stretchwith a single filter}, booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2008. ICASSP 2008}, year = {2008}, month = {2008/04/31/March}, pages = {909 - 912}, publisher = {IEEE}, organization = {IEEE}, abstract = {We analytically develop a filter that is able to measure the linear stretch of the transformation around a point, and present results of applying it to real signals. We show that this method is a real-time alternative solution for measuring local signal transformations. Experimentally, this method can accurately measure stretch, however, it is sensitive to shift.}, keywords = {Cepstral analysis, Educational institutions, filter, filtering theory, Fourier transforms, Frequency domain analysis, Frequency estimation, Gabor filters, Image analysis, IMAGE PROCESSING, linear stretch measurement, local signal transformation measurement, Nonlinear filters, Phase estimation, Signal analysis, Speech processing}, isbn = {978-1-4244-1483-3}, doi = {10.1109/ICASSP.2008.4517758}, author = {Bitsakos,K. and Domke, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {19197, title = {Measuring the pulse of the city through shared bicycle programs}, journal = {Proc. of UrbanSense08}, year = {2008}, month = {2008}, author = {Jon Froehlich and Neumann, J. and Oliver,N.} } @article {12360, title = {Memory-constrained block processing for dsp software optimization}, journal = {Journal of Signal Processing Systems}, volume = {50}, year = {2008}, month = {2008///}, pages = {163 - 177}, author = {Ko,M. Y and Shen,C. C and Bhattacharyya, Shuvra S.} } @article {18584, title = {Method and System for Detecting and Responding to Attacking Networks}, volume = {11/538,212}, year = {2008}, month = {2008/01/31/}, abstract = {A system and method for detecting a first network of compromised computers in a second network of computers, comprising: collecting Domain Name System (DNS) data for the second network; examining the collected data relative to DNS data from known comprised and/or uncompromised computers in the second network; and determining the existence of the first network and/or the identity of compromised computers in the second network based on the examination.}, url = {http://www.google.com/patents?id=TYunAAAAEBAJ}, author = {Dagon,David and Feamster, Nick and Lee,Weake and Edmonds,Robert and Lipton,Richard and Ramachandran,Anirudh}, editor = {Damballa, Inc.} } @conference {18775, title = {Methods to directly measure the trapping potential in optical tweezers}, year = {2008}, month = {2008///}, pages = {70380V{\textendash}1 - 70380V{\textendash}1}, abstract = {Techniques to measure the trapping force in an optical tweezers without any prior assumptions about the trapshape have been developed. The response of a trapped micro or nanoparticle to a step input is measured and then used to calculate the trapping force experienced by the particle as a function of it{\textquoteright}s position in the trap. This method will provide new insight into the trapping behavior of nanoparticles, which are more weakly bound than microparticles and thereby explore larger regions of the trapping potential due to Brownian motion. Langevin dynamics simulations are presented to model the system and are used to demonstrate this technique. Preliminary experimental results are then presented to validate the simulations. Finally, the measured trapping forces, from simulations and laboratory experiments, are integrated to recover the trapping potential. }, url = {http://144.206.159.178/FT/CONF/16419087/16419102.pdf}, author = {Balijepalli,A. and LeBrun,T. W. and Gorman,J. J. and Gupta,S.K.} } @article {16835, title = {Metric space similarity joins}, journal = {ACM Trans. Database Syst.}, volume = {33}, year = {2008}, month = {2008/06//}, pages = {7:1{\textendash}7:38 - 7:1{\textendash}7:38}, abstract = {Similarity join algorithms find pairs of objects that lie within a certain distance ε of each other. Algorithms that are adapted from spatial join techniques are designed primarily for data in a vector space and often employ some form of a multidimensional index. For these algorithms, when the data lies in a metric space, the usual solution is to embed the data in vector space and then make use of a multidimensional index. Such an approach has a number of drawbacks when the data is high dimensional as we must eventually find the most discriminating dimensions, which is not trivial. In addition, although the maximum distance between objects increases with dimension, the ability to discriminate between objects in each dimension does not. These drawbacks are overcome via the introduction of a new method called Quickjoin that does not require a multidimensional index and instead adapts techniques used in distance-based indexing for use in a method that is conceptually similar to the Quicksort algorithm. A formal analysis is provided of the Quickjoin method. Experiments show that the Quickjoin method significantly outperforms two existing techniques.}, keywords = {distance-based indexing, external memory algorithms, nearest neighbor queries, range queries, Ranking, Similarity join}, isbn = {0362-5915}, doi = {10.1145/1366102.1366104}, url = {http://doi.acm.org/10.1145/1366102.1366104}, author = {Jacox,Edwin H. and Samet, Hanan} } @conference {18585, title = {MINT: a Market for INternet Transit}, booktitle = {Proceedings of the 2008 ACM CoNEXT Conference}, series = {CoNEXT {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {70:1{\textendash}70:6 - 70:1{\textendash}70:6}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Today{\textquoteright}s Internet{\textquoteright}s routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long paths, de-peering, etc. The latter arises because of a primitive market structure that results in unfulfilled demand and unused capacity. Today{\textquoteright}s networks make pairwise, myopic interconnection decisions based on business considerations that may not mirror considerations of the edge networks (or end systems) that would benefit from the existence of a particular interconnection. These bilateral contracts are also complex and difficult to enforce. This paper proposes MINT, a market structure and routing protocol suite that facilitates the sale and purchase of end-to-end Internet paths. We present MINT{\textquoteright}s structure, explain how it improves connectivity and market efficiency, explore the types of connectivity that might be exchanged (vs. today{\textquoteright}s "best effort" connectivity), and argue that MINT{\textquoteright}s deployment is beneficial to both stub networks and transit providers. We discuss research challenges, including the design both of the protocol that maintains information about connectivity and of the market clearing algorithms. Our preliminary evaluation shows that such a market quickly reaches equilibrium and exhibits price stability.}, isbn = {978-1-60558-210-8}, doi = {10.1145/1544012.1544082}, url = {http://doi.acm.org/10.1145/1544012.1544082}, author = {Valancius,Vytautas and Feamster, Nick and Johari,Ramesh and Vazirani,Vijay} } @article {12557, title = {Mixed state models for automatic target recognition and behavior analysis in video sequences}, journal = {Proceedings of SPIE}, volume = {6967}, year = {2008}, month = {2008/04/03/}, pages = {69670Q-69670Q-11 - 69670Q-69670Q-11}, abstract = {Mixed state or hybrid state space systems are useful tools for various problems in computer vision. These systems model complicated system dynamics as a mixture of inherently simple sub-systems, with an additional mechanism to switch between the sub-systems. This approach of modeling using simpler systems allows for ease in learning the parameters of the system and in solving the inference problem. In this paper, we study the use of such mixed state space systems for problems in recognition and behavior analysis in video sequences. We begin with a dynamical system formulation for recognition of faces from a video. This system is used to introduce the simultaneous tracking and recognition paradigm that allows for improved performance in both tracking and recognition. We extend this framework to design a second system for verification of vehicles across non-overlapping views using structural and textural fingerprints for characterizing the identity of the target. Finally, we show the use of such modeling for tracking and behavior analysis of bees from video.}, isbn = {0277786X}, doi = {doi:10.1117/12.777766}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/6967/1/69670Q_1?isAuthorized=no}, author = {Chellapa, Rama and Sankaranarayanan,Aswin C. and Veeraraghavan,Ashok} } @article {13599, title = {Mobile Retriever: Access to Digital Documents from their Physical Source}, journal = {International Journal on Document Analysis and Recognition}, volume = {11}, year = {2008}, month = {2008/09//}, pages = {19 - 27}, abstract = {In this paper, we describe an image based document retrieval system which runs on camera enabled mobile devices. {\textquotedblleft}Mobile Retriever{\textquotedblright} aims to seamlessly link physical and digital documents by allowing users to snap a picture of the text of a document and retrieve its electronic version from a database. Experiments show that for a database of 100,093 pages, the correct document can be retrieved in less than 4 s at a success rate over 95\%. Our system extracts token pairs from the text, to efficiently index and retrieve candidate pages using only a small portion of the image. We use token triplets that define the orientation of three corresponding tokens to effectively prune the false positives and identify the correct page to retrieve. We stress the importance of geometrical relationship between feature points and show its effectiveness in our camera based image retrieval system.}, author = {Liu,Xu and David Doermann} } @article {12851, title = {Model Based Design Verification: A Monitor Based Approach}, volume = {2008-01-0741}, year = {2008}, month = {2008/04//}, institution = {SAE International}, address = {Warrendale, PA}, abstract = {This paper assesses the utility of an automated functional verification methodology in the design of a body electronics application. The use of design models as detailed specifications for software is gaining steady acceptance in the automotive industry because of the advantages it offers in terms of rapid system prototyping and automatic code generation. This paper argues that such modeling effort can also be used to provide support for design verification, so that errors may be pinpointed before they find their way into code, when they become much harder and more expensive to isolate, diagnose and repair.}, url = {http://papers.sae.org/2008-01-0741}, author = {Ackermann,Chris and Ray,Arnab and Cleaveland, Rance and Heit,J{\"u}rgen and Martin,Christopher and Shelton,Charles} } @article {12544, title = {Model Driven Segmentation of Articulating Humans in Laplacian Eigenspace}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {30}, year = {2008}, month = {2008/10//}, pages = {1771 - 1785}, abstract = {We propose a general approach using Laplacian Eigenmaps and a graphical model of the human body to segment 3D voxel data of humans into different articulated chains. In the bottom-up stage, the voxels are transformed into a high-dimensional (6D or less) Laplacian Eigenspace (LE) of the voxel neighborhood graph. We show that LE is effective at mapping voxels on long articulated chains to nodes on smooth 1D curves that can be easily discriminated, and prove these properties using representative graphs. We fit 1D splines to voxels belonging to different articulated chains such as the limbs, head and trunk, and determine the boundary between splines using the spline fitting error. A top-down probabilistic approach is then used to register the segmented chains, utilizing their mutual connectivity and individual properties. Our approach enables us to deal with complex poses such as those where the limbs form loops. We use the segmentation results to automatically estimate the human body models. While we use human subjects in our experiments, the method is fairly general and can be applied to voxel-based segmentation of any articulated object composed of long chains. We present results on real and synthetic data that illustrate the usefulness of this approach.}, keywords = {3D voxel data segmentation, algorithms, Anatomic;Pattern Recognition, Artificial intelligence, Automated;Reproducibility of Results;Sensitivity and Specificity;Whole Body Imaging;, Computer simulation, Computer-Assisted;Imaging, curve fitting, Eigenvalues and eigenfunctions, graph theory, human articulation, human body graphical model, human motion analysis, HUMANS, Image Enhancement, Image Interpretation, Image motion analysis, image registration, Image segmentation, Laplace transforms, Laplacian eigenspace transform, model driven segmentation, probability, representative graph, skeleton registration, Smoothing methods, solid modelling, spline fitting error, splines (mathematics), Three-Dimensional;Joints;Models, top-down probabilistic approach, voxel neighborhood graph}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2007.70823}, author = {Sundaresan, A. and Chellapa, Rama} } @article {13302, title = {Modeling and visualization approaches for time-varying volumetric data}, journal = {Advances in Visual Computing}, year = {2008}, month = {2008///}, pages = {1000 - 1010}, abstract = {Time-varying volumetric data arise in a variety of application domains, and thus several techniques for dealing with such data have been proposed in the literature. A time-varying dataset is typically modeled either as a collection of discrete snapshots of volumetric data, or as a four-dimensional dataset. This choice influences the operations that can be efficiently performed on such data. Here, we classify the various approaches to modeling time-varying scalar fields, and briefly describe them. Since most models of time-varying data have been abstracted from well-known approaches to volumetric data, we review models of volumetric data as well as schemes to accelerate isosurface extraction and discuss how these approaches have been applied to time-varying datasets. Finally, we discuss multi-resolution approaches which allow interactive processing and visualization of large time varying datasets.}, doi = {10.1007/978-3-540-89646-3_100}, author = {Weiss,K. and De Floriani, Leila} } @conference {12550, title = {Modeling shape and textural variations in aging faces}, booktitle = {Automatic Face Gesture Recognition, 2008. FG {\textquoteright}08. 8th IEEE International Conference on}, year = {2008}, month = {2008/09//}, pages = {1 - 8}, abstract = {We propose a two fold approach towards modeling facial aging in adults. Firstly, we develop a shape transformation model that is formulated as a physically-based parametric muscle model that captures the subtle deformations facial features undergo with age. The model implicitly accounts for the physical properties and geometric orientations of the individual facial muscles. Next, we develop an image gradient based texture transformation function that characterizes facial wrinkles and other skin artifacts often observed during different ages. Facial growth statistics (both in terms of shape and texture) play a crucial role in developing the aforementioned transformation models. From a database that comprises of pairs of age separated face images of many individuals, we extract age-based facial measurements across key fiducial features and further, study textural variations across ages. We present experimental results that illustrate the applications of the proposed facial aging model in tasks such as face recognition and facial appearance prediction across aging.}, keywords = {Aging, analysis;, faces;image, function;face, gradient;modeling, model;textural, recognition;image, shape;shape, texture;statistical, transformation, variations;texture}, doi = {10.1109/AFGR.2008.4813337}, author = {Ramanathan,N. and Chellapa, Rama} } @inbook {13455, title = {Modeling Transfer Relationships Between Learning Tasks for Improved Inductive Transfer}, booktitle = {Machine Learning and Knowledge Discovery in DatabasesMachine Learning and Knowledge Discovery in Databases}, series = {Lecture Notes in Computer Science}, volume = {5211}, year = {2008}, month = {2008///}, pages = {317 - 332}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In this paper, we propose a novel graph-based method for knowledge transfer. We model the transfer relationships between source tasks by embedding the set of learned source models in a graph using transferability as the metric. Transfer to a new problem proceeds by mapping the problem into the graph, then learning a function on this graph that automatically determines the parameters to transfer to the new learning task. This method is analogous to inductive transfer along a manifold that captures the transfer relationships between the tasks. We demonstrate improved transfer performance using this method against existing approaches in several real-world domains.}, isbn = {978-3-540-87478-2}, url = {http://dx.doi.org/10.1007/978-3-540-87479-9_39}, author = {Eaton,Eric and desJardins, Marie and Lane,Terran}, editor = {Daelemans,Walter and Goethals,Bart and Morik,Katharina} } @article {14708, title = {Modular Information Hiding and Type-Safe Linking for C}, journal = {IEEE Transactions on Software Engineering}, volume = {34}, year = {2008}, month = {2008/06//May}, pages = {357 - 376}, abstract = {This paper presents CMod, a novel tool that provides a sound module system for C. CMod works by enforcing four rules that are based on principles of modular reasoning and on current programming practice. CMod{\textquoteright}s rules flesh out the convention that .h header files are module interfaces and .c source files are module implementations. Although this convention is well-known, existing explanations of it are incomplete, omitting important subtleties needed for soundness. In contrast, we have proven formally that CMod{\textquoteright}s rules enforce both information hiding and type-safe linking. To use CMod, the programmer develops and builds their software as usual, redirecting the compiler and linker to CMod{\textquoteright}s wrappers. We evaluated CMod by applying it to 30 open source programs, totaling more than one million LoC. Violations to CMod{\textquoteright}s rules revealed more than a thousand information hiding errors, dozens of typing errors, and hundreds of cases that, although not currently bugs, make programming mistakes more likely as the code evolves. At the same time, programs generally adhere to the assumptions underlying CMod{\textquoteright}s rules, and so we could fix rule violations with a modest effort. We conclude that CMod can effectively support modular programming in C: it soundly enforces type-safe linking and information-hiding while being largely compatible with existing practice.}, keywords = {C language, CMOD, Code design, Coding Tools and Techniques, compiler, data encapsulation, Information hiding, modular information hiding, modular reasoning, modules, object-oriented programming, open source programs, packages, program compilers, public domain software, reliability, software reusability, type-safe linking}, isbn = {0098-5589}, doi = {10.1109/TSE.2008.25}, author = {Srivastava,S. and Hicks, Michael W. and Foster, Jeffrey S. and Jenkins,P.} } @article {12976, title = {A molecular footprint of limb loss: sequence variation of the autopodial identity gene Hoxa-13}, journal = {J Mol Evol}, volume = {67}, year = {2008}, month = {2008/12//}, pages = {581 - 593}, abstract = {The homeobox gene Hoxa-13 codes for a transcription factor involved in multiple functions, including body axis and hand/foot development in tetrapods. In this study we investigate whether the loss of one function (e.g., limb loss in snakes) left a molecular footprint in exon 1 of Hoxa-13 that could be associated with the release of functional constraints caused by limb loss. Fragments of the Hoxa-13 exon 1 were sequenced from 13 species and analyzed, with additional published sequences of the same region, using relative rates and likelihood-ratio tests. Five amino acid sites in exon 1 of Hoxa-13 were detected as evolving under positive selection in the stem lineage of snakes. To further investigate whether there is an association between limb loss and sequence variation in Hoxa-13, we used the random forest method on an alignment that included shark, basal fish lineages, and "eu-tetrapods" such as mammals, turtle, alligator, and birds. The random forest method approaches the problem as one of classification, where we seek to predict the presence or absence of autopodium based on amino acid variation in Hoxa-13 sequences. Different alignments tested were associated with similar error rates (18.42\%). The random forest method suggested that phenotypic states (autopodium present and absent) can often be correctly predicted based on Hoxa-13 sequences. Basal, nontetrapod gnat-hostomes that never had an autopodium were consistently classified as limbless together with the snakes, while eu-tetrapods without any history of limb loss in their phylogeny were also consistently classified as having a limb. Misclassifications affected mostly lizards, which, as a group, have a history of limb loss and limb re-evolution, and the urodele and caecilian in our sample. We conclude that a molecular footprint can be detected in Hoxa-13 that is associated with the lack of an autopodium; groups with classification ambiguity (lizards) are characterized by a history of repeated limb loss and possible limb re-evolution.}, doi = {10.1007/s00239-008-9156-7}, author = {Kohlsdorf,T and Cummings, Michael P. and Lynch,VJ and Stopper,GF and Takahashi,K and Wagner,GP} } @conference {19457, title = {More Than Meets the Eye: Transforming the User Experience of Home Network Management}, booktitle = {Proceedings of the 7th ACM conference on Designing interactive systems}, series = {DIS {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {455 - 464}, publisher = {ACM}, organization = {ACM}, abstract = {As computing migrates from the workplace to the home, householders must tackle problems of home network maintenance. Often they lack the technical knowledge or motivation to complete these tasks, making the user experience of home network maintenance frustrating. In response to these difficulties, many householders rely on handwritten reminders or interactive networking tools that are ill-suited for the home environment. In this paper, we seek to understand how to design better home network management tools through a study of sketches created by 40 people in 18 households. In our study, we obtained information about householders{\textquoteright} knowledge, practices and needs with respect to home networking. Based on our results, we present guidelines for transforming the user experience of home network management.}, keywords = {home networks, sketching, troubleshooting}, isbn = {978-1-60558-002-9}, url = {http://doi.acm.org/10.1145/1394445.1394494}, author = {Poole, Erika Shehan and Marshini Chetty and Grinter, Rebecca E. and Edwards, W. Keith} } @conference {13304, title = {Morphological analysis of terrains based on discrete curvature and distortion}, booktitle = {Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems}, series = {GIS {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {53:1{\textendash}53:4 - 53:1{\textendash}53:4}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In order to characterize the morphology of a triangulated terrain, we define several discrete estimators that mimic mean and Gaussian curvatures in the discrete case. We start from concentrated curvature, a discrete notion of Gaussian curvature for polyhedral surfaces, defined by Troyanov [7]. Since concentrated curvature does not depend on the local geometric shape of the terrain, we introduce Ccurvature that allows us to obtain discrete counterparts of both Gaussian and mean curvature. Finally, we define distortion, which behaves as an approximation of mean curvature. We apply all such measures to the analysis of the morphology of triangulated terrains.}, keywords = {curvature, Morphology, terrain modeling}, isbn = {978-1-60558-323-5}, doi = {10.1145/1463434.1463498}, url = {http://doi.acm.org/10.1145/1463434.1463498}, author = {Mesmoudi,Mohammed Mostefa and De Floriani, Leila and Magillo,Paola} } @conference {12247, title = {Motivating participation in internet routing overlays}, booktitle = {Proceedings of the 3rd international workshop on Economics of networked systems}, series = {NetEcon {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {91 - 96}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {PeerWise is an Internet routing overlay that reduces end-to-end latencies by allowing peers to forward through a relay instead of connecting directly to their destinations. Fundamental to PeerWise is the notion of peering agreements between two peers, wherein they agree to forward for one another. In this paper, we consider the problem of motivating users to establish and maintain peerings in a completely decentralized, scalable manner. We show that routing overlays present unique challenges and goals. For instance, since participants can always "fall back" on standard Internet routing, we must encourage users to stay in the system and maintain long-lived peering agreements. To address these challenges, we propose two mechanisms: First, we use Service Level Agreements (SLAs) to expressively negotiate peers{\textquoteright} demands and the recourses they will take when SLAs are violated. Second, we propose a mechanism to address SLA violations that differs from the standard notion of punishment via service degradation. Our simulation results demonstrate that our mechanism causes peers to avoid SLA violators in favor of long-lived peerings. Lastly, we discuss potential, emergent behaviors in a selfish routing overlay.}, keywords = {incentives, internet routing overlays, service-level agreements}, isbn = {978-1-60558-179-8}, doi = {10.1145/1403027.1403048}, url = {http://doi.acm.org/10.1145/1403027.1403048}, author = {Levin,Dave and Baden,Randolph and Lumezanu,Cristian and Spring, Neil and Bhattacharjee, Bobby} } @article {18247, title = {Mpeg recompression detection based on block artifacts}, journal = {Proc. of SPIE Electronic Imaging, Security, Steganography, and Watermarking of Multimedia Contents}, volume = {6819}, year = {2008}, month = {2008///}, abstract = {With sophisticated video editing technologies, it is becoming increasingly easy to tamper digital video withoutleaving visual clues. One of the common tampering operations on video is to remove some frames and then re-encode the resulting video. In this paper, we propose a new method for detecting this type of tampering by exploring the temporal patterns of the block artifacts in video sequences. We show that MPEG compression introduces different block artifacts into various types of frames and that the strength of the block artifacts as a function over time has a regular pattern for a given group of pictures (GOP) structure. When some frames are removed from an MPEG video file and the file is then recompressed, the block artifacts introduced by the previous compression would remain and affect the average of block artifact strength of the recompressed one in such a way that depends on the number of deleted frames and the type of GOP used previously. We propose a feature curve to reveal the compression history of an MPEG video file with a given GOP structure, and use it as evidence to detect tampering. Experimental results evaluated on common video benchmark clips demonstrate the effectiveness of the proposed method. }, author = {Luo,W. and Wu,M. and Huang,J.} } @article {16385, title = {Multi-agent learning with a distributed genetic algorithm}, journal = {AAMAS 2008: ALAMAS + ALAg Workshop}, year = {2008}, month = {2008///}, abstract = {Lightweight agents distributed in space have the potential to solve many complex problems. In this paper, we examine a model where agents represent individuals in a genetic algorithm (GA) solving a shared problem. We examine two questions: (1) How does the network density of connections between agents a ffect the performance of the systems? (2) How does the interaction topology a affect the performance of the system? In our model, agents exist in either a random network topology with long-distance communication, or a location-based topology, where agents only communicate with near neighbors. We examine both fixed and dynamic networks. Within the context of our investigation, our initial results indicate that relatively low network density achievesthe same results as a panmictic, or fully connected, population. Additionally, we find that dynamic networks outperform fixed networks, and that random network topologies outperform proximity-based network topologies. We conclude by showing how this model can be useful not only for multi-agent learning, but also for genetic algorithms, agent-based simulation and models of diff usion of innovation. }, author = {Stonedahl,F. and Rand, William and Wilensky,U.} } @conference {12556, title = {Multi-biometric cohort analysis for biometric fusion}, booktitle = {Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on}, year = {2008}, month = {2008/04/31/4}, pages = {5224 - 5227}, abstract = {Biometric matching decisions have traditionally been made based solely on a score that represents the similarity of the query biometric to the enrolled biometric(s) of the claimed identity. Fusion schemes have been proposed to benefit from the availability of multiple biometric samples (e.g., multiple samples of the same fingerprint) or multiple different biometrics (e.g., face and fingerprint). These commonly adopted fusion approaches rarely make use of the large number of non-matching biometric samples available in the database in the form of other enrolled identities or training data. In this paper, we study the impact of combining this information with the existing fusion methodologies in a cohort analysis framework. Experimental results are provided to show the usefulness of such a cohort-based fusion of face and fingerprint biometrics.}, keywords = {(access, analysis;biometrics, biometric, biometrics;fingerprint, biometrics;multi-biometric, cohort, control);face, data;, decisions;face, fusion;biometric, identification;security, MATCHING, of, recognition;fingerprint}, doi = {10.1109/ICASSP.2008.4518837}, author = {Aggarwal,G. and Ratha,N. K and Bolle, R.M. and Chellapa, Rama} } @conference {18347, title = {Multimodal question answering for mobile devices}, booktitle = {Proceedings of the 13th international conference on Intelligent user interfaces}, series = {IUI {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {405 - 408}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper introduces multimodal question answering, a new interface for community-based question answering services. By offering users an extra modality---photos---in addition to the text modality to formulate queries, multimodal question answering overcomes the limitations of text-only input methods when the users ask questions regarding visually distinctive objects. Such interface is especially useful when users become curious about an interesting object in the environment and want to know about it---simply by taking a photo and asking a question in a situated (from a mobile device) and intuitive (without describing the object in words) manner. We propose a system architecture for multimodal question answering, describe an algorithm for searching the database, and report on the findings of two prototype studies.}, keywords = {Information retrieval, mobile application, pattern matching, Question answering}, isbn = {978-1-59593-987-6}, doi = {10.1145/1378773.1378841}, url = {http://doi.acm.org/10.1145/1378773.1378841}, author = {Tom Yeh and Darrell,Trevor} } @article {13833, title = {Multiple alternative sentence compressions and word-pair antonymy for automatic text summarization and recognizing textual entailment}, journal = {Proceedings of the Text Analysis Conference (TAC-2008), Gaithersburg, MD}, year = {2008}, month = {2008///}, abstract = {The University of Maryland participatedin three tasks organized by the Text Anal- ysis Conference 2008 (TAC 2008): (1) the update task of text summarization; (2) the opinion task of text summariza- tion; and (3) recognizing textual entail- ment (RTE). At the heart of our summa- rization system is Trimmer, which gener- ates multiple alternative compressed ver- sions of the source sentences that act as candidate sentences for inclusion in the summary. For the first time, we investi- gated the use of automatically generated antonym pairs for both text summariza- tion and recognizing textual entailment. We used an antonymy feature in both the opinion summarization task and for rec- ognizing textual entailment. More coher- ent summaries resulted when using the antonymy feature as compared to when not using it. However, performance on ROUGE dropped. The RTE system per- formed almost equally well when using antonyms from WordNet and when using automatically generated antonyms. }, author = {Mohammad,S. and Dorr, Bonnie J and Egan,M. and Jimmy Lin and Zajic, David} } @conference {13117, title = {Multi-resolution Tracking in Space and Time}, booktitle = {Computer Vision, Graphics Image Processing, 2008. ICVGIP {\textquoteright}08. Sixth Indian Conference on}, year = {2008}, month = {2008/12//}, pages = {352 - 358}, abstract = {This paper proposes efficient and robust methods for tracking a moving object at multiple spatial and temporal resolution levels. The efficiency comes from optimising the amounts of spatial and temporal data processed. The robustness results from multi-level coarse-to-fine state-space searching. Tracking across resolution levels incurs an accuracy-versus-speed trade-off. For example, tracking at higher resolutions incurs greater processing cost, while maintaining higher accuracy in estimating the position of the moving object. We propose a novel spatial multi-scale tracker that tracks at the optimal accuracy-versus-speed operating point. Next, we relax this requirement to propose a multi-resolution tracker that operates at a minimum acceptable performance level. Finally, we extend these ideas to a multi-resolution spatio-temporal tracker. We show results of extensive experimentation in support of the proposed approaches.}, keywords = {analysis;image, coarse-to-fine, detection;, estimation;spatial, MOTION, moving, multiscale, object, resolution;object, searching;multiresolution, state-space, tracker;image, tracker;spatio-temporal, tracking;multilevel, tracking;position}, doi = {10.1109/ICVGIP.2008.74}, author = {Roy,S.D. and Tran,S.D. and Davis, Larry S. and Vikram,B.S.} } @conference {13311, title = {Multi-Scale 3D Morse Complexes}, booktitle = {Computational Sciences and Its Applications, 2008. ICCSA {\textquoteright}08. International Conference on}, year = {2008}, month = {2008/07/30/3}, pages = {441 - 451}, abstract = {Morse theory studies the relationship between the topology of a manifold M and the critical points of a scalar function f defined over M. Morse and Morse-Smale complexes, defined by critical points and integral lines of f, induce a subdivision of M into regions of uniform gradient flow, representing the morphology of M in a compact way. Function f can be simplified by canceling its critical points in pairs, thus simplifying the morphological representation of M, given by Morse and Morse-Smale complexes of f. Here, we propose a compact representation for the two Morse complexes in 3D, which is based on encoding the incidence relations of their cells, and on exploiting the duality among the complexes. We define cancellation operations, and their inverse expansion operations, on the Morse complexes and on their dual representation. We propose a multi-scale representation of the Morse complexes which provides a description of such complexes, and thus of the morphology of a 3D scalar field, at different levels of abstraction. This representation allows us also to perform selective refinement operations to extract description of the complexes which varies in different parts of the domain, thus improving efficiency on large data sets, and eliminating the noise in the data through topology simplification.}, keywords = {(mathematics);inverse, 3D, analysis;duality, complexes;topology;data, computing;topology;, critical, expansion, lines;inverse, morphology;mathematics, Morse, operations;morphology;multi-scale, points;duality;integral, problems;mathematical}, doi = {10.1109/ICCSA.2008.10}, author = {Comic,L. and De Floriani, Leila} } @article {18707, title = {Mutations in the Hydrophobic Core of Ubiquitin Differentially Affect Its Recognition by Receptor Proteins}, journal = {Journal of Molecular Biology}, volume = {375}, year = {2008}, month = {2008/01/25/}, pages = {979 - 996}, abstract = {Ubiquitin (Ub) is one of the most highly conserved signaling proteins in eukaryotes. In carrying out its myriad functions, Ub conjugated to substrate proteins interacts with dozens of receptor proteins that link the Ub signal to various biological outcomes. Here we report mutations in conserved residues of Ub{\textquoteright}s hydrophobic core that have surprisingly potent and specific effects on molecular recognition. Mutant Ubs bind tightly to the Ub-associated domain of the receptor proteins Rad23 and hHR23A but fail to bind the Ub-interacting motif present in the receptors Rpn10 and S5a. Moreover, chains assembled on target substrates with mutant Ubs are unable to support substrate degradation by the proteasome in vitro or sustain viability of yeast cells. The mutations have relatively little effect on Ub{\textquoteright}s overall structure but reduce its rigidity and cause a slight displacement of the C-terminal β-sheet, thereby compromising association with Ub-interacting motif but not with Ub-associated domains. These studies emphasize an unexpected role for Ub{\textquoteright}s core in molecular recognition and suggest that the diversity of protein{\textendash}protein interactions in which Ub engages placed enormous constraints on its evolvability.}, keywords = {hydrophobic core mutation, molecular recognition, proteasomal degradation, ubiquitin, ubiquitin receptors}, isbn = {0022-2836}, doi = {10.1016/j.jmb.2007.11.016}, url = {http://www.sciencedirect.com/science/article/pii/S0022283607014763}, author = {Haririnia,Aydin and Verma,Rati and Purohit,Nisha and Twarog,Michael Z. and Deshaies,Raymond J. and Bolon,Dan and Fushman, David} } @conference {17769, title = {MAGIC: A Multi-Activity Graph Index for Activity Detection}, booktitle = {Information Reuse and Integration, 2007. IRI 2007. IEEE International Conference on}, year = {2007}, month = {2007/08//}, pages = {267 - 272}, abstract = {Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O{\textquoteright}), where a epsi A and O{\textquoteright} sube O, that minimally validate the fact that an instance of activity a occurs in O with probability p or more. The novel contribution of this paper is the notion of the multi-activity graph index (MAGIC), which can index very large numbers of observations from interleaved activities and quickly retrieve completed instances of the monitored activities. We introduce two complexity reducing restrictions of the problem (which takes exponential time) and develop algorithms for each. We experimentally evaluate our exponential algorithm as well as the restricted algorithms on both synthetic data and a real (depersonalized) travel data set consisting of 5.5 million observations. Our experiments show that MAGIC consumes reasonable amounts of memory and can retrieve completed instances of activities in just a few seconds. We also report appropriate statistical significance results validating our experimental hypotheses.}, keywords = {complexity;graph, detection;complexity, graph, index;probability, MAGIC;activity, reducing, restrictions;exponential, theory;probability;, threshold;computational, time;multiactivity}, doi = {10.1109/IRI.2007.4296632}, author = {Albanese, M. and Pugliese, A. and V.S. Subrahmanian and Udrea,O.} } @article {16402, title = {Making models match: Replicating an agent-based model}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {10}, year = {2007}, month = {2007///}, pages = {2 - 2}, abstract = {Scientists have increasingly employed computer models in their work. Recent years have seen a proliferation of agent-based models in the natural and social sciences. But with the exception of a few "classic" models, most of these models have never been replicated by anyone but the original developer. As replication is a critical component of the scientific method and a core practice of scientists, we argue herein for an increased practice of replication in the agent-based modeling community, and for widespread discussion of the issues surrounding replication. We begin by clarifying the concept of replication as it applies to ABM. Furthermore we argue that replication may have even greater benefits when applied to computational models than when applied to physical experiments. Replication of computational models affects model verification and validation and fosters shared understanding about modeling decisions. To facilitate replication, we must create standards for both how to replicate models and how to evaluate the replication. In this paper, we present a case study of our own attempt to replicate a classic agent-based model. We begin by describing an agent-based model from political science that was developed by Axelrod and Hammond. We then detail our effort to replicate that model and the challenges that arose in recreating the model and in determining if the replication was successful. We conclude this paper by discussing issues for (1) researchers attempting to replicate models and (2) researchers developing models in order to facilitate the replication of their results.}, author = {Wilensky,U. and Rand, William} } @article {18859, title = {Manufacturing multi-material articulated plastic products using in-mold assembly}, journal = {The International Journal of Advanced Manufacturing Technology}, volume = {32}, year = {2007}, month = {2007///}, pages = {350 - 365}, abstract = {In-mold assembly can be used to create plastic products with articulated joints. This process eliminates the need for post-molding assembly and reduces the number of parts being used in the product, hence improving the product quality. However, designing both products and molds is significantly more challenging in case of in-mold assembly. Currently, a systematic methodology does not exist for developing product and processes to exploit potential benefits of in-mold assembly for creating articulated joints. This paper is a step towards creating such a methodology and reports the following three results. First, it presents a model for designing assemblies and molding process so that the joint clearances and variation in the joint clearances can meet the performance goals. Second, it describes proven mold design templates for realizing revolute, prismatic, and spherical joints. Third, it describes a mold design methodology for designing molds for products that contain articulated joints and will be produced using in-mold assembly process. Three case studies are also presented to illustrate how in-mold assembly process can be used to create articulated devices.}, keywords = {engineering}, isbn = {0268-3768}, doi = {10.1007/s00170-005-0343-z}, url = {http://www.springerlink.com/content/q77nl78827r7w461/abstract/}, author = {Priyadarshi,Alok and Gupta, Satyandra K. and Gouker,Regina and Krebs,Florian and Shroeder,Martin and Warth,Stefan} } @article {18706, title = {Mapping the Interactions between Lys48 and Lys63-Linked Di-ubiquitins and a Ubiquitin-Interacting Motif of S5a}, journal = {Journal of Molecular Biology}, volume = {368}, year = {2007}, month = {2007/05/04/}, pages = {753 - 766}, abstract = {Numerous cellular processes are regulated by (poly)ubiquitin-mediated signaling events, which involve a covalent modification of the substrate protein by a single ubiquitin or a chain of ubiquitin molecules linked via a specific lysine. Remarkably, the outcome of polyubiquitination is linkage-dependent. For example, Lys48-linked chains are the principal signal for proteasomal degradation, while Lys63-linked chains act as nonproteolytic signals. Despite significant progress in characterization of various cellular pathways involving ubiquitin, understanding of the structural details of polyubiquitin chain recognition by downstream cellular effectors is missing. Here we use NMR to study the interaction of a ubiquitin-interacting motif (UIM) of the proteasomal subunit S5a with di-ubiquitin, the simplest model for polyubiquitin chain, to gain insights into the mechanism of polyubiquitin recognition by the proteasome. We have mapped the binding interface and characterized the stoichiometry and the process of UIM binding to Lys48- and Lys63-linked di-ubiquitin chains. Our data provide the first direct evidence that UIM binding involves a conformational transition in Lys48-linked di-ubiquitin, which opens the hydrophobic interdomain interface. This allows UIM to enter the interface and bind directly to the same ubiquitin hydrophobic-patch surface as utilized in UIM:monoubiquitin complexes. The results indicate that up to two UIM molecules can bind di-ubiquitin, and the binding interface between UIM and ubiquitin units in di-ubiquitin is essentially the same for both Lys48- and Lys63-linked chains. Our data suggest possible structural models for the binding of UIM and of full-length S5a to di-ubiquitin.}, keywords = {chemical shift perturbation mapping, polyubiquitin, S5a, ubiquitin, ubiquitin-interacting motif}, isbn = {0022-2836}, doi = {10.1016/j.jmb.2007.02.037}, url = {http://www.sciencedirect.com/science/article/pii/S0022283607002185}, author = {Haririnia,Aydin and D{\textquoteright}Onofrio,Mariapina and Fushman, David} } @conference {12592, title = {Markerless Monocular Tracking of Articulated Human Motion}, booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on}, volume = {1}, year = {2007}, month = {2007/04//}, pages = {I-693 -I-696 - I-693 -I-696}, abstract = {This paper presents a method for tracking general 3D general articulated human motion using a single camera with unknown calibration data. No markers, special clothes, or devices are assumed to be attached to the subject. In addition, both the camera and the subject are allowed to move freely, so that long-term view-independent human motion tracking and recognition are possible. We exploit the fact that the anatomical structure of the human body can be approximated by an articulated blob model. The optical flow under scaled orthographic projection is used to relate the spatial-temporal intensity change of the image sequence to the human motion parameters. These motion parameters are obtained by solving a set of linear equations to achieve global optimization. The correctness and robustness of the proposed method are demonstrated using Tai Chi sequences}, keywords = {analysis;image, blob, camera;spatial-temporal, Chi, equations;markerless, flow;scaled, human, intensity;cameras;gait, model;articulated, monocular, MOTION, motion;global, optimization;human, orthographic, projection;single, recognition;image, sequence;linear, sequences;anatomical, sequences;optimisation;, structure;articulated, Tai, tracking;optical}, doi = {10.1109/ICASSP.2007.366002}, author = {Liu,Haiying and Chellapa, Rama} } @conference {15910, title = {An M-channel directional filter bank compatible with the contourlet and shearlet frequency tiling}, booktitle = {Proceedings of SPIE}, volume = {6701}, year = {2007}, month = {2007///}, pages = {67010C - 67010C}, author = {Easley,G. R and Patel, Vishal M. and Healy Jr,D.M.} } @conference {12256, title = {Measurement and analysis of online social networks}, booktitle = {Proceedings of the 7th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {29 - 42}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity to study the characteristics of online social network graphs at large scale. Understanding these graphs is important, both to improve current systems and to design new applications of online social networks. This paper presents a large-scale measurement study and analysis of the structure of multiple online social networks. We examine data gathered from four popular online social networks: Flickr, YouTube, LiveJournal, and Orkut. We crawled the publicly accessible user links on each site, obtaining a large portion of each social network{\textquoteright}s graph. Our data set contains over 11.3 million users and 328 million links. We believe that this is the first study to examine multiple online social networks at scale. Our results confirm the power-law, small-world, and scale-free properties of online social networks. We observe that the indegree of user nodes tends to match the outdegree; that the networks contain a densely connected core of high-degree nodes; and that this core links small groups of strongly clustered, low-degree nodes at the fringes of the network. Finally, we discuss the implications of these structural properties for the design of social network based systems.}, keywords = {analysis, measurement, social networks}, isbn = {978-1-59593-908-1}, doi = {10.1145/1298306.1298311}, url = {http://doi.acm.org/10.1145/1298306.1298311}, author = {Mislove,Alan and Marcon,Massimiliano and Gummadi,Krishna P. and Druschel,Peter and Bhattacharjee, Bobby} } @conference {18582, title = {Measuring the Contributions of Routing Dynamics to Prolonged End-to-End Internet Path Failures}, booktitle = {Global Telecommunications Conference, 2007. GLOBECOM {\textquoteright}07. IEEE}, year = {2007}, month = {2007/11//}, pages = {1855 - 1859}, abstract = {This paper studies the contributions of routing dynamics to the duration of long-lived end-to-end Internet path failures. Studies have shown that end-to-end Internet failures (periods of prolonged packet loss) are widespread. These failures are typically attributed to either congestion or routing dynamics. Unfortunately, the extent to which congestion and routing dynamics contribute to long-lasting path failures, and the effect of routing dynamics on end-to-end performance, are not well understood. This paper uses a joint analysis of active measurements and routing data to characterize end-to-end failures observed over one month on a topologically diverse Internet testbed. We find that routing dynamics coincide with most prolonged end-to-end failures, suggesting that routing dynamics contribute significantly to the duration of these failures. We also find that most long-lived end-to-end path failures that coincide with routing dynamics are caused by BGP convergence or instability. Our results provide new insights into the effects of routing instability on end-to-end Internet path performance.}, keywords = {diverse Internet topological testbed, Internet, prolonged end-to-end Internet path failure, routing dynamics, telecommunication network reliability, telecommunication network routing, telecommunication network topology}, doi = {10.1109/GLOCOM.2007.357}, author = {Wang,Feng and Feamster, Nick and Gao,Lixin} } @conference {13828, title = {Measuring variability in sentence ordering for news summarization}, booktitle = {Proceedings of the Eleventh European Workshop on Natural Language Generation}, series = {ENLG {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {81 - 88}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {The issue of sentence ordering is an important one for natural language tasks such as multi-document summarization, yet there has not been a quantitative exploration of the range of acceptable sentence orderings for short texts. We present results of a sentence reordering experiment with three experimental conditions. Our findings indicate a very high degree of variability in the orderings that the eighteen subjects produce. In addition, the variability of reorderings is significantly greater when the initial ordering seen by subjects is different from the original summary. We conclude that evaluation of sentence ordering should use multiple reference orderings. Our evaluation presents several metrics that might prove useful in assessing against multiple references. We conclude with a deeper set of questions: (a) what sorts of independent assessments of quality of the different reference orderings could be made and (b) whether a large enough test set would obviate the need for such independent means of quality assessment.}, url = {http://dl.acm.org/citation.cfm?id=1610163.1610177}, author = {Madnani,Nitin and Passonneau,Rebecca and Ayan,Necip Fazil and Conroy,John M. and Dorr, Bonnie J and Klavans,Judith L. and O{\textquoteright}Leary, Dianne P. and Schlesinger,Judith D.} } @article {14586, title = {MetaProm: a neural network based meta-predictor for alternative human promoter prediction}, journal = {BMC Genomics}, volume = {8}, year = {2007}, month = {2007///}, pages = {374 - 374}, abstract = {BACKGROUND:De novo eukaryotic promoter prediction is important for discovering novel genes and understanding gene regulation. In spite of the great advances made in the past decade, recent studies revealed that the overall performances of the current promoter prediction programs (PPPs) are still poor, and predictions made by individual PPPs do not overlap each other. Furthermore, most PPPs are trained and tested on the most-upstream promoters; their performances on alternative promoters have not been assessed.RESULTS:In this paper, we evaluate the performances of current major promoter prediction programs (i.e., PSPA, FirstEF, McPromoter, DragonGSF, DragonPF, and FProm) using 42,536 distinct human gene promoters on a genome-wide scale, and with emphasis on alternative promoters. We describe an artificial neural network (ANN) based meta-predictor program that integrates predictions from the current PPPs and the predicted promoters{\textquoteright} relation to CpG islands. Our specific analysis of recently discovered alternative promoters reveals that although only 41\% of the 3{\textquoteright} most promoters overlap a CpG island, 74\% of 5{\textquoteright} most promoters overlap a CpG island.CONCLUSION:Our assessment of six PPPs on 1.06 x 109 bps of human genome sequence reveals the specific strengths and weaknesses of individual PPPs. Our meta-predictor outperforms any individual PPP in sensitivity and specificity. Furthermore, we discovered that the 5{\textquoteright} alternative promoters are more likely to be associated with a CpG island.}, isbn = {1471-2164}, doi = {10.1186/1471-2164-8-374}, url = {http://www.biomedcentral.com/1471-2164/8/374}, author = {Wang,Junwen and Ungar,Lyle and Tseng,Hung and Hannenhalli, Sridhar} } @article {12596, title = {Method of three-dimensional object reconstruction from a video sequence using a generic model}, volume = {10/644,817}, year = {2007}, month = {2007/02/27/}, abstract = {In a novel method of 3D modeling of an object from a video sequence using an SfM algorithm and a generic object model, the generic model is incorporated after the SfM algorithm generates a 3D estimate of the object model purely and directly from the input video sequence. An optimization framework provides for comparison of the local trends of the 3D estimate and the generic model so that the errors in the 3D estimate are corrected. The 3D estimate is obtained by fusing intermediate 3D reconstructions of pairs of frames of the video sequence after computing the uncertainty of the two frame solutions. The quality of the fusion algorithm is tracked using a rate-distortion function. In order to combine the generic model with the 3D estimate, an energy function minimization procedure is applied to the 3D estimate. The optimization is performed using a Metropolis-Hasting sampling strategy.}, url = {http://www.google.com/patents?id=4At_AAAAEBAJ}, author = {Chellapa, Rama and Chowdhury,Amit K. Roy and Srinivasan,Sridhar}, editor = {University of Maryland} } @article {14088, title = {Microarray analysis of gene expression induced by sexual contact in Schistosoma mansoni}, journal = {BMC Genomics}, volume = {8}, year = {2007}, month = {2007///}, pages = {181 - 181}, abstract = {BACKGROUND:The parasitic trematode Schistosoma mansoni is one of the major causative agents of Schistosomiasis, a disease that affects approximately 200 million people, mostly in developing countries. Since much of the pathology is associated with eggs laid by the female worm, understanding the mechanisms involved in oogenesis and sexual maturation is an important step towards the discovery of new targets for effective drug therapy. It is known that the adult female worm only develops fully in the presence of a male worm and that the rates of oviposition and maturation of eggs are significantly increased by mating. In order to study gene transcripts associated with sexual maturation and oviposition, we compared the gene expression profiles of sexually mature and immature parasites using DNA microarrays.RESULTS:For each experiment, three amplified RNA microarray hybridizations and their dye swaps were analyzed. Our results show that 265 transcripts are differentially expressed in adult females and 53 in adult males when mature and immature worms are compared. Of the genes differentially expressed, 55\% are expressed at higher levels in paired females while the remaining 45\% are more expressed in unpaired ones and 56.6\% are expressed at higher levels in paired male worms while the remaining 43.4\% are more expressed in immature parasites. Real-time RT-PCR analysis validated the microarray results. Several new maturation associated transcripts were identified. Genes that were up-regulated in single-sex females were mostly related to energy generation (i.e. carbohydrate and protein metabolism, generation of precursor metabolites and energy, cellular catabolism, and organelle organization and biogenesis) while genes that were down-regulated related to RNA metabolism, reactive oxygen species metabolism, electron transport, organelle organization and biogenesis and protein biosynthesis.CONCLUSION:Our results confirm previous observations related to gene expression induced by sexual maturation in female schistosome worms. They also increase the list of S. mansoni maturation associated transcripts considerably, therefore opening new and exciting avenues for the study of the conjugal biology and development of new drugs against schistosomes.}, isbn = {1471-2164}, doi = {10.1186/1471-2164-8-181}, url = {http://www.biomedcentral.com/1471-2164/8/181}, author = {Waisberg,Michael and Lobo,Francisco and Cerqueira,Gustavo and Passos,Liana and Carvalho,Omar and Franco,Gloria and El-Sayed, Najib M.} } @conference {13991, title = {Microphone Arrays as Generalized Cameras for Integrated Audio Visual Processing}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 8}, abstract = {Combinations of microphones and cameras allow the joint audio visual sensing of a scene. Such arrangements of sensors are common in biological organisms and in applications such as meeting recording and surveillance where both modalities are necessary to provide scene understanding. Microphone arrays provide geometrical information on the source location, and allow the sound sources in the scene to be separated and the noise suppressed, while cameras allow the scene geometry and the location and motion of people and other objects to be estimated. In most previous work the fusion of the audio-visual information occurs at a relatively late stage. In contrast, we take the viewpoint that both cameras and microphone arrays are geometry sensors, and treat the microphone arrays as generalized cameras. We employ computer-vision inspired algorithms to treat the combined system of arrays and cameras. In particular, we consider the geometry introduced by a general microphone array and spherical microphone arrays. The latter show a geometry that is very close to central projection cameras, and we show how standard vision based calibration algorithms can be profitably applied to them. Experiments are presented that demonstrate the usefulness of the considered approach.}, keywords = {algorithms;generalized, arrays;scene, arrays;sensor, audio, audio-visual, cameras;geometrical, fusion;, fusion;computer-vision, geometry;sound, information, information;geometry, inspired, location;acoustic, processing;array, processing;audio-visual, processing;microphone, sensors;integrated, signal, sources;source, systems;cameras;computer, vision;geometry;microphone, visual}, doi = {10.1109/CVPR.2007.383345}, author = {O{\textquoteright}Donovan,A. and Duraiswami, Ramani and Neumann, J.} } @book {14003, title = {Middleware for programming NVIDIA GPUs from Fortran 9x}, volume = {7}, year = {2007}, month = {2007///}, publisher = {Supercomputing}, organization = {Supercomputing}, author = {Gumerov, Nail A. and Duraiswami, Ramani and Dorland,W.} } @article {16279, title = {Minimus: a fast, lightweight genome assembler}, journal = {BMC Bioinformatics}, volume = {8}, year = {2007}, month = {2007/02/26/}, pages = {64 - 64}, abstract = {Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of the most common uses of assemblers, however, are best served by a simpler type of assembler that requires fewer software components, uses less memory, and is far easier to install and run.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-8-64}, url = {http://www.biomedcentral.com/1471-2105/8/64}, author = {Sommer,Daniel D and Delcher,Arthur L. and Salzberg,Steven L. and Pop, Mihai} } @article {12598, title = {Mixed-state models for nonstationary multiobject activities}, journal = {EURASIP J. Appl. Signal Process.}, volume = {2007}, year = {2007}, month = {2007/01//}, pages = {106 - 106}, abstract = {We present a mixed-state space approach for modeling and segmenting human activities. The discrete-valued component of the mixed state represents higher-level behavior while the continuous state models the dynamics within behavioral segments. A basis of behaviors based on generic properties of motion trajectories is chosen to characterize segments of activities. A Viterbi-based algorithm to detect boundaries between segments is described. The usefulness of the proposed approach for temporal segmentation and anomaly detection is illustrated using the TSA airport tarmac surveillance dataset, the bank monitoring dataset, and the UCF database of human actions.}, isbn = {1110-8657}, doi = {10.1155/2007/65989}, url = {http://dx.doi.org/10.1155/2007/65989}, author = {Cuntoor,Naresh P. and Chellapa, Rama} } @conference {18586, title = {MobCast: Overlay Architecture for Seamless IP Mobility using Scalable Anycast Proxies}, booktitle = {Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE}, year = {2007}, month = {2007/03//}, pages = {3872 - 3876}, abstract = {We propose a routing overlay system, MobCast, for simple and efficient routing to mobile hosts. Mobcast nodes advertise the same address space at each proxy location, and each mobile host is assigned a "universal" IP address from this address space, so packets sent to a mobile host{\textquoteright}s universal IP address automatically go to the nearest proxy on the overlay. The overlay then delivers the packets to the mobile host. Our architecture enables seamless mobility for both micro and macro mobility. While our initial design is not as mature as Mobile IP, it shows great promise to solve the traditional problems of ingress routing, firewalls, NATs, and rapid mobility with much lower complexity. We present our design as a scalable and deployable alternative to mobile IP. In this paper, we focus on describing the MobCast system architecture. We form our arguments for scalability, handoff-speed, and simplicity, and give our initial results for scalability. We postpone a detailed discussion of MobCast{\textquoteright}s security model for future work.}, keywords = {address space, handoff-speed, IP networks, MobCast, mobile hosts, mobile radio, overlay architecture, proxy location, routing overlay system, scalable anycast proxies, seamless IP mobility, telecommunication network routing, universal IP address}, doi = {10.1109/WCNC.2007.708}, author = {Lee,C.P. and Attrey,K. and Caballero,C. and Feamster, Nick and Mihail,M. and Copeland,J.A.} } @conference {13598, title = {Mobile Retriever - Finding Document with a Snapshot}, booktitle = {CBDAR}, year = {2007}, month = {2007/09//}, pages = {29 - 34}, abstract = {In this paper we describe a camera based document image retrieval system which is targeted toward camera phones. Our goal is to enable the device to identify which of a known set of documents it is {\textquotedblleft}looking at{\textquotedblright}. This paper provides two key contributions 1) a local context descriptor that effectively rules out irrelevant documents using only a small patch of the document image and 2) a layout verification approach that boosts the accuracy of retrieval even under severe degradation such as warping or crinkling. We have implemented the mobile retriever client on an iMate Jamin camera phone and tested it with a document database of 12742 pages. Experiments show that our verification approach clearly separates successful retrievals from unsuccessful retrievals.}, author = {Liu,Xu and David Doermann} } @article {18735, title = {Model and algorithms for point cloud construction using digital projection patterns}, journal = {Journal of Computing and Information Science in Engineering}, volume = {7}, year = {2007}, month = {2007///}, pages = {372 - 372}, author = {Peng,T. and Gupta,S.K.} } @article {17974, title = {Modelling and rendering large volume data with gaussian radial basis functions}, volume = {UMIACS-TR-2007-22}, year = {2007}, month = {2007///}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Implicit representations have the potential to represent large volumes succinctly. In this paper we presenta multiresolution and progressive implicit representation of scalar volumetric data using anisotropic Gaussian radial basis functions (RBFs) defined over an octree. Our representation lends itself well to progressive level-of-detail representations. Our RBF encoding algorithm based on a Maximum Like- lihood Estimation (MLE) calculation is non-iterative, scales in a O(nlogn) manner, and operates in a memory-friendly manner on very large datasets by processing small blocks at a time. We also present a GPU-based ray-casting algorithm for direct rendering from implicit volumes. Our GPU-based im- plicit volume rendering algorithm is accelerated by early-ray termination and empty-space skipping for implicit volumes and can render volumes encoded with 16 million RBFs at 1 to 3 frames/second. The octree hierarchy enables the GPU-based ray-casting algorithm to efficiently traverse using location codes and is also suitable for view-dependent level-of-detail-based rendering. }, author = {Juba,D. and Varshney, Amitabh} } @conference {18002, title = {Models for advancing PRAM and other algorithms into parallel programs for a PRAM-On-Chip platform}, booktitle = {IN HANDBOOK OF PARALLEL COMPUTING: MODELS, ALGORITHMS AND APPLICATIONS, EDITORS}, year = {2007}, month = {2007///}, publisher = {CRC Press}, organization = {CRC Press}, abstract = {A bold vision that guided this work is as follows: (i) a parallel algorithms and programming course could become a standard course in every undergraduate computer science program, and (ii) this course could be coupled with a so-called PRAM-On-Chip architecture {\textemdash} a commodity high-end multi-core computer architecture. In fact, the current paper is a tutorial on how to convert PRAM algorithms intoefficient PRAM-On-Chip programs. Coupled with a text on PRAM algorithms as well as an available PRAM-On-Chip tool-chain, comprising a compiler and a simulator, the paper provides the missing link for upgrading a standard theoretical PRAM algorithms class to a parallel algorithms and programming class. Having demonstrated that such a course could cover similar programming projects and material to what is covered by a typical first serial algorithms and programming course, the paper suggests that parallel programming in the emerging multi-core era does not need to be more difficult than serial programming. If true, a powerful answer to the so-called parallel programming open problem is being provided. This open problem is currently the main stumbling block for the industry in getting the upcoming generation of multi-core architectures to improve single task completion time using easy-to-program application programmer interfaces. Known constraints of this open problem, such as backwards compatibility on serial code, are also addressed by the overall approach. More concretely, a widely used methodology for advancing parallel algorithmic thinking into parallel algorithms is revisited, and is extended into a methodology for advancing parallel algorithms to PRAM-On-Chip programs. A performance cost model for the PRAM-On-Chip is also presented. It uses as complexity metrics the length of sequence of round trips to memory (LSRTM) and queuing delay (QD) from memory access queues, in addition to standard PRAM computation costs. Highlighting the importance of LSRTM in determining performance is another contribution of the paper. Finally, some alternatives to PRAM algorithms, which, on one hand, are easier-to-think, but, on the other hand, suppress more architecture details, are also discussed. }, author = {Vishkin, Uzi and Caragea,George C. and Lee,Bryant} } @article {15771, title = {Modified Cholesky Algorithms: A Catalog with New Approaches}, journal = {Mathematical Programming}, year = {2007}, month = {2007///}, url = {doi:10.1007/s10107-007-0177-6doi:10.1007/s10107-007-0177-6}, author = {Fang,Hawren and O{\textquoteright}Leary, Dianne P.} } @article {13831, title = {Multi-candidate reduction: Sentence compression as a tool for document summarization tasks}, journal = {Information Processing \& Management}, volume = {43}, year = {2007}, month = {2007/11//}, pages = {1549 - 1570}, abstract = {This article examines the application of two single-document sentence compression techniques to the problem of multi-document summarization{\textemdash}a {\textquotedblleft}parse-and-trim{\textquotedblright} approach and a statistical noisy-channel approach. We introduce the multi-candidate reduction (MCR) framework for multi-document summarization, in which many compressed candidates are generated for each source sentence. These candidates are then selected for inclusion in the final summary based on a combination of static and dynamic features. Evaluations demonstrate that sentence compression is a valuable component of a larger multi-document summarization framework.}, keywords = {Headline generation, Hidden Markov model, Parse-and-trim, Summarization}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2007.01.016}, url = {http://www.sciencedirect.com/science/article/pii/S0306457307000295}, author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Schwartz,Richard} } @conference {19036, title = {Multi-Dimensional Range Query over Encrypted Data}, year = {2007}, month = {2007}, pages = {350 - 364}, abstract = {We design an encryption scheme called multi-dimensional range query over encrypted data (MRQED), to address the privacy concerns related to the sharing of network audit logs and various other applications. Our scheme allows a network gateway to encrypt summaries of network flows before submitting them to an untrusted repository. When network intrusions are suspected, an authority can release a key to an auditor, allowing the auditor to decrypt flows whose attributes (e.g., source and destination addresses, port numbers, etc.) fall within specific ranges. However, the privacy of all irrelevant flows are still preserved. We formally define the security for MRQED and prove the security of our construction under the decision bilinear Diffie-Hellman and decision linear assumptions in certain bilinear groups. We study the practical performance of our construction in the context of network audit logs. Apart from network audit logs, our scheme also has interesting applications for financial audit logs, medical privacy, untrusted remote storage, etc. In particular, we show that MRQED implies a solution to its dual problem, which enables investors to trade stocks through a broker in a privacy-preserving manner.}, keywords = {auditing, cryptography, data privacy, decision bilinear Diffie-Hellman, decision linear assumptions, encrypted data, multi-dimensional range query, network audit logs, network gateway, network intrusions}, author = {Elaine Shi and Bethencourt, J. and Chan, T.-H.H. and Song, Dawn and Perrig, A.} } @conference {13145, title = {Multimodal Tracking for Smart Videoconferencing and Video Surveillance}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 2}, abstract = {Many applications require the ability to track the 3-D motion of the subjects. We build a particle filter based framework for multimodal tracking using multiple cameras and multiple microphone arrays. In order to calibrate the resulting system, we propose a method to determine the locations of all microphones using at least five loudspeakers and under assumption that for each loudspeaker there exists a microphone very close to it. We derive the maximum likelihood (ML) estimator, which reduces to the solution of the non-linear least squares problem. We verify the correctness and robustness of the multimodal tracker and of the self-calibration algorithm both with Monte-Carlo simulations and on real data from three experimental setups.}, keywords = {(numerical, 3D, algorithm;smart, analysis;least, approximations;particle, arrays;nonlinear, cameras;multiple, Carlo, estimator;multimodal, filter;self-calibration, Filtering, least, likelihood, methods);teleconferencing;video, methods;image, microphone, MOTION, motion;Monte-Carlo, problem;particle, processing;video, signal, simulations;maximum, squares, surveillance;, surveillance;Monte, tracking;multiple, videoconferencing;video}, doi = {10.1109/CVPR.2007.383525}, author = {Zotkin,Dmitry N and Raykar,V.C. and Duraiswami, Ramani and Davis, Larry S.} } @article {13834, title = {Multiple alternative sentence compressions for automatic text summarization}, journal = {Proceedings of DUC}, year = {2007}, month = {2007///}, abstract = {We perform multi-document summariza-tion by generating compressed versions of source sentences as summary candi- dates and using weighted features of these candidates to construct summaries. We combine a parse-and-trim approach with a novel technique for producing multiple alternative compressions for source sen- tences. In addition, we use a novel method for tuning the feature weights that maxi- mizes the change in the ROUGE-2 score (∆ROUGE) between the already existing summary state and the new state that re- sults from the addition of the candidate under consideration. We also describe ex- periments using a new paraphrase-based feature for redundancy checking. Finally, we present the results of our DUC2007 submissions and some ideas for future work. }, author = {Madnani,N. and Zajic, David and Dorr, Bonnie J and Ayan,N.F. and Jimmy Lin} } @conference {11985, title = {Multiple View Image Reconstruction: A Harmonic Approach}, booktitle = {IEEE Conference on Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07}, year = {2007}, month = {2007/06/17/22}, pages = {1 - 8}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents a new constraint connecting the signals in multiple views of a surface. The constraint arises from a harmonic analysis of the geometry of the imaging process and it gives rise to a new technique for multiple view image reconstruction. Given several views of a surface from different positions, fundamentally different information is present in each image, owing to the fact that cameras measure the incoming light only after the application of a low-pass filter. Our analysis shows how the geometry of the imaging is connected to this filtering. This leads to a technique for constructing a single output image containing all the information present in the input images.}, keywords = {CAMERAS, filtering theory, Geometry, Harmonic analysis, Image reconstruction, imaging process geometry, Information filtering, Joining processes, Low pass filters, low-pass filter, low-pass filters, multiple view image reconstruction, Position measurement, Power harmonic filters, surface reconstruction}, isbn = {1-4244-1180-7}, doi = {10.1109/CVPR.2007.383285}, author = {Domke, J. and Aloimonos, J.} } @article {12571, title = {A Multiple-Hypothesis Approach for Multiobject Visual Tracking}, journal = {Image Processing, IEEE Transactions on}, volume = {16}, year = {2007}, month = {2007/11//}, pages = {2849 - 2854}, abstract = {In multiple-object tracking applications, it is essential to address the problem of associating targets and observation data. For visual tracking of multiple targets which involves objects that split and merge, a target may be associated with multiple measurements and many targets may be associated with a single measurement. The space of such data association is exponential in the number of targets and exhaustive enumeration is impractical. We pose the association problem as a bipartite graph edge covering problem given the targets and the object detection information. We propose an efficient method of maintaining multiple association hypotheses with the highest probabilities over all possible histories of associations. Our approach handles objects entering and exiting the field of view, merging and splitting objects, as well as objects that are detected as fragmented parts. Experimental results are given for tracking multiple players in a soccer game and for tracking people with complex interaction in a surveillance setting. It is shown through quantitative evaluation that our method tracks through varying degrees of interactions among the targets with high success rate.}, keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, bipartite graph edge covering problem;data association;multiobject visual tracking;multiple measurements;multiple-hypothesis approach;multiple-object tracking;object detection;graph theory;object detection;probability;target tracking;Algorithms;Artificial, Computer-Assisted;Motion;Numerical Analysis, Computer-Assisted;Pattern Recognition, Computer-Assisted;Subtraction Technique;}, isbn = {1057-7149}, doi = {10.1109/TIP.2007.906254}, author = {Joo,Seong-Wook and Chellapa, Rama} } @conference {18588, title = {Multiplexing BGP sessions with BGP-Mux}, booktitle = {Proceedings of the 2007 ACM CoNEXT conference}, series = {CoNEXT {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {44:1{\textendash}44:2 - 44:1{\textendash}44:2}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a BGP-session multiplexer called BGP-Mux, which provides stable, on-demand access to global BGP route feeds. This gateway allows arbitrary and even transient client BGP connections to be provisioned and torn down on demand without affecting globally visible BGP sessions. BGP-Mux provides two capabilities: (1) the ability for a client network to receive multiple unfiltered routes per destination from a set of upstream ASes; and (2) the ability to provision BGP sessions without introducing global instability. Several applications could benefit from these features:}, isbn = {978-1-59593-770-4}, doi = {10.1145/1364654.1364707}, url = {http://doi.acm.org/10.1145/1364654.1364707}, author = {Valancius,Vytautas and Feamster, Nick} } @conference {13309, title = {Multi-resolution Morse-Smale Complexes for Terrain Modeling}, booktitle = {Image Analysis and Processing, 2007. ICIAP 2007. 14th International Conference on}, year = {2007}, month = {2007/09//}, pages = {337 - 342}, abstract = {We propose a hierarchical representation for the morphology of a terrain. The basis of our morphological model is a decomposition of the terrain model, composed of the stable and unstable manifolds defined by its critical points, called a Morse-Smale complex. We propose a compact dual representation of the Morse-Smale complex and we define new simplification operators of the terrain morphology, which act on such representation. Based on these operators, we define a hierarchical morphology-based representation for a terrain, that we call a Multi-resolution Morse-Smale Complex (MMSC). Results from our implementation of the MMSC are shown.}, keywords = {complex;terrain, hierarchical, mapping;, modeling;terrain, modelling;terrain, morphology-based, morphology;image, morphology;solid, Morse-Smale, representation;image, representation;multiresolution, resolution;mathematical}, doi = {10.1109/ICIAP.2007.4362801}, author = {Danovaro,E. and De Floriani, Leila and Vitali,M.} } @article {13316, title = {Multiresolution Terrain Processing and Visualization with VARIANT}, journal = {Department of Computer and Information Sciences, University of Genova, Via Dodecaneso}, volume = {35}, year = {2007}, month = {2007///}, pages = {16146 - 16146}, abstract = {We present VARIANT (VAriable Resolution Interactive ANalysis of Terrain), a system forprocessing and visualizing terrains represented through Triangulated Irregular Networks (TINs) at multiple resolutions. Multiresolution refers to the possibility of dynamically varying the density of the TIN, and is used to enhance speed of computation while guaranteeing the accuracy needed by operations. VARIANT directly supports basic queries as well as some high-level operations, and it can be enriched with many other functionalities. It is built on the Multi- Triangulation (MT) Library, an extensible library for multiresolution geometric modeling. }, author = {De Floriani, Leila and Magillo,P.} } @conference {13312, title = {Multi-scale dual morse complexes for representing terrain morphology}, booktitle = {Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {29:1{\textendash}29:8 - 29:1{\textendash}29:8}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We propose a new multi-scale terrain model, based on a hierarchical representation for the morphology of a terrain. The basis of our morphological model is a dual Morse decomposition of the terrain, composed by the stable and unstable manifolds defined by its critical points and its integral lines. We propose a two-level representation of the dual Morse decomposition and we define new simplification operators for the Morse decomposition which act on such representation. Based on these operators, we define a hierarchical morphology-based representation, that we call a Multi-scale Morse Complex (MMC). Results from our implementation of the MMC are presented.}, keywords = {Morphology, multi-scale representations, terrain modeling}, isbn = {978-1-59593-914-2}, doi = {10.1145/1341012.1341050}, url = {http://doi.acm.org/10.1145/1341012.1341050}, author = {Danovaro,Emanuele and De Floriani, Leila and Vitali,Maria and Magillo,Paola} } @inbook {13606, title = {Multi-scale Structural Saliency for Signature Detection}, booktitle = {IEEEConference on Computer Vision and Pattern Recognition (CVPR 2007)IEEEConference on Computer Vision and Pattern Recognition (CVPR 2007)}, year = {2007}, month = {2007///}, pages = {1 - 8}, publisher = {Minneapolis, MN}, organization = {Minneapolis, MN}, abstract = {Detecting and segmenting free-form objects from cluttered backgrounds is a challenging problem in computer vision. Signature detection in document images is one classic example and as of yet no reasonable solutions have been presented. In this paper, we propose a novel multi-scale approach to jointly detecting and segmenting signatures from documents with diverse layouts and complex backgrounds. Rather than focusing on local features that typically have large variations, our approach aims to capture the structural saliency of a signature by searching over multiple scales. This detection framework is general and computationally tractable. We present a saliency measure based on a signature production model that effectively quantifies the dynamic curvature of 2-D contour fragments. Our evaluation using large real world collections of handwritten and machine printed documents demonstrates the effectiveness of this joint detection and segmentation approach.}, author = {Zhu,Guangyu and Yefeng Zheng and David Doermann and Jaeger,Stefan} } @conference {13157, title = {Multi-scale video cropping}, booktitle = {Proceedings of the 15th international conference on Multimedia}, series = {MULTIMEDIA {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {97 - 106}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We consider the problem of cropping surveillance videos. This process chooses a trajectory that a small sub-window can take through the video, selecting the most important parts of the video for display on a smaller monitor. We model the information content of the video simply, by whether the image changes at each pixel. Then we show that we can find the globally optimal trajectory for a cropping window by using a shortest path algorithm. In practice, we can speed up this process without affecting the results, by stitching together trajectories computed over short intervals. This also reduces system latency. We then show that we can use a second shortest path formulation to find good cuts from one trajectory to another, improving coverage of interesting events in the video. We describe additional techniques to improve the quality and efficiency of the algorithm, and show results on surveillance videos.}, keywords = {shortest path algorithm, Surveillance, video cropping}, isbn = {978-1-59593-702-5}, doi = {10.1145/1291233.1291255}, url = {http://doi.acm.org/10.1145/1291233.1291255}, author = {El-Alfy,Hazem and Jacobs, David W. and Davis, Larry S.} } @article {14711, title = {Mutatis Mutandis: Safe and predictable dynamic software updating}, journal = {ACM Trans. Program. Lang. Syst.}, volume = {29}, year = {2007}, month = {2007/08//}, abstract = {This article presents Proteus, a core calculus that models dynamic software updating, a service for fixing bugs and adding features to a running program. Proteus permits a program{\textquoteright}s type structure to change dynamically but guarantees the updated program remains type-correct by ensuring a property we call con-freeness. We show how con-freeness can be enforced dynamically, and how it can be approximated via a novel static analysis. This analysis can be used to assess the implications of a program{\textquoteright}s structure on future updates in order to make update success more predictable. We have implemented Proteus for C, and briefly discuss our implementation which we have tested on several well-known programs.}, keywords = {capability, dynamic software updating, proteus, Type inference, updateability analysis}, isbn = {0164-0925}, doi = {10.1145/1255450.1255455}, url = {http://doi.acm.org/10.1145/1255450.1255455}, author = {Stoyle,Gareth and Hicks, Michael W. and Bierman,Gavin and Sewell,Peter and Neamtiu,Iulian} } @conference {14338, title = {MyExperience: a system for in situ tracing and capturing of user feedback on mobile phones}, booktitle = {Proceedings of the 5th international conference on Mobile systems, applications and services}, series = {MobiSys {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {57 - 70}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper presents MyExperience, a system for capturing both objective and subjective in situ data on mobile computing activities. MyExperience combines the following two techniques: 1) passive logging of device usage, user context, and environmental sensor readings, and 2) active context-triggered user experience sampling to collect in situ, subjective user feedback. MyExperience currently runs on mobile phones and supports logging of more than 140 event types, including: 1) device usage such as communication, application usage, and media capture, 2) user context such as calendar appointments, and 3) environmental sensing such as Bluetooth and GPS. In addition, user experience sampling can be targeted to moments of interest by triggering off sensor readings. We present several case studies of field deployments on people{\textquoteright}s personal phones to demonstrate how MyExperience can be used effectively to understand how people use and experience mobile technology.}, keywords = {context-aware systems, experience sampling method (ESM), field studies, in situ evaluation, Mobile computing, SmartPhones, toolkit, usage logging, user surveys, user-centered design}, isbn = {978-1-59593-614-1}, doi = {10.1145/1247660.1247670}, url = {http://doi.acm.org/10.1145/1247660.1247670}, author = {Jon Froehlich and Chen,Mike Y. and Consolvo,Sunny and Harrison,Beverly and Landay,James A.} } @article {16409, title = {Machine Learning Meets Agent-Based Modeling: When not to go to A Bar}, journal = {Proceedings of Agent Based Simulation}, year = {2006}, month = {2006///}, abstract = {One of the promises of ABM is the ability to have adaptive agents make decisions inchanging environments. Though great work has been done using adaptive agents in ABM, more research into the theoretical understanding of these systems would be useful. Adaptive agents have already been studied within machine learning (ML){\textemdash}an area of artificial intelligence specifically concerned with adaptation and building internal models. The first part of this paper presents a framework for understanding ML as a component of ABM, and describes how different ML techniques can be incorporated into some ABMs. At the high level this framework consists of two cycles that involve evaluating input, making decisions and then generating output. Within this generalized framework, the ML algorithm is using the ABM as an environment and a reward generator, while the ABM is using the ML algorithm to refine the internal models of the agents. There are many details that must be answered before any ML technique can be incorporated into an ABM. In this paper I start to explore some guidelines for how to more closely integrate ABM and ML and will discuss complications that arise when combining ABM and ML techniques. To illustrate some of these issues, I will describe an integration of a ML technique within the El Farol Bar Problem. I will conclude with some discussion of this integration and a look toward future research. }, author = {Rand, William} } @inbook {13825, title = {Machine Translation: Interlingual Methods}, booktitle = {Encyclopedia of Language \& Linguistics (Second Edition)Encyclopedia of Language \& Linguistics (Second Edition)}, year = {2006}, month = {2006///}, pages = {383 - 394}, publisher = {Elsevier}, organization = {Elsevier}, address = {Oxford}, abstract = {An interlingua is a notation for representing the content of a text that abstracts away from the characteristics of the language itself and focuses on the meaning (semantics) alone. Interlinguas are typically used as pivot representations in machine translation, allowing the contents of a source text to be generated in many different target languages. Because of the complexities involved, few interlinguas are more than demonstration prototypes, and only one has been used in a commercial MT system. In this article, we define the components of an interlingua and the principal issues faced by designers and builders of interlinguas and interlingua MT systems, illustrating with examples from operational systems and research prototypes. We discuss current efforts to annotate texts with interlingua-based information.}, keywords = {approximate interlingua, compositionality, conceptual knowledge, cross-language divergences, interlingua, interlingual speech translation, language-independent representation, lexical-conceptual structure, Machine translation, ontology, predicate-argument structure, semantic annotation, semantic frames, semantic zones, text-meaning representations, THEMATIC ROLES}, isbn = {978-0-08-044854-1}, url = {http://www.sciencedirect.com/science/article/pii/B0080448542009391}, author = {Dorr, Bonnie J and Hovy,E. and Levin,L.}, editor = {Editor-in-Chief:~~ Keith Brown} } @article {18856, title = {Machining feature-based similarity assessment algorithms for prismatic machined parts}, journal = {Computer-Aided Design}, volume = {38}, year = {2006}, month = {2006/09//}, pages = {954 - 972}, abstract = {This paper presents algorithms for identifying machined parts in a database that are similar to a given query part based on machining features. In this paper we only consider parts that are machined on 3-axis machining centers. We utilize reduced feature vectors consisting of machining feature access directions, feature types, feature volumes, feature dimensional tolerances and feature group cardinality as a basis for assessing shape similarity. We have defined a distance function between two sets of reduced feature vectors to assess the similarity between them from the machining effort point of view. To assess the similarity between the two parts, one set of reduced feature vectors is transformed in space using rigid body transformations with respect to the other set such that the distance between them is minimized. The distance between the two sets of aligned reduced feature vectors is used as a measure of similarity between the two parts. The existing machined parts are rank ordered based on the value of the distance with respect to the query part. The cost of previously machined parts that have a very small distance from the query part can be used as a basis for estimating the cost of machining the new part.}, keywords = {Feature vector alignment, Machining features, Similarity assessment}, isbn = {0010-4485}, doi = {10.1016/j.cad.2006.08.001}, url = {http://www.sciencedirect.com/science/article/pii/S0010448506001369}, author = {Cardone, Antonio and Gupta, Satyandra K. and Deshmukh,Abhijit and Karnik,Mukul} } @conference {18889, title = {Maintaining cooperation in noisy environments}, volume = {21}, year = {2006}, month = {2006///}, pages = {1561 - 1561}, abstract = {To prevent or alleviate conflicts in multi-agent environ- ments, it is important to distinguish between situations where another agent has misbehaved intentionally and situations where the misbehavior was accidental. One situation where this problem arises is the Noisy Iterated Prisoner{\textquoteright}s Dilemma, a version of the Iterated Prisoner{\textquoteright}s Dilemma (IPD) in which there is a nonzero probability that a {\textquotedblleft}cooperate{\textquotedblright} action will accidentally be changed into a {\textquotedblleft}defect{\textquotedblright} action and vice versa. Tit-For-Tat and other strategies that do quite well in the ordi- nary (non-noisy) IPD can do quite badly in the Noisy IPD.This paper presents a technique called symbolic noise detec- tion, for detecting whether anomalies in player{\textquoteright}s behavior are deliberate or accidental. This idea to use player{\textquoteright}s determin- istic behavior to tell whether an action has been affected by noise. We also present DBS, an algorithm that uses symbolic noise detection in the Noisy IPD. DBS constructs a model of the other agent{\textquoteright}s deterministic behavior, and watches for any deviation from this model. If the other agent{\textquoteright}s next ac- tion is inconsistent with this model, the inconsistency can be due either to noise or to a genuine change in their behavior; and DBS can often distinguish between two cases by waiting to see whether this inconsistency persists in next few moves. This technique is effective because many IPD players often have clear deterministic patterns of behavior. We entered several different implementations of DBS in the 2005 Iterated Prisoner{\textquoteright}s Dilemma competition, in Category 2 (noisy environments). Out of the 165 contestants in this cate- gory, most of DBS implementations ranked among top ten. The best one ranked third, and it was beaten only by two {\textquotedblleft}master-and-slaves strategy{\textquotedblright} programs that each had a large number of {\textquotedblleft}slave{\textquotedblright} programs feeding points to them. }, url = {https://www.aaai.org/Papers/AAAI/2006/AAAI06-250.pdf}, author = {Au,T. C and Nau, Dana S.} } @article {16864, title = {Maintenance of K-nn and spatial join queries on continuously moving points}, journal = {ACM Trans. Database Syst.}, volume = {31}, year = {2006}, month = {2006/06//}, pages = {485 - 536}, abstract = {Cars, aircraft, mobile cell phones, ships, tanks, and mobile robots all have the common property that they are moving objects. A kinematic representation can be used to describe the location of these objects as a function of time. For example, a moving point can be represented by the function p(t) = \&OV0489;0 + (t - t0)\&OV0505;, where \&OV0489;0 is the start location, t0 is the start time, and \&OV0505; is its velocity vector. Instead of storing the location of the object at a given time in a database, the coefficients of the function are stored. When an object{\textquoteright}s behavior changes enough so that the function describing its location is no longer accurate, the function coefficients for the object are updated. Because the location of each object is represented as a function of time, spatial query results can change even when no transactions update the database. We present efficient algorithms to maintain k-nearest neighbor, and spatial join queries in this domain as time advances and updates occur. We assume no previous knowledge of what the updates will be before they occur. We experimentally compare these new algorithms with more straight forward adaptations of previous work to support updates. Experiments are conducted using synthetic uniformly distributed data, and real aircraft flight data. The primary metric of comparison is the number of I/O disk accesses needed to maintain the query results and the supporting data structures.}, keywords = {k-nearest neighbor, continuously moving objects, materialized view maintenance, Moving object databases, Spatial join, temporal databases}, isbn = {0362-5915}, doi = {10.1145/1138394.1138396}, url = {http://doi.acm.org/10.1145/1138394.1138396}, author = {Iwerks,Glenn S. and Samet, Hanan and Smith,Kenneth P.} } @conference {17285, title = {Making a difference: integrating socially relevant projects into HCI teaching}, booktitle = {CHI {\textquoteright}06 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {41 - 44}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Enriching courses on human-computer interaction with socially-relevant projects provides a compelling opportunity for students to improve their education and make socially beneficial contributions. By having clearly defined user communities outside the classroom, students have the chance to practice their interview, observation, and usability testing skills, while developing projects that continue beyond the semester. These projects often give students life-changing exposure to genuine needs and impressive results to include in their portfolio when seeking employment. Educators will present their strategies for arranging, supervising, and grading these projects. Students will describe their experience and how it influenced them.}, keywords = {education, making a difference, relevance, service learning, social impact, team projects}, isbn = {1-59593-298-4}, doi = {10.1145/1125451.1125463}, url = {http://doi.acm.org/10.1145/1125451.1125463}, author = {Shneiderman, Ben and Bishop,Ann and Friedman,Batya and Lazar,Jonathan and Marsden,Gary and Nass,Cliff} } @article {14583, title = {A mammalian promoter model links cis elements to genetic networks}, journal = {Biochemical and Biophysical Research Communications}, volume = {347}, year = {2006}, month = {2006/08/18/}, pages = {166 - 177}, abstract = {An accurate identification of gene promoters remains an important challenge. Computational approaches for this problem rely on promoter sequence attributes that are believed to be critical for transcription initiation. Here we report a probabilistic model that captures two important properties of promoters, not used by previous methods, viz., the location preference and co-occurrence of promoter elements. Additionally, we found that many of the position-specific DNA elements are strongly linked with the function of the gene product. For instance, a highly conserved motif CCTTT at -1 position is strongly associated with protein synthesis, cellular and tissue development. Our comparative analysis of promoter classes reveals that the promoters devoid of CpG islands are more conserved and have fewer alternative transcription start sites. The discovered links between promoter elements and gene function allows us to infer genetic networks from promoter elements. The web server for the PSPA promoter predictor is available at http://cagr.pcbi.upenn.edu/PSPA.}, keywords = {conservation, Core promoter prediction, CpG island, Genetic networks, Position-specific motif, Propensity, Transcription factor binding site (TFBS)}, isbn = {0006-291X}, doi = {16/j.bbrc.2006.06.062}, url = {http://www.sciencedirect.com/science/article/pii/S0006291X06013635}, author = {Wang,Junwen and Hannenhalli, Sridhar} } @conference {14706, title = {Managing policy updates in security-typed languages}, booktitle = {19th IEEE Computer Security Foundations Workshop, 2006}, year = {2006}, month = {2006///}, pages = {13 pp.-216 - 13 pp.-216}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents Rx, a new security-typed programming language with features intended to make the management of information-flow policies more practical. Security labels in Rx, in contrast to prior approaches, are defined in terms of owned roles, as found in the RT role-based trust-management framework. Role-based security policies allow flexible delegation, and our language Rx provides constructs through which programs can robustly update policies and react to policy updates dynamically. Our dynamic semantics use statically verified transactions to eliminate illegal information flows across updates, which we call transitive flows. Because policy updates can be observed through dynamic queries, policy updates can potentially reveal sensitive information. As such, Rx considers policy statements themselves to be potentially confidential information and subject to information-flow metapolicies}, keywords = {Access control, Computer languages, Data security, Database systems, dynamic queries, dynamic semantics, Educational institutions, high level languages, Information security, information-flow policy management, Lattices, Network servers, Operating systems, policy update management, Robustness, role-based security policies, RT role-based trust-management framework, Rx security-typed programming language, security of data, statically verified transactions, transitive flows}, isbn = {0-7695-2615-2}, doi = {10.1109/CSFW.2006.17}, author = {Swamy,N. and Hicks, Michael W. and Tse,S. and Zdancewic,S.} } @article {18860, title = {Manufacturing of multi-material compliant mechanisms using multi-material molding}, journal = {The International Journal of Advanced Manufacturing Technology}, volume = {30}, year = {2006}, month = {2006///}, pages = {1049 - 1075}, abstract = {Multi-material compliant mechanisms enable many new design possibilities. Significant progress has been made in the area of design and analysis of multi-material compliant mechanisms. What is now needed is a method to mass-produce such mechanisms economically. A feasible and practical way of producing such mechanisms is through multi-material molding. Devices based on compliant mechanisms usually consist of compliant joints. Compliant joints in turn are created by carefully engineering interfaces between a compliant and a rigid material. This paper presents an overview of multi-material molding technology and describes feasible mold designs for creating different types of compliant joints found in multi-material compliant mechanisms. It also describes guidelines essential to successfully utilizing the multi-material molding process for creating compliant mechanisms. Finally, practical applications for the use of multi-material molding to create compliant mechanisms are demonstrated.}, keywords = {engineering}, isbn = {0268-3768}, doi = {10.1007/s00170-005-0152-4}, url = {http://www.springerlink.com/content/djk6wq2213447pqn/abstract/}, author = {Gouker,Regina and Gupta, Satyandra K. and Bruck,Hugh and Holzschuh,Tobias} } @conference {12391, title = {Mapping Multimedia Applications Onto Configurable Hardware With Parameterized Cyclo-Static Dataflow Graphs}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {3}, year = {2006}, month = {2006/05//}, pages = {III - III}, abstract = {This paper develops methods for model-based design and implementation of image processing applications. We apply our previously developed meta-modeling technique of homogeneous parameterized dataflow (HPDF) (M. Sen et al., 2005) to the framework of cyclostatic dataflow (CSDF) (G. Bilsen et al., 1996), and demonstrate this integrated modeling methodology through hardware mapping of a gesture recognition application. We also provide a comparative study between HPDF/CSDF-based representation of the gesture recognition application, and a previously developed version based on applying HPDF in conjunction with conventional synchronous dataflow (SDF) semantics (M. Sen et al., 2005)}, keywords = {configurable hardware, Data communication, Gesture recognition, gesture recognition application, graph theory, hardware mapping, image processing applications, mapping multimedia applications, meta-modeling technique, model-based design, Multimedia communication, parameterized cyclo-static dataflow graphs}, doi = {10.1109/ICASSP.2006.1660838}, author = {Haim,F. and Sen,M. and Ko,Dong-Ik and Bhattacharyya, Shuvra S. and Wolf,W.} } @article {12266, title = {Matching Jobs to Resources in Distributed Desktop Grid Environments}, journal = {Technical Reports from UMIACS, UMIACS-TR-2006-15}, year = {2006}, month = {2006/04//}, abstract = {Desktop grids use opportunistic sharing to exploit large collectionsof personal computers and workstations across the Internet and can achieve tremendous computing power with low cost. However, current systems are typically based on a traditional client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. The key idea behind our proposed system is to leverage information provided by an underlying peer-to-peer system to create a hierarchical Rendezvous Node Tree, which performs the matching efficiently. Our experimental results obtained via simulation show that we can effectively match jobs with varying levels of resource constraints to available nodes and maintain good load balance in a fully decentralized heterogeneous computational environment. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3669}, author = {Kim,Jik-Soo and Bhattacharjee, Bobby and Keleher, Peter J. and Sussman, Alan} } @article {15365, title = {MATHEMATICAL MODELS OF HYSTERESIS (DYNAMIC PROBLEMS IN HYSTERESIS)}, year = {2006}, month = {2006/08/21/}, institution = {University of Maryland College Park}, abstract = {This research has further advanced the current state of the art in the areas of dynamic aspects of hysteresis and nonlinear large scale magnetization dynamics. The results of this research will find important engineering applications in the areas of magnetic data storage technology and the emerging technology of {\textquotedblleft}spintronics{\textquotedblright}. Our research efforts have been focused on the following tasks: {\textbullet} Study of fast (pulse) precessional switching of magnetization in magnetic materials. {\textbullet} Analysis of critical fields and critical angles for precessional switching of magnetization. {\textbullet} Development of inverse problem approach to the design of magnetic field pulses for precessional switching of magnetization. {\textbullet} Study of magnetization dynamics induced by spin polarized current injection. {\textbullet} Construction of complete stability diagrams for spin polarized current induced magnetization dynamics. {\textbullet} Development of the averaging technique for the analysis of the slow time scale magnetization dynamics. {\textbullet} Study of thermal effects on magnetization dynamics by using the theory of stochastic processes on graphs.}, author = {Mayergoyz, Issak D} } @conference {13382, title = {MauveDB: supporting model-based user views in database systems}, booktitle = {Proceedings of the 2006 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {73 - 84}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Real-world data --- especially when generated by distributed measurement infrastructures such as sensor networks --- tends to be incomplete, imprecise, and erroneous, making it impossible to present it to users or feed it directly into applications. The traditional approach to dealing with this problem is to first process the data using statistical or probabilistic models that can provide more robust interpretations of the data. Current database systems, however, do not provide adequate support for applying models to such data, especially when those models need to be frequently updated as new data arrives in the system. Hence, most scientists and engineers who depend on models for managing their data do not use database systems for archival or querying at all; at best, databases serve as a persistent raw data store.In this paper we define a new abstraction called model-based views and present the architecture of MauveDB, the system we are building to support such views. Just as traditional database views provide logical data independence, model-based views provide independence from the details of the underlying data generating mechanism and hide the irregularities of the data by using models to present a consistent view to the users. MauveDB supports a declarative language for defining model-based views, allows declarative querying over such views using SQL, and supports several different materialization strategies and techniques to efficiently maintain them in the face of frequent updates. We have implemented a prototype system that currently supports views based on regression and interpolation, using the Apache Derby open source DBMS, and we present results that show the utility and performance benefits that can be obtained by supporting several different types of model-based views in a database system.}, keywords = {Query processing, regression, sensor networks, statistical models, uncertain data, views}, isbn = {1-59593-434-0}, doi = {10.1145/1142473.1142483}, url = {http://doi.acm.org/10.1145/1142473.1142483}, author = {Deshpande, Amol and Madden,Samuel} } @conference {13706, title = {A maximum entropy approach to combining word alignments}, booktitle = {Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics}, series = {HLT-NAACL {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {96 - 103}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper presents a new approach to combining outputs of existing word alignment systems. Each alignment link is represented with a set of feature functions extracted from linguistic features and input alignments. These features are used as the basis of alignment decisions made by a maximum entropy approach. The learning method has been evaluated on three language pairs, yielding significant improvements over input alignments and three heuristic combination methods. The impact of word alignment on MT quality is investigated, using a phrase-based MT system.}, doi = {10.3115/1220835.1220848}, url = {http://dx.doi.org/10.3115/1220835.1220848}, author = {Ayan,Necip Fazil and Dorr, Bonnie J} } @article {19662, title = {MCMC Data Association and Sparse Factorization Updating for Real Time Multitarget Tracking with Merged and Multiple Measurements}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {28}, year = {2006}, month = {2006/12//}, pages = {1960 - 1972}, abstract = {In several multitarget tracking applications, a target may return more than one measurement per target and interacting targets may return multiple merged measurements between targets. Existing algorithms for tracking and data association, initially applied to radar tracking, do not adequately address these types of measurements. Here, we introduce a probabilistic model for interacting targets that addresses both types of measurements simultaneously. We provide an algorithm for approximate inference in this model using a Markov chain Monte Carlo (MCMC)-based auxiliary variable particle filter. We Rao-Blackwellize the Markov chain to eliminate sampling over the continuous state space of the targets. A major contribution of this work is the use of sparse least squares updating and downdating techniques, which significantly reduce the computational cost per iteration of the Markov chain. Also, when combined with a simple heuristic, they enable the algorithm to correctly focus computation on interacting targets. We include experimental results on a challenging simulation sequence. We test the accuracy of the algorithm using two sensor modalities, video, and laser range data. We also show the algorithm exhibits real time performance on a conventional PC}, keywords = {algorithms, approximate inference, Artificial intelligence, auxiliary variable particle filter, Computational efficiency, continuous state space, downdating, Image Enhancement, Image Interpretation, Computer-Assisted, Inference algorithms, Information Storage and Retrieval, laser range scanner, laser range scanner., Least squares approximation, least squares approximations, Least squares methods, linear least squares, Markov chain Monte Carlo, Markov processes, MCMC data association, merged measurements, Monte Carlo methods, Movement, multiple merged measurements, multitarget tracking, particle filter, particle filtering (numerical methods), Particle filters, Pattern Recognition, Automated, probabilistic model, QR factorization, Radar tracking, Rao-Blackwellized, real time multitarget tracking, Reproducibility of results, Sampling methods, Sensitivity and Specificity, sensor fusion, sparse factorization updating, sparse least squares, State-space methods, Subtraction Technique, target tracking, updating}, isbn = {0162-8828}, author = {Zia Khan and Balch, T. and Dellaert, F.} } @article {12274, title = {Measurement-based optimal routing on overlay architectures for unicast sessions}, journal = {Computer Networks}, volume = {50}, year = {2006}, month = {2006///}, pages = {1938 - 1951}, abstract = {We propose a measurement-based routing algorithm to load-balance intradomain traffic along multiple paths for multi-ple unicast sources. Multiple paths are established using overlay nodes. The distributed algorithm is derived from simul- taneous perturbation stochastic approximation (SPSA) and does not assume that the gradient of an analytical cost function is known. Instead, we rely on (potentially) noisy estimates from local measurements. Using the analytical model presented in the paper, we first show the almost sure convergence of the algorithm to the optimal solution under a decreas- ing step size policy (as with a standard SPSA model). Motivated by practical concerns, we next consider the constant step size case, for which we establish weak convergence. We provide simulation results to demonstrate the advantages of our proposed algorithm under various network scenarios, and also present a comparative study with MATE (an existing opti- mal routing algorithm) }, author = {La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby} } @article {12636, title = {Measuring human movement for biomechanical applications using markerless motion capture}, journal = {Proceedings of SPIE}, volume = {6056}, year = {2006}, month = {2006///}, pages = {60560R - 60560R}, abstract = {Modern biomechanical and clinical applications require the accurate capture of normal and pathological humanmovement without the artifacts associated with standard marker-based motion capture techniques such as soft tissue artifacts and the risk of artificial stimulus of taped-on or strapped-on markers. In this study, the need for new markerless human motion capture methods is discussed in view of biomechanical applications. Three different approaches for estimating human movement from multiple image sequences were explored. The first two approaches tracked a 3D articulated model in 3D representations constructed from the image sequences, while the third approach tracked a 3D articulated model in multiple 2D image planes. The three methods are systematically evaluated and results for real data are presented. The role of choosing appropriate technical equipment and algorithms for accurate markerless motion capture is critical. The implementation of this new methodology offers the promise for simple, time-efficient, and potentially more meaningful assessments of human movement in research and clinical practice. }, author = {M{\"u}ndermann, L. and Corazza, S. and Chaudhari, A.M. and Andriacchi, T.P. and Sundaresan, A. and Chellapa, Rama} } @book {12356, title = {Memory management for synthesis of DSP software}, year = {2006}, month = {2006///}, publisher = {CRC}, organization = {CRC}, author = {Murthy,P. K and Bhattacharyya, Shuvra S.} } @conference {12325, title = {Memory-constrained block processing optimization for synthesis of DSP software}, booktitle = {Embedded Computer Systems: Architectures, Modeling and Simulation, 2006. IC-SAMOS 2006. International Conference on}, year = {2006}, month = {2006///}, pages = {137 - 143}, author = {Ko,M. Y and Shen,C. C and Bhattacharyya, Shuvra S.} } @article {18010, title = {Mesh-of-Trees and Alternative Interconnection Networks for Single Chip Parallel Processing (Extended Abstract)}, year = {2006}, month = {2006/06//}, abstract = {Many applications have stimulated the recent surge of interest single-chip parallel processing. In such machines, it is crucial to implement a high-throughput low-latency interconnection network to connect the on-chip components, especially the processing units and the memory units. In this paper, we propose a new mesh of trees (MoT) implementation of the interconnection network and evaluate it relative to metrics such as wire area, register count, total switch delay, maximum throughput, latency-throughput relation and delay effects of long wires. We show that on-chip interconnection networks can facilitate higher bandwidth between processors and shared first-level cache than previously considered possible. This has significant impact for chip multiprocessing. MoT is also compared, both analytically and experimentally, to some other traditional network topologies, such as hypercube, butterfly, fat trees and butterfly fat trees. When we evaluate a 64-terminal MoT network at 65nm technology, concrete results show that MoT provides higher throughput and lower latency especially when the input traffic (or the on-chip parallelism) is high, at the cost of larger area. A recurring problem in networking and communication is that of achieving good sustained throughput in contrast to just high theoretical peak performance that does not materialize for typical work loads. Our quantitative results demonstrate a clear advantage of the proposed MoT network in the context of single-chip parallel processing.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3678}, author = {Balkan,Aydin O. and Gang Qu and Vishkin, Uzi} } @article {16006, title = {The metacognitive loop I: Enhancing reinforcement learning with metacognitive monitoring and control for improved perturbation tolerance}, journal = {Journal of Experimental \& Theoretical Artificial Intelligence}, volume = {18}, year = {2006}, month = {2006///}, pages = {387 - 411}, author = {Anderson,M. L and Oates,T. and Chong,W. and Perlis, Don} } @article {16276, title = {Metagenomic Analysis of the Human Distal Gut Microbiome}, journal = {Science}, volume = {312}, year = {2006}, month = {2006/06/02/}, pages = {1355 - 1359}, abstract = {The human intestinal microbiota is composed of 1013 to 1014 microorganisms whose collective genome ({\textquotedblleft}microbiome{\textquotedblright}) contains at least 100 times as many genes as our own genome. We analyzed \~{}78 million base pairs of unique DNA sequence and 2062 polymerase chain reaction{\textendash}amplified 16S ribosomal DNA sequences obtained from the fecal DNAs of two healthy adults. Using metabolic function analyses of identified genes, we compared our human genome with the average content of previously sequenced microbial genomes. Our microbiome has significantly enriched metabolism of glycans, amino acids, and xenobiotics; methanogenesis; and 2-methyl-d-erythritol 4-phosphate pathway{\textendash}mediated biosynthesis of vitamins and isoprenoids. Thus, humans are superorganisms whose metabolism represents an amalgamation of microbial and human attributes.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1124234}, url = {http://www.sciencemag.org/content/312/5778/1355}, author = {Gill,Steven R. and Pop, Mihai and DeBoy,Robert T. and Eckburg,Paul B and Turnbaugh,Peter J and Samuel,Buck S and Gordon,Jeffrey I and Relman,David A and Fraser-Liggett,Claire M and Nelson,Karen E.} } @article {12602, title = {Method and System for Object Surveillance and Real Time Activity Recognition}, volume = {12/086,118}, year = {2006}, month = {2006/12/05/}, abstract = {Method and system for objects surveillance and real-time activity recognition is based on analysis of spatio-temporal images of individuals under surveillance where a spatio-temporal volume occupied by each individual is decomposed by crossing the same at specific heights to form 2-dimensional slices, each containing representation of trajectory of the motion of corresponding portions of the individual body. The symmetry of the trajectories (Gait DNA) is analyzed and classified to generate data indicative of a type of activity of the individual based on the symmetry or asymmetry of the Gait DNA in each 2-dimensional slice. An effective occlusion handling ability is implemented which permits to restore the occluded silhouette of an individual.}, url = {http://www.google.com/patents?id=IArMAAAAEBAJ}, author = {Yang Ran and Chellapa, Rama and Qinfen Zheng} } @article {15294, title = {Methods for automatically evaluating answers to complex questions}, journal = {Information Retrieval}, volume = {9}, year = {2006}, month = {2006///}, pages = {565 - 587}, abstract = {Evaluation is a major driving force in advancing the state of the art in language technologies. In particular, methods for automatically assessing the quality of machine output is the preferred method for measuring progress, provided that these metrics have been validated against human judgments. Following recent developments in the automatic evaluation of machine translation and document summarization, we present a similar approach, implemented in a measure called POURPRE, an automatic technique for evaluating answers to complex questions based on n-gram co-occurrences between machine output and a human-generated answer key. Until now, the only way to assess the correctness of answers to such questions involves manual determination of whether an information {\textquotedblleft}nugget{\textquotedblright} appears in a system{\textquoteright}s response. The lack of automatic methods for scoring system output is an impediment to progress in the field, which we address with this work. Experiments with the TREC 2003, TREC 2004, and TREC 2005 QA tracks indicate that rankings produced by our metric correlate highly with official rankings, and that POURPRE outperforms direct application of existing metrics.}, doi = {10.1007/s10791-006-9003-7}, author = {Jimmy Lin and Demner-Fushman,D.} } @article {17295, title = {Methods for the electronic annotation, retrieval, and use of electronic images}, volume = {09/976,362}, year = {2006}, month = {2006/03/07/}, abstract = {The present invention provides software for electronically annotating electronic images, such as drawings, photographs, video, etc., through the drag-and-drop of annotations from a pre-defined, but extendable, list. The annotations are placed at a user-selected X, Y location on the image, and stored in a searchable database. Thus, they can be searched in order to retrieve, organize, group, or display desired electronic images or collections of such images. The annotations may be text, images, sounds, etc. The invention provides a flexible, easy to learn, rapid, low error rate and satisfying interface for accomplishing such tasks.}, url = {http://www.google.com/patents?id=iBt4AAAAEBAJ}, author = {Shneiderman, Ben}, editor = {University of Maryland, College Park} } @conference {12928, title = {Microbial diversity in the era of genomics}, booktitle = {SYMPOSIA-SOCIETY FOR GENERAL MICROBIOLOGY}, volume = {66}, year = {2006}, month = {2006///}, pages = {1 - 1}, author = {Rita R Colwell} } @conference {12838, title = {Model based verification and validation of distributed control architectures}, booktitle = {Proceedings of Convergence Convergence International Congress and Exposition on Transportation Electronics, Detroit, USA}, year = {2006}, month = {2006///}, author = {Ray,A. and Cleaveland, Rance and Jiang,S. and Fuhrman,T.} } @article {16933, title = {A model for computer frustration: the role of instrumental and dispositional factors on incident, session, and post-session frustration and mood}, journal = {Computers in Human Behavior}, volume = {22}, year = {2006}, month = {2006/11//}, pages = {941 - 961}, abstract = {Frustration is almost universally accepted as the emotional outcome of a negative computing experience. Despite the wide use of the term, however, it has not been rigorously conceptualized as a factor in the study of the human{\textendash}computer interface. This project sets out to explicate frustration as a pre-emotional state generated by the user{\textquoteright}s appraisal of the interface as an impediment to goal attainment, and looks at how user characteristics, such as self-efficacy, relate to it. This project employed episode report methodology to capture data from 144 computer users{\textquoteright} reports of actual frustrating events as they took place. Diaries taken as users worked at their everyday tasks yield detailed data about the problems they encountered and included information about session length and an estimate of the time lost due to the experiences. Outcomes were measured as either situational or dispositional factors. Situational factors, having to do with specific events, predicted incident frustration. However, disposition variables, especially user self-efficacy, were much stronger, predicting incident and session frustration, and post-session mood. One surprising outcome was the failure of demographic variables as predictors of frustration.}, keywords = {Efficacy, Emotion, Frustration, Mood, problem solving, usability}, isbn = {0747-5632}, doi = {10.1016/j.chb.2004.03.015}, url = {http://www.sciencedirect.com/science/article/pii/S0747563204000615}, author = {Bessi{\`e}re,Katie and Newhagen,John E. and Robinson,John P. and Shneiderman, Ben} } @inbook {12633, title = {Model-Based Approaches}, booktitle = {Human Identification Based on GaitHuman Identification Based on Gait}, year = {2006}, month = {2006///}, pages = {107 - 133}, abstract = {The model based approaches aim to derive the movement of the torso and/or the legs. The distinction of a structural approach is one which uses static parameters illustrated in Fig. 6.1(a) whereas a model can be the (relative) motion of the angles (α, β, and ϕ) between the limbs, shown in Fig. 6.1(b). As earlier, these angles can also be measured relative to vertical.}, author = {Nixon, M.S. and Tan, T. and Chellapa, Rama} } @conference {12333, title = {Model-based mapping of image registration applications onto configurable hardware}, booktitle = {Signals, Systems and Computers, 2006. ACSSC{\textquoteright}06. Fortieth Asilomar Conference on}, year = {2006}, month = {2006///}, pages = {1453 - 1457}, author = {Hemaraj,Y. and Sen,M. and Shekhar,R. and Bhattacharyya, Shuvra S.} } @conference {17854, title = {Model-based OpenMP implementation of a 3D facial pose tracking system}, booktitle = {2006 International Conference on Parallel Processing Workshops, 2006. ICPP 2006 Workshops}, year = {2006}, month = {2006///}, pages = {8 pp.-73 - 8 pp.-73}, publisher = {IEEE}, organization = {IEEE}, abstract = {Most image processing applications are characterized by computation-intensive operations, and high memory and performance requirements. Parallelized implementation on shared-memory systems offer an attractive solution to this class of applications. However, we cannot thoroughly exploit the advantages of such architectures without proper modeling and analysis of the application. In this paper, we describe our implementation of a 3D facial pose tracking system using the OpenMP platform. Our implementation is based on a design methodology that uses coarse-grain dataflow graphs to model and schedule the application. We present our modeling approach, details of the implementation that we derived based on this modeling approach, and associated performance results. The parallelized implementation achieves significant speedup, and meets or exceeds the target frame rate under various configurations}, keywords = {3D facial pose tracking system, application modeling, application program interfaces, application scheduling, coarse-grain dataflow graphs, Concurrent computing, data flow graphs, Educational institutions, face recognition, IMAGE PROCESSING, image processing applications, Inference algorithms, Message passing, OpenMP platform, parallel implementation, PARALLEL PROCESSING, parallel programming, Particle tracking, Processor scheduling, SHAPE, shared memory systems, shared-memory systems, Solid modeling, tracking}, isbn = {0-7695-2637-3}, doi = {10.1109/ICPPW.2006.55}, author = {Saha,S. and Chung-Ching Shen and Chia-Jui Hsu and Aggarwal,G. and Veeraraghavan,A. and Sussman, Alan and Bhattacharyya, Shuvra S.} } @conference {15483, title = {Model-based testing of community-driven open-source GUI applications}, booktitle = {Software Maintenance, 2006. ICSM{\textquoteright}06. 22nd IEEE International Conference on}, year = {2006}, month = {2006///}, pages = {145 - 154}, abstract = {Although the World-Wide-Web (WWW) has significantly enhanced open-source software (OSS) development, it has also created new challenges for quality assurance (QA), especially for OSS with a graphical-user interface (GUI) front-end. Distributed communities of developers, connected by the WWW, work concurrently on loosely-coupled parts of the OSS and the corresponding GUI code. Due to the unprecedented code churn rates enabled by the WWW, developers may not have time to determine whether their recent modifications have caused integration problems with the overall OSS; these problems can often be detected via GUI integration testing. However, the resource-intensive nature of GUI testing prevents the application of existing automated QA techniques used during conventional OSS evolution. In this paper we develop new process support for three nested techniques that leverage developer communities interconnected by the WWW to automate model-based testing of evolving GUI-based OSS. The "innermost" technique (crash testing) operates on each code check-in of the GUI software and performs a quick and fully automatic integration test. The second technique {smoke testing) operates on each day{\textquoteright}s GUI build and performs functional "reference testing" of the newly integrated version of the GUI. The third (outermost) technique (comprehensive GUI testing) conducts detailed integration testing of a major GUI release. An empirical study involving four popular OSS shows that (1) the overall approach is useful to detect severe faults in GUI-based OSS and (2) the nesting paradigm helps to target feedback and makes effective use of the WWW by implicitly distributing QA}, isbn = {0-7695-2354-4}, doi = {10.1109/ICSM.2006.39}, author = {Xie,Q. and Memon, Atif M.} } @conference {12614, title = {Modeling Age Progression in Young Faces}, booktitle = {Computer Vision and Pattern Recognition, 2006 IEEE Computer Society Conference on}, volume = {1}, year = {2006}, month = {2006/06//}, pages = {387 - 394}, abstract = {We propose a craniofacial growth model that characterizes growth related shape variations observed in human faces during formative years. The model draws inspiration from the $\#$145;revised $\#$146; cardioidal strain transformation model proposed in psychophysical studies related to craniofacial growth. The model takes into account anthropometric evidences collected on facial growth and hence is in accordance with the observed growth patterns in human faces across years. We characterize facial growth by means of growth parameters defined over facial landmarks often used in anthropometric studies. We illustrate how the age-based anthropometric constraints on facial proportions translate into linear and non-linear constraints on facial growth parameters and propose methods to compute the optimal growth parameters. The proposed craniofacial growth model can be used to predict one $\#$146;s appearance across years and to perform face recognition across age progression. This is demonstrated on a database of age separated face images of individuals under 18 years of age.}, doi = {10.1109/CVPR.2006.187}, author = {Ramanathan,N. and Chellapa, Rama} } @article {18643, title = {Modeling and Simulation of the Escalation Archetype in Computer Security}, journal = {Symposium on Simulation Software Security (SSSS 06)}, volume = {38}, year = {2006}, month = {2006///}, pages = {495 - 495}, abstract = {To support decision-making for mitigating computer security risks, we developed and used a system dynamics model of security aspects of an enterprise system. We describe the notion of archetypes in general and the escalation archetype specifically, showing how it can arise in computer security. We show the effects of this instance of escalation through simulation of our model, consider the effects of changes in the simulation, and discuss the prognoses drawn from the archetype literature and their applicability to security.}, url = {https://www.scs.org/confernc/springsim/springsim06/prelimProgram/ssss/2.html}, author = {Rosenfeld,S. N. and Rus,I. and Michel Cukier} } @conference {15834, title = {Modeling identity in archival collections of email: A preliminary study}, booktitle = {Proceedings of the 2006 Conference on Email and Anti-Spam (CEAS 06)}, year = {2006}, month = {2006///}, pages = {95 - 103}, author = {Elsayed,T. and Oard, Douglas} } @conference {18679, title = {Modeling the Symptomatic Fixes Archetype in Enterprise Computer Security}, volume = {1}, year = {2006}, month = {2006/09//}, pages = {178 - 188}, abstract = {To support decision-making for security-risk mitigation and the appropriate selection of security countermeasures, we propose a system dynamics model of the security aspects of an enterprise system. We developed such an executable model, incorporating the concept of archetypes. We present here one archetype for computer security, namely symptomatic fixes (or shifting the burden). Using simulation, we show one instance of how this archetype can be used for recognizing and diagnosing typical situations, as well as for fixing problems. The global effects of changes and behavioral trends are examined, and other instances of symptomatic fixes in security are described as well}, keywords = {business data processing, decision making, decision-making, enterprise computer security, human factors, security of data, security-risk mitigation, symptomatic fixes archetype modeling, system dynamics model, system modeling}, doi = {10.1109/COMPSAC.2006.62}, author = {Rosenfeld,S. N. and Rus,I. and Michel Cukier} } @article {18011, title = {Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform}, year = {2006}, month = {2006/05/18/}, abstract = {A bold vision that guided this work is as follows: (i) a parallel algorithms and programming course could become a standard course in every undergraduate computer science program, and (ii) this course could be coupled with a so-called PRAM-On-Chip architecture --- a commodity high-end multi-core computer architecture.In fact, the current paper is a tutorial on how to convert PRAM algorithms into efficient PRAM-On-Chip programs. Coupled with a text on PRAM algorithms as well as an available PRAM-On-Chip tool-chain, comprising a compiler and a simulator, the paper provides the missing link for upgrading a standard theoretical PRAM algorithms class to a parallel algorithms and programming class. Having demonstrated that such a course could cover similar programming projects and material to what is covered by a typical first serial algorithms and programming course, the paper suggests that parallel programming in the emerging multi-core era does not need to be more difficult than serial programming. If true, a powerful answer to the so-called parallel programming open problem is being provided. This open problem is currently the main stumbling block for the industry in getting the upcoming generation of multi-core architectures to improve single task completion time using easy-to-program application programmer interfaces. Known constraints of this open problem, such as backwards compatibility on serial code, are also addressed by the overall approach. More concretely, a widely used methodology for advancing parallel algorithmic thinking into parallel algorithms is revisited, and is extended into a methodology for advancing parallel algorithms to PRAM-On-Chip programs. A performance cost model for the PRAM-On-Chip is also presented. It uses as complexity metrics the length of sequence of round trips to memory (LSRTM) and queuing delay (QD) from memory access queues, in addition to standard PRAM computation costs. Highlighting the importance of LSRTM in determining performance is another contribution of the paper. Finally, some alternatives to PRAM algorithms, which, on one hand, are easier-to-think, but, on the other hand, suppress more architecture details, are also discussed. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3338}, author = {Vishkin, Uzi and Caragea,George C. and Lee,Bryant} } @article {14081, title = {Molecular Characterization of Serine-, Alanine-, and Proline-Rich Proteins of Trypanosoma cruzi and Their Possible Role in Host Cell Infection}, journal = {Infect. Immun.}, volume = {74}, year = {2006}, month = {2006/03/01/}, pages = {1537 - 1546}, abstract = {We previously reported the isolation of a novel protein gene family, termed SAP (serine-, alanine-, and proline-rich protein), from Trypanosoma cruzi. Aided by the availability of the completed genome sequence of T. cruzi, we have now identified 39 full-length sequences of SAP, six pseudogenes and four partial genes. SAPs share a central domain of about 55 amino acids and can be divided into four groups based on their amino (N)- and carboxy (C)-terminal sequences. Some SAPs have conserved N- and C-terminal domains encoding a signal peptide and a glycosylphosphatidylinositol anchor addition site, respectively. Analysis of the expression of SAPs in metacyclic trypomastigotes by two-dimensional electrophoresis and immunoblotting revealed that they are likely to be posttranslationally modified in vivo. We have also demonstrated that some SAPs are shed into the extracellular medium. The recombinant SAP exhibited an adhesive capacity toward mammalian cells, where binding was dose dependent and saturable, indicating a possible ligand-receptor interaction. SAP triggered the host cell Ca2+ response required for parasite internalization. A cell invasion assay performed in the presence of SAP showed inhibition of internalization of the metacyclic forms of the CL strain. Taken together, these results show that SAP is involved in the invasion of mammalian cells by metacyclic trypomastigotes, and they confirm the hypothesis that infective trypomastigotes exploit an arsenal of surface glycoproteins and shed proteins to induce signaling events required for their internalization.}, doi = {

10.1128/IAI.74.3.1537-1546.2006

}, url = {http://iai.asm.org/cgi/content/abstract/74/3/1537}, author = {Baida,Renata C. P. and Santos,Marcia R. M. and Carmo,Mirian S. and Yoshida,Nobuko and Ferreira,Danielle and Ferreira,Alice Teixeira and El Sayed,Najib M. and Andersson,Bjorn and da Silveira,Jose Franco} } @conference {13604, title = {Morphology Induction from Limited Noisy Data Using Approximate String Matching}, booktitle = {Proceedings of the Eighth Meeting of the ACL Special Interest Group in Computational Phonology (SIGPHON 2006)}, year = {2006}, month = {2006/06//}, pages = {60 - 68}, address = {New York City, NY}, abstract = {For a language with limited resources, a dictionary may be one of the few available electronic resources. To make effective use of the dictionary for translation, however, users must be able to access it using the root form of morphologically deformed variant found in the text. Stemming and data driven methods, however, are not suitable when data is sparse. We present algorithms for discovering morphemes from limited, noisy data obtained by scanning a hard copy dictionary. Our approach is based on the novel application of the longest common substring and string edit distance metrics. Results show that these algorithms can in fact segment words into roots and affixes from the limited data contained in a dictionary, and extract affixes. This in turn allows non native speakers to perform multilingual tasks for applications where response must be rapid, and their knowledge is limited. In addition, this analysis can feed other NLP tools requiring lexicons.}, author = {Karagol-Ayan,Burcu and David Doermann and Weinberg, Amy} } @article {13605, title = {Mosaicing of Camera-captured Documents Without Pose Restriction}, journal = {Computer Vision and Image Understanding}, year = {2006}, month = {2006///}, abstract = {In this paper we present an image mosaicing method for camera-captured documents. Our method is unique in not restricting the camera position, thus allowing greater flexibility than approaches using scanner or fixed-cameras. To accommodate for the perspective distortions introduced by varying poses, we implement a two step image registration process that accurately computes the projectivity between any two document images with an overlapping area that may be as small as 10\%. In the overlapping area, we apply a sharpness based selection process to obtain seamless composition across the border and within. Experiments show that our approach can produce a very sharp, high resolution and accurate full page mosaic from small image patches of a document captured from unconstrained positions.}, author = {Liang,Jian and DeMenthon,Daniel and David Doermann} } @conference {12616, title = {Motion Based Correspondence for 3D Tracking of Multiple Dim Objects}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {2}, year = {2006}, month = {2006/05//}, pages = {II - II}, abstract = {Tracking multiple objects in a video is a demanding task that is frequently encountered in several systems such as surveillance and motion analysis. Ability to track objects in 3D requires the use of multiple cameras. While tracking multiple objects using multiples video cameras, establishing correspondence between objects in the various cameras is a nontrivial task. Specifically, when the targets are dim or are very far away from the camera, appearance cannot be used in order to establish this correspondence. Here, we propose a technique to establish correspondence across cameras using the motion features extracted from the targets, even when the relative position of the cameras is unknown. Experimental results are provided for the problem of tracking multiple bees in natural flight using two cameras. The reconstructed 3D flight paths of the bees show some interesting flight patterns}, keywords = {3D, analysis;motion, analysis;video, based, cameras;feature, correspondence;motion, dim, extraction;image, extraction;multiple, features, MOTION, objects;video, processing;, signal, tracking;motion}, doi = {10.1109/ICASSP.2006.1660431}, author = {Veeraraghavan,A. and Srinivasan, M. and Chellapa, Rama and Baird, E. and Lamont, R.} } @conference {12619, title = {Moving Object Verification from Airborne Video}, booktitle = {Computer Vision Systems, 2006 ICVS {\textquoteright}06. IEEE International Conference on}, year = {2006}, month = {2006/01//}, pages = {29 - 29}, abstract = {This paper presents an end-to-end verification system for moving objects in airborne video. Lacking prior training data, the object information is collected on the fly from a short real-time learning sequence. Using a sample selection module, the system selects samples from the learning sequence and stores them in an exemplar database. To handle appearance change due to potentially large aspect angle variations, a homography-based view synthesis method is used to generate a novel view of each image in the exemplar database at the same pose as the query object in each frame of a query sequence. A spatial match score is obtained using a Distance Transform to compare the novel view and query object. After looping over all query frames, the set of match scores is passed to a temporal analysis module to examine the behavior of the query object, and calculate a final likelihood. Very good verification performance is achieved over thousands of trials for both color and infrared video sequences using the proposed system.}, doi = {10.1109/ICVS.2006.42}, author = {Yue,Zhanfeng and Chellapa, Rama and Guarino, D.} } @article {13177, title = {Multi-camera tracking and segmentation of occluded people on ground plane using search-guided particle filtering}, journal = {Computer Vision{\textendash}ECCV 2006}, year = {2006}, month = {2006///}, pages = {98 - 109}, abstract = {A multi-view multi-hypothesis approach to segmenting and tracking multiple (possibly occluded) persons on a ground plane is proposed. During tracking, several iterations of segmentation are performed using information from human appearance models and ground plane homography. To more precisely locate the ground location of a person, all center vertical axes of the person across views are mapped to the top-view plane and their intersection point on the ground is estimated. To tackle the explosive state space due to multiple targets and views, iterative segmentation-searching is incorporated into a particle filtering framework. By searching for people{\textquoteright}s ground point locations from segmentations, a set of a few good particles can be identified, resulting in low computational cost. In addition, even if all the particles are away from the true ground point, some of them move towards the true one through the iterated process as long as they are located nearby. We demonstrate the performance of the approach on several video sequences.}, author = {Kim,K. and Davis, Larry S.} } @inbook {12624, title = {Multi-camera Tracking of Articulated Human Motion Using Motion and Shape Cues}, booktitle = {Computer Vision {\textendash} ACCV 2006Computer Vision {\textendash} ACCV 2006}, series = {Lecture Notes in Computer Science}, volume = {3852}, year = {2006}, month = {2006///}, pages = {131 - 140}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present a framework and algorithm for tracking articulated motion for humans. We use multiple calibrated cameras and an articulated human shape model. Tracking is performed using motion cues as well as image-based cues (such as silhouettes and {\textquotedblleft}motion residues{\textquotedblright} hereafter referred to as spatial cues,) as opposed to constructing a 3D volume image or visual hulls. Our algorithm consists of a predictor and corrector: the predictor estimates the pose at the t + 1 using motion information between images at t and t + 1. The error in the estimated pose is then corrected using spatial cues from images at t + 1. In our predictor, we use robust multi-scale parametric optimisation to estimate the pixel displacement for each body segment. We then use an iterative procedure to estimate the change in pose from the pixel displacement of points on the individual body segments. We present a method for fusing information from different spatial cues such as silhouettes and {\textquotedblleft}motion residues{\textquotedblright} into a single energy function. We then express this energy function in terms of the pose parameters, and find the optimum pose for which the energy is minimised.}, isbn = {978-3-540-31244-4}, url = {http://dx.doi.org/10.1007/11612704_14}, author = {Sundaresan,Aravind and Chellapa, Rama}, editor = {Narayanan,P. and Nayar,Shree and Shum,Heung-Yeung} } @conference {17852, title = {Multiple range query optimization with distributed cache indexing}, booktitle = {Proceedings of the 2006 ACM/IEEE conference on Supercomputing}, year = {2006}, month = {2006///}, pages = {100{\textendash}es - 100{\textendash}es}, author = {Nam,B. and Andrade,H. and Sussman, Alan} } @article {13266, title = {A multi-resolution representation for terrain morphology}, journal = {Geographic Information Science}, year = {2006}, month = {2006///}, pages = {33 - 46}, abstract = {Mesh-based terrain representations provide accurate descriptions of a terrain, but fail in capturing its morphological structure. The morphology of a terrain is defined by its critical points and by the critical lines joining them, which form a so-called surface network. Because of the large size of current terrain data sets, a multi-resolution representation of the terrain morphology is crucial. Here, we address the problem of representing the morphology of a terrain at different resolutions. The basis of the multi-resolution terrain model, that we call a Multi-resolution Surface Network (MSN), is a generalization operator on a surface network, which produces a simplified representation incrementally. An MSN is combined with a multi-resolution mesh-based terrain model, which encompasses the terrain morphology at different resolutions. We show how variable-resolution representations can be extracted from an MSN, and we present also an implementation of an MSN in a compact encoding data structure.}, doi = {10.1007/11863939_3}, author = {Danovaro,E. and De Floriani, Leila and Papaleo,L. and Vitali,M.} } @article {18253, title = {Multiuser cross-layer resource allocation for video transmission over wireless networks}, journal = {Network, IEEE}, volume = {20}, year = {2006}, month = {2006/04//march}, pages = {21 - 27}, abstract = {With the advancement of video-compression technology and the wide deployment of wireless networks, there is an increasing demand for wireless video communication services, and many design challenges remain to be overcome. In this article, we discuss how to dynamically allocate resources according to the changing environments and requirements, so as to improve the overall system performance and ensure individual quality of service (QoS). Specifically, we consider two aspects with regard to design issues: cross-layer design, which jointly optimizes resource utilization from the physical layer to the application layer, and multiuser diversity, which explores source and channel heterogeneity for different users. We study how to efficiently transmit multiple video streams, encoded by current and future video codecs, over resource-limited wireless networks such as 3G/4G cellular system and future wireless local/metropolitan area networks (WLANs/WMANs)}, keywords = {3G, allocation;multiuser, allocation;video, cellular, channels;quality, codecs;video, coding;video, communication;4G, communication;data, compression;diversity, cross-layer, diversity;physical, layer;multiple, layer;quality, mobile, networks;3G, of, reception;multiuser, resource, service;resource, service;video, streaming;, streams;multiuser, system;4G, system;QoS;application, technology;wireless, transmission;video-compression, video}, isbn = {0890-8044}, doi = {10.1109/MNET.2006.1607892}, author = {Su,Guan-Ming and Man,Zhu and M. Wu and Liu,K. J.R} } @article {18254, title = {Multiuser distortion management of layered video over resource limited downlink multicode-CDMA}, journal = {Wireless Communications, IEEE Transactions on}, volume = {5}, year = {2006}, month = {2006/11//}, pages = {3056 - 3067}, abstract = {Transmitting multiple real-time encoded videos to multiple users over wireless cellular networks is a key driving force for developing broadband technology. We propose a new framework to transmit multiple users{\textquoteright} video programs encoded by MPEG-4 FGS codec over downlink multicode CDMA networks in real time. The proposed framework jointly manages the rate adaptation of source and channel coding, CDMA code allocation, and power control. Subject to the limited system resources, such as the number of pseudo-random codes and the maximal power for CDMA transmission, we develop an adaptive scheme of distortion management to ensure baseline video quality for each user and further reduce the overall distortion received by all users. To efficiently utilize system resources, the proposed scheme maintains a balanced ratio between the power and code usages. We also investigate three special scenarios where demand, power, or code is limited, respectively. Compared with existing methods in the literature, the proposed algorithm can reduce the overall system{\textquoteright}s distortion by 14\% to 26\%. In the demand-limited case and the code-limited but power-unlimited case, the proposed scheme achieves the optimal solutions. In the power-limited but code-unlimited case, the proposed scheme has a performance very close to a performance upper bound}, keywords = {(mobile, access;combined, allocation;broadband, case;layered, CDMA, cellular, code, codes;radio, codes;real-time, codes;telecommunication, coding;mobility, coding;video, coding;wireless, communication;, control;pseudo-random, control;pseudonoise, control;video, distortion, division, downlink, encoded, limited, links;random, management, management;power, multicode-CDMA;source-channel, multiple, networks;broadband, networks;cellular, radio);power, radio;code, source-channel, technology;code-unlimited, video;multiuser, videos;resource}, isbn = {1536-1276}, doi = {10.1109/TWC.2006.258231}, author = {Han,Z. and Su,Guan-Ming and Kwasinski,A. and M. Wu and Liu,K. J.R} } @article {13174, title = {Multivalued default logic for identity maintenance in visual surveillance}, journal = {Computer Vision{\textendash}ECCV 2006}, year = {2006}, month = {2006///}, pages = {119 - 132}, abstract = {Recognition of complex activities from surveillance video requires detection and temporal ordering of its constituent {\textquotedblleft}atomic{\textquotedblright} events. It also requires the capacity to robustly track individuals and maintain their identities across single as well as multiple camera views. Identity maintenance is a primary source of uncertainty for activity recognition and has been traditionally addressed via different appearance matching approaches. However these approaches, by themselves, are inadequate. In this paper, we propose a prioritized, multivalued, default logic based framework that allows reasoning about the identities of individuals. This is achieved by augmenting traditional appearance matching with contextual information about the environment and self identifying traits of certain actions. This framework also encodes qualitative confidence measures for the identity decisions it takes and finally, uses this information to reason about the occurrence of certain predefined activities in video.}, author = {Shet,V. and Harwood,D. and Davis, Larry S.} } @article {14437, title = {Multi-View Learning and Link Farm Discovery}, journal = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, year = {2006}, month = {2006///}, abstract = {The first part of this abstract focuses on estimation of mixture models for problems in which multiple views of the instances are available. Examples of this setting include clustering web pages or research papers that have intrinsic (text) and extrinsic (references) attributes. Mixture model estimation is a key problem for both semi-supervised and unsupervised learning. An appropriate optimization criterion quantifies the likelihood and the consensus among models in the individual views; maximizing this consensus minimizes a bound on the risk of assigning an instance to an incorrect mixture component. An EM algorithm maximizes this criterion. The second part of this abstract focuses on the problem of identifying link spam. Search engine optimizers inflate the page rank of a target site by spinning an artificial web for the sole purpose of providing inbound links to the target. Discriminating natural from artificial web sites is a difficult multi-view problem.}, author = {Scheffer,T. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H} } @article {13184, title = {Multi-view Reconstruction of Static and Dynamic Scenes}, journal = {Handbook of Mathematical Models in Computer Vision}, year = {2006}, month = {2006///}, pages = {405 - 422}, abstract = {We explore the reconstruction of a three-dimensional scene from multiple images captured from far away viewpoints (wide-baseline camera arrangement). Such an arrangement is required for complex scenes where the visibility flora any one viewpoint is not sufficient to adequately reconstruct the entire scene. Also, such an arrangement reduces the error in triangulation of the features, thereby improving the accuracy of reconstruction. Our emphasis is on algorithms that recover a volumetric model of the scene from calibrated cameras by explicitly modeling and detecting occlusions. We present a brief overview of the state of the art in such methods for multi-view reconstruction. In particular, algorithms based on a probabilistic framework have become quite popular and produce very accurate models. Several such probabilistic volume reconstruction methods will be described. For the dynamic parts of the scene, where an online reconstruction is needed, simpler methods are required. An important case of such scenes is that of walking people in a surveillance scenario. For this case, we present fast online algorithms that recover approximate shape and appearance models and 3D trajectories of people as they walk in the scene. Finally, we address the problem of optimal placement of cameras in order to acquire the best possible image data for the reconstruction of a given scene according to the particular task specification.}, author = {Agrawal,M. and Mittal,A. and Davis, Larry S.} } @article {13006, title = {Magic bullets and golden rules: data sampling in molecular phylogenetics}, journal = {Zoology (Jena)}, volume = {108}, year = {2005}, month = {2005///}, pages = {329 - 336}, abstract = {Data collection for molecular phylogenetic studies is based on samples of both genes and taxa. In an ideal world, with no limitations to resources, as many genes could be sampled as deemed necessary to address phylogenetic problems. Given limited resources in the real world, inadequate (in terms of choice of genes or number of genes) sequences or restricted taxon sampling can adversely affect the reliability or information gained in phylogenetics. Recent empirical and simulation-based studies of data sampling in molecular phylogenetics have reached differing conclusions on how to deal with these problems. Some advocated sampling more genes, others more taxa. There is certainly no {\textquoteright}magic bullet{\textquoteright} that will fit all phylogenetic problems, and no specific {\textquoteright}golden rules{\textquoteright} have been deduced, other than that single genes may not always contain sufficient phylogenetic information. However, several general conclusions and suggestions can be made. One suggestion is that the determination of a multiple, but moderate number (e.g., 6-10) of gene sequences might take precedence over sequencing a larger set of genes and thereby permit the sampling of more taxa for a phylogenetic study.}, doi = {10.1016/j.zool.2005.09.006}, author = {Cummings, Michael P. and Meyer,A.} } @conference {16298, title = {Main effects screening}, booktitle = {Proceedings of the 27th international conference on Software engineering - ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 293}, address = {St. Louis, MO, USA}, doi = {10.1145/1062455.1062515}, url = {http://dl.acm.org/citation.cfm?id=1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @conference {15453, title = {Main effects screening: a distributed continuous quality assurance process for monitoring performance degradation in evolving software systems}, booktitle = {Proceedings of the 27th international conference on Software engineering}, series = {ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 302}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Developers of highly configurable performance-intensive software systems often use a type of in-house performance-oriented "regression testing" to ensure that their modifications have not adversely affected their software{\textquoteright}s performance across its large configuration space. Unfortunately, time and resource constraints often limit developers to in-house testing of a small number of configurations and unreliable extrapolation from these results to the entire configuration space, which allows many performance bottlenecks and sources of QoS degradation to escape detection until systems are fielded. To improve performance assessment of evolving systems across large configuration spaces, we have developed a distributed continuous quality assurance (DCQA) process called main effects screening that uses in-the-field resources to execute formally designed experiments to help reduce the configuration space, thereby allowing developers to perform more targeted in-house QA. We have evaluated this process via several feasibility studies on several large, widely-used performance-intensive software systems. Our results indicate that main effects screening can detect key sources of performance degradation in large-scale systems with significantly less effort than conventional techniques.}, keywords = {design of experiment theory, distributed continuous quality assurance, performance-oriented regression testing}, isbn = {1-58113-963-2}, doi = {10.1145/1062455.1062515}, url = {http://doi.acm.org/10.1145/1062455.1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @conference {12192, title = {Maintaining concentration to achieve task completion}, booktitle = {Proceedings of the 2005 conference on Designing for User eXperience}, year = {2005}, month = {2005///}, pages = {9 - 9}, author = {Shneiderman, Ben and Bederson, Benjamin B.} } @conference {17284, title = {Maintaining concentration to achieve task completion}, booktitle = {Proceedings of the 2005 conference on Designing for User eXperience}, series = {DUX {\textquoteright}05}, year = {2005}, month = {2005///}, publisher = {AIGA: American Institute of Graphic Arts}, organization = {AIGA: American Institute of Graphic Arts}, address = {New York, NY, USA}, abstract = {When faced with a challenging goal, knowledge workers need to concentrate on their tasks so that they move forward toward completion. Since frustrations, distractions, and interruptions can interfere with their smooth progress, design strategies should enable users to maintain concentration. This paper promotes awareness of this issue, reviews related work, and suggests three initial strategies: Reduce short-term and working memory load, provide information abundant interfaces, and increase automaticity.}, keywords = {avoid interruption, calm, flow, focus, goal attainment, interface design, maintain concentration, situation awareness, task completion}, isbn = {1-59593-250-X}, url = {http://dl.acm.org/citation.cfm?id=1138235.1138246}, author = {Shneiderman, Ben and Bederson, Benjamin B.} } @conference {16734, title = {Maintaining Implicated Statistics in Constrained Environments}, booktitle = {Data Engineering, International Conference on}, year = {2005}, month = {2005///}, pages = {730 - 741}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Aggregated information regarding implicated entities is critical for online applications like network management, traffic characterization or identifying patters of resource consumption. Recently there has been a flurry of research for online aggregation on streams (like quantiles, hot items, hierarchical heavy hitters) but surprizingly the problem of summarizing implicated information in stream data has received no attention. As an example, consider an IP-network and the implication source {\textrightarrow} destination. Flash crowds, {\textemdash} such as those that follow recent sport events (like the olympics) or seek information regarding catastrophic events {\textemdash} or denial of service attacks direct a large volume of traffic from a huge number of sources to a very small number of destinations. In this paper we present novel randomized algorithms for monitoring such implications with constraints in both memory and processing power for environments like network routers. Our experiments demonstrate several factors of improvements over straightforward approaches.}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.84}, author = {Sismanis,Yannis and Roussopoulos, Nick} } @article {17287, title = {Making Computer and Internet Usability a Priority (2000)}, year = {2005}, month = {2005///}, abstract = {As usability professionals, we are all too aware of the productivity losses, frustration, and lost business that results from poorly designed user interfaces. And we are uncomfortable with the risks created by poorly designed computer systems in life-critical applications such as air travel, medical care, and military applications. Yet despite the common sense of our approach, we still find it difficult to convince the technical and managerial communities that usability is a critical business parameter. While senior managers may support the concept of usability, project mangers and developers, coping with too tight schedules, often see it as a nicety that can be eliminated.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6527}, author = {Kreitzberg,Charles B and Shneiderman, Ben} } @conference {14026, title = {The manifolds of spatial hearing}, booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on}, volume = {3}, year = {2005}, month = {2005/03//}, pages = {iii/285 - iii/288 Vol. 3 - iii/285 - iii/288 Vol. 3}, abstract = {We present exploratory studies on learning the non-linear manifold structure, in head related impulse responses (HRIRs). We use the recently popular locally linear embedding technique. The lower dimensional manifold encodes the perceptual information in the HRIRs, namely the direction of the sound source. Based on this, we propose a new method for HRIR interpolation. We also propose that the distance between two HRIRs of an individual be taken as the geodesic distance on the learned manifold.}, keywords = {acoustics;, dimensional, direction, distance;, EMBEDDING, encoding;, geodesic, Head, hearing, hearing;, HRIR, impulse, information, interpolation;, learned, linear, localization;, locally, low, manifold, manifold;, manifolds;, nonlinear, perceptual, related, response;, responses;, sound, source, spatial, structure;, technique;, transient}, doi = {10.1109/ICASSP.2005.1415702}, author = {Duraiswami, Ramani and Raykar,V.C.} } @conference {12646, title = {Markerless Motion Capture using Multiple Cameras}, booktitle = {Computer Vision for Interactive and Intelligent Environment, 2005}, year = {2005}, month = {2005/11//}, pages = {15 - 26}, abstract = {Motion capture has important applications in different areas such as biomechanics, computer animation, and human-computer interaction. Current motion capture methods use passive markers that are attached to different body parts of the subject and are therefore intrusive in nature. In applications such as pathological human movement analysis, these markers may introduce an unknown artifact in the motion, and are, in general, cumbersome. We present computer vision based methods for performing markerless human motion capture. We model the human body as a set of super-quadrics connected in an articulated structure and propose algorithms to estimate the parameters of the model from video sequences. We compute a volume data (voxel) representation from the images and combine bottom-up approach with top down approach guided by our knowledge of the model. We propose a tracking algorithm that uses this model to track human pose. The tracker uses an iterative framework akin to an Iterated Extended Kalman Filter to estimate articulated human motion using multiple cues that combine both spatial and temporal information in a novel manner. We provide preliminary results using data collected from 8-16 cameras. The emphasis of our work is on models and algorithms that are able to scale with respect to the requirement for accuracy. Our ultimate objective is to build an end-to-end system that can integrate the above mentioned components into a completely automated markerless motion capture system.}, doi = {10.1109/CVIIE.2005.13}, author = {Sundaresan, A. and Chellapa, Rama} } @article {12645, title = {Matching shape sequences in video with applications in human movement analysis}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {27}, year = {2005}, month = {2005/12//}, pages = {1896 - 1909}, abstract = {We present an approach for comparing two sequences of deforming shapes using both parametric models and nonparametric methods. In our approach, Kendall{\textquoteright}s definition of shape is used for feature extraction. Since the shape feature rests on a non-Euclidean manifold, we propose parametric models like the autoregressive model and autoregressive moving average model on the tangent space and demonstrate the ability of these models to capture the nature of shape deformations using experiments on gait-based human recognition. The nonparametric model is based on dynamic time-warping. We suggest a modification of the dynamic time-warping algorithm to include the nature of the non-Euclidean space in which the shape deformations take place. We also show the efficacy of this algorithm by its application to gait-based human recognition. We exploit the shape deformations of a person{\textquoteright}s silhouette as a discriminating feature and provide recognition results using the nonparametric model. Our analysis leads to some interesting observations on the role of shape and kinematics in automated gait-based person authentication.}, keywords = {Automated;Photography;Reproducibility of Results;Sensitivity and Specificity;Subtraction Technique;Video Recording;, autoregressive moving average model;deforming shapes;dynamic time-warping;feature extraction;gait-based human recognition;human movement analysis;matching shape sequences;video;autoregressive moving average processes;feature extraction;image matching;imag, Biological;Models, Computer-Assisted;Imaging, Statistical;Movement;Pattern Recognition, Three-Dimensional;Leg;Models}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2005.246}, author = {A,Veeraraghavan and Roy-Chowdhury, A.K. and Chellapa, Rama} } @article {19663, title = {MCMC-based particle filtering for tracking a variable number of interacting targets}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {27}, year = {2005}, month = {2005/11//}, pages = {1805 - 1819}, abstract = {We describe a particle filter that effectively deals with interacting targets, targets that are influenced by the proximity and/or behavior of other targets. The particle filter includes a Markov random field (MRF) motion prior that helps maintain the identity of targets throughout an interaction, significantly reducing tracker failures. We show that this MRF prior can be easily implemented by including an additional interaction factor in the importance weights of the particle filter. However, the computational requirements of the resulting multitarget filter render it unusable for large numbers of targets. Consequently, we replace the traditional importance sampling step in the particle filter with a novel Markov chain Monte Carlo (MCMC) sampling step to obtain a more efficient MCMC-based multitarget filter. We also show how to extend this MCMC-based filter to address a variable number of interacting targets. Finally, we present both qualitative and quantitative experimental results, demonstrating that the resulting particle filters deal efficiently and effectively with complicated target interactions.}, keywords = {algorithms, Animals, Artificial intelligence, Computer simulation, Computer vision, Filtering, filtering theory, HUMANS, Image Enhancement, Image Interpretation, Computer-Assisted, Index Terms- Particle filters, Information Storage and Retrieval, Insects, interacting targets, Markov chain Monte Carlo sampling step, Markov chain Monte Carlo., Markov chains, Markov processes, Markov random field motion, Markov random fields, Models, Biological, Models, Statistical, Monte Carlo Method, Monte Carlo methods, MOTION, Movement, multitarget filter, multitarget tracking, particle filtering, Particle filters, Particle tracking, Pattern Recognition, Automated, Sampling methods, Subtraction Technique, target tracking, Video Recording}, isbn = {0162-8828}, author = {Zia Khan and Balch, T. and Dellaert, F.} } @article {19499, title = {MEAD: support for Real-Time Fault-Tolerant CORBA}, journal = {Concurrency and Computation: Practice and Experience}, volume = {17}, year = {2005}, month = {2005///}, pages = {1527 - 1545}, abstract = {The OMG{\textquoteright}s Real-Time CORBA (RT-CORBA) and Fault-Tolerant CORBA (FT-CORBA) specifications make it possible for today{\textquoteright}s CORBA implementations to exhibit either real-time or fault tolerance in isolation. While real-time requires a priori knowledge of the system{\textquoteright}s temporal operation, fault tolerance necessarily deals with faults that occur unexpectedly, and with possibly unpredictable fault recovery times. The MEAD (Middleware for Embedded Adaptive Dependability) system attempts to identify and to reconcile the conflicts between real-time and fault tolerance, in a resource-aware manner, for distributed CORBA applications. MEAD supports transparent yet tunable fault tolerance in real-time, proactive dependability, resource-aware system adaptation to crash, communication and timing faults with bounded fault detection and fault recovery. Copyright {\textcopyright} 2005 John Wiley \& Sons, Ltd.}, keywords = {CORBA, Fault tolerance, non-determinism, predictability, real-time, recovery, trade-offs}, isbn = {1532-0634}, url = {http://onlinelibrary.wiley.com/doi/10.1002/cpe.882/abstract}, author = {Narasimhan, P. and Tudor Dumitras and Paulos, A. M. and Pertet, S. M. and Reverte, C. F. and Slember, J. G. and Srivastava, D.} } @conference {17288, title = {Meaningful presentations of photo libraries: rationale and applications of bi-level radial quantum layouts}, booktitle = {Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries, 2005. JCDL {\textquoteright}05}, year = {2005}, month = {2005/06/07/11}, pages = {188 - 196}, publisher = {IEEE}, organization = {IEEE}, abstract = {Searching photo libraries can be made more satisfying and successful if search results are presented in a way that allows users to gain an overview of the photo categories. Since photo layouts on computer displays are the primary way that users get an overview, we propose a novel approach to show more photos in meaningful groupings. Photo layouts can be linear strips, or zoomable three dimensional arrangements, but the most common form is the two-dimensional grid. This paper introduces a novel bi-level hierarchical layout with motivating examples. In a bilevel hierarchy, one region is designated for primary content - an image, text, or combination. Adjacent to that region, groups of photos are placed radially in an ordered fashion, such that the relationship of the single primary region to its many secondary regions is apparent. A compelling aspect is the interactive experience in which the layout is dynamically resized, allowing users to rapidly, incrementally, and reversibly alter the dimensions and content. It can accommodate hundreds of photos in dozens of regions, can be customized in a corner or center layout, and can scale from an element on a web page to a large poster size. On typical displays (1024 times 1280 or 1200 times 1600 pixels), bi-level radial quantum layouts can conveniently accommodate 2-20 regions with tens or hundreds of photos per region}, keywords = {1024 pixel, 1200 pixel, 1280 pixel, 1310720 pixel, 1600 pixel, 1920000 pixel, Application software, bi-level radial quantum layouts, Computer displays, Computer science, digital libraries, Educational institutions, Image retrieval, Layout, layout generation, Lifting equipment, linear strips, Permission, photo layouts, photo library searching, photo management, Photography, Quantum computing, software libraries, Strips, two-dimensional grid, User interfaces, visual databases, visual presentation, zoomable three dimensional arrangements}, isbn = {1-58113-876-8}, doi = {10.1145/1065385.1065431}, author = {Kustanowitz,J. and Shneiderman, Ben} } @conference {12280, title = {Measurement-based multipath multicast}, booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE}, volume = {4}, year = {2005}, month = {2005/03//}, pages = {2803 - 2808 vol. 4 - 2803 - 2808 vol. 4}, abstract = {We propose a measurement-based routing algorithm to load balance intradomain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application-layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities.}, keywords = {algorithm;, allocation;, application-layer, approximation, approximation;, balance, communication;, Convergence, convergence;, intradomain, load, measurement-based, methods;, Multicast, multipath, network, numerical, of, overlaying;, perturbation, processes;, resource, Routing, routing;, source;, Stochastic, techniques;, Telecommunication, theory;, traffic;}, doi = {10.1109/INFCOM.2005.1498566}, author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby} } @conference {16420, title = {Measurements for understanding the behavior of the genetic algorithm in dynamic environments: a case study using the Shaky Ladder Hyperplane-Defined Functions}, booktitle = {Proceedings of the 2005 workshops on Genetic and evolutionary computation}, series = {GECCO {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {32 - 38}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe a set of measures to examine the behavior of the Genetic Algorithm (GA) in dynamic environments. We describe how to use both average and best measures to look at performance, satisficability, robustness, and diversity. We use these measures to examine GA behavior with a recently devised dynamic test suite, the Shaky Ladder Hyperplane-Defined Functions (sl-hdf{\textquoteright}s). This test suite can generate random problems with similar levels of difficulty and provides a platform allowing systematic controlled observations of the GA in dynamic environments. We examine the results of these measures in two different versions of the sl-hdf{\textquoteright}s, one static and one regularly-changing. We provide explanations for the observations in these two different environments, and give suggestions as to future work.}, keywords = {dynamic environments, Genetic algorithms, hyperplane-defined functions, measurement}, doi = {10.1145/1102256.1102263}, url = {http://doi.acm.org/10.1145/1102256.1102263}, author = {Rand, William and Riolo,Rick} } @conference {18402, title = {Measuring productivity on high performance computers}, booktitle = {11th IEEE International Symposium on Software Metric}, year = {2005}, month = {2005///}, abstract = {In the high performance computing domain, the speed ofexecution of a program has typically been the primary performance metric. But productivity is also of concern to high performance computing developers. In this paper we will discuss the problems of defining and measuring productivity for these machines and we develop a model of productivity that includes both a performance component and a component that measures the development time of the program. We ran several experiments using students in high performance courses at several universities, and we report on those results with respect to our model of productivity. }, author = {Zelkowitz, Marvin V and Basili, Victor R. and Asgari, S. and Hochstein, L. and Hollingsworth, Jeffrey K and Nakamura, T.} } @article {17292, title = {MediaFinder: An Interface for Dynamic Personal Media Management with Semantic Regions (2003)}, year = {2005}, month = {2005///}, abstract = {Computer users deal with large amounts of personal media often face problems in managing and exploring it. This paper presents Semantic Regions, rectangular regions that enable users to specify their semantics or mental models, and the MediaFinder application, which uses Semantic Regions as the basis of a personal media management tool.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6499}, author = {Kang,Hyunmo and Shneiderman, Ben} } @inbook {14707, title = {Merging Network Measurement with Data Transport}, booktitle = {Passive and Active Network MeasurementPassive and Active Network Measurement}, series = {Lecture Notes in Computer Science}, volume = {3431}, year = {2005}, month = {2005///}, pages = {368 - 371}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The tasks of measurement and data transport are often treated independently, but we believe there are benefits to bringing them together. This paper proposes the simple idea of a transport agent to encapsulate useful data within probe packets in place of useless padding.}, isbn = {978-3-540-25520-8}, url = {http://dx.doi.org/10.1007/978-3-540-31966-5_36}, author = {Papageorgiou,Pavlos and Hicks, Michael W.}, editor = {Dovrolis,Constantinos} } @article {14821, title = {Mesh saliency}, journal = {ACM transactions on graphics}, volume = {24}, year = {2005}, month = {2005/07//}, pages = {659 - 666}, abstract = {Research over the last decade has built a solid mathematical foundation for representation and analysis of 3D meshes in graphics and geometric modeling. Much of this work however does not explicitly incorporate models of low-level human visual attention. In this paper we introduce the idea of mesh saliency as a measure of regional importance for graphics meshes. Our notion of saliency is inspired by low-level human visual system cues. We define mesh saliency in a scale-dependent manner using a center-surround operator on Gaussian-weighted mean curvatures. We observe that such a definition of mesh saliency is able to capture what most would classify as visually interesting regions on a mesh. The human-perception-inspired importance measure computed by our mesh saliency operator results in more visually pleasing results in processing and viewing of 3D meshes. compared to using a purely geometric measure of shape. such as curvature. We discuss how mesh saliency can be incorporated in graphics applications such as mesh simplification and viewpoint selection and present examples that show visually appealing results from using mesh saliency.}, keywords = {perception, saliency, simplification, viewpoint selection, visual attention}, isbn = {0730-0301}, doi = {10.1145/1073204.1073244}, url = {http://doi.acm.org/10.1145/1073204.1073244}, author = {Lee,Chang Ha and Varshney, Amitabh and Jacobs, David W.} } @conference {15924, title = {Metacognition for dropping and reconsidering intentions}, booktitle = {AAAI Spring Symposium on Metacognition in Computation}, year = {2005}, month = {2005///}, author = {Josyula,D. P and Anderson,M. L and Perlis, Don} } @article {11910, title = {Method and system for providing physical security in an area of interest}, volume = {10/916,545}, year = {2005}, month = {2005/03/10/}, abstract = {A system for detecting the presence of an intruder in a protected area utilizes a received signal strength indicator (RSSI) value of signals broadcast from transmitting stations deployed in the protected area. The system includes monitoring points for receiving broadcast signals, measuring the RSSI values of the received signals, and transmitting the measured RSSI values to a security system server. The security system server analyzes the RSSI values, and initiates security measures when the physical security of the protected area is violated which is detected when the measured RSSI values deviate from a predetermined strength of the broadcast signals. The security system also has the ability to track objects in the protected area and keep track of their movement in real time and report such movement. The system may be based on a Wi-Fi infrastructure in the protected area.}, url = {http://www.google.com/patents?id=VIaWAAAAEBAJ}, author = {Agrawala, Ashok K. and Youssef,Moustafa Amin and Shahamat,Layla} } @conference {12659, title = {A method for converting a smiling face to a neutral face with applications to face recognition}, booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/03//}, pages = {ii/977 - ii/980 Vol. 2 - ii/977 - ii/980 Vol. 2}, abstract = {The human face displays a variety of expressions, like smile, sorrow, surprise, etc. All these expressions constitute nonrigid motions of various features of the face. These expressions lead to a significant change in the appearance of a facial image which leads to a drop in the recognition accuracy of a face-recognition system trained with neutral faces. There are other factors like pose and illumination which also lead to performance drops. Researchers have proposed methods to tackle the effects of pose and illumination; however, there has been little work on how to tackle expressions. We attempt to address the issue of expression invariant face-recognition. We present preprocessing steps for converting a smiling face to a neutral face. We expect that this would in turn make the vector in the feature space to be closer to the correct vector in the gallery, in an appearance-based face recognition. This conjecture is supported by our recognition results which demonstrate that the accuracy goes up if we include the expression-normalization block.}, keywords = {appearance-based, Expression, Face, face;, feature, invariant, motion;, neutral, nonrigid, normalization;, recognition;, smiling}, doi = {10.1109/ICASSP.2005.1415570}, author = {Ramachandran, M. and Zhou,S. K and Jhalani, D. and Chellapa, Rama} } @article {13707, title = {A methodology for extrinsic evaluation of text summarization: Does ROUGE correlate}, journal = {Proceedings of the ACL Workshop on Intrinsic and Extrinsic Evaluation Measures for Machine Translation and/or Summarization}, year = {2005}, month = {2005///}, pages = {1 - 8}, abstract = {This paper demonstrates the usefulness of sum-maries in an extrinsic task of relevance judgment based on a new method for measuring agree- ment, Relevance-Prediction, which compares sub- jects{\textquoteright} judgments on summaries with their own judg- ments on full text documents. We demonstrate that, because this measure is more reliable than previ- ous gold-standard measures, we are able to make stronger statistical statements about the benefits of summarization. We found positive correlations be- tween ROUGE scores and two different summary types, where only weak or negative correlations were found using other agreement measures. How- ever, we show that ROUGE may be sensitive to the choice of summarization style. We discuss the im- portance of these results and the implications for fu- ture summarization evaluations. }, author = {Dorr, Bonnie J and Monz,C. and President,S. and Schwartz,R. and Zajic, David} } @conference {12108, title = {A metric space for productivity measurement in software development}, booktitle = {Proceedings of the second international workshop on Software engineering for high performance computing system applications}, series = {SE-HPCS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {13 - 16}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We define a metric space to measure the contributions of individual programmers to a software development project. It allows us to measure the distance between the contributions of two different programmers as well as the absolute contribution of each individual programmer. Our metric is based on an action function that provides a picture of how one programmer{\textquoteright}s approach differs from another at each instance of time during the project. We apply our metric to data we collected from students taking a course in parallel programming. We display the pictures for two students who showed approximately equal contributions but who followed very different paths through the course.}, isbn = {1-59593-117-1}, doi = {10.1145/1145319.1145324}, url = {http://doi.acm.org/10.1145/1145319.1145324}, author = {Numrich,Robert W. and Hochstein, Lorin and Basili, Victor R.} } @article {12148, title = {Metrics of software architecture changes based on structural distance}, journal = {IEEE METRICS}, year = {2005}, month = {2005///}, pages = {8 - 8}, abstract = {Software architecture is an important form of abstrac-tion, representing the overall system structure and the re- lationship among components. When software is modified from one version to another, its architecture may change. Software modification involving architectural change is of- ten difficult when the change goes beyond the original ar- chitectural design, involving changes to the connectivity of multiple components. Existing research has looked at ar- chitectural change at the level of architecture metrics such as size, complexity, coupling and cohesion, which abstract a particular version of the software in isolation. In this pa- per, we argue that this level of abstraction is often too high to characterize some interesting aspects of the architectural change process, and propose an approach that takes into account the change in connectivity from version to version of individual components. In this approach, two endpoints of a major change are taken as reference points, and inter- mediate connectivity changes are examined relative to the endpoints. We define a distance measure between software structures using a graph kernel function, which is quite powerful as it is applicable to any software structure repre- sentable as a graph. Using this distance measure, we define a metric which models the architecture change as a transi- tion between two endpoints. In addition to theoretical anal- ysis of the approach, we present empirical results obtained by applying the approach to open-source software projects to evaluate its validity and usefulness. }, author = {Nakamura, T. and Basili, Victor R.} } @article {16646, title = {Mirror symmetric topographic maps can arise from activity-dependent synaptic changes}, journal = {Neural computation}, volume = {17}, year = {2005}, month = {2005///}, pages = {1059 - 1083}, author = {Schulz,R. and Reggia, James A.} } @conference {12281, title = {Misbehaving TCP receivers can cause internet-wide congestion collapse}, booktitle = {Proceedings of the 12th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {383 - 392}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {An optimistic acknowledgment (opt-ack) is an acknowledgment sent by a misbehaving client for a data segment that it has not received. Whereas previous work has focused on opt-ack as a means to greedily improve end-to-end performance, we study opt-ack exclusively as a denial of service attack. Specifically, an attacker sends optimistic acknowledgments to many victims in parallel, thereby amplifying its effective bandwidth by a factor of 30 million (worst case). Thus, even a relatively modest attacker can totally saturate the paths from many victims back to the attacker. Worse, a distributed network of compromised machines ("zombies") attacking in parallel can exploit over-provisioning in the Internet to bring about wide-spread, sustained congestion collapse.We implement this attack both in simulation and in a wide-area network, and show it severity both in terms of number of packets and total traffic generated. We engineer and implement a novel solution that does not require client or network modifications allowing for practical deployment. Additionally, we demonstrate the solution{\textquoteright}s efficiency on a real network.}, keywords = {Congestion control, distributed denial of service}, isbn = {1-59593-226-7}, doi = {10.1145/1102120.1102170}, url = {http://doi.acm.org/10.1145/1102120.1102170}, author = {Sherwood,Rob and Bhattacharjee, Bobby and Braud,Ryan} } @conference {14986, title = {Mitigating risk of data loss in preservation environments}, booktitle = {Mass Storage Systems and Technologies, 2005. Proceedings. 22nd IEEE / 13th NASA Goddard Conference on}, year = {2005}, month = {2005/04//}, pages = {39 - 48}, abstract = {Preservation environments manage digital records for time periods that are much longer than that of a single vendor product. A primary requirement is the preservation of the authenticity and integrity of the digital records while simultaneously minimizing the cost of long-term storage, as the data is migrated onto successive generations of technology. The emergence of low-cost storage hardware has made it possible to implement innovative software systems that minimize risk of data loss and preserve authenticity and integrity. This paper describes software mechanisms in use in current persistent archives and presents an example based upon the NARA research prototype persistent archive.}, keywords = {archives;, authentication;, authenticity;, computing;, data, databases;, digital, distributed, environment;, Grid, integrity;, management;, message, objects;, persistent, preservation, record, risk, storage}, doi = {10.1109/MSST.2005.20}, author = {Moore,R.W. and JaJa, Joseph F. and Chadduck,R.} } @conference {13602, title = {Model of Object-Based Coding for Surveillance Video}, booktitle = {Proceedings in the ICASSP{\textquoteright}04 IEEE International Conference on Computer Vision}, year = {2005}, month = {2005/03//}, pages = {693 - 696}, abstract = {In this paper, we explore the model of potential savingsof object-based coding for surveillance video. Moving foreground objects in stationary camera surveillance video are detected by a background subtraction technique [3] and encoded with MPEG-4 object-based coding. Experiment results show that compared with frame-based coding, object-based coding can achieve significant savings which are dependent on the video content. We further model the relationship of compression efficiency and the number and size of video objects using statistical learning method. Simulations show that the model is representative. The model can be used to predict the savings of object-based coding and select the coding methods for surveillance video. }, author = {Yu,Yang and David Doermann} } @article {13387, title = {Model-based approximate querying in sensor networks}, journal = {The VLDB Journal}, volume = {14}, year = {2005}, month = {2005///}, pages = {417 - 443}, abstract = {Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that {\textquotedblleft}the sensornet is a database{\textquotedblright} is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor readings onto physical reality, a model of that reality is required to complement the readings. In this article, we enrich interactive sensor querying with statistical modeling techniques. We demonstrate that such models can help provide answers that are both more meaningful, and, by introducing approximations with probabilistic confidences, significantly more efficient to compute in both time and energy. Utilizing the combination of a model and live data acquisition raises the challenging optimization problem of selecting the best sensor readings to acquire, balancing the increase in the confidence of our answer against the communication and data acquisition costs in the network. We describe an exponential time algorithm for finding the optimal solution to this optimization problem, and a polynomial-time heuristic for identifying solutions that perform well in practice. We evaluate our approach on several real-world sensor-network datasets, taking into account the real measured data and communication quality, demonstrating that our model-based approach provides a high-fidelity representation of the real phenomena and leads to significant performance gains versus traditional data acquisition techniques.}, isbn = {1066-8888}, url = {http://dx.doi.org/10.1007/s00778-005-0159-3}, author = {Deshpande, Amol and Guestrin,Carlos and Madden,Samuel and Hellerstein,Joseph and Wei Hong} } @conference {12394, title = {Modeling image processing systems with homogeneous parameterized dataflow graphs}, booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on}, volume = {5}, year = {2005}, month = {2005/03//}, pages = {v/133 - v/136 Vol. 5 - v/133 - v/136 Vol. 5}, abstract = {We describe a new dataflow model called homogeneous parameterized dataflow (HPDF). This form of dynamic dataflow graph takes advantage of the fact that in a large number of image processing applications, data production and consumption rates, though dynamic, are equal across graph edges for any particular iteration, which leads to a homogeneous rate of actor execution, even though data production and consumption values are dynamic and vary across graph edges. We discuss existing dataflow models and formulate in detail the HPDF model. We develop examples of applications that are described naturally in terms of HPDF semantics and present experimental results that demonstrate the efficacy of the HPDF approach.}, keywords = {data consumption, data flow graphs, data production, dynamic dataflow graph, graph edges, homogeneous parameterized dataflow graphs, IMAGE PROCESSING, image processing system modeling, iteration, iterative methods}, doi = {10.1109/ICASSP.2005.1416258}, author = {Sen,Mainak and Bhattacharyya, Shuvra S. and Lv,Tiehan and Wolf,W.} } @conference {15135, title = {Modeling insider attacks on group key-exchange protocols}, booktitle = {Proceedings of the 12th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {180 - 189}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Protocols for authenticated key exchange (AKE) allow parties within an insecure network to establish a common session key which can then be used to secure their future communication. It is fair to say that group AKE is currently less well understood than the case of two-party AKE; in particular, attacks by malicious insiders --- a concern specific to the group setting --- have so far been considered only in a relatively "ad-hoc" fashion. The main contribution of this work is to address this deficiency by providing a formal, comprehensive model and definition of security for group AKE which automatically encompasses insider attacks. We do so by defining an appropriate ideal functionality for group AKE within the universal composability (UC) framework. As a side benefit, any protocol secure with respect to our definition is secure even when run concurrently with other protocols, and the key generated by any such protocol may be used securely in any subsequent application.In addition to proposing this definition, we show that the resulting notion of security is strictly stronger than the one proposed by Bresson, et al. (termed "AKE-security"), and that our definition implies all previously-suggested notions of security against insider attacks. We also show a simple technique for converting any AKE-secure protocol into one secure with respect to our definition.}, keywords = {group key exchange, insider attacks, universal composability}, isbn = {1-59593-226-7}, doi = {10.1145/1102120.1102146}, url = {http://doi.acm.org/10.1145/1102120.1102146}, author = {Katz, Jonathan and Shin,Ji Sun} } @article {12350, title = {Modeling of block-based DSP systems}, journal = {The Journal of VLSI Signal Processing}, volume = {40}, year = {2005}, month = {2005///}, pages = {289 - 299}, author = {Ko,D. I and Bhattacharyya, Shuvra S.} } @article {13307, title = {Morse-Smale decompositions for modeling terrain knowledge}, journal = {Spatial Information Theory}, year = {2005}, month = {2005///}, pages = {426 - 444}, abstract = {In this paper, we describe, analyze and compare techniques for extracting spatial knowledge from a terrain model. Specifically, we investigate techniques for extracting a morphological representation from a terrain model based on an approximation of a Morse-Smale complex. A Morse-Smale complex defines a decomposition of a topographic surface into regions with vertices at the critical points and bounded by integral lines which connect passes to pits and peaks. This provides a terrain representation which encompasses the knowledge on the salient characteristics of the terrain. We classify the various techniques for computing a Morse-Smale complexe based on the underlying terrain model, a Regular Square Grid (RSG) or a Triangulated Irregular Network (TIN), and based on the algorithmic approach they apply. Finally, we discuss hierarchical terrain representations based on a Morse-Smale decomposition.}, doi = {10.1007/11556114_27}, author = {{\v C}omi{\'c},L. and De Floriani, Leila and Papaleo,L.} } @conference {18887, title = {A motion closed world asumption}, volume = {19}, year = {2005}, month = {2005///}, pages = {621 - 621}, abstract = {Yaman et. al. [Yaman et al., 2004] introduce {\textquotedblleft}gotheories{\textquotedblright} to reason about moving objects. In this paper, we show that this logic often does not allow us to infer that an object is not present at a given place or region, even though common sense would dictate that this is a reasonable inference to make. We define a class of models of go-theories called coherent models. We use this concept to define a motion closed world assumption (MCWA) and de- velop a notion of MCWA-entailment. We show that checking if a go-theory has a coherent model is NP-complete. An in atom checks if a given ob- ject is present in a given region sometime in a given time interval. We provide sound and complete al- gorithms to check if a ground in literal (positive or negative in atom) can be inferred from a go- theory using the MCWA. In our experiments our algorithms answer such queries in less than 1 sec- ond when there are up to 1,000 go-atoms per object. }, url = {http://ijcai.org/papers/1227.pdf}, author = {Yaman,F. and Nau, Dana S. and V.S. Subrahmanian} } @article {14230, title = {Motion segmentation using occlusions}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {27}, year = {2005}, month = {2005/06//}, pages = {988 - 992}, abstract = {We examine the key role of occlusions in finding independently moving objects instantaneously in a video obtained by a moving camera with a restricted field of view. In this problem, the image motion is caused by the combined effect of camera motion (egomotion), structure (depth), and the independent motion of scene entities. For a camera with a restricted field of view undergoing a small motion between frames, there exists, in general, a set of 3D camera motions compatible with the observed flow field even if only a small amount of noise is present, leading to ambiguous 3D motion estimates. If separable sets of solutions exist, motion-based clustering can detect one category of moving objects. Even if a single inseparable set of solutions is found, we show that occlusion information can be used to find ordinal depth, which is critical in identifying a new class of moving objects. In order to find ordinal depth, occlusions must not only be known, but they must also be filled (grouped) with optical flow from neighboring regions. We present a novel algorithm for filling occlusions and deducing ordinal depth under general circumstances. Finally, we describe another category of moving objects which is detected using cardinal comparisons between structure from motion and structure estimates from another source (e.g., stereo).}, keywords = {3D motion estimation, algorithms, Artificial intelligence, CAMERAS, Computer vision, Filling, hidden feature removal, Image Enhancement, Image Interpretation, Computer-Assisted, image motion, Image motion analysis, Image segmentation, Layout, MOTION, Motion detection, Motion estimation, motion segmentation, Movement, Object detection, occlusion, occlusions, optical flow, ordinal depth, Pattern Recognition, Automated, Photography, Reproducibility of results, segmentation, Semiconductor device modeling, Sensitivity and Specificity, video analysis., Video Recording}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2005.123}, author = {Ogale, A. S and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {17298, title = {Motivating annotation for personal digital photo libraries: Lowering barriers while raising incentives}, journal = {University of Marlyand}, year = {2005}, month = {2005///}, abstract = {The value of personal digital photo libraries grows immensely when users invest effort to annotate their photos. Frameworksfor understanding annotation requirements could guide improved strategies that would motivate more users to invest the necessary effort. We propose one framework for annotation techniques along with the strengths and weaknesses of each one, and a second framework for target user groups and their motivations. Several applications are described that provide useful and information-rich representations, but which require good annotations, in the hope of providing incentives for high quality annotation. We describe how annotations make possible four novel presentations of personal photo collections: (1) Birthday Collage to show growth of a child over several years, (2) FamiliarFace to show family trees of photos, (3) Kaleidoscope to show photos of related people in an appealing tableau, and (4) TripPics to show photos from a sequential story such as a vacation trip. }, author = {Kustanowitz,J. and Shneiderman, Ben} } @inbook {12670, title = {Moving Object Detection and Compression in IR Sequences}, booktitle = {Computer Vision Beyond the Visible SpectrumComputer Vision Beyond the Visible Spectrum}, series = {Advances in Pattern Recognition}, year = {2005}, month = {2005///}, pages = {141 - 165}, publisher = {Springer London}, organization = {Springer London}, abstract = {We consider the problem of remote surveillance using infrared (IR) sensors. The aim is to use IR image sequences to detect moving objects (humans or vehicles), and to transmit a few {\textquotedblleft}best-view images{\textquotedblright} of every new object that is detected. Since the available bandwidth is usually low, if the object chip is big, it needs to be compressed before being transmitted. Due to low computational power of computing devices attached to the sensor, the algorithms should be computationally simple. We present two approaches for object detection {\textemdash} one which specifically solves the more difficult long-range object detection problem, and the other for objects at short range. For objects at short range, we also present techniques for selecting a single best-view object chip and computationally simple techniques for compressing it to very low bit rates due to the channel bandwidth constraint. A fast image chip compression scheme implemented in the wavelet domain by combining a non-iterative zerotree coding method with 2D-DPCM for both low-and high-frequency subbands is presented. Comparisons with some existing schemes are also included. The object detection and compression algorithms have been implemented in C/C++ and their performance has been evaluated using the Hitachi{\textquoteright}s SH4 platform with software simulation.}, isbn = {978-1-84628-065-8}, url = {http://dx.doi.org/10.1007/1-84628-065-6_5}, author = {Vaswani,Namrata and Agrawal,Amit and Qinfen Zheng and Chellapa, Rama}, editor = {Bhanu,Bir and Pavlidis,Ioannis} } @conference {12665, title = {Moving Object Segmentation and Dynamic Scene Reconstruction Using Two Frames}, booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005//18/23}, pages = {705 - 708}, keywords = {3D, analysis;, constraints;, dynamic, ego-motion, estimation;, flow, image, images;, independent, INTENSITY, least, mean, median, method;, methods;, model;, MOTION, motion;, moving, object, of, parallax, parallax;, parametric, processing;, reconstruction;, scene, segmentation;, signal, squares, squares;, static, structure;, subspace, surface, translational, two-frame, unconstrained, video}, doi = {10.1109/ICASSP.2005.1415502}, author = {Agrawala, Ashok K. and Chellapa, Rama} } @book {18251, title = {Multimedia fingerprinting forensics for traitor tracing}, year = {2005}, month = {2005///}, publisher = {Hindawi Pub Corp}, organization = {Hindawi Pub Corp}, author = {KJR Liu, W. Trappe, Z.J. Wang, M. Wu,H Zhao} } @conference {13310, title = {Multi-resolution out-of-core modeling of terrain and geological data}, booktitle = {Proceedings of the 13th annual ACM international workshop on Geographic information systems}, series = {GIS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {143 - 152}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Multi-resolution is a useful tool for managing the complexity of huge terrain and geological data sets. Since encoding large data sets may easily exceed main memory capabilities, data structures and algorithms capable of efficiently working in external memory are needed. In our work, we aim at developing an out-of-core multi-resolution model dimension-independent, that can be used for both terrains, represented by Triangulated Irregular Networks(TINs), and 3D data, such as geological data, represented by tetrahedral meshes. We have based our approach on a general multi-resolution model, that we have proposed in our previous work, which supports the extraction of variable-resolution representations. As first step, we have developed, in a prototype simulation system, a large number of clustering techniques for the modifications in a multi-resolution model. Here, we describe such techniques, and analyze and evaluate them experimentally. The result of this investigation has led us to select a specific clustering approach as the basis for an efficient out-of-core data structure.}, keywords = {Multi-resolution, out-of-core, terrain models}, isbn = {1-59593-146-5}, doi = {10.1145/1097064.1097085}, url = {http://doi.acm.org/10.1145/1097064.1097085}, author = {Danovaro,Emanuele and De Floriani, Leila and Puppo,Enrico and Samet, Hanan} } @conference {19665, title = {Multitarget tracking with split and merged measurements}, booktitle = {IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005. CVPR 2005}, volume = {1}, year = {2005}, month = {2005/06//}, pages = {605 - 610 vol. 1}, abstract = {In many multitarget tracking applications in computer vision, a detection algorithm provides locations of potential targets. Subsequently, the measurements are associated with previously estimated target trajectories in a data association step. The output of the detector is often imperfect and the detection data may include multiple, split measurements from a single target or a single merged measurement from several targets. To address this problem, we introduce a multiple hypothesis tracker for interacting targets that generate split and merged measurements. The tracker is based on an efficient Markov chain Monte Carlo (MCMC) based auxiliary variable particle filter. The particle filter is Rao-Blackwellized such that the continuous target state parameters are estimated analytically, and an MCMC sampler generates samples from the large discrete space of data associations. In addition, we include experimental results in a scenario where we track several interacting targets that generate these split and merged measurements.}, keywords = {Application software, Computer vision, Detection algorithms, Detectors, filtering theory, Markov chain Monte Carlo based auxiliary variable particle filter, Markov processes, merged measurements, Monte Carlo methods, multiple hypothesis tracker, multitarget tracking, parameter estimation, Particle filters, Particle tracking, Rao-Blackwellized filter, split measurements, target tracking, Trajectory}, author = {Zia Khan and Balch, T. and Dellaert, F.} } @conference {14710, title = {Mutatis mutandis: safe and predictable dynamic software updating}, booktitle = {Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, series = {POPL {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {183 - 194}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynamic updating has been used for many years. Perhaps surprisingly, there is little high-level understanding or language support to help programmers write dynamic updates effectively.To bridge this gap, we present Proteus, a core calculus for dynamic software updating in C-like languages that is flexible, safe, and predictable. Proteus supports dynamic updates to functions (even active ones), to named types and to data, allowing on-line evolution to match source-code evolution as we have observed it in practice. We ensure updates are type-safe by checking for a property we call "con-freeness" for updated types t at the point of update. This means that non-updated code will not use t concretely beyond that point (concrete usages are via explicit coercions) and thus t{\textquoteright}s representation can safely change. We show how con-freeness can be enforced dynamically for a particular program state. We additionally define a novel and efficient static updateability analysis to establish con-freeness statically, and can thus automatically infer program points at which all future (well-formed) updates will be type-safe. We have implemented our analysis for C and tested it on several well-known programs.}, keywords = {capability, dynamic software updating, proteus, Type inference, updateability analysis}, isbn = {1-58113-830-X}, doi = {10.1145/1040305.1040321}, url = {http://doi.acm.org/10.1145/1040305.1040321}, author = {Stoyle,Gareth and Hicks, Michael W. and Bierman,Gavin and Sewell,Peter and Neamtiu,Iulian} } @article {13592, title = {Machine printed text and handwriting identification in noisy document images}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {26}, year = {2004}, month = {2004/03//}, pages = {337 - 353}, abstract = {In this paper, we address the problem of the identification of text in noisy document images. We are especially focused on segmenting and identifying between handwriting and machine printed text because: 1) Handwriting in a document often indicates corrections, additions, or other supplemental information that should be treated differently from the main content and 2) the segmentation and recognition techniques requested for machine printed and handwritten text are significantly different. A novel aspect of our approach is that we treat noise as a separate class and model noise based on selected features. Trained Fisher classifiers are used to identify machine printed text and handwriting from noise and we further exploit context to refine the classification. A Markov Random Field-based (MRF) approach is used to model the geometrical structure of the printed text, handwriting, and noise to rectify misclassifications. Experimental results show that our approach is robust and can significantly improve page segmentation in noisy document collections.}, keywords = {Automated;Reading;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted;Information Storage and Retrieval;Models, Computer-Assisted;Pattern Recognition, Computer-Assisted;Stochastic Processes;Subtraction Technique;User-Computer Interface;Writing;, Markov random field;fisher classifiers;handwriting identification;machine printed text;noisy document images;page segmentation;recognition techniques;text identification;Markov processes;document image processing;feature extraction;handwriting recognition, Statistical;Numerical Analysis}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2004.1262324}, author = {Yefeng Zheng and Huiping Li and David Doermann} } @article {17804, title = {Maintaining RDF views}, year = {2004}, month = {2004///}, institution = {Tech. Rep. CS-TR-4612 (UMIACS-TR-2004-54)}, abstract = {Resource Description Framework (RDF) has been recommended bythe World Wide Web Consortium for integrating web data. RDF specifications are increasingly being stored in RDF databases. Many applications will maintain views over RDF databases {\textendash} these views may describe resources of interest to the owner of the views. As data about the resources available on the web is subject to frequent change, there is a need to incrementally maintain such views. We present algorithms to maintain materialized RDF views when data is inserted into, deleted from, or modified in RDF database instances. We have developed a prototype of our algorithms. For each of these three cases, we compare the performance of our algorithm against the naive approach of storing RDF data in a relational database and using the standard view maintenance algorithm }, author = {Deng,Y. and Hung,E. and V.S. Subrahmanian} } @inbook {16889, title = {Maintenance of Spatial Semijoin Queries on Moving Points}, booktitle = {Proceedings 2004 VLDB ConferenceProceedings 2004 VLDB Conference}, year = {2004}, month = {2004///}, pages = {828 - 839}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, address = {St Louis}, abstract = {In this paper, we address the maintenance of spatial semijoin queries over continuously moving points, where points are modeled as linear functions of time. This is analogous to the maintenance of a materialized view except, as time advances, the query result may change independently of updates. As in a materialized view, we assume there is no prior knowledge of updates before they occur. We present a new approach, continuous fuzzy sets (CFS), to maintain continuous spatial semijoins efficiently. CFS is compared experimentally to a simple scaling of previous work. The result is significantly better performance of CFS compared to previous work by up to an order of magnitude in some cases.}, isbn = {978-0-12-088469-8}, url = {http://www.sciencedirect.com/science/article/pii/B9780120884698500735}, author = {Iwerks,Glenn S. and Samet, Hanan and Smith,Kenneth P.} } @article {18512, title = {Managing the 802.11 energy/performance tradeoff with machine learning}, volume = {MIT-CSAIL-TR-2004-068}, year = {2004}, month = {2004///}, institution = {Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory}, abstract = {This paper addresses the problem of managing the tradeoff betweenenergy consumption and performance in wireless devices implementingthe IEEE 802.11 standard. To save energy, the 802.11 specificationproposes a power-saving mode (PSM), where a device can sleep to saveenergy, periodically waking up to receive packets from a neighbor(e.g., an access point) that may have buffered packets for thesleeping device. Previous work has shown that a fixed polling time forwaking up degrades the performance of Web transfers, because networkactivity is bursty and time-varying. We apply a new online machinelearning algorithm to this problem and show, using ns simulation andtrace analysis, that it is able to adapt well to network activity. Thelearning process makes no assumptions about the underlying networkactivity being stationary or even Markov. Our learning power-savingalgorithm, LPSM, guides the learning using a "loss function" thatcombines the increased latency from potentially sleeping too long andthe wasted use of energy in waking up too soon. In our nssimulations, LPSM saved 7\%-20\% more energy than 802.11 in power-savingmode, with an associated increase in average latency by a factor of1.02, and not more than 1.2. LPSM is straightforward to implementwithin the 802.11 PSM framework.}, url = {http://hdl.handle.net/1721.1/30499}, author = {Monteleoni,C. and Balakrishnan,H. and Feamster, Nick and Jaakkola,T.} } @article {15861, title = {Mandarin-English Information (MEI): investigating translingual speech retrieval}, journal = {Computer Speech \& Language}, volume = {18}, year = {2004}, month = {2004/04//}, pages = {163 - 179}, abstract = {This paper describes the Mandarin{\^a}{\texteuro}{\textquotedblleft}English Information (MEI) project, where we investigated the problem of cross-language spoken document retrieval (CL-SDR), and developed one of the first English{\^a}{\texteuro}{\textquotedblleft}Chinese CL-SDR systems. Our system accepts an entire English news story (text) as query, and retrieves relevant Chinese broadcast news stories (audio) from the document collection. Hence, this is a cross-language and cross-media retrieval task. We applied a multi-scale approach to our problem, which unifies the use of phrases, words and subwords in retrieval. The English queries are translated into Chinese by means of a dictionary-based approach, where we have integrated phrase-based translation with word-by-word translation. Untranslatable named entities are transliterated by a novel subword translation technique. The multi-scale approach can be divided into three subtasks {\^a}{\texteuro}{\textquotedblleft} multi-scale query formulation, multi-scale audio indexing (by speech recognition) and multi-scale retrieval. Experimental results demonstrate that the use of phrase-based translation and subword translation gave performance gains, and multi-scale retrieval outperforms word-based retrieval.}, keywords = {English{\^a}{\texteuro}{\textquotedblleft}Chinese cross-language spoken document retrieval, Multi-scale spoken document retrieval}, isbn = {0885-2308}, doi = {10.1016/j.csl.2003.09.003}, url = {http://www.sciencedirect.com/science/article/pii/S0885230803000524}, author = {Meng,Helen M. and Chen,Berlin and Khudanpur,Sanjeev and Levow,Gina-Anne and Lo,Wai-Kit and Oard, Douglas and Schone,Patrick and Tang,Karen and Wang,Hsin-Min and Wang,Jianqiang} } @article {17800, title = {MASS: Multiagent Security and Survivability}, journal = {Monitoring, Security and Rescue Techniques in Multiagent Systems}, year = {2004}, month = {2004///}, pages = {112 - 112}, abstract = {Multiagent applications are not likely to be very useful in thereal world if they are unable to ensure the security and survivability of agents in the multiagent system. In this talk, I will focus on survivabil- ity of MASs and present a set of architectures that can greatly enhance survivability of MASs. I will discuss the advantages and disadvantages of the architectures and discuss their impact on scalability of the MAS applications. The talk reflects joint work with S. Kraus, C. Tas and Y. Zhang. }, author = {V.S. Subrahmanian} } @inbook {19651, title = {An MCMC-Based Particle Filter for Tracking Multiple Interacting Targets}, booktitle = {Computer Vision - ECCV 2004}, series = {Lecture Notes in Computer Science}, year = {2004}, month = {2004/01/01/}, pages = {279 - 290}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or behavior of other targets. Such interactions cause problems for traditional approaches to the data association problem. In response, we developed a joint tracker that includes a more sophisticated motion model to maintain the identity of targets throughout an interaction, drastically reducing tracker failures. The paper presents two main contributions: (1) we show how a Markov random field (MRF) motion prior, built on the fly at each time step, can substantially improve tracking when targets interact, and (2) we show how this can be done efficiently using Markov chain Monte Carlo (MCMC) sampling. We prove that incorporating an MRF to model interactions is equivalent to adding an additional interaction factor to the importance weights in a joint particle filter. Since a joint particle filter suffers from exponential complexity in the number of tracked targets, we replace the traditional importance sampling step in the particle filter with an MCMC sampling step. The resulting filter deals efficiently and effectively with complicated interactions when targets approach each other. We present both qualitative and quantitative results to substantiate the claims made in the paper, including a large scale experiment on a video-sequence of over 10,000 frames in length.}, keywords = {Artificial Intelligence (incl. Robotics), Computer Graphics, Image Processing and Computer Vision, pattern recognition}, isbn = {978-3-540-21981-1, 978-3-540-24673-2}, url = {http://link.springer.com/chapter/10.1007/978-3-540-24673-2_23}, author = {Zia Khan and Balch, Tucker and Dellaert, Frank}, editor = {Pajdla, Tom{\'a}s and Matas, Ji{\v r}{\'\i}} } @conference {12291, title = {Measurement based optimal multi-path routing}, booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, volume = {1}, year = {2004}, month = {2004/03//}, pages = {187 - 196}, abstract = {We propose a new architecture for efficient network monitoring and measurements in a traditional IP network. This new architecture enables establishment of multiple paths (tunnels) between source-destination pairs without having to modify the underlying routing protocol(s). Based on the proposed architecture we propose a measurement-based multipath routing algorithm derived from simultaneous perturbation stochastic approximation. The proposed algorithm does not assume that the gradient of analytical cost function is known to the algorithm, but rather relies on noisy estimates from measurements. Using the analytical model presented in the paper we prove the convergence of the algorithm to the optimal solution. Simulation results are presented to demonstrate the advantages of the proposed algorithm under a variety of network scenarios. A comparative study with an existing optimal routing algorithm, MATE, is also provided}, keywords = {algorithm;network, approximation;routing, IP, measurement;network, monitoring;optimization;perturbation, multipath, network;measurement-based, networks;Internet;optimisation;routing, processes;, protocol;IP, protocols;stochastic, Routing, Stochastic}, doi = {10.1109/INFCOM.2004.1354493}, author = {Guven,T. and Kommareddy,C. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby} } @article {16334, title = {Measuring HPC productivity}, journal = {International Journal of High Performance Computing Applications}, volume = {18}, year = {2004}, month = {2004///}, pages = {459 - 473}, author = {Faulk,S. and Gustafson,J. and Johnson,P. and Porter, Adam and Tichy,W. and Votta,L.} } @article {17624, title = {Method of designing signaling networks for internet telephony}, volume = {:~09/517,658}, year = {2004}, month = {2004/02/03/}, abstract = {A method is disclosed for designing a signaling network of call coordinators (CCs) for internet telephony. The new method can be used to design a CC network of arbitrary size that satisfies, with high probability, limitations on the maximum number of sockets per CC and on the maximum number of hops between an arbitrary pair of switches in the network. According to the disclosed method, the network of CCs is treated initially as a collection of isolated points, one point for each CC. Then, links are added between pairs of CCs, excluding pairs lying within the same switch. The links are added randomly, but with a particular probability p, which may be different for different pairs. Thus, whether a given link is added depends, in effect, upon the outcome of a loaded coin toss in which the probability of a positive outcome is p.}, url = {http://www.google.com/patents?id=VTsSAAAAEBAJ}, author = {Aravamudan,Murali and Kumaran,Krishnan and Ramakrishnan,Kajamalai Gopalaswamy and Srinivasan, Aravind}, editor = {Lucent Technologies Inc.} } @article {13232, title = {Mining tool for surveillance video}, journal = {SPIE 16th International Symposium on Electronic Imaging, Storage and Retrieval Methods and Applications for Multimedia}, volume = {5307}, year = {2004}, month = {2004///}, pages = {259 - 270}, abstract = {This paper describes a system for the mining of surveillance video. Our main contributions are: providing ahigh level query language for submitting queries about spatial and temporal relations of background regions and moving entities, and about human activities; providing a compiler to map high level queries into a set of novel Petri net filters that utilize computer vision algorithms to answer components of the queries; and providing a powerful graphical interface where users have the ability to formulate the query visually. }, author = {Ghanem,N.M. and David Doermann and Davis, Larry S. and DeMenthon,D.} } @conference {13597, title = {Mining Tools for Surveillance Video}, booktitle = {Proceedings in SPIE 16th International Symposium on Electronic Imaging}, year = {2004}, month = {2004/01//}, pages = {5307 259-270 - 5307 259-270}, author = {Ghanem,N. and David Doermann and Davis, Larry S. and DeMenthon,D.} } @conference {13902, title = {Mixing ideas: a new technique for working with young children as design partners}, booktitle = {Proceedings of the 2004 conference on Interaction design and children: building a community}, year = {2004}, month = {2004///}, pages = {35 - 42}, author = {Guha,M.L. and Druin, Allison and Chipman,G. and Fails,J. A and Simms,S. and Farber,A.} } @article {18542, title = {A model of BGP routing for network engineering}, journal = {SIGMETRICS Perform. Eval. Rev.}, volume = {32}, year = {2004}, month = {2004/06//}, pages = {331 - 342}, abstract = {The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of the Internet can all degrade performance. To maintain good performance, network operators must continually reconfigure the routing protocols. Operators configure BGP to control how traffic flows to neighboring Autonomous Systems (ASes), as well as how traffic traverses their networks. However, because BGP route selection is distributed, indirectly controlled by configurable policies, and influenced by complex interactions with intradomain routing protocols, operators cannot predict how a particular BGP configuration would behave in practice. To avoid inadvertently degrading network performance, operators need to evaluate the effects of configuration changes before deploying them on a live network. We propose an algorithm that computes the outcome of the BGP route selection process for each router in a single AS, given only a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe a BGP emulator based on this algorithm; the emulator exploits the unique characteristics of routing data to reduce computational overhead. Using data from a large ISP, we show that the emulator correctly computes BGP routing decisions and has a running time that is acceptable for many tasks, such as traffic engineering and capacity planning.}, keywords = {BGP, modeling, Routing, traffic engineering}, isbn = {0163-5999}, doi = {10.1145/1012888.1005726}, url = {http://doi.acm.org/10.1145/1012888.1005726}, author = {Feamster, Nick and Winick,Jared and Rexford,Jennifer} } @article {15446, title = {Model-Based Approaches-Validating Quality of Service for Reusable Software Via Model-Integrated Distributed Continuous Quality Assurance}, journal = {Lecture Notes in Computer Science}, volume = {3107}, year = {2004}, month = {2004///}, pages = {286 - 295}, author = {Krishna,A. S and Schmidt,D. C and Memon, Atif M. and Porter, Adam and Sevilla,D.} } @article {15454, title = {A Model-based Distributed Continuous Quality Assurance Process to Enhance the Quality of Service of Evolving Performance-intensive Software Systems}, journal = {Proceedings of the 2nd ICSE Workshop on Remote Analysis and Measurement of Software Systems (RAMSS), Edinburgh, Scotland, UK}, year = {2004}, month = {2004///}, abstract = {Performance-intensive software, such as that found in high-perfo-rmance computing systems and distributed real-time and embedded systems, increasingly executes on a multitude of platforms and user contexts. To ensure that performance-intensive software meets its quality of service (QoS) requirements, it must often be fine-tuned to specific platforms/contexts by adjusting many (in some cases hun- dreds of) configuration options. Developers who write these types of systems must therefore try to ensure that their additions and mod- ifications work across this large configuration space. In practice, however, time and resource constraints often force developers to assess performance on very few configurations and to extrapolate from these to the entire configuration space, which allows many performance bottlenecks and sources of QoS degradation to escape detection until systems are fielded. To improve the assessment of performance across large config- uration spaces, we present a model-based approach to develop- ing and deploying a new distributed continuous quality assurance (DCQA) process. Our approach builds upon and extends the Skoll environment, which is developing and validating novel software QA processes and tools that leverage the extensive computing resources of worldwide user communities in a distributed, continuous man- ner to significantly and rapidly improve software quality. This pa- per describes how our new DCQA performance assessment process enables developers to run formally-designed screening experiments that isolate the most significant options. After that, exhaustive ex- periments (on the now much smaller configuration space) are con- ducted. We implemented this process using model-based software tools and executed it in the Skoll environment to demonstrate its ef- fectiveness via two experiments on widely used QoS-enabled mid- dleware. Our results show that model-based DCQA processes im- proves developer insight into the effect of system changes on per- formance at an acceptable cost. }, author = {Yilmaz,C. and Krishna,A. S and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @conference {13388, title = {Model-driven data acquisition in sensor networks}, booktitle = {Proceedings of the Thirtieth international conference on Very large data bases - Volume 30}, series = {VLDB {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {588 - 599}, publisher = {VLDB Endowment}, organization = {VLDB Endowment}, abstract = {Declarative queries are proving to be an attractive paradigm for ineracting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor readings onto physical reality, a model of that reality is required to complement the readings. In this paper, we enrich interactive sensor querying with statistical modeling techniques. We demonstrate that such models can help provide answers that are both more meaningful, and, by introducing approximations with probabilistic confidences, significantly more efficient to compute in both time and energy. Utilizing the combination of a model and live data acquisition raises the challenging optimization problem of selecting the best sensor readings to acquire, balancing the increase in the confidence of our answer against the communication and data acquisition costs in the network. We describe an exponential time algorithm for finding the optimal solution to this optimization problem, and a polynomial-time heuristic for identifying solutions that perform well in practice. We evaluate our approach on several real-world sensor-network data sets, taking into account the real measured data and communication quality, demonstrating that our model-based approach provides a high-fidelity representation of the real phenomena and leads to significant performance gains versus traditional data acquisition techniques.}, isbn = {0-12-088469-0}, url = {http://dl.acm.org/citation.cfm?id=1316689.1316741}, author = {Deshpande, Amol and Guestrin,Carlos and Madden,Samuel R. and Hellerstein,Joseph M. and Wei Hong} } @article {18520, title = {Modeling BGP route selection within an AS}, journal = {IEEE/ACM Transactions on Networking}, year = {2004}, month = {2004///}, abstract = {This paper presents a provably correct model that computes the out-come of the BGP decision process for each router in a single AS, without simulating the complex details of BGP message passing. The model requires only static inputs that can be easily obtained from the routers: the set of candidate routes to a destination (and the routers in the AS at which they were learned), import policies and other session-level parameters, and internal topology. We pro- pose algorithms for computing route selection under four different network configurations: with the MED attribute compared across all routes, and compared only across routes from the same neigh- boring AS; and with a {\textquotedblleft}full mesh{\textquotedblright} internal BGP (iBGP) topology versus an iBGP topology that uses a scalability technique called {\textquotedblleft}route reflection{\textquotedblright}. For each scenario, we derive general properties of the routes that routers ultimately select, present an efficient al- gorithm for computing the outcome of BGP route selection, and prove the algorithm{\textquoteright}s correctness. Studying the general properties and computational overhead of modeling the route selection pro- cess in each of these cases provides insights into the unnecessary complexity introduced by the MED attribute and route reflection; we use these insights to propose improvements to BGP that achieve the same goals as MED and route reflection without introducing the negative side effects of these features. We have implemented some of the algorithms from this paper in a prototype and have shown them to be efficient and accurate enough for many traffic engineer- ing tasks. }, author = {Feamster, Nick and Rexford,J.} } @article {17626, title = {Modelling disease outbreaks in realistic urban social networks}, journal = {Nature}, volume = {429}, year = {2004}, month = {2004/05/13/}, pages = {180 - 184}, abstract = {Most mathematical models for the spread of disease use differential equations based on uniform mixing assumptions1 or ad hoc models for the contact process2, 3, 4. Here we explore the use of dynamic bipartite graphs to model the physical contact patterns that result from movements of individuals between specific locations. The graphs are generated by large-scale individual-based urban traffic simulations built on actual census, land-use and population-mobility data. We find that the contact network among people is a strongly connected small-world-like5 graph with a well-defined scale for the degree distribution. However, the locations graph is scale-free6, which allows highly efficient outbreak detection by placing sensors in the hubs of the locations network. Within this large-scale simulation framework, we then analyse the relative merits of several proposed mitigation strategies for smallpox spread. Our results suggest that outbreaks can be contained by a strategy of targeted vaccination combined with early detection without resorting to mass vaccination of a population.}, isbn = {0028-0836}, doi = {10.1038/nature02541}, url = {http://www.nature.com/nature/journal/v429/n6988/full/nature02541.html}, author = {Eubank,Stephen and Guclu,Hasan and Kumar,V. S. Anil and Marathe,Madhav V. and Srinivasan, Aravind and Toroczkai,Zolt|[aacute]|n and Wang,Nan} } @article {17296, title = {Motivating annotation for digital photographs: Lowering barriers while raising incentives}, year = {2004}, month = {2004///}, abstract = {Frameworks for understanding annotation requirements could guide improved strategies that would motivate more users to invest the necessary effort. We propose one framework for annotation techniques along with the st rengths and weaknesses of each one, and a second framework for target user groups and their motivations. Several applications are described that provide useful and information-rich representations, but which require good annotations, in the hope of providing incentives for high quality annotation. We describe how annotations make possible four novel presentations of photo collections: (1) Birthday Collage to show growth of a child over several years, (2) FamiliarFace to show family trees of photos, (3) Kaleidoscope to show photos of related people in an appeal tableau, and (4) TripPics to show photos from a sequential story such as a vacation trip.}, author = {Kustanowitz,J. and Shneiderman, Ben} } @article {16369, title = {Mpjava: High-performance message passing in java using java. nio}, journal = {Languages and Compilers for Parallel Computing}, year = {2004}, month = {2004///}, pages = {323 - 339}, author = {Pugh, William and Spacco,J.} } @inbook {13830, title = {Multi-align: Combining Linguistic and Statistical Techniques to Improve Alignments for Adaptable MT}, booktitle = {Machine Translation: From Real Users to ResearchMachine Translation: From Real Users to Research}, series = {Lecture Notes in Computer Science}, volume = {3265}, year = {2004}, month = {2004///}, pages = {17 - 26}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {An adaptable statistical or hybrid MT system relies heavily on the quality of word-level alignments of real-world data. Statistical alignment approaches provide a reasonable initial estimate for word alignment. However, they cannot handle certain types of linguistic phenomena such as long-distance dependencies and structural differences between languages. We address this issue in Multi-Align, a new framework for incremental testing of different alignment algorithms and their combinations. Our design allows users to tune their systems to the properties of a particular genre/domain while still benefiting from general linguistic knowledge associated with a language pair. We demonstrate that a combination of statistical and linguistically-informed alignments can resolve translation divergences during the alignment process.}, isbn = {978-3-540-23300-8}, url = {http://dx.doi.org/10.1007/978-3-540-30194-3_3}, author = {Ayan,Necip and Dorr, Bonnie J and Habash,Nizar}, editor = {Frederking,Robert and Taylor,Kathryn} } @article {13226, title = {Multi-cue exemplar-based nonparametric model for gesture recognition}, journal = {Indian Conference on Computer Vision, Graphics and Image Processing}, year = {2004}, month = {2004///}, pages = {16 - 18}, abstract = {This paper presents an approach for a multi-cue, view-based recognition of gestures. We describe an exemplar- based technique that combines two different forms of exem- plars - shape exemplars and motion exemplars - in a uni- fied probabilistic framework. Each gesture is represented as a sequence of learned body poses as well as a sequence of learned motion parameters. The shape exemplars are comprised of pose contours, and the motion exemplars are represented as affine motion parameters extracted using a robust estimation approach. The probabilistic framework learns by employing a nonparametric estimation technique to model the exemplar distributions. It imposes temporal constraints between different exemplars through a learned Hidden Markov Model (HMM) for each gesture. We use the proposed multi-cue approach to recognize a set of four- teen gestures and contrast it against a shape only, single- cue based system. }, author = {Shet,V. D and Prasad,V. S.N and Elgammal,A. and Yacoob,Yaser and Davis, Larry S.} } @conference {12286, title = {Multi-dimensional quorum sets for read-few write-many replica control protocols}, booktitle = {Cluster Computing and the Grid, 2004. CCGrid 2004. IEEE International Symposium on}, year = {2004}, month = {2004/04//}, pages = {355 - 362}, abstract = {We describe d-spaces, a replica control protocol defined in terms of quorum sets on multi-dimensional logical structures. Our work is motivated by asymmetrical access patterns, where the number of read accesses to data are dominant relative to update accesses, i.e. where the protocols should be read-few write-many. D-spaces are optimal with respect to quorum group sizes. The quality of the tradeoff between read efficiency and update availability is not matched by existing quorum protocols. We also propose a novel scheme for implementing d-spaces that combines caching and local information to provide a best-effort form of global views. This allows quorum reconfiguration to be lightweight without impacting access latencies, even when the rate of membership changes is very high.}, keywords = {accesses;, availability;, cache, caching;, Communication, complexity;, CONTROL, d-spaces;, distributed, efficiency;, lightweight, logical, multi-dimensional, processing;, protocols;, quorum, read, read-few, reconfiguration;, replica, sets;, storage;, structures;, update, write-many}, doi = {10.1109/CCGrid.2004.1336588}, author = {Silaghi,B. and Keleher,P. and Bhattacharjee, Bobby} } @conference {13209, title = {Multi-level fast multipole method for thin plate spline evaluation}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {3}, year = {2004}, month = {2004/10//}, pages = {1683 - 1686 Vol. 3 - 1683 - 1686 Vol. 3}, abstract = {Image registration is an important problem in image processing and computer vision. Much recent work in image registration is on matching non-rigid deformations. Thin plate splines are an effective image registration method when the deformation between two images can be modeled as the bending of a thin metal plate on point constraints such that the topology is preserved (non-rigid deformation). However, because evaluating the computed TPS model at all the image pixels is computationally expensive, we need to speed it up. We introduce the use of multi-level fast muitipole method (MLFMM) for this purpose. Our contribution lies in the presentation of a clear and concise MLFMM framework for TPS, which will be useful for future application developments. The achieved speedup using MLFMM is an improvement from O(N2) to O(N log N). We show that the fast evaluation outperforms the brute force method while maintaining acceptable error bound.}, keywords = {(mathematics);, Computer, deformation;, evaluation;, fast, image, MATCHING, matching;, metal, method;, multilevel, multipole, nonrigid, pixel;, plate, plate;, processing;, registration;, resolution;, spline, splines, thin, vision;}, doi = {10.1109/ICIP.2004.1421395}, author = {Zandifar,A. and Lim,S. and Duraiswami, Ramani and Gumerov, Nail A. and Davis, Larry S.} } @conference {12683, title = {Multiple view tracking of humans modelled by kinematic chains}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {2}, year = {2004}, month = {2004/10//}, pages = {1009 - 1012 Vol.2 - 1009 - 1012 Vol.2}, abstract = {We use a kinematic chain to model human body motion. We estimate the kinematic chain motion parameters using pixel displacements calculated from video sequences obtained from multiple calibrated cameras to perform tracking. We derive a linear relation between the 2D motion of pixels in terms of the 3D motion parameters of various body parts using a perspective projection model for the cameras, a rigid body motion model for the base body and the kinematic chain model for the body parts. An error analysis of the estimator is provided, leading to an iterative algorithm for calculating the motion parameters from the pixel displacements. We provide experimental results to demonstrate the accuracy of our formulation. We also compare our iterative algorithm to the noniterative algorithm and discuss its robustness in the presence of noise.}, keywords = {3D, algorithm;, analysis;, body, calibrated, cameras;, chain, displacement;, error, estimation;, human, image, iterative, kinematic, kinematics;, methods;, model;, MOTION, motion;, multiple, parameters;, perspective, Pixel, processing;, projection, sequences;, signal, tracking;, video, view}, doi = {10.1109/ICIP.2004.1419472}, author = {Sundaresan, A. and Chellapa, Rama and RoyChowdhury, R.} } @conference {12692, title = {Multiple-exemplar discriminant analysis for face recognition}, booktitle = {Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on}, volume = {4}, year = {2004}, month = {2004/08//}, pages = {191 - 194 Vol.4 - 191 - 194 Vol.4}, abstract = {Face recognition is characteristically different from regular pattern recognition and, therefore, requires a different discriminant analysis other than linear discriminant analysis(LDA). LDA is a single-exemplar method in the sense that each class during classification is represented by a single exemplar, i.e., the sample mean of the class. We present a multiple-exemplar discriminant analysis (MEDA) where each class is represented using several exemplars or even the whole available sample set. The proposed approach produces improved classification results when tested on a subset of FERET database where LDA is ineffective.}, keywords = {analysis;, database;, databases;, discriminant, Face, FERET, multiple-exemplar, recognition;, visual}, doi = {10.1109/ICPR.2004.1333736}, author = {Zhou,S. K and Chellapa, Rama} } @article {13308, title = {Multi-resolution modeling, visualization and streaming of volume meshes}, journal = {Eurographics 2004, Tutorials 2: Multi-resolution Modeling, Visualization and Streaming of Volume Meshes}, year = {2004}, month = {2004///}, author = {Cignoni,P. and De Floriani, Leila and Lindstrom,P. and Pascucci,V. and Rossignac,J. and Silva,C.} } @article {13267, title = {A multi-resolution topological representation for non-manifold meshes}, journal = {Computer-Aided Design}, volume = {36}, year = {2004}, month = {2004/02//}, pages = {141 - 159}, abstract = {We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology, at different levels of detail. First, we describe a multi-resolution model, that we call a non-manifold multi-tessellation (NMT), and we consider the selective refinement query, which is at the heart of several analysis operations on multi-resolution meshes. Next, we focus on a specific instance of a NMT, generated by simplifying simplicial meshes based on vertex-pair contraction, and we describe a compact data structure for encoding such a model. We also propose a new data structure for two-dimensional simplicial meshes, capable of representing both connectivity and adjacency information with a small memory overhead, which is used to describe the mesh extracted from an NMT through selective refinement. Finally, we present algorithms to efficiently perform updates on such a data structure.}, keywords = {Data structures, Multi-resolution, Non-manifold modeling}, isbn = {0010-4485}, doi = {10.1016/S0010-4485(03)00058-7}, url = {http://www.sciencedirect.com/science/article/pii/S0010448503000587}, author = {De Floriani, Leila and Magillo,Paola and Puppo,Enrico and Sobrero,Davide} } @article {14990, title = {Multiscale advanced raster map analysis system: definition, design and development}, journal = {Environmental and Ecological Statistics}, volume = {11}, year = {2004}, month = {2004///}, pages = {113 - 138}, abstract = {This paper brings together a multidisciplinary initiative to develop advanced statistical and computational techniques for analyzing, assessing, and extracting information from raster maps. This information will provide a rigorous foundation to address a wide range of applications including disease mapping, emerging infectious diseases, landscape ecological assessment, land cover trends and change detection, watershed assessment, and map accuracy assessment. It will develop an advanced map analysis system that integrates these techniques with an advanced visualization toolbox, and use the system to conduct large case studies using rich sets of raster data, primarily from remotely sensed imagery. As a result, it will be possible to study and evaluate raster maps of societal, ecological, and environmental variables to facilitate quantitative characterization and comparative analysis of geospatial trends, patterns, and phenomena. In addition to environmental and ecological studies, these techniques and tools can be used for policy decisions at national, state, and local levels, crisis management, and protection of infrastructure. Geospatial data form the foundation of an information-based society. Remote sensing has been a vastly under-utilized resource involving a multi-million dollar investment at the national levels. Even when utilized, the credibility has been at stake, largely because of lack of tools that can assess, visualize, and communicate accuracy and reliability in timely manner and at desired confidence levels. Consider an imminent 21st century scenario: What message does a multi-categorical map have about the large landscape it represents? And at what scale, and at what level of detail? Does the spatial pattern of the map reveal any societal, ecological, environmental condition of the landscape? And therefore can it be an indicator of change? How do you automate the assessment of the spatial structure and behavior of change to discover critical areas, hot spots, and their corridors? Is the map accurate? How accurate is it? How do you assess the accuracy of the map? How do we evaluate a temporal change map for change detection? What are the implications of the kind and amount of change and accuracy on what matters, whether climate change, carbon emission, water resources, urban sprawl, biodiversity, indicator species, human health, or early warning? And with what confidence? The proposed research initiative is expected to find answers to these questions and a few more that involve multi-categorical raster maps based on remote sensing and other geospatial data. It includes the development of techniques for map modeling and analysis using Markov Random Fields, geospatial statistics, accuracy assessment and change detection, upper echelons of surfaces, advanced computational techniques for geospatial data mining, and advanced visualization techniques.}, doi = {10.1023/B:EEST.0000027205.77490.8c}, author = {Patil,G. P. and Balbus,J. and Biging,G. and JaJa, Joseph F. and Myers,W. L. and Taillie,C.} } @article {13252, title = {M 2 Tracker: a multi-view approach to segmenting and tracking people in a cluttered scene}, journal = {International Journal of Computer Vision}, volume = {51}, year = {2003}, month = {2003///}, pages = {189 - 203}, abstract = {When occlusion is minimal, a single camera is generally sufficient to detect and track objects. However, when the density of objects is high, the resulting occlusion and lack of visibility suggests the use of multiple cameras and collaboration between them so that an object is detected using information available from all the cameras in the scene.In this paper, we present a system that is capable of segmenting, detecting and tracking multiple people in a cluttered scene using multiple synchronized surveillance cameras located far from each other. The system is fully automatic, and takes decisions about object detection and tracking using evidence collected from many pairs of cameras. Innovations that help us tackle the problem include a region-based stereo algorithm capable of finding 3D points inside an object knowing only the projections of the object (as a whole) in two views, a segmentation algorithm using bayesian classification and the use of occlusion analysis to combine evidence from different camera pairs. The system has been tested using different densities of people in the scene. This helps us determine the number of cameras required for a particular density of people. Experiments have also been conducted to verify and quantify the efficacy of the occlusion analysis scheme. }, author = {Mittal,A. and Davis, Larry S.} } @article {15769, title = {Machine and Human Performance for Single- and Multi-Document Summarization}, journal = {IEEE Intelligent Systems (special issue on Natural Language Processing)}, volume = {18}, year = {2003}, month = {2003///}, pages = {46 - 54}, url = {http://csdl.computer.org/comp/mags/ex/2003/01/x1toc.htmhttp://csdl.computer.org/comp/mags/ex/2003/01/x1toc.htm}, author = {Schlesinger,Judith D. and Conroy,John M. and Okurowski,Mary Ellen and O{\textquoteright}Leary, Dianne P.} } @article {13593, title = {Machine Printed Text and Handwriting Identification in Noisy Document Images}, volume = {LAMP-TR-107,CFAR-TR-992,CS-TR-4531,UMIACS-TR-2003-99}, year = {2003}, month = {2003/09//}, institution = {University of Maryland, College Park}, abstract = {In this paper we address the problem of the identification of text in noisy document images. We are especially focused on segmenting and identifying between handwriting and machine printed text because: 1) handwriting in a document often indicates corrections, additions, or other supplemental information that should be treated differently from the main content, and 2) the segmentation and recognition techniques requested for machine printed and handwritten text are significantly different. A novel aspect of our approach is that we treat noise as a separate class and model noise based on selected features. Trained Fisher classifiers are used to identify machine printed text and handwriting from noise, and we further exploit context to refine the classification. AMarkov Random Field (MRF) based approach is used to model the geometrical structure of the printed text, handwriting, and noise to rectify misclassifications. Experimental results show that our approach is robust and can significantly improve page segmentation in noisy document collections.}, author = {Yefeng Zheng and Huiping Li and David Doermann} } @article {15847, title = {Making miracles: Interactive translingual search for cebuano and hindi}, journal = {ACM Transactions on Asian Language Information Processing (TALIP)}, volume = {2}, year = {2003}, month = {2003///}, pages = {219 - 244}, author = {He,D. and Oard, Douglas and Wang,J. and Luo,J. and Demner-Fushman,D. and Darwish,K. and Resnik, Philip and Khudanpur,S. and Nossal,M. and Subotin,M. and others} } @conference {18857, title = {Manufacturability Analysis of Multi-Material Objects Molded by Rotary Platen Multi-Shot Molding Process}, volume = {2003}, year = {2003}, month = {2003///}, pages = {353 - 365}, publisher = {ASME}, organization = {ASME}, abstract = {This paper describes a systematic approach for manufacturability analysis of multi-material objects molded using rotary platen multi-shot injection molding process. In this paper we first identify potential manufacturability problems that are associated with objects molded by the rotary platen process. Identified problems include infeasibility of molding sequences, unnecessary mold complexity, undesired friction during mold opening and closing, and undesired material flash on finished faces. These problems are unique to multi-material molding and do not occur in traditional injection molding. For each of the above four potential manufacturability problems, this paper also describes geometric algorithms for detecting the potential occurrence of the problem based on the object and mold design, finding its causes, and offering appropriate redesign suggestions. We expect that these algorithms will help in decreasing the product development time and improving the product quality for molded multi-material objects}, isbn = {0-7918-3712-2}, doi = {10.1115/IMECE2003-42442}, url = {http://link.aip.org/link/ASMECP/v2003/i37122/p353/s1\&Agg=doi}, author = {Li,Xuejun and Gupta, Satyandra K.} } @conference {12145, title = {Matching Software Measurements to Business Goals}, booktitle = {Keynote Address at the 2003 Software Management Conference, San Jose, California}, year = {2003}, month = {2003///}, author = {Basili, Victor R.} } @book {15389, title = {Mathematical Models of Hysteresis and Their Applications: Second Edition}, year = {2003}, month = {2003/08/15/}, publisher = {Academic Press}, organization = {Academic Press}, abstract = {This new edition has been significantly revised and updated to reflect advances in the field since the publication of the first edition, such as the systematic experimental testing of Preisach models of hysteresis. The author has, however, retained the two most salient features of the original, the emphasis on the universal nature of mathematical models of hysteresis and their applicability to the description of hysteresis phenomena in various areas of science, technology and economics and its accessibility to a broad audience of researchers, engineers, and students. Provides a unique emphasis on the development of universal mathematical models of hysteresis Accessibility to a broad audience, using simple and complex mathematical tools, application to various areas of science. Presents new theoretical and experimental results}, keywords = {Business \& Economics / Industrial Management, Hysteresis, Mathematics / Applied, Mathematics / General, Science / Physics / Magnetism, Science / Physics / Mathematical \& Computational, Technology \& Engineering / Electrical, Technology \& Engineering / Electronics / General, Technology \& Engineering / Electronics / Microelectronics, Technology \& Engineering / Signals \& Signal Processing}, isbn = {9780080535890}, author = {Mayergoyz, Issak D} } @article {15360, title = {Mathematical models of hysterisis and their applications (2003)}, journal = {Recherche}, volume = {67}, year = {2003}, month = {2003///}, pages = {02 - 02}, abstract = {This new edition has been significantly revised and updated to reflect advances in the field since the publication of the first edition, such as the systematic experimental testing of Preisach models of hysteresis. The author has, however, retained the two most salient features of the original, the emphasis on the universal nature of mathematical models of hysteresis and their applicability to the description of hysteresis phenomena in various areas of science, technology and economics and its accessibility to a broad audience of researchers, engineers, and students}, author = {Mayergoyz, Issak D} } @article {17706, title = {Matrix Algorithms, Volume II: Eigensystems}, journal = {Applied Mechanics Reviews}, volume = {56}, year = {2003}, month = {2003///}, pages = {B2-B2 - B2-B2}, keywords = {algorithm theory, Eigenvalues and eigenfunctions, linear algebra, matrix algebra, reviews}, doi = {10.1115/1.1523352}, url = {http://link.aip.org/link/?AMR/56/B2/1}, author = {Stewart, G.W. and Author and Mahajan,A. and Reviewer} } @conference {13239, title = {Mean-shift analysis using quasiNewton methods}, booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on}, volume = {2}, year = {2003}, month = {2003/09//}, pages = {II - 447-50 vol.3 - II - 447-50 vol.3}, abstract = {Mean-shift analysis is a general nonparametric clustering technique based on density estimation for the analysis of complex feature spaces. The algorithm consists of a simple iterative procedure that shifts each of the feature points to the nearest stationary point along the gradient directions of the estimated density function. It has been successfully applied to many applications such as segmentation and tracking. However, despite its promising performance, there are applications for which the algorithm converges too slowly to be practical. We propose and implement an improved version of the mean-shift algorithm using quasiNewton methods to achieve higher convergence rates. Another benefit of our algorithm is its ability to achieve clustering even for very complex and irregular feature-space topography. Experimental results demonstrate the efficiency and effectiveness of our algorithm.}, keywords = {analysis;, classification;, clustering, clustering;, Convergence, density, estimation;, feature-space, image, irregular, iterative, Mean-shift, method;, methods;, Newton, nonparametric, pattern, procedure;, quasiNewton, rates;, segmentation;, technique;, topography;}, doi = {10.1109/ICIP.2003.1246713}, author = {Yang,C. and Duraiswami, Ramani and DeMenthon,D. and Davis, Larry S.} } @conference {13596, title = {Measuring Structural Similarity of Document Pages for Searching Document Image Databases}, booktitle = {5th IASTEDInternational Conference on Signal and Image Processing}, year = {2003}, month = {2003/08//}, pages = {320 - 325}, abstract = {Current document management and database systems provide text search and retrieval capabilities, but generally lack the ability to utilize the documents{\^a}{\texteuro}{\texttrademark} logical and physical structures. This paper describes a general system for document image retrieval that is able to make use of document structure. It discusses the use of structural similarity for retrieval; it defines a measure of structural similarity between document images based on content area overlap, and also compares similarity ratings based on this measure with human relevance judgments.}, author = {Shin,C. and David Doermann and Rosenfeld, A.} } @article {18583, title = {Measuring the effects of internet path faults on reactive routing}, journal = {SIGMETRICS Perform. Eval. Rev.}, volume = {31}, year = {2003}, month = {2003/06//}, pages = {126 - 137}, abstract = {Empirical evidence suggests that reactive routing systems improve resilience to Internet path failures. They detect and route around faulty paths based on measurements of path performance. This paper seeks to understand why and under what circumstances these techniques are effective.To do so, this paper correlates end-to-end active probing experiments, loss-triggered traceroutes of Internet paths, and BGP routing messages. These correlations shed light on three questions about Internet path failures: (1) Where do failures appear? (2) How long do they last? (3) How do they correlate with BGP routing instability?Data collected over 13 months from an Internet testbed of 31 topologically diverse hosts suggests that most path failures last less than fifteen minutes. Failures that appear in the network core correlate better with BGP instability than failures that appear close to end hosts. On average, most failures precede BGP messages by about four minutes, but there is often increased BGP traffic both before and after failures. Our findings suggest that reactive routing is most effective between hosts that have multiple connections to the Internet. The data set also suggests that passive observations of BGP routing messages could be used to predict about 20\% of impending failures, allowing re-routing systems to react more quickly to failures.}, isbn = {0163-5999}, doi = {10.1145/885651.781043}, url = {http://doi.acm.org/10.1145/885651.781043}, author = {Feamster, Nick and Andersen,David G. and Balakrishnan,Hari and Kaashoek,M. Frans} } @conference {17291, title = {MediaFinder: an interface for dynamic personal media management with semantic regions}, booktitle = {CHI {\textquoteright}03 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {764 - 765}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Computer users deal with large amounts of personal media often face problems in managing and exploring it. This paper presents Semantic Regions, rectangular regions that enable users to specify their semantics or mental models, and the MediaFinder application, which uses Semantic Regions as the basis of a personal media management tool.}, keywords = {dynamic queries, Fling-and-flock, Personal media management, spatial information organization, User interfaces}, isbn = {1-58113-637-4}, doi = {10.1145/765891.765977}, url = {http://doi.acm.org/10.1145/765891.765977}, author = {Kang,Hyunmo and Shneiderman, Ben} } @article {17709, title = {Memory leaks in derived types revisited}, journal = {SIGPLAN Fortran Forum}, volume = {22}, year = {2003}, month = {2003/12//}, pages = {25 - 27}, abstract = {In a note in the Fortran Forum, Markus describes a technique for avoiding memory leaks with derived types. In this note, we show by a simple example that this technique does not work when the object in question is a parameter in nested subprogram invocations. A fix is proposed and illustrated with code from MATRAN, a Fortran 95 package for performing matrix manipulations.}, isbn = {1061-7264}, doi = {10.1145/962180.962183}, url = {http://doi.acm.org/10.1145/962180.962183}, author = {Stewart, G.W.} } @article {12946, title = {Method of DNA extraction and application of multiplex polymerase chain reaction to detect toxigenic Vibrio cholerae O1 and O139 from aquatic ecosystems}, journal = {Environmental Microbiology}, volume = {5}, year = {2003}, month = {2003/07/01/}, pages = {599 - 606}, abstract = {Vibrio cholerae is a free-living bacterium found in water and in association with plankton. V. cholerae non-O1/non-O139 strains are frequently isolated from aquatic ecosystems worldwide. Less frequently isolated are V. cholerae O1 and V. cholerae O139, the aetiological agents of cholera. These strains have two main virulence-associated factors, cholera toxin (CT) and toxin co-regulated pilus (TCP). By extracting total DNA from aquatic samples, the presence of pathogenic strains can be determined quickly and used to improve a microbiological risk assessment for cholera in coastal areas. Some methods suggested for DNA extraction from water samples are not applicable to all water types. We describe here a method for DNA extraction from coastal water and a multiplex polymerase chain reaction (PCR) for O1 and O139 serogroups. DNA extraction was successfully accomplished from 117 sea water samples collected from coastal areas of Per{\'u}, Brazil and the USA. DNA concentration in all samples varied from 20~ng to 480~{\textmu}g~{\textmu}l-1. The sensitivity of the DNA extraction method was 100 V. cholerae cells in 250~ml of water. The specificity of multiplex O1/O139 PCR was investigated by analysing 120 strains of V. cholerae, Vibrio and other Bacteria species. All V. cholerae O1 and O139 tested were positive. For cholera surveillance of aquatic environments and ballast water, total DNA extraction, followed by V. cholerae PCR, and O1/O139 serogroup and tcpA/ctxA genes by multiplex PCR offers an efficient system, permitting risk analysis for cholera in coastal areas.}, isbn = {1462-2920}, doi = {10.1046/j.1462-2920.2003.00443.x}, url = {http://onlinelibrary.wiley.com/doi/10.1046/j.1462-2920.2003.00443.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Rivera,Irma N. G. and Lipp,Erin K. and Gil,Ana and Choopun,Nipa and Huq,Anwar and Rita R Colwell} } @article {13386, title = {MobiCom poster: mining a world of smart sensors}, journal = {SIGMOBILE Mob. Comput. Commun. Rev.}, volume = {7}, year = {2003}, month = {2003/01//}, pages = {34 - 36}, isbn = {1559-1662}, doi = {10.1145/881978.881987}, url = {http://doi.acm.org/10.1145/881978.881987}, author = {Nath,Suman and Deshpande, Amol and Gibbons,Phillip B. and Seshan,Srinivasan} } @article {17923, title = {Modeling and Rendering of Points with Local Geometry}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {9}, year = {2003}, month = {2003///}, pages = {30 - 42}, abstract = {We present a novel rendering primitive that combines the modeling brevity of points with the rasterization efficiency of polygons. The surface is represented by a sampled collection of Differential Points (DP), each with embedded curvature information that captures the local differential geometry in the vicinity of that point. This is a more general point representation that, for the cost of a few additional bytes, packs much more information per point than the traditional point-based models. This information is used to efficiently render the surface as a collection of local geometries. To use the hardware acceleration, the DPs are quantized into $\big. 256\bigr.$ different types and each sampled point is approximated by the closest quantized DP and is rendered as a normal-mapped rectangle. The advantages to this representation are: 1) The surface can be represented more sparsely compared to other point primitives, 2) it achieves a robust hardware accelerated per-pixel shading{\textemdash}even with no connectivity information, and 3) it offers a novel point-based simplification technique that factors in the complexity of the local geometry. The number of primitives being equal, DPs produce a much better quality of rendering than a pure splat-based approach. Visual appearances being similar, DPs are about two times faster and require about 75 percent less disk space in comparison to splatting primitives.}, keywords = {differential geometry, per-pixel shading., point sample rendering, simplification}, isbn = {1077-2626}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2003.1175095}, author = {Kalaiah,Aravind and Varshney, Amitabh} } @conference {13246, title = {Modelling pedestrian shapes for outlier detection: a neural net based approach}, booktitle = {Intelligent Vehicles Symposium, 2003. Proceedings. IEEE}, year = {2003}, month = {2003/06//}, pages = {428 - 433}, abstract = {In this paper we present an example-based approach to learn a given class of complex shapes, and recognize instances of that shape with outliers. The system consists of a two-layer custom-designed neural network. We apply this approach to the recognition of pedestrians carrying objects from a single camera. The system is able to capture and model an ample range of pedestrian shapes at varying poses and camera orientations, and achieves a 90\% correct recognition rate.}, keywords = {(artificial, complex, Computer, computing;, custom, design;, detection;, engineering, intelligence);, layer, learning, method;, modelling;, net;, nets;, neural, object, outlier, pedestrian, pedestrians, rate;, recognition, recognition;, SHAPE, shapes;, traffic, two, vision;}, doi = {10.1109/IVS.2003.1212949}, author = {Nanda,H. and Benabdelkedar,C. and Davis, Larry S.} } @conference {13306, title = {Morphology-driven simplification and multiresolution modeling of terrains}, booktitle = {Proceedings of the 11th ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {63 - 70}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We propose a technique for simplification and multiresolution modeling of a terrain represented as a TIN. Our goal is to maintain the morphological structure of the terrain in the resulting multiresolution model. To this aim, we extend Morse theory, developed for continuous and differentiable functions, to the case of piecewise linear functions. We decompose a TIN into areas with uniform morphological properties (such as valleys, basins, etc.) separated by a network of critical lines and points. We describe an algorithm to compute the above decomposition and the critical net, and a TIN simplification algorithm that preserves them. On this basis, we build a multiresolution terrain model, which provides a representation of critical features at any level of detail.}, keywords = {morphological structure, Multi-resolution, terrain models}, isbn = {1-58113-730-3}, doi = {10.1145/956676.956685}, url = {http://doi.acm.org/10.1145/956676.956685}, author = {Danovaro,Emanuele and De Floriani, Leila and Magillo,Paola and Mesmoudi,Mohammed Mostefa and Puppo,Enrico} } @book {18249, title = {Multimedia Data Hiding}, year = {2003}, month = {2003///}, publisher = {Springer}, organization = {Springer}, abstract = {With the advances of the digital information revolution and the societal changes they have prompted, it has become critical to facilitate secure management of content usage and delivery across communication networks. Data hiding and digital watermarking are promising new technologies for multimedia information protection and rights management. Multimedia Data Hiding addresses the theory, methods, and design of multimedia data hiding and its application to multimedia rights management, information security, and communication. It offers theoretical and practical aspects, and both design and attack problems. Applications discussed include: annotation, tamper detection, copy/access control, fingerprinting, and ownership protection. Countermeasures for attacks on data hiding are discussed, and a chapter assesses attack problems on digital music protection under a unique competitive environment. Topics and features: * Comprehensive and practical coverage of data hiding for various media types, including binary image, grayscale and color images and video, and audio * Provides unique analysis of problems and solutions, such as data hiding in binary signature and generic binary documents, block concealment attacks, and attacks on audio watermarking * Authoritative discussion and analysis of data hiding and effective countermeasures, supported by concrete application examples * Accessible, well-organized progression from the fundamentals to specific approaches to various data-hiding problems This work offers a state-of-the-art presentation covering theoretical, algorithmic, and design topics for digital content/data security protection, and rights management. It is an essential resource for multimedia security researchers and professionals in electrical engineering, computer science, IT, and digital rights management.}, keywords = {computer security, Computers / Computer Engineering, Computers / Computer Science, Computers / Database Management / General, Computers / Information Technology, Computers / Information Theory, Computers / Interactive \& Multimedia, Computers / Networking / General, Computers / Security / Cryptography, Computers / Security / General, Computers / System Administration / Storage \& Retrieval, Data encryption (Computer science), multimedia systems, Technology \& Engineering / Electrical, Technology \& Engineering / Engineering (General)}, isbn = {9780387954264}, author = {M. Wu and Liu,Bede} } @conference {18400, title = {Maintaining software with a security perspective}, booktitle = {Software Maintenance, 2002. Proceedings. International Conference on}, year = {2002}, month = {2002///}, pages = {194 - 203}, abstract = {Testing for software security is a lengthy, complex and costly process. Currently, security testing is done using penetration analysis and formal verification of security kernels. These methods are not complete and are difficult to use. Hence it is essential to focus testing effort in areas that have a greater number of security vulnerabilities to develop secure software as well as meet budget and time constraints. We propose a testing strategy based on a classification of vulnerabilities to develop secure and stable systems. This taxonomy will enable a system testing and maintenance group to understand the distribution of security vulnerabilities and prioritize their testing effort according to the impact the vulnerabilities have on the system. This is based on Landwehr{\textquoteright}s (1994) classification scheme for security flaws and we evaluated it using a database of 1360 operating system vulnerabilities. This analysis indicates vulnerabilities tend to be focused in relatively few areas and associated with a small number of software engineering issues.}, keywords = {(computers);, budget, classification, classification;, constraints;, data;, engineering;, flaw, maintenance;, of, operating, program, scheme;, Security, software, stable, system, systems, systems;, testing;, TIME, vulnerabilities;, vulnerability}, doi = {10.1109/ICSM.2002.1167766}, author = {Jiwnani,K. and Zelkowitz, Marvin V} } @article {16394, title = {Markov models of literary style for authorship identification}, journal = {Fluctuation and Noise Letters}, volume = {2}, year = {2002}, month = {2002///}, pages = {L299{\textendash}L303 - L299{\textendash}L303}, abstract = {The author introduces a statistical model of literary style that allows for the authorship question to be examined. This model uses Markov modeling to examine underlying patterns in pieces of literature. Different methods for comparing these models are examined. The methods are then applied to an experiment involving the authorship of 16th century sonnets. Finally suggestions for improving on this technique are discussed.}, doi = {10.1142/S0219477502000890}, author = {Rand, William} } @conference {17520, title = {Measuring ISP topologies with Rocketfuel}, booktitle = {ACM SIGCOMM Computer Communication Review}, volume = {32}, year = {2002}, month = {2002///}, pages = {133 - 145}, author = {Spring, Neil and Mahajan,R. and Wetherall,D.} } @article {17290, title = {Media Conversion from Visual to Audio: Voice Browsers}, journal = {Technical Reports of the Computer Science Department}, year = {2002}, month = {2002/12/19/}, abstract = {There is a large amount of information on the World Wide Web that is atthe fingertips of anyone with access to the internet. However, so far this information has primarily been used by people who connect to the web via traditional computer. This is about to change. Recent advances in wireless communication, speech recognition, and speech synthesis technologies have made it possible to access this information from any place, and at any time. In this paper, we discuss voice browsers as compared to current web browsers. Some of the primary techniques of universal accessible design are listed with their relation to voice browsers and some ideas are offered to help authors implementing these considerations when designing web pages. The new voice markup language is briefly discussed. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/534}, author = {Youssef,Adel and Shneiderman, Ben} } @article {17293, title = {Meeting human needs with new digital imaging technologies}, journal = {IEEE Multimedia}, volume = {9}, year = {2002}, month = {2002/12//Oct}, pages = {8 - 14}, abstract = {It{\textquoteright}s a visual world. Images capture many people{\textquoteright}s thrills, emotions, and concerns. Art can shock or inspire, and family photos are some of our greatest treasures. It{\textquoteright}s not surprising that visual information is a vital component of the new computing. Most people depend on visual input to understand the world around them and as a basis for further creative activities. The popularity of visual media such as photos, short videos, and animations attests to their mainstream acceptance. Digital photos and image-laden Web pages have already become major computing applications, but users still want higher-resolution images and faster downloads}, keywords = {animation, animations, Computer applications, digital images, digital imaging technologies, Helium, History, HUMANS, Image databases, IMAGE PROCESSING, Photography, photos, software libraries, Videos, visual media, Web pages}, isbn = {1070-986X}, doi = {10.1109/MMUL.2002.1041942}, author = {Shneiderman, Ben} } @article {16028, title = {Metareasoning for More Effective Human-Computer Dialogue}, year = {2002}, month = {2002/12/31/}, institution = {University of Maryland, College Park}, abstract = {The research project explores specific meta-dialogue behaviors in terms of both how a system could be made to perform them, and to what extent they can increase overall system performance. We focus on two types of meta-dialogue capabilities: ability to detect and recover from anomalous dialogue patterns in simple exchanges, and on-line extensions or changes to working vocabulary. Our main method involves detailed representation of the dialogue context, separating domain, language, and dialogue specific aspects, and significant amounts of meta-reasoning about the system{\textquoteright}s processing of these representations. An existing logical inference system, ALMA/CARNE, developed as part of a pilot study, is being used in an implementation phase of this work. We are also engaged in a study of existing dialogue corpora to investigate the range and frequency of meta-dialogue expressions in different task domains.}, keywords = {*LEARNING MACHINES, COMPUTER LOGIC, COMPUTER PROGRAMMING AND SOFTWARE, CYBERNETICS, MAN COMPUTER INTERFACE, METAREASONING, NATURAL LANGUAGE., PROCESSING}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA414209}, author = {Perlis, Don and Anderson,Mike} } @article {14507, title = {Method and apparatus for learning probabilistic relational models having attribute and link uncertainty and for performing selectivity estimation using probabilistic relational models}, volume = {09/922,324}, year = {2002}, month = {2002/08/01/}, abstract = {The invention comprises a method and apparatus for learning probabilistic models (PRM{\textquoteright}s) with attribute uncertainty. A PRM with attribute uncertainty defines a probability distribution over instantiations of a database. A learned PRM is useful for discovering interesting patterns and dependencies in the data. Unlike many existing techniques, the process is data-driven rather than hypothesis driven. This makes the technique particularly well-suited for exploratory data analysis. In addition, the invention comprises a method and apparatus for handling link uncertainty in PRM{\textquoteright}s. Link uncertainty is uncertainty over which entities are related in our domain. The invention comprises of two mechanisms for modeling link uncertainty: reference uncertainty and existence uncertainty. The invention includes learning algorithms for each form of link uncertainty. The third component of the invention is a technique for performing database selectivity estimation using probabilistic relational...}, url = {http://www.google.com/patents?id=FVqDAAAAEBAJ}, author = {Koller,Daphne and Getoor, Lise and Pfeffer,Avi and Friedman,Nir and Taskar,Ben} } @article {18240, title = {Methods and apparatus for multi-layer data hiding}, volume = {:~09/427,321}, year = {2002}, month = {2002/09/24/}, abstract = {A data hiding system and method for providing a method of embedding multiple layers of hidden data into multimedia data. First, a media unit of the multimedia data is evaluated to determine an appropriate embedding procedure. Next during a first embedding pass, a ruling layer of primary hidden data is embedded into the media unit. In another embedding pass, a governing layer of secondary hidden data is embedded on top of the ruling layer. The secondary hidden data provides control information for controlling the primary hidden data and the host data. Control information such as error correction data, synchronization data, decoding data, and authentication data is embedded in the governing layer. Embedding schemes such as base domain and spectrum domain embedding are employed.}, url = {http://www.google.com/patents?id=1KYLAAAAEBAJ}, author = {Yu,Hong Heather and M. Wu and Li,Xin and Gelman,Alexander D.}, editor = {Matsushita Electric Industrial Co., Ltd.} } @conference {11899, title = {Mixture models for dynamic statistical pressure snakes}, booktitle = {16th International Conference on Pattern Recognition, 2002. Proceedings}, volume = {2}, year = {2002}, month = {2002///}, pages = {721- 724 vol.2 - 721- 724 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper introduces a new approach to statistical pressure snakes. It uses statistical modeling for both object and background to obtain a more robust pressure model. The Expectation Maximization (EM) algorithm is used to model the data into a Mixture of Gaussians (MoG). Bayesian theory is then employed as a decision making mechanism. Experimental results using the traditional pressure model and the new mixture pressure model demonstrate the effectiveness of the new models.}, keywords = {active contour models, Active contours, Artificial intelligence, Bayes methods, Bayesian methods, Bayesian theory, complex colored object, Computer vision, decision making, decision making mechanism, dynamic statistical pressure snakes, Equations, expectation maximization algorithm, Gaussian distribution, image colour analysis, Image edge detection, Image segmentation, Intelligent robots, mixture models, mixture of Gaussians, mixture pressure model, Robot vision systems, robust pressure model, Robustness, segmentation results, statistical analysis, statistical modeling}, isbn = {0-7695-1695-X}, doi = {10.1109/ICPR.2002.1048404}, author = {Abd-Almageed, Wael and Smith,C.E.} } @article {16413, title = {Modeling the Effects of Greenbelts at the Urban-Rural Fringe}, journal = {Proceedings of IEMSS 2002}, year = {2002}, month = {2002///}, pages = {190 - 195}, abstract = {We present and evaluate an agent based model (ABM) of land use change at the rural-urban fringe,comparing its performance to a mathematical model of the same process. Our simplified model was developed in Swarm using agents with heterogeneous preferences and a landscape with heterogeneous properties. The context of this work is a larger project that includes surveys of the preferences of residents and data on historical patterns of development. Our broader goal is to use the model to evaluate the ecological effects of alternative policies and designs. We begin by evaluating the influence of a greenbelt, which is located next to a developing area and in which no development is permitted. We present results of a mathematical model that illustrates the necessary trade-off between greenbelt placement and greenbelt width on its effectiveness at delaying develop- ment beyond. Experiments run with the ABM are validated by the mathematical model and illustrate analyses that can be performed by extending to two-dimensions, variable agent preferences, and multiple, and ultimately realistic, patterns of landscape variability. }, author = {Brown,D.G. and Page,S.E. and Riolo,R and Rand, William} } @article {18913, title = {M-Translog-2: A Planning Domain Designed for AIPS-2002}, volume = {UMIACS-TR-2002-82}, year = {2002}, month = {2002/10/03/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This document describes UM-Translog-2, which is an extended version of theUM Translog planning domain. The extensions include some numerical-computation features to make the domain a more realistic model of transportation-logistics problems. We are proposing UM- Translog-2 as a candidate domain for AIPS-2002 planning competition. (Also UMIACS-TR-2002-82) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/1228}, author = {Wu,Dan and Nau, Dana S.} } @article {14152, title = {A multigrid method enhanced by Krylov subspace iteration for discrete Helmholtz equations}, journal = {SIAM Journal on scientific computing}, volume = {23}, year = {2002}, month = {2002///}, pages = {1291 - 1315}, author = {Elman, Howard and Ernst, O. G and O{\textquoteright}Leary, Dianne P. and others} } @conference {17835, title = {Multiple Query Optimization for Data Analysis Applications on Clusters of SMPs}, booktitle = {2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2002}, year = {2002}, month = {2002/05/21/24}, pages = {154 - 154}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper is concerned with the efficient execution of multiple query workloads on a cluster of SMPs. We target applications that access and manipulate large scientific datasets. Queries in these applications involve user-defined processing operations and distributed data structures to hold intermediate and final results. Our goal is to implement system components to leverage previously computed query results and to effectively utilize processing power and aggregated I/O bandwidth on SMP nodes so that both single queries and multi-query batches can be efficiently executed.}, keywords = {Aggregates, Application software, Bandwidth, Data analysis, Data structures, Delay, Query processing, scheduling, Subcontracting, Switched-mode power supply}, isbn = {0-7695-1582-7}, doi = {10.1109/CCGRID.2002.1017123}, author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.} } @conference {14524, title = {Multiple scattering from N spheres}, booktitle = {Antennas and Propagation Society International Symposium, 2002. IEEE}, volume = {2}, year = {2002}, month = {2002///}, pages = {90 - 93}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {13314, title = {Multiresolution mesh representation: Models and data structures}, journal = {Tutorials on Multiresolution in Geometric Modelling}, year = {2002}, month = {2002///}, pages = {363 - 418}, abstract = {Multiresolution meshes are a common basis for building representationsof a geometric shape at different levels of detail. The use of the term multiresolu- tion depends on the remark that the accuracy (or, level of detail) of a mesh in approximating a shape is related to the mesh resolution, i.e., to the density (size and number) of its cells. A multiresolution mesh provides several alternative mesh- based approximations of a spatial object (e.g., a surface describing the boundary of a solid object, or the graph of a scalar field). A multiresolution mesh is a collection of mesh fragments, describing usually small portions of a spatial object with different accuracies, plus suitable relations that allow selecting a subset of fragments (according to user-defined accuracy crite- ria), and combining them into a mesh covering the whole object, or an object part. Existing multiresolution models differ in the type of mesh fragments they consider and in the way they define relations among such fragments. In this chapter, we introduce a framework for multiresolution meshes in order to analyze and compare existing models proposed in the literature on a common basis. We have identified two sets of basic queries on a multiresolution meshes, that we call selective refinement and spatial selection. We describe two approaches for answering such queries, and discuss the primitives involved in them, which must be efficiently supported by any data structure implementing a multiresolution mesh. We then describe and analyze data structures proposed in the literature for encoding multiresolution meshes. }, author = {De Floriani, Leila and Magillo,P.} } @conference {13317, title = {Multiresolution tetrahedral meshes: an analysis and a comparison}, booktitle = {Shape Modeling International, 2002. Proceedings}, year = {2002}, month = {2002///}, pages = {83 - 91}, abstract = {We deal with the problem of analyzing and visualizing large-size volume data sets. To this aim, we consider multiresolution representations based on a decomposition of the field domain into tetrahedral cells. We compare two types of multiresolution representations that differ on the rule applied to refine an initial coarse mesh: one is based on tetrahedron bisection, and one based on vertex split. The two representations can be viewed as instances of a common multiresolution model, that we call a multiresolution mesh. Encoding data structures for the two representations are briefly described. An experimental comparison on structured volume data sets is presented}, keywords = {(computer, bisection;vertex, cells;tetrahedron, data, generation;rendering, geometry;data, graphics);solid, meshes;rendering;tetrahedral, modelling;, refinement;multiresolution, representations;multiresolution, sets;mesh, split;computational, structures;data, tetrahedral, visualisation;mesh, visualization;experiment;large-size, volume}, doi = {10.1109/SMI.2002.1003532}, author = {Danovaro,E. and De Floriani, Leila and Lee,M. and Samet, Hanan} } @conference {15899, title = {Mandarin-English Information (MEI): investigating translingual speech retrieval}, booktitle = {Proceedings of the first international conference on Human language technology research}, series = {HLT {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {1 - 7}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper describes the Mandarin-English Information (MEI) project, where we investigated the problem of cross-language spoken document retrieval (CL-SDR), and developed one of the first English-Chinese CL-SDR systems. Our system accepts an entire English news story (text) as query, and retrieves relevant Chinese broadcast news stories (audio) from the document collection. Hence this is a cross-language and cross-media retrieval task. We applied a multi-scale approach to our problem, which unifies the use of phrases, words and subwords in retrieval. The English queries are translated into Chinese by means of a dictionary-based approach, where we have integrated phrase-based translation with word-by-word translation. Untranslatable named entities are transliterated by a novel subword translation technique. The multi-scale approach can be divided into three subtasks -- multi-scale query formulation, multi-scale audio indexing (by speech recognition) and multi-scale retrieval. Experimental results demonstrate that the use of phrase-based translation and subword translation gave performance gains, and multi-scale retrieval outperforms word-based retrieval.}, keywords = {cross-language, English-Chinese, spoken document retrieval}, doi = {10.3115/1072133.1072202}, url = {http://dx.doi.org/10.3115/1072133.1072202}, author = {Meng,Helen and Chen,Berlin and Khudanpur,Sanjeev and Levow,Gina-Anne and Lo,Wai-Kit and Oard, Douglas and Schone,Patrick and Tang,Karen and Wang,Hsin-Min and Wang,Jianqiang} } @conference {13826, title = {Mapping lexical entries in a verbs database to WordNet senses}, booktitle = {Proceedings of the 39th Annual Meeting on Association for Computational Linguistics}, series = {ACL {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {244 - 251}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper describes automatic techniques for mapping 9611 entries in a database of English verbs to WordNet senses. The verbs were initially grouped into 491 classes based on syntactic features. Mapping these verbs into WordNet senses provides a resource that supports disambiguation in multilingual applications such as machine translation and cross-language information retrieval. Our techniques make use of (1) a training set of 1791 disambiguated entries, representing 1442 verb entries from 167 classes; (2) word sense probabilities, from frequency counts in a tagged corpus; (3) semantic similarity of WordNet senses for verbs within the same class; (4) probabilistic correlations between WordNet data and attributes of the verb classes. The best results achieved 72\% precision and 58\% recall, versus a lower bound of 62\% precision and 38\% recall for assigning the most frequently occurring WordNet sense, and an upper bound of 87\% precision and 75\% recall for human judgment.}, doi = {10.3115/1073012.1073044}, url = {http://dx.doi.org/10.3115/1073012.1073044}, author = {Green,Rebecca and Pearl,Lisa and Dorr, Bonnie J and Resnik, Philip} } @article {13827, title = {Mapping WorldNet Senses to a Lexical Database of Verbs}, year = {2001}, month = {2001/01//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This paper describes automatic techniques for mapping 9611 semantically classified English verbs to WordNet senses. The verbs were initially grouped into 491 semantic classes based on syntactic categories; they were then mapped into WordNet senses according to three pieces of information: (1) prior probability of WordNet senses; (2) semantic similarity of WordNet senses for verbs within the same category; and (3) probabilistic correlations between WordNet relationship and verb frame data. Our techniques make use of a training set of 1791 disambiguated entries representing 1442 verbs occurring in 167 of the categories. The best results achieved .58 recall and .72 precision, versus a lower bound of .38 recall and .62 precision for assigning the most frequently occurring WordNet sense, and an upper bound of .75 recall and .87 precision for human judgment.}, keywords = {*DATA BASES, *ENGLISH LANGUAGE, *LEXICAL DATABASES, *LEXICOGRAPHY, *MAPPING, *VERBS, *WORD MAPPING, *WORDNET, AMBIGUITY, correlation, FRAMES, Frequency, INFORMATION SCIENCE, JUDGEMENT(PSYCHOLOGY), linguistics, PRECISION, probability, RECALL, semantics, syntax, WORDS(LANGUAGE), WSD(WORD SENSE DISAMBIGUATION)}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458846}, author = {Green,Rebecca and Pearl,Lisa and Dorr, Bonnie J} } @book {17708, title = {Matrix Algorithms: Eigensystems}, year = {2001}, month = {2001/08/30/}, publisher = {SIAM}, organization = {SIAM}, abstract = {This is the second volume in a projected five-volume survey of numerical linear algebra and matrix algorithms. It treats the numerical solution of dense and large-scale eigenvalue problems with an emphasis on algorithms and the theoretical background required to understand them. The notes and reference sections contain pointers to other methods along with historical comments. The book is divided into two parts: dense eigenproblems and large eigenproblems. The first part gives a full treatment of the widely used QR algorithm, which is then applied to the solution of generalized eigenproblems and the computation of the singular value decomposition. The second part treats Krylov sequence methods such as the Lanczos and Arnoldi algorithms and presents a new treatment of the Jacobi-Davidson method. These volumes are not intended to be encyclopedic, but provide the reader with the theoretical and practical background to read the research literature and implement or modify new algorithms.}, keywords = {eigenvalues, Mathematics / Algebra / Linear, Mathematics / Applied, Mathematics / General, Mathematics / Mathematical Analysis, Mathematics / Matrices, Mathematics / Numerical Analysis, Matrices, Medical / General}, isbn = {9780898715033}, author = {Stewart, G.W.} } @article {18983, title = {Messenger RNA Splicing Signals}, journal = {eLS}, year = {2001}, month = {2001///}, abstract = {Splicing signals are elements in the DNA sequence of a gene that specify the accurate splicing of its primary RNA transcript to generate its mature RNA product.}, keywords = {consensus sequences, exon definition, small nuclear ribonucleoprotein particles (snRNPs), splice site selection, splicing enhancers}, doi = {10.1038/npg.els.0000888}, url = {http://onlinelibrary.wiley.com/doi/10.1038/npg.els.0000888/abstract}, author = {Mount, Stephen M.} } @conference {15859, title = {Modeling information content using observable behavior}, booktitle = {PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE}, volume = {38}, year = {2001}, month = {2001///}, pages = {481 - 488}, author = {Oard, Douglas and Kim,J.} } @conference {14529, title = {Modeling the effect of a nearby boundary on the HRTF}, booktitle = {2001 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP {\textquoteright}01)}, volume = {5}, year = {2001}, month = {2001///}, pages = {3337-3340 vol.5 - 3337-3340 vol.5}, publisher = {IEEE}, organization = {IEEE}, abstract = {Understanding and simplified modeling of the head related transfer function (HRTF) holds the key to many applications in spatial audio. We develop an analytical solution to the problem of scattering of sound from a sphere in the vicinity of an infinite plane. Using this solution we study the influence of a nearby scattering rigid surface, on a spherical model for the HRTF}, keywords = {Acoustic scattering, acoustic signal processing, acoustic wave reflection, acoustic wave scattering, architectural acoustics, audio signal processing, Biological system modeling, boundary effect modeling, Computer interfaces, Ear, Educational institutions, Frequency, Head related transfer function, HRTF, HUMANS, infinite plane, Laboratories, Nails, Raman scattering, rigid surface, room environment, sound pressure level, sound scattering, spatial audio, sphere, spherical model, Transfer functions, wall influence}, isbn = {0-7803-7041-4}, doi = {10.1109/ICASSP.2001.940373}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {18246, title = {Modulation and multiplexing techniques for multimedia data hiding}, journal = {Proc. of SPIE ITcom{\textquoteright}01, SPIE vol}, volume = {4518}, year = {2001}, month = {2001///}, abstract = {Many multimedia data hiding systems demand either multiple bits or multiple sets of data to be embedded. Thispaper examines the modulation and multiplexing techniques for accomplishing the task of extending the basic single- bit embedding to multiple-bit embedding. Amplitude modulo modulation, orthogonal/bi-orthogonal modulation, and TDMA or CDMA type modulation/multiplexing are discussed and compared. Several examples are included to demonstrate the use of such techniques in practical designs. }, author = {Wu,M. and Liu,B.} } @conference {16347, title = {More efficient network class loading through bundling}, booktitle = {Proceedings of the 2001 Symposium on Java TM Virtual Machine Research and Technology Symposium-Volume 1}, year = {2001}, month = {2001///}, pages = {17 - 17}, author = {Hovemeyer,D. and Pugh, William} } @conference {18468, title = {Multimodal 3-D tracking and event detection via the particle filter}, booktitle = {IEEE Workshop on Detection and Recognition of Events in Video, 2001. Proceedings}, year = {2001}, month = {2001///}, pages = {20 - 27}, publisher = {IEEE}, organization = {IEEE}, abstract = {Determining the occurrence of an event is fundamental to developing systems that can observe and react to them. Often, this determination is based on collecting video and/or audio data and determining the state or location of a tracked object. We use Bayesian inference and the particle filter for tracking moving objects, using both video data obtained from multiple cameras and audio data obtained using arrays of microphones. The algorithms developed are applied to determining events arising in two fields of application. In the first, the behavior of a flying echo locating bat as it approaches a moving prey is studied, and the events of search, approach and capture are detected. In a second application we describe detection of turn-taking in a conversation between possibly moving participants recorded using a smart video conferencing setup}, keywords = {algorithms, APPROACH, audio data collection, audio signal processing, Bayesian inference, Bayesian methods, belief networks, CAMERAS, capture, conversation, echo, Educational institutions, Event detection, event occurrence, filtering theory, flying echo locating bat behaviour, Image motion analysis, inference mechanisms, Laboratories, microphone arrays, moving object tracking, moving participants, moving prey, multimodal 3D tracking, multiple cameras, Object detection, particle filter, Particle filters, Particle tracking, Robustness, search, smart video conferencing setup, target tracking, Teleconferencing, tracking filters, turn-taking detection, video data collection, video signal processing}, isbn = {0-7695-1293-3}, doi = {10.1109/EVENT.2001.938862}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S.} } @conference {18465, title = {Multimodal localization of a flying bat}, booktitle = {Acoustics, Speech, and Signal Processing, IEEE International Conference on}, volume = {5}, year = {2001}, month = {2001///}, pages = {3057 - 3060}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {We present a new multimodal system that combines stereoscopic and audio-based source localization to track the position of a flying bat. Also presented are novel algorithms for audio source localization. The bat was allowed to fly in an anechoic room and monitored by two high-speed video cameras. The vocalizations of the bat were simultaneously recorded from six microphones. The data was then processed offline to localize the source and reconstruct the trajectory of the bat. We compare the performance of the localization algorithm with the position data obtained from stereoscopic pictures of the bat. The results confirm that the stereoscopic analysis and the audio localization are in good agreement. This system opens up new possibilities for performing multimodal research, and developing more tightly integrated algorithms.}, isbn = {0-7803-7041-4}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICASSP.2001.940303}, author = {Ghose,K. and Zotkin,Dmitry N and Duraiswami, Ramani and Moss,C.F.} } @conference {18481, title = {Multimodal tracking for smart videoconferencing}, booktitle = {Second International Conference on Multimedia and Expo, Tokyo, Japan}, year = {2001}, month = {2001///}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Nanda,H. and Davis, Larry S.} } @article {12327, title = {Multiprocessor clustering for embedded systems}, journal = {Euro-Par 2001 Parallel Processing}, year = {2001}, month = {2001///}, pages = {697 - 701}, author = {Kianzad,V. and Bhattacharyya, Shuvra S.} } @article {14439, title = {Multi-Relational Data Mining using Probabilistic Models Research Summary}, journal = {Proc. Of 1st workshop in MRDM}, year = {2001}, month = {2001///}, abstract = {We are often faced with the challenge of mining data represented inrelational form. Unfortunately, most statistical learning methods work only with {\textquotedblleft}flat{\textquotedblright} data representations. Thus, to apply these methods, we are forced to con- vert the data into a flat form, thereby not only losing its compact representa- tion and structure but also potentially introducing statistical skew. These draw- backs severely limit the ability of current statistical methods to mine relational databases. Probabilistic models, in particular probabilistic relational models, al- low us to represent a statistical model over a relational domain. These models can represent correlations between attributes within a single table, and between attributes in multiple tables, when these tables are related via foreign key joins. In previous work [4, 6, 8], we have developed algorithms for automatically con- structing a probabilistic relational model directly from a relational database. We survey the results here and describe how the methods can be used to discover interesting dependencies the data. We show how this class of models and our construction algorithm are ideally suited to mining multi-relational data. }, author = {Getoor, Lise} } @conference {14402, title = {Multi-relational data mining using probabilistic relational models: research summary}, booktitle = {In Proceedings of the First Workshop in Multi-relational Data Mining}, year = {2001}, month = {2001///}, abstract = {We are often faced with the challenge of mining data represented in relational form. Unfortunately, most statistical learning methods work only with {\textquotedblleft}flat {\textquotedblright} data representations. Thus, to apply these methods, we are forced to convert the data into a flat form, thereby not only losing its compact representation and structure but also potentially introducing statistical skew. These drawbacks severely limit the ability of current statistical methods to mine relational databases. Probabilistic models, in particular probabilistic relational models, allow us to represent a statistical model over a relational domain. These models can represent correlations between attributes within a single table, and between attributes in multiple tables, when these tables are related via foreign key joins. In previous work [4, 6, 8], we have developed algorithms for automatically constructing a probabilistic relational model directly from a relational database. We survey the results here and describe how the methods can be used to discover interesting dependencies the data. We show how this class of models and our construction algorithm are ideally suited to mining multi-relational data.}, author = {Getoor, Lise} } @article {17286, title = {Making Computer and Internet Usability a Priority}, year = {2000}, month = {2000/10/04/}, abstract = {A management oriented essay on how to promote usability inorganizations. It begins with crafting the message (Good usability is good business). Then it deals with creating a cultural shift in information technology and software engineering departments, so that the impact of poor design and the benefits of improvements are widely understood. It closes with an eight-step call to action. Keywords: usability, technology fluency, user-centered design, software engineering (Also cross-referenced as UMIACS-TR-2000-70) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1106}, author = {Kreitzberg,Charles B and Shneiderman, Ben} } @conference {16715, title = {Measuring verb similarity}, booktitle = {Proceedings of the Twenty-second Annual Conference of the Cognitive Science Society: August 13-15, 2000, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, PA}, year = {2000}, month = {2000///}, pages = {399 - 399}, author = {Resnik, Philip and Diab,M.} } @article {15942, title = {Meta-reasoning for intelligent dialog repair}, year = {2000}, month = {2000///}, institution = {Technical report, University of Maryland}, abstract = {Under consideration for other conferences (specify)? We present a logical approach and implmentation of a real-time rational agent for dialogue management, which includes an ability to represent, reason about, and repair (both implicitly and explicitly) incoherence in dialogue. We exemplify a target problem of negative feedback in action directive subdialogues, with an ability to make reference resolution sensitive to dialogue context and like intentions. The resulting system is able to behave more sensibly in several situations than earlier dialogue management systems in these same conditions. Meta-reasoning for intelligent dialog repair We present a logical approach and implmentation of a real-time rational agent for dialogue management, which includes an ability to represent, reason about, and repair (both implicitly and explicitly) incoherence in dialogue. We exemplify a target problem of negative feedback in action directive subdialogues, with an ability to make reference resolution sensitive to dialogue context and like intentions. The resulting system is able to behave more sensibly in several situations than earlier dialogue management systems in these same conditions.}, author = {Purang,K. and Traum,D. and Purushothaman,D. and Chong,W. and Okamato,Y. and Perlis, Don} } @conference {14987, title = {MOCHA: a database middleware system featuring automatic deployment of application-specific functionality}, booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas}, year = {2000}, month = {2000///}, author = {Rodr{\i}guez-Martinez,M. and Roussopoulos, Nick and McGann,J. M and Keyley,S. and Katz,V. and Song,Z. and JaJa, Joseph F.} } @conference {16747, title = {MOCHA: a self-extensible database middleware system for distributed data sources}, booktitle = {ACM SIGMOD Record}, volume = {29}, year = {2000}, month = {2000///}, pages = {213 - 224}, author = {Rodr{\'\i}guez-Mart{\'\i}nez,M. and Roussopoulos, Nick} } @article {15370, title = {A model for magnetic aftereffect in the presence of time varying demagnetizing fields}, journal = {Magnetics, IEEE Transactions on}, volume = {36}, year = {2000}, month = {2000/09//}, pages = {3182 - 3184}, abstract = {Preisach models driven by stochastic inputs are employed to model magnetic aftereffect in the presence of demagnetizing fields. As a result of thermal relaxation, the magnetization and, consequently, the demagnetizing field vary in time. The new model generalizes earlier work and self-consistently accounts for the effect of time varying demagnetizing fields on the relaxation process. Three practical numerical techniques are proposed to compute the time variation in the magnetic field and the state of the Preisach plane}, keywords = {aftereffect;, aftereffect;magnetization;numerical, demagnetizing, field;demagnetisation;magnetic, model;magnetic, Preisach, relaxation;time, simulation;thermal, varying}, isbn = {0018-9464}, doi = {10.1109/20.908729}, author = {Korman,C.E. and Adly,A.A. and Mayergoyz, Issak D and Rugkwamsook,P.} } @conference {14232, title = {Multi-camera networks: eyes from eyes}, booktitle = {IEEE Workshop on Omnidirectional Vision, 2000. Proceedings}, year = {2000}, month = {2000///}, pages = {11 - 18}, publisher = {IEEE}, organization = {IEEE}, abstract = {Autonomous or semi-autonomous intelligent systems, in order to function appropriately, need to create models of their environment, i.e., models of space time. These are descriptions of objects and scenes and descriptions of changes of space over time, that is, events and actions. Despite the large amount of research on this problem, as a community we are still far from developing robust descriptions of a system{\textquoteright}s spatiotemporal environment using video input (image sequences). Undoubtedly, some progress has been made regarding the understanding of estimating the structure of visual space, but it has not led to solutions to specific applications. There is, however, an alternative approach which is in line with today{\textquoteright}s {\textquotedblleft}zeitgeist.{\textquotedblright} The vision of artificial systems can be enhanced by providing them with new eyes. If conventional video cameras are put together in various configurations, new sensors can be constructed that have much more power and the way they {\textquotedblleft}see{\textquotedblright} the world makes it much easier to solve problems of vision. This research is motivated by examining the wide variety of eye design in the biological world and obtaining inspiration for an ensemble of computational studies that relate how a system sees to what that system does (i.e. relating perception to action). This, coupled with the geometry of multiple views that has flourished in terms of theoretical results in the past few years, points to new ways of constructing powerful imaging devices which suit particular tasks in robotics, visualization, video processing, virtual reality and various computer vision applications, better than conventional cameras. This paper presents a number of new sensors that we built using common video cameras and shows their superiority with regard to developing models of space and motion}, keywords = {Biosensors, CAMERAS, Computer vision, Eyes, Image sequences, intelligent systems, Layout, Machine vision, Robot vision systems, Robustness, Spatiotemporal phenomena, video cameras, Virtual reality}, isbn = {0-7695-0704-2}, doi = {10.1109/OMNVIS.2000.853797}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J. and Baker, P. and Pless, R. and Neumann, J. and Stuart, B.} } @article {12371, title = {Multidimensional exploration of software implementations for DSP algorithms}, journal = {The Journal of VLSI Signal Processing}, volume = {24}, year = {2000}, month = {2000///}, pages = {83 - 98}, author = {Zitzler,E. and Teich,J. and Bhattacharyya, Shuvra S.} } @conference {13709, title = {A multi-level approach to interlingual machine translation: defining the interface between representational languages}, booktitle = {Natural language processing and knowledge representation}, year = {2000}, month = {2000///}, pages = {207 - 248}, author = {Dorr, Bonnie J and Voss,C.R.} } @article {13820, title = {Machine Translation}, journal = {Multilingual Information Management: Current Levels and Future Abilities}, year = {1999}, month = {1999///}, pages = {18 - 18}, author = {Bel,N. and Dorr, Bonnie J and Hovy,E. and Knight,K. and Iida,H. and Boitet,C. and Maegaard,B. and Wilks,Y.} } @conference {16678, title = {Mining the web for bilingual text}, booktitle = {Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics}, year = {1999}, month = {1999///}, pages = {527 - 534}, author = {Resnik, Philip} } @conference {15984, title = {Mixed initiative dialogue and intelligence via active logic}, booktitle = {proceedings of the AAAI99 Workshop on Mixed-Initiative Intelligence}, year = {1999}, month = {1999///}, pages = {60 - 67}, author = {Andersen,C. and Traum,D. and Purang,K. and Purushothaman,D. and Perlis, Don} } @conference {13601, title = {Model Based Graphics Recognition}, booktitle = {GREC}, year = {1999}, month = {1999///}, pages = {136 - 143}, author = {Stuckelberg,M.V. and David Doermann} } @conference {16579, title = {A model of lateralization and asymmetries in cortical maps}, booktitle = {Neural Networks, 1999. IJCNN{\textquoteright}99. International Joint Conference on}, volume = {1}, year = {1999}, month = {1999///}, pages = {121 - 124}, author = {Levitan,S. and Stoica,I. and Reggia, James A.} } @article {16354, title = {Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results}, journal = {ACM Transactions on Programming Languages and SystemsACM Trans. Program. Lang. Syst.}, volume = {21}, year = {1999}, month = {1999/07//}, pages = {747 - 789}, isbn = {01640925}, doi = {10.1145/325478.325480}, url = {http://dl.acm.org/citation.cfm?id=325480}, author = {Bultan,Tevfik and Gerber,Richard and Pugh, William} } @article {14112, title = {Modified streamline diffusion schemes for convection-diffusion problems}, journal = {Computer Methods in Applied Mechanics and Engineering}, volume = {174}, year = {1999}, month = {1999/05/04/}, pages = {137 - 151}, abstract = {We consider the design of robust and accurate finite element approximation methods for solving convection--diffusion problems. We develop some two-parameter streamline diffusion schemes with piecewise bilinear (or linear) trial functions and show that these schemes satisfy the necessary conditions for L2-uniform convergence of order greater than 1/2 introduced by Stynes and Tobiska M. Stynes and L. Tobiska, Necessary L2-uniform convergence conditions for difference schemes for two dimensional convection--diffusion problems, Comput. Math. Applic. 29 (1995) 45-53. For smooth problems, the schemes satisfy error bounds of the form O(h)u2 in an energy norm. In addition, extensive numerical experiments show that they effectively reproduce boundary layers and internal layers caused by discontinuities on relatively coarse grids, without any requirements on alignment of flow and grid.}, isbn = {0045-7825}, doi = {16/S0045-7825(98)00283-7}, url = {http://www.sciencedirect.com/science/article/pii/S0045782598002837}, author = {Shih,Yin-Tzer and Elman, Howard} } @article {14093, title = {More surprises from Kinetoplastida}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, volume = {96}, year = {1999}, month = {1999///}, pages = {2579 - 2579}, author = {Donelson,J. E and Gardner,M. J and El-Sayed, Najib M.} } @conference {12041, title = {Motion Segmentation: A Synergistic Approach}, booktitle = {Computer Vision and Pattern Recognition, IEEE Computer Society Conference on}, volume = {2}, year = {1999}, month = {1999///}, pages = {2226 - 2226}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Since estimation of camera motion requires knowledge of independent motion, and moving object detection and localization requires knowledge about the camera motion, the two problems of motion estimation and segmentation need to be solved together in a synergistic manner. This paper provides an approach to treating both these problems simultaneously. The technique introduced here is based on a novel concept, {\textquoteleft}{\textquoteleft}scene ruggedness,{\textquoteright}{\textquoteright} which parameterizes the variation in estimated scene depth with the error in the underlying three-dimensional (3D) motion. The idea is that incorrect 3D motion estimates cause distortions in the estimated depth map, and as a result smooth scene patches are computed as rugged surfaces. The correct 3D motion can be distinguished, as it does not cause any distortion and thus gives rise to the background patches with the least depth variation between depth discontinuities, with the locations corresponding to independent motion being rugged. The algorithm presented employs a binocular observer whose nature is exploited in the extraction of depth discontinuities, a step that facilitates the overall procedure, but the technique can be extended to a monocular observer in a variety of ways.}, keywords = {epipolar minimization, independent motion detection, Motion analysis}, doi = {http://doi.ieeecomputersociety.org/10.1109/CVPR.1999.784633}, author = {Ferm{\"u}ller, Cornelia and Brodsky, Tomas and Aloimonos, J.} } @conference {18493, title = {An MPEG-2 to H. 263 transcoder}, booktitle = {SPIE Voice, Video, and Data Communications Conference}, year = {1999}, month = {1999///}, abstract = {We present an MPEG-2 to H.263 transcoder that accepts an interlaced MPEG-2 bitstream as the input and producesa lower-bitrate progressive H.263 bitstream as the output. As both DVD and digital television may use MPEG-2 interlaced sequences, a potential application of such a transcoder is the transmission of a digital television signal over a wireless medium. Another application is transcoding interlaced DVD content for use on lower-resolution thin clients with progressive displays. The proposed algorithm exploits the properties of the MPEG-2 and H.263 compression standards to perform interlaced to progressive ( eld to frame) conversion with spatial downsampling and frame-rate reduction in a CPU and memory e cient manner, while additionally minimizing picture quality degradation as measured by PSNR. This is the rst algorithm to our knowledge that e ectively uses both spatial and temporal downsampling in an MPEG-2 to H.263 eld to frame transcoder in order to achieve substantial bitrate reduction. This paper discusses recoding experiments used to determine appropriate source and target coding parameters for the transcoder, provides a detailed description of the transcoding algorithm, and describes the performance of a software implementation of the transcoder. }, author = {Feamster, Nick and Wee,S.} } @article {18248, title = {Multi-level data hiding for digital image and video}, journal = {SPIE Photonics East{\textquoteright}99}, year = {1999}, month = {1999///}, abstract = {Previous works on data hiding generally targeted on a specific tradeoff between capacity and robustness. This results inoverestimation of the processing noise under some situations and/or underestimation under some other situations, hence limits the overall performance. In this paper, we propose a multi-level data hiding scheme which is able to convey secondary data in high rate when noise is not severe and can also convey some data reliably under heavy distortion. The proposed scheme is motivated by a two-category classification of embedding schemes and by a study on detection performance of spread spectrum watermarking. The multi-level data hiding has been successfully applied to both digital image and video, and can be used for applications such as copy control. }, author = {Wu,M. and Yu,H. and Gelman,A.} } @article {15853, title = {Multilingual Information Discovery and AccesS (MIDAS): A Joint ACM DL{\textquoteright}99/ ACM SIGIR{\textquoteright}99 Workshop.}, journal = {D-Lib MagazineD-Lib Magazine}, volume = {5}, year = {1999}, month = {1999///}, pages = {1 - 12}, abstract = {Discusses a multidisciplinary workshop that addressed issues concerning internationally distributed information networks. Highlights include multilingual information access in media other than character-coded text; cross-language information retrieval and multilingual metadata; and evaluation of multilingual systems. (LRW)}, keywords = {Distributed computing, Electronic Media}, isbn = {ISSN-1082-9873}, url = {http://www.eric.ed.gov/ERICWebPortal/detail?accno=EJ601937}, author = {Oard, Douglas and Peters,Carol and Ruiz,Miguel and Frederking,Robert and Klavans,Judith and Sheridan,Paraic} } @conference {17302, title = {Multiple dimensions> 3}, booktitle = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {93 - 95}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {13616, title = {On musical score recognition using probabilistic reasoning}, booktitle = {Document Analysis and Recognition, 1999. ICDAR {\textquoteright}99. Proceedings of the Fifth International Conference on}, year = {1999}, month = {1999/09//}, pages = {115 - 118}, abstract = {We present a probabilistic framework for document analysis and recognition and illustrate it on the problem of musical score recognition. Our system uses an explicit descriptive model of the document class to find the most likely interpretation of a scanned document image. In contrast to the traditional pipeline architecture, we carry out all stages of the analysis with a single inference engine, allowing for an end-to-end propagation of the uncertainty. The global modeling structure is similar to a stochastic attribute grammar, and local parameters are estimated using hidden Markov models}, keywords = {analysis;document, attribute, class;document, descriptive, document, engine;local, estimation;musical, grammar;attribute, grammars;character, handling;, image, interpretation;stochastic, Markov, mechanisms;music;uncertainty, model;global, modeling, models;inference, parameter, processing;image, propagation;explicit, reasoning;scanned, recognition;document, recognition;end-to-end, recognition;inference, recognition;probabilistic, score, structure;hidden, Uncertainty}, doi = {10.1109/ICDAR.1999.791738}, author = {Stuckelberg,M.V. and David Doermann} } @article {16767, title = {Materialized views and data warehouses}, journal = {ACM SIGMOD RecordSIGMOD Rec.}, volume = {27}, year = {1998}, month = {1998/03//}, pages = {21 - 26}, isbn = {01635808}, doi = {10.1145/273244.273253}, url = {http://dl.acm.org/citation.cfm?id=273244.273253}, author = {Roussopoulos, Nick} } @book {17707, title = {Matrix Algorithms: Basic decompositions}, year = {1998}, month = {1998/08/01/}, publisher = {SIAM}, organization = {SIAM}, abstract = {This thorough, concise, and superbly written volume is the first in a self-contained five-volume series devoted to matrix algorithms. It focuses on the computation of matrix decompositions - the factorization of matrices into products of similar ones. The first two chapters provide the required background from mathematics and computer science needed to work effectively in matrix computations. The remaining chapters are devoted to the computation and applications of the LU and QR decompositions. The series is aimed at the nonspecialist who needs more than black-box proficiency with matrix computations. A certain knowledge of elementary analysis and linear algebra is assumed, as well as a reasonable amount of programming experience. The guiding principle, that if something is worth explaining, it is worth explaining fully, has necessarily restricted the scope of the series, but the selection of topics should give the reader a sound basis for further study.}, keywords = {Mathematics / Algebra / General, Mathematics / Algebra / Linear, Mathematics / Applied, Mathematics / Mathematical Analysis, Mathematics / Matrices, Mathematics / Numerical Analysis, Matrices}, isbn = {9780898714142}, author = {Stewart, G.W.} } @conference {16478, title = {A Meta-Wrapper for Scaling up to Multiple Autonomous Distributed Information Sources}, booktitle = {Cooperative Information Systems, IFCIS International Conference on}, year = {1998}, month = {1998///}, pages = {148 - 148}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Abstract Current mediator and wrapper architectures do not have the flexibility to scale to multiple wrapped sources, where some sources may be redundant, and some sources may provide incomplete answers to a query. We propose a meta-wrapper component which is capable of handling multiple wrapped sources, in a particular domain, where the multiple sources provide related information. The meta-wrapper makes these sources transparent to the mediator, and provides a single meta-wrapper interface for all these sources. Source descriptions specify the content and query capability of the sources. These are used to determine the meta-wrapper interface and to decide which queries from a mediator can be accepted. Sources are partitioned into equivalence classes, based on their descriptions. These equivalence classes are partially ordered, and the lattices that correspond to these orderings are used to identify the relevant sources for a query submitted by the mediator. If there is redundancy of the sources, the meta-wrapper identifies alternate sources for the query. A meta-wrapper cost model is then used to select among alternate relevant sources and choose the best plan.}, keywords = {information resource discovery, integration and interoperability, metadata use and management, wrappers and mediators}, isbn = {0-8186-8380-5}, doi = {http://doi.ieeecomputersociety.org/10.1109/COOPIS.1998.706193}, author = {Vidal,Maria Esther and Raschid, Louiqa and Gruser,Jean Robert} } @article {15674, title = {Minimum Enclosures with Specified Angles}, volume = {CS-TR-3219}, year = {1998}, month = {1998/10/15/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {Given a convex polygon P, an m-envelope is a convex m-sidedpolygon that contains P. Given any convex polygon P, and any sequence of m > 3 angles A = ((11Xct2X@..ckm) we consider the problem of computing the minimum area m-envelope for P whose counte rclockwise sequence of exterior angles is given by A. We show that such envelopes can be computed in O(nm log m) time. The main result on which the correctness of the algorithm rests is a flushness condition stating that for any locally minimum enclosure with specified angles, one of its sides must be collinear with one of the sides of P. (Also cross-referenced as CAR-TR-701) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/405}, author = {Mount, Dave and Silverman,Ruth} } @article {14804, title = {Modeling and evaluating design alternatives for an on-line instrumentation system: a case study}, journal = {IEEE Transactions on Software Engineering}, volume = {24}, year = {1998}, month = {1998/06//}, pages = {451 - 470}, abstract = {This paper demonstrates the use of a model-based evaluation approach for instrumentation systems (ISs). The overall objective of this study is to provide early feedback to tool developers regarding IS overhead and performance; such feedback helps developers make appropriate design decisions about alternative system configurations and task scheduling policies. We consider three types of system architectures: network of workstations (NOW), symmetric multiprocessors (SMP), and massively parallel processing (MPP) systems. We develop a Resource OCCupancy (ROCC) model for an on-line IS for an existing tool and parameterize it for an IBM SP-2 platform. This model is simulated to answer several {\textquotedblleft}what if{\textquotedblright} questions regarding two policies to schedule instrumentation data forwarding: collect-and-forward (CF) and batch-and-forward (BF). In addition, this study investigates two alternatives for forwarding the instrumentation data: direct and binary tree forwarding for an MPP system. Simulation results indicate that the BF policy can significantly reduce the overhead and that the tree forwarding configuration exhibits desirable scalability characteristics for MPP systems. Initial measurement-based testing results indicate more than 60 percent reduction in the direct IS overhead when the BF policy was added to Paradyn parallel performance measurement tool}, keywords = {alternative system configurations, Application software, batch-and-forward, collect-and-forward, Computer aided software engineering, design alternatives, design decisions, Feedback, IBM SP-2 platform, Instruments, massively parallel processing, model-based evaluation approach, Monitoring, multiprocessing programs, on-line instrumentation system, Paradyn parallel performance measurement tool, PARALLEL PROCESSING, Real time systems, scalability characteristics, software metrics, software tools, Space technology, symmetric multiprocessors, system architectures, system monitoring, System testing, task scheduling policies, tool developers, tree forwarding configuration, Workstations}, isbn = {0098-5589}, doi = {10.1109/32.689402}, author = {Waheed, A. and Rover, D. T and Hollingsworth, Jeffrey K} } @conference {14534, title = {Modeling of particle motion in viscous swirl flow between two porous cylinders}, booktitle = {Proc. ASME Fluids Engineering Division Summer Meeting}, year = {1998}, month = {1998///}, pages = {21 - 25}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {14988, title = {Models and high-performance algorithms for global BRDF retrieval}, journal = {Computational Science Engineering, IEEE}, volume = {5}, year = {1998}, month = {1998/12//oct}, pages = {16 - 29}, abstract = {The authors describe three models for retrieving information related to the scattering of light on the Earth{\textquoteright}s surface. Using these models, they{\textquoteright}ve developed algorithms for the IBM SP2 that efficiently retrieve this information}, keywords = {algorithms;, BRDF, Earth, geomorphology;, geophysical, global, high-performance, IBM, information, light, machines;, models;, Parallel, processing;, reflectivity;, retrieval, retrieval;, scattering;, signal, SP2;, surface;}, isbn = {1070-9924}, doi = {10.1109/99.735892}, author = {Zengyan Zhang and Kalluri, SNV and JaJa, Joseph F. and Liang,Shunlin and Townshend,J.R.G.} } @conference {17627, title = {Multicommodity flow and circuit switching}, booktitle = {, Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998}, volume = {7}, year = {1998}, month = {1998/01/06/9}, pages = {459-465 vol.7 - 459-465 vol.7}, publisher = {IEEE}, organization = {IEEE}, abstract = {Given a set of request pairs in a network, the problem of routing virtual circuits with low congestion is to connect each pair by a path so that few paths use the same link in the network. We build on an earlier multicommodity flow based approach of Leighton and Rao (1996) to show that short flow paths lead to path selections with low congestion. This shows that such good path selections exist for constant-degree expanders with strong expansion, generalizing a result of (Broder et al., 1994). We also show, for infinitely many n, n-vertex undirected graphs Gn along with a set T of connection requests, such that: T is fractionally realizable using flow-paths that impose a (fractional) congestion of at most 1; but any rounding of such a flow to the given set of flow-paths, leads to a congestion of Ω(log n/log log n). This is progress on a long-standing open problem}, keywords = {Application software, Bandwidth, circuit switching, Computer science, constant-degree expanders, graph theory, High speed integrated circuits, Integrated circuit technology, Laboratories, low congestion, MATHEMATICS, multicommodity flow, National electric code, network routing, path selections, Routing, short flow paths, Switching circuits, switching theory, undirected graphs, virtual circuit routing}, isbn = {0-8186-8255-8}, doi = {10.1109/HICSS.1998.649241}, author = {Leighton,T. and Rao,S. and Srinivasan, Aravind} } @article {14084, title = {Multiple mechanisms of immune evasion by African trypanosomes}, journal = {Molecular and Biochemical Parasitology}, volume = {91}, year = {1998}, month = {1998/03/01/}, pages = {51 - 66}, abstract = {During infection of a mammalian host, African trypanosomes are in constant contact with the host{\textquoteright}s immune system. These protozoan parasites are infamous for their ability to evade the immune responses by periodically switching their major variant surface glycoprotein (VSG), a phenomenon called antigenic variation. Antigenic variation, however, is likely to be only one of several mechanisms enabling these organisms to thrive in the face of the immune defenses. The ability to grow in high levels of interferon-gamma (IFN-[gamma]) and to avoid complement-mediated destruction may also facilitate the parasite{\textquoteright}s survival. In this review we summarize (i) the activation of trypanosome genes for three different VSGs during antigenic variation, (ii) the secretion of a trypanosome protein that induces host CD8+ T cells to produce IFN-[gamma], and (iii) the evidence for trypansome protein similar to a surface protease of Leishmania that plays a role in resistance to complement-mediated lysis.}, keywords = {Leishmania, Recombinant cloning, T cell, Trypanosomes, VSG genes}, isbn = {0166-6851}, doi = {16/S0166-6851(97)00209-0}, url = {http://www.sciencedirect.com/science/article/pii/S0166685197002090}, author = {Donelson,John E. and Hill,Kent L. and El-Sayed, Najib M.} } @article {18722, title = {The main-chain dynamics of the dynamin pleckstrin homology (PH) domain in solution: analysis of 15N relaxation with monomer/dimer equilibration}, journal = {Journal of Molecular Biology}, volume = {266}, year = {1997}, month = {1997/02/14/}, pages = {173 - 194}, abstract = {The backbone dynamics of the pleckstrin homology (PH) domain from dynamin were studied by 15N NMR relaxation (R1 and R2) and steady state heteronuclear 15N {1H} nuclear Overhauser effect measurements at 500 and 600 MHz, at protein concentrations of 1.7 mM and 300 μM, and by molecular dynamics (MD) simulations. The analysis was performed using the model-free approach. The method was extended in order to account for observed partial (equilibrium) dimerization of the protein at NMR concentrations. A model is developed that takes into account both rapid monomer-dimer exchange and anisotropy of the over-all rotation of the dimer. The data show complex dynamics of the dynamin PH domain. Internal motions in elements of the secondary structure are restricted, as inferred from the high value of the order parameter (S2 \~{} 0.9) and from the local correlation time \<100 ps. Of the four extended loop regions that are disordered in the NMR-derived solution structure of the protein, loops β1/β2 and β5/β6 are involved in a large-amplitude (S2 down to 0.2 to 0.3) subnanosecond to nanosecond time-scale motion. Reorientation of the loops β3/β4 and β6/β7, in contrast, is restricted, characterized by the values of order parameter S2 \~{} 0.9 more typical of the protein core. These loops, however, are involved in much slower processes of motion resulting in a conformational exchange on a microsecond to submillisecond time scale. The motions of the terminal regions (residues 1 to 10, 122 to 125) are practically unrestricted (S2 down to 0.05, characteristic times in nanosecond time scale), suggesting that these parts of the sequence do not participate in the protein fold. The analysis shows a larger sensitivity of the 15N relaxation data to protein microdynamic parameters (S2, τloc) when protein molecular mass (τc) increases. The use of negative values of the steady state 15N{1H} NOEs as an indicator of the residues not belonging to the folded structure is suggested. The amplitudes of local motion observed in the MD simulation are in a good agreement with the NMR data for the amide NH groups located in the protein core.}, keywords = {dynamin, monomer/dimer equilibration, NMR relaxation, pleckstrin homology domain, protein dynamics}, isbn = {0022-2836}, doi = {10.1006/jmbi.1996.0771}, url = {http://www.sciencedirect.com/science/article/pii/S0022283696907718}, author = {Fushman, David and Cahill,Sean and Cowburn,David} } @article {17714, title = {On markov chains with sluggish transients}, journal = {Communications in Statistics. Stochastic Models}, volume = {13}, year = {1997}, month = {1997///}, pages = {85 - 94}, abstract = {In this note it is shown how to construct a Markov chain whose subdominant eigenvalue does not predict the decay of its transient}, isbn = {0882-0287}, doi = {10.1080/15326349708807414}, url = {http://www.tandfonline.com/doi/abs/10.1080/15326349708807414}, author = {Stewart, G.W.} } @article {14875, title = {Matching 3-D models to 2-D images}, journal = {International Journal of Computer Vision}, volume = {21}, year = {1997}, month = {1997///}, pages = {123 - 153}, abstract = {We consider the problem of analytically characterizing the set of all 2-D images that a group of 3-D features may produce, and demonstrate that this is a useful thing to do. Our results apply for simple point features and point features with associated orientation vectors when we model projection as a 3-D to 2-D affine transformation. We show how to represent the set of images that a group of 3-D points produces with two lines (1-D subspaces), one in each of two orthogonal, high-dimensional spaces, where a single image group corresponds to one point in each space. The images of groups of oriented point features can be represented by a 2-D hyperbolic surface in a single high-dimensional space. The problem of matching an image to models is essentially reduced to the problem of matching a point to simple geometric structures. Moreover, we show that these are the simplest and lowest dimensional representations possible for these cases.We demonstrate the value of this way of approaching matching by applying our results to a variety of vision problems. In particular, we use this result to build a space-efficient indexing system that performs 3-D to 2-D matching by table lookup. This system is analytically built and accessed, accounts for the effects of sensing error, and is tested on real images. We also derive new results concerning the existence of invariants and non-accidental properties in this domain. Finally, we show that oriented points present unexpected difficulties: indexing requires fundamentally more space with oriented than with simple points, we must use more images in a motion sequence to determine the affine structure of oriented points, and the linear combinations result does not hold for oriented points. }, doi = {10.1023/A:1007927623619}, author = {Jacobs, David W.} } @conference {14813, title = {MDL: a language and compiler for dynamic program instrumentation}, booktitle = {, 1997 International Conference on Parallel Architectures and Compilation Techniques., 1997. Proceedings}, year = {1997}, month = {1997/11/10/14}, pages = {201 - 212}, publisher = {IEEE}, organization = {IEEE}, abstract = {We use a form of dynamic code generation, called dynamic instrumentation, to collect data about the execution of an application program. Dynamic instrumentation allows us to instrument running programs to collect performance and other types of information. The instrumentation code is generated incrementally and can be inserted and removed at any time. Our instrumentation currently runs on the SPARC, PA-RISC, Power 2, Alpha, and x86 architectures. Specification of what data to collect are written in a specialized language called the Metric Description Language, that is part of the Paradyn Parallel Performance Tools. This language allows platform independent descriptions of how to collect performance data. It also provides a concise way to specify, how to constrain performance data to particular resources such as modules, procedures, nodes, files, or message channels (or combinations of these resources). We also describe the details of how we weave instrumentation into a running program}, keywords = {Alpha architecture, application program, application program interfaces, Application software, compiler generators, Computer science, dynamic code generation, Dynamic compiler, dynamic program instrumentation, Educational institutions, files, instrumentation code, Instruments, MDL, measurement, message channels, Message passing, Metric Description Language, modules, nodes, Operating systems, optimising compilers, PA-RISC, Paradyn Parallel Performance Tools, Parallel architectures, parallel programming, performance data, platform independent descriptions, Power 2 architecture, Power generation, procedures, program debugging, Program processors, running programs, Runtime, software metrics, SPARC, Specification languages, x86 architecture}, isbn = {0-8186-8090-3}, doi = {10.1109/PACT.1997.644016}, author = {Hollingsworth, Jeffrey K and Niam, O. and Miller, B. P and Zhichen Xu and Goncalves,M. J.R and Ling Zheng} } @article {14741, title = {The measured cost of copying garbage collection mechanisms}, journal = {SIGPLAN Not.}, volume = {32}, year = {1997}, month = {1997/08//}, pages = {292 - 305}, abstract = {We examine the costs and benefits of a variety of copying garbage collection (GC) mechanisms across multiple architectures and programming languages. Our study covers both low-level object representation and copying issues as well as the mechanisms needed to support more advanced techniques such as generational collection, large object spaces, and type segregated areas.Our experiments are made possible by a novel performance analysis tool, Oscar. Oscar allows us to capture snapshots of programming language heaps that may then be used to replay garbage collections. The replay program is self-contained and written in C, which makes it easy to port to other architectures and to analyze with standard performance analysis tools. Furthermore, it is possible to study additional programming languages simply by instrumenting existing implementations to capture heap snapshots.In general, we found that careful implementation of GC mechanisms can have a significant benefit. For a simple collector, we measured improvements of as much as 95\%. We then found that while the addition of advanced features can have a sizeable overhead (up to 15\%), the net benefit is quite positive, resulting in additional gains of up to 42\%. We also found that results varied depending upon the platform and language. Machine characteristics such as cache arrangements, instruction set (RISC/CISC), and register pool were important. For different languages, average object size seemed to be most important.The results of our experiments demonstrate the usefulness of a tool like Oscar for studying GC performance. Without much overhead, we can easily identify areas where programming language implementors could collaborate with GC implementors to improve GC performance.}, isbn = {0362-1340}, doi = {10.1145/258949.258976}, url = {http://doi.acm.org/10.1145/258949.258976}, author = {Hicks, Michael W. and Moore,Jonathan T. and Nettles,Scott M.} } @conference {17623, title = {Mechanism design for intellectual property rights protection}, booktitle = {Proceedings of the eighteenth international conference on Information systems}, series = {ICIS {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {448{\textendash} - 448{\textendash}}, publisher = {Association for Information Systems}, organization = {Association for Information Systems}, address = {Atlanta, GA, USA}, url = {http://dl.acm.org/citation.cfm?id=353071.353206}, author = {Giridharan,P. S. and Srinivasan, Aravind} } @article {15523, title = {Model generation and state generation for disjunctive logic programs}, journal = {The Journal of Logic Programming}, volume = {32}, year = {1997}, month = {1997/07//}, pages = {49 - 69}, abstract = {This paper investigates two fixpoint approaches for minimal model reasoning with disjunctive logic programs P. The first one, called model generation, is based on an operator TPINT defined on sets of Herbrand interpretations whose least fixpoint is logically equivalent to the set of minimal Herbrand models of the program. The second approach, called state generation, uses a fixpoint operation TPs based on hyperresolution. It operates on disjunctive Herbrand states, and its least fixpoint is the set of logical consequences of P, the so-called minimal model state of the program. We establish a useful relationship between hyperresolution by PPs and model generation by TPINT. Then we investigate the problem of continuity of the two operators TPs and TPINT. It is known that the operator TPs is continuous, and so it reaches its least fixpoint in at most ω iterations. On the other hand, the question of whether TPINT is continuous has been open. We show by a counterexample that TPINT is not continuous. Nevertheless, we prove that it converges towards its least fixpoint in at most ω iterations, too, as follows from the relationship that we show exists between hyperresolution and model generation. We define an iterative version of TPINT that computes the perfect model semantics of stratified disjunctive logic programs. On each stratum of the program, this operator converges in at most ω iterations. Model generations for the stable semantics and the partial stable semantics are respectively achieved by using this iterative operator together with the evidential transformation and the 3-S transformation.}, isbn = {0743-1066}, doi = {10.1016/S0743-1066(96)00116-1}, url = {http://www.sciencedirect.com/science/article/pii/S0743106696001161}, author = {Seipel,Dietmar and Minker, Jack and Ruiz,Carolina} } @article {12842, title = {Modeling and verifying active structural control systems}, journal = {Science of Computer Programming}, volume = {29}, year = {1997}, month = {1997/07//}, pages = {99 - 122}, isbn = {01676423}, doi = {10.1016/S0167-6423(96)00031-7}, url = {zotero://attachment/28808/}, author = {Elseaidy,W.} } @article {17954, title = {Multiresolution surface modeling}, journal = {SIGGRAPH 1997 Course Notes}, year = {1997}, month = {1997///}, author = {Heckbert,P. and Rossignac,J. and Hoppe,H. and Schroeder,W. and Soucy,M. and Varshney, Amitabh} } @article {13608, title = {Multiscale Document Page Segmentation Using Soft Decision Integration}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, year = {1997}, month = {1997///}, pages = {92 - 96}, author = {Etemad,K. and David Doermann and Chellapa, Rama} } @article {11922, title = {MARUTI at ARDEC.}, year = {1996}, month = {1996/07/11/}, institution = {University of Maryland, College Park}, abstract = {This is the final report of the effort undertaken at the University of Maryland, sponsored by DARPA under the DSSA (Domain Specific Software Architectures) program. The activities reported here required an active cooperation and collaboration of the US Army ARDEC (Automation and Robotics Laboratory) and the University of Maryland (Computer Science Department). The principal investigators have been developing a hard real time operating system, MARUTI, at the University of Maryland. The goal of this effort was to demonstrate the applicability and usefulness of this operating system for exercising PID control at high frequency on the ATB1000 testbed which has been used to simulate a gun turret. A MARUTI based PID controller which operates at 200 HZ and 400 HZ was successfully implemented to demonstrate this feasibility.}, keywords = {*OPERATING SYSTEMS(COMPUTERS), Computer architecture, COMPUTER PROGRAMMING AND SOFTWARE, CONTROL, Cooperation, DSSA(DOMAIN SPECIFIC SOFTWARE ARCHITECTURE), GUN TURRETS., HIGH FREQUENCY, Laboratories, REAL TIME, ROBOTICS, TEST BEDS}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA315086}, author = {Agrawala, Ashok K. and Tripathi,Satish K} } @article {14825, title = {Matching convex polygons and polyhedra, allowing for occlusion}, journal = {Applied Computational Geometry Towards Geometric Engineering}, year = {1996}, month = {1996///}, pages = {133 - 147}, abstract = {We review our recent results on visual object recognition and reconstruction allowing for occlusion. Our scheme uses matches between convex parts of objects in the model and image to determine structure and pose, without relying on specific correspondences between local or global geometric features of the objects. We provide results determining the minimal number of regions required to uniquely determine the pose under a variety of situations, and also showing that, depending on the situation, the problem of determining pose may be a convex optimization problem that is efficiently solved, or it may be a non-convex optimization problem which has no known, efficient solution. We also relate the problem of determining pose using region matching to the problem of finding the transformation that places one polygon inside another and the problem of finding a line that intersects each of a set of 3-D volumes.}, doi = {10.1007/BFb0014491}, author = {Basri,R. and Jacobs, David W.} } @article {16452, title = {A methodology for query reformulation in CIS using semantic knowledge}, journal = {International Journal of Cooperative Information Systems}, volume = {5}, year = {1996}, month = {1996///}, pages = {431 - 468}, author = {Florescu,D. and Raschid, Louiqa and Valduriez,P.} } @conference {15530, title = {Mixing a default rule with stable negation}, booktitle = {Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics}, year = {1996}, month = {1996///}, pages = {122 - 125}, abstract = {Logic programs containing only at most one form ofdefault negation have been studied in the literature. We describe a class of logic programs containing multi- ple forms of default negation. We de ne a meaning for these programs based on the well{founded semantics and the stable semantics. We investigate properties of the new combined semantics and calculate the com- putational complexity of determining the existence of models, and of skeptical and credulous reasoning. An e ective procedure to construct the collection of mod- els characterizing the semantics of a program is given. Applications to knowledge representation and knowl- edge base merging are presented. }, author = {Minker, Jack and Ruiz,C.} } @article {15534, title = {Model theoretic approach to view updates in deductive databases}, journal = {Journal of Automated Reasoning}, volume = {17}, year = {1996}, month = {1996///}, pages = {171 - 197}, abstract = {The view update problem for deductive databases has been defined as the problem of accomplishing the update of an intensional predicate by modifying appropriately the extensional database. A previous paper by Grant, Horty, Lobo, and Minker developed algorithms for the insertion and the deletion of an intensional predicate in certain important classes of stratified disjunctive deductive databases. This paper introduces a model theoretic approach which encompasses a wide class of Herbrand semantics, including the perfect model and stable model semantics, for disjunctive databases including negation. This generalizes the earlier results: now the intensional database may contain disjunctive and denial rules, and the database may be required to satisfy integrity constraints. As in the previous paper, the algorithms are proved to be correct and best according to the criterion of causing minimal change to the database, where the first priority is to minimize deletions.}, doi = {10.1007/BF00244495}, author = {Fernandez,J. A. and Grant,J. and Minker, Jack} } @article {12785, title = {Modeling and verifying distributed systems using priorities: A case study}, journal = {Software - Concepts and Tools}, volume = {17}, year = {1996}, month = {1996///}, pages = {50 - 62}, author = {Cleaveland, Rance and Natarajan,V. and Sims,S. and Luettgen,G.} } @conference {14787, title = {Modeling, Evaluation, and Testing of Paradyn Instrumentation System}, booktitle = {Proceedings of the 1996 ACM/IEEE Conference on Supercomputing, 1996}, year = {1996}, month = {1996///}, pages = {18 - 18}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents a case study of modeling, evaluating, and testing the data collection services (called an instrumentation system) of the Paradyn parallel performance measurement tool using well-known performance evaluation and experiment design techniques. The overall objective of the study is to use modeling- and simulation-based evaluation to provide feedback to the tool developers to help them choose system configurations and task scheduling policies that can significantly reduce the data collection overheads. We develop and parameterize a resource occupancy model for the Paradyn instrumentation system (IS) for an IBM SP-2 platform. This model is parameterized with a measurement-based workload characterization and subsequently used to answer several "what if" questions regarding configuration options and two policies to schedule instrumentation system tasks: collect-and-forward (CF) and batch-and-forward (BF) policies. Simulation results indicate that the BF policy can significantly reduce the overheads. Based on this feedback, the BF policy was implemented in the Paradyn IS as an option to manage the data collection. Measurement-based testing results obtained from this enhanced version of the Paradyn IS are reported in this paper and indicate more than 60\% reduction in the direct IS overheads when the BF policy is used.}, keywords = {Distributed control, Feedback, High performance computing, Instruments, Monitoring, Real time systems, Software measurement, Software systems, Software testing, System testing}, isbn = {0-89791-854-1}, doi = {10.1109/SUPERC.1996.183524}, author = {Waheed, A. and Rover, D. T and Hollingsworth, Jeffrey K} } @article {18404, title = {Modeling software engineering environment capabilities}, journal = {Journal of Systems and Software}, volume = {35}, year = {1996}, month = {1996/10//}, pages = {3 - 14}, abstract = {There is considerable interest today in designing open systems that permit tools to be moved freely among various environments on different hardware platforms. To develop such systems, terms such as open systems, features for open systems such as interoperability, and integration must all be precisely defined. We present a model that is an extension of a servicebased reference model for development environments that can be used to formally define these and other related concepts.}, isbn = {0164-1212}, doi = {10.1016/0164-1212(95)00082-8}, url = {http://www.sciencedirect.com/science/article/pii/0164121295000828}, author = {Zelkowitz, Marvin V} } @article {14123, title = {Multigrid and Krylov subspace methods for the discrete Stokes equations}, journal = {International journal for numerical methods in fluids}, volume = {22}, year = {1996}, month = {1996///}, pages = {755 - 770}, author = {Elman, Howard} } @article {13710, title = {A Multi-Level Approach to Interlingual MT: Defining the Interface between Representational Languages}, journal = {International Journal of Expert Systems}, volume = {9}, year = {1996}, month = {1996///}, pages = {15 - 51}, abstract = {This paper describes a multi-level design, i.e., a non-uniform approach to interlingual ma-chine translation (MT), in which distinct representational languages are used for di erent types of knowledge. We demonstrate that a linguistically-motivated \division of labor" across multiple representation levels has not complicated, but rather has readily facilitated, the identi cation and construction of systematic relations at the interface between each level. Our approach assumes an interlingua derived from the lexical semantics and predi- cate decomposition approaches of Jackendo (1983; 1990) and Levin and Rappaport-Hovav (1995a; 1995b). We describe a model of interpretation and representation of natural lan- guage sentences which has been implemented as part of an interlingual MT system called PRINCITRAN. }, author = {Dorr, Bonnie J and Voss,C.R.} } @article {13832, title = {Multilingual generation: The role of telicity in lexical choice and syntactic realization}, journal = {Machine Translation}, volume = {11}, year = {1996}, month = {1996///}, pages = {37 - 74}, abstract = {Multilingual generation in machine translation (MT) requires a knowledge organization that facilitates the task of lexical choice, i.e. selection of lexical units to be used in the generation of a target-language sentence. This paper investigates the extent to which lexicalization patterns involving the lexical aspect feature [+telic] may be used for translating events and states among languages. Telicity has been correlated syntactically with both transitivity and unaccusativity, and semantically with Talmy{\textquoteright}s {\textquoteleft}path{\textquoteright} of a motion event, the representation of which characterizes languages parametrically.}, isbn = {0922-6567}, url = {http://dx.doi.org/10.1007/BF00349353}, author = {Dorr, Bonnie J and Olsen,Mari Broman} } @conference {18858, title = {Manufacturing feature instances: which ones to recognize?}, series = {SMA {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {141 - 152}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-672-7}, doi = {10.1145/218013.218052}, url = {http://doi.acm.org/10.1145/218013.218052}, author = {Gupta, Satyandra K. and Regli,William C. and Nau, Dana S.} } @conference {15599, title = {M.H.M: Euclidean spanners: short, thin, and lanky}, booktitle = {In: 27th ACM Symposium on Theory of Computing}, year = {1995}, month = {1995///}, pages = {489 - 498}, publisher = {ACM press}, organization = {ACM press}, abstract = {Euclidean spanners are important data structures in geometric algorithm design, because they provide a means of approximating the complete Euclidean graph with only O(n) edges, so that the shortest path length between each pair of points is not more than a constant factor longer than the Euclidean distance between the points. In many applications of spanners, it is important that the spanner possess a number of additional properties: low tot al edge weight, bounded degree, and low diameter. Existing research on spanners has considered one property or the other. We show that it is possible to build spanners in optimal O (n log n) time and O(n) space that achieve optimal or near optimal tradeoffs between all combinations of these *Max-Planck-Institut fiir Informatik, D-66123 Saarbrucken,}, author = {Arya,Sunil and Dast,Gautam and Mount, Dave and Salowe,Jeffrey S. and Smid,Michiel} } @article {12213, title = {A miniaturized space-variant active vision system: Cortex-I}, journal = {Machine Vision and applications}, volume = {8}, year = {1995}, month = {1995///}, pages = {101 - 109}, author = {Bederson, Benjamin B. and Wallace,R.S. and Schwartz,E.} } @article {16607, title = {A modified cellular automata model of nucleotide interactions and non-enzymatic transcription of DNA}, journal = {inbs}, year = {1995}, month = {1995///}, pages = {136 - 136}, author = {Hilke,J. and Reggia, James A. and Navarro-Gonzalez,R. and Lohn,J.} } @article {13821, title = {Machine translation divergences: a formal description and proposed solution}, journal = {Comput. Linguist.}, volume = {20}, year = {1994}, month = {1994/12//}, pages = {597 - 633}, abstract = {There are many cases in which the natural translation of one language into another results in a very different form than that of the original. The existence of translation divergences (i.e., crosslinguistic distinctions) makes the straightforward transfer from source structures into target structures impractical. Many existing translation systems have mechanisms for handling divergent structures but do not provide a general procedure that takes advantage of takes advantage of the systematic relation between lexical-semantic structure and syntactic structure. This paper demonstrates that a systematic solution to the divergence problem can be derived from the formalization of two types of information: (1) the linguistically grounded classes upon which lexical-semantic divergences are based; and (2) the techniques by which lexical-semantic divergences are resolved. This formalization is advantageous in that it facilitates the design and implementation of the system, allows one to make an evaluation of the status of the system, and provides a basis for proving certain important properties about the system.}, isbn = {0891-2017}, url = {http://dl.acm.org/citation.cfm?id=203987.203993}, author = {Dorr, Bonnie J} } @article {16594, title = {Map formation in proprioceptive cortex.}, journal = {International journal of neural systems}, volume = {5}, year = {1994}, month = {1994///}, pages = {87 - 87}, author = {Cho,S. and Reggia, James A.} } @article {18401, title = {Measuring prime program complexity}, journal = {Information Sciences}, volume = {77}, year = {1994}, month = {1994/03//}, pages = {325 - 350}, abstract = {This paper uses the prime program decomposition of a program as the basis for a measure that closely correlates with our intuitive notion of program complexity. This measure is based upon the information theory ideas of randomness and entropy such that results about structured programming, data abstractions, and other programming paradigms can be stated in quantitative terms, and empirical means can be used to validate the assumptions used to develop the model. As a graph-based model, it can be applied to several graphical examples as extensions not otherwise available to source-code based models. This paper introduces the measure, derives several properties for it, and gives some simple examples to demonstrate that the measure is a plausible approximation of our notions concerning structured programming.}, isbn = {0020-0255}, doi = {10.1016/0020-0255(94)90007-8}, url = {http://www.sciencedirect.com/science/article/pii/0020025594900078}, author = {Zelkowitz, Marvin V and Tian,Jianhui} } @conference {15948, title = {Meta-languages, reflection principles and self-reference}, booktitle = {Handbook of logic in artificial intelligence and logic programming}, year = {1994}, month = {1994///}, pages = {323 - 358}, author = {Perlis, Don and V.S. Subrahmanian} } @article {12216, title = {A miniature pan-tilt actuator: the spherical pointing motor}, journal = {IEEE Transactions on Robotics and Automation}, volume = {10}, year = {1994}, month = {1994/06//}, pages = {298 - 308}, abstract = {A pan-tilt mechanism is a computer-controlled actuator designed to point an object such as a camera sensor. For applications in active vision, a pan-tilt mechanism should be accurate, fast, small, inexpensive and have low power requirements. The authors have designed and constructed a new type of actuator meeting these requirements, which incorporates both pan and tilt into a single, two-degree-of-freedom device. The spherical pointing motor (SPM) consists of three orthogonal motor windings in a permanent magnetic field, configured to move a small camera mounted on a gimbal. It is an absolute positioning device and is run open-loop. The SPM is capable of panning and tilting a load of 15 grams, for example a CCD image sensor, at rotational velocities of several hundred degrees per second with a repeatability of .15{\textdegree}. The authors have also built a miniature camera consisting of a single CCD sensor chip and miniature lens assembly that fits on the rotor of this motor. In this paper, the authors discuss the theory of the SPM, which includes its basic electromagnetic principles, and derive the relationship between applied currents and resultant motor position. The authors present an automatic calibration procedure and discuss open- and closed-loop control strategies. Finally, the authors present the physical characteristics and results of their prototype}, keywords = {absolute positioning device, active vision, Actuators, Application software, Assembly, automatic calibration, camera sensor, CAMERAS, CCD image sensors, CCD sensor chip, Charge coupled devices, Charge-coupled image sensors, closed-loop control strategies, computerised control, Lenses, Magnetic fields, miniature lens assembly, miniature pan-tilt actuator, open-loop control strategies, orthogonal motor windings, pan-tilt mechanism, Permanent magnet motors, position control, Scanning probe microscopy, spherical pointing motor, two-degree-of-freedom device}, isbn = {1042-296X}, doi = {10.1109/70.294205}, author = {Bederson, Benjamin B. and Wallace,R.S. and Schwartz,E.L.} } @article {11925, title = {Mission-oriented replication of periodic tasks in real-time distributed systems}, journal = {Computer Science Technical Report Series; Vol. CS-TR-3256}, year = {1994}, month = {1994///}, pages = {24 - 24}, author = {Cheng,S. T and Hwang,S. I and Agrawala, Ashok K.} } @conference {16559, title = {Modeling brain adaptation to focal damage.}, booktitle = {Proceedings of the Annual Symposium on Computer Application in Medical Care}, year = {1994}, month = {1994///}, pages = {860 - 860}, author = {Goodall,S. and Reggia, James A. and Cho,S.} } @article {16649, title = {A modified cellular automata model of nucleotide interactions and DNA replication}, year = {1994}, month = {1994///}, institution = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Hilke,James and Lohn,Jason and Reggia, James A. and Navarro,Rafael} } @conference {13823, title = {Machine Translation of Spatial Expressions: Defining the Relation betweenan Interlingua and a Knowledge Representation System}, booktitle = {IN PROCEEDINGS OF TWELFTH CONFERENCE OF THE AMERICAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE}, year = {1993}, month = {1993///}, pages = {374 - 379}, abstract = {In this paper we present one aspect of our presents a clear case of where general as well as specific research on machine translation (MT): defining the re- real world knowledge should assist in eliminating inap- lation between the interlingua (IL) and a knowledge representation (KR) within an MT system. Our interest lies in the translation of natural language (NL) sentences where the "message" contains a spatial relation in particular, where the sentence conveys information about the location or path of physical entities in the real, physical world. We explore several arguments for clarifying the source of constraints on the particular IL structures needed to translate these sentences.}, author = {Dorr, Bonnie J and Voss,Clare R.} } @article {16735, title = {MANDATE: managing networks using database technology}, journal = {IEEE Journal on Selected Areas in Communications}, volume = {11}, year = {1993}, month = {1993/12//}, pages = {1360 - 1372}, abstract = {There has been a growing demand for the development of tools to manage enterprise communication networks. A management information database is the heart of a network management system-it provides the interface between all functions of the network management system and, therefore, has to provide sophisticated functionality allied with high performance. The authors introduce the design of MANDATE (MAnaging Networks using DAtabase TEchnology), a proposed database system for effectively supporting the management of large enterprise networks. The MANDATE design makes a conscious attempt to take advantage of the special characteristics of network data and transactions, and of advances in database technology, to efficiently derive some of the required management functionality}, keywords = {Communication networks, database management systems, enterprise communication networks, Heart, Information management, interface, internetworking, Local area networks, management functionality, management information database, managing networks using database technology, MANDATE, Manufacturing, network operating systems, open systems, Optical fiber cables, Research and development management, Technology management, telecommunication network management, Transaction databases, wide area networks}, isbn = {0733-8716}, doi = {10.1109/49.257929}, author = {Haritsa,J. R and Ball,M. O and Roussopoulos, Nick and Datta,A. and Baras,J. S} } @article {15630, title = {On The Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions}, journal = {Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario}, year = {1993}, month = {1993///}, pages = {49 - 54}, abstract = {We obtain exact bounds on the maximum number of in-tersections between two polygons with prescribed edge counts. In three dimensions, we obtain exact bounds on the number of intersecting face-pairs of two polyhe- dra with prescribed face counts when the polyhedra are convex, and lower bounds in the general case. }, author = {Dillencourt,M. B and Mount, Dave and Saalfeld,A.J.} } @inbook {18963, title = {Messenger RNA splicing signals in Drosophila genes}, booktitle = {Atlas of Drosophila Genes}, year = {1993}, month = {1993///}, pages = {333 - 358}, publisher = {Oxford University Press, New York, NY}, organization = {Oxford University Press, New York, NY}, abstract = {This chapter provides a general description of introns in Drosophila genes, withemphasis on the genetic information responsible for the correct specification of boundaries between introns and exons. The problem of locating introns within unannotated DNA sequences is posed by any large genomic sequencing project, and provides a perspective for discussing the information that specifies their removal. I want to stress, however, that there may not be a single set of rules that can identify all introns in all tissues. Certainly, it has become clear that the rules for locating introns will differ between species, such as flies and humans, in different taxonomic classes. Here, I will attempt to describe in general terms both what is known about how introns are recognized by the splicing machinery, and how an investigator might go about identifying introns within the sequence of his favorite Drosophila gene. Ultimately, such searches will be carried out by computer. Most current software, however, is designed specifically or primarily for species other than Drosophila (one exception is the program GM (Fields and Soderlund 1990), which accepts organism-specific consensus matrices and codon asymmetry tables). I am currently developing computational applications of the ideas described here, and interested readers are encouraged to consult current releases of the electronic Drosophila Infor- mation Newsletter. }, author = {Mount, Stephen M.} } @conference {14176, title = {Motion constraint patterns}, booktitle = {, Proceedings of IEEE Workshop on Qualitative Vision, 1993}, year = {1993}, month = {1993/06/14/}, pages = {128 - 139}, publisher = {IEEE}, organization = {IEEE}, abstract = {The problem of egomotion recovery has been treated by using as input local image motion, with the published algorithms utilizing the geometric constraint relating 2-D local image motion (optical flow, correspondence, derivatives of the image flow) to 3-D motion and structure. Since it has proved very difficult to achieve accurate input (local image motion), a lot of effort has been devoted to the development of robust techniques. A new approach to the problem of egomotion estimation is taken, based on constraints of a global nature. It is proved that local normal flow measurements form global patterns in the image plane. The position of these patterns is related to the three dimensional motion parameters. By locating some of these patterns, which depend only on subsets of the motion parameters, through a simple search technique, the 3-D motion parameters can be found. The proposed algorithmic procedure is very robust, since it is not affected by small perturbations in the normal flow measurements. As a matter of fact, since only the sign of the normal flow measurement is employed, the direction of translation and the axis of rotation can be estimated with up to 100\% error in the image measurements}, keywords = {3D motion parameters, Automation, computational geometry, Computer vision, correspondence, Educational institutions, egomotion recovery, Fluid flow measurement, geometric constraint, Geometrical optics, Image motion analysis, image plane, Laboratories, local image motion, local normal flow measurements, Motion estimation, Motion measurement, motion parameters, optical flow, Rotation measurement}, isbn = {0-8186-3692-0}, doi = {10.1109/WQV.1993.262942}, author = {Ferm{\"u}ller, Cornelia} } @article {16541, title = {Multiple disorder diagnosis with adaptive competitive neural networks}, journal = {Artificial intelligence in medicine}, volume = {5}, year = {1993}, month = {1993///}, pages = {469 - 487}, author = {Cho,S. and Reggia, James A.} } @conference {11926, title = {Multiple Resource Allocation for Multiprocessor Distributed Real-Time Systems}, booktitle = {In Workshop on Parallel and Distributed Real-Time Systems (PDRTS), IEEE IPPS{\textquoteright}93}, year = {1993}, month = {1993///}, abstract = {this report are those of the author(s) and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency, ONR, the U.S. Government or Honeywell. Computer facilities were provided in part by NSF grant CCR-8811954. Workshop on Parallel and Dist Real-Time Syst, IEEE IPPS{\textquoteright}93 April 1993 in the queue and tries to schedule it. If the task is successfully scheduled, it is removed from the queue and executed. Otherwise, the task is unlocked so that other processors may examine it in the same fashion. This scheme is convenient for a shared memory architecture, but becomes too expensive and cumbersome when such facility is not available in hardware (for example, in distributed systems). The goal of this paper is twofold: first, to study the problem of allocating multiple resources to a single task; and second, to provide a heuristic allocation policy for selecting a resource among multiple instances of identical resources. We consider a distributed system in which each site is a uniform memory access (UMA) multiprocessor, but the scheme is easily extensible to non-UMA models. For the first problem, a three-tiered resource allocation scheme is proposed. A hierarchy of the resources is defined to reduce the probability of allocation failure as the allocation progresses. To reduce the complexity of multiple resource allocation, we group the resources into schedulable sets of resources. Since the objective in real-time systems is to meet deadlines, this approach is acceptable so long as it meets a justifiable minimum level of resource utilization. It is shown that our approach allows modularity, flexibility, and potential concurrency in scheduling. Another contribution of this paper is in explicitly ide...}, author = {Mosse,Daniel and Noh,Sam H and Trinh,Bao and Agrawala, Ashok K.} } @article {18072, title = {Methods in parallel algorithmcs}, journal = {Mathematical Foundations of Computer Science 1992}, year = {1992}, month = {1992///}, pages = {81 - 81}, author = {Vishkin, Uzi} } @article {18071, title = {Methods in parallel algorithmics and who may need to know them?}, journal = {Algorithms and Computation}, year = {1992}, month = {1992///}, pages = {1 - 4}, author = {Vishkin, Uzi} } @conference {17866, title = {Model-driven mapping onto distributed memory parallel computers}, booktitle = {Proceedings of the 1992 ACM/IEEE conference on Supercomputing}, year = {1992}, month = {1992///}, pages = {818 - 829}, author = {Sussman, Alan} } @conference {13603, title = {Modeling of a Grasp for Handwriting}, booktitle = {Proceedings of the Twenty-Third Annual Modeling and Simulation Conference}, year = {1992}, month = {1992///}, pages = {2133 - 2140}, address = {Pittsburgh, PA}, author = {Varma,V. and David Doermann} } @conference {14233, title = {Multi-resolution shape description by corners}, booktitle = {, 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992. Proceedings CVPR {\textquoteright}92}, year = {1992}, month = {1992/06/15/18}, pages = {271 - 276}, publisher = {IEEE}, organization = {IEEE}, abstract = {A robust method for describing planar curves in multiple resolution using curvature information is presented. 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 main contribution lies in the robustness of the technique, which is due to the additional information that is extracted from observing the behavior of corners in the whole pyramid. Furthermore, the resulting algorithm is conceptually simple and easily parallelizable. Theoretical results are developed analyzing the curvature of continuous curves in scale-space and showing the behavior of curvature extrema under varying scale. The results are used to eliminate any ambiguities that might arise from sampling problems due to the discreteness of the representation. Experimental results demonstrate the potential of the method}, keywords = {ambiguities, Automation, computational geometry, Computer vision, continuous curves, corners, curvature extrema, curvature information, curve fitting, digital images, Feature extraction, IMAGE PROCESSING, image resolution, Image segmentation, Laboratories, multiple resolution, multiresolution structure, parallelizable, planar curves, Robustness, Sampling methods, scale-space, SHAPE, Smoothing methods, varying scale}, isbn = {0-8186-2855-3}, doi = {10.1109/CVPR.1992.223264}, author = {Ferm{\"u}ller, Cornelia and Kropatsch,W.} } @conference {13824, title = {Machine translation: A principle-based approach}, booktitle = {Artificial intelligence at MIT expanding frontiers}, year = {1991}, month = {1991///}, pages = {326 - 361}, author = {Dorr, Bonnie J} } @article {18362, title = {A management tool for evaluation of software design}, journal = {Software Engineering, IEEE Transactions on}, volume = {17}, year = {1991}, month = {1991/09//}, pages = {961 - 971}, abstract = {A model for evaluating software designs based on extending the functional model of program verification with concepts from economic decision theory has been proposed. The authors describe the method, and discuss a prototype implementation of a tool, called Selector, which implements this technique. It is suggested that a system like Selector can be used in two ways: as a decision support system for management to be used in the process of making choices among various alternatives; and as a prototyping investigative system for proposing and answering a series of {\textquoteleft}what if{\textquoteright} scenarios. The proposed model depends on a risk analysis, of each potential solution and aspects of decision theory to modify the evaluation strategy. The model depends on equilibrium probabilities for generating answers}, keywords = {analysis;software, decision, designs;decision, investigative, model;management, probabilities;evaluation, prototyping;software, Selector;decision, strategy;functional, Support, system;economic, system;risk, systems;program, theory;equilibrium, tool;program, tools;, verification;prototyping, verification;software}, isbn = {0098-5589}, doi = {10.1109/32.92916}, author = {Cardenas-Garcia,S. and Zelkowitz, Marvin V} } @article {15971, title = {Memory, reason and time: the Step-Logic approach}, journal = {Philosophy and AI: Essays at the Interface}, year = {1991}, month = {1991///}, pages = {79 - 103}, author = {Elgot-drapkin,J. and Miller,M. and Perlis, Don} } @conference {16332, title = {Metric-driven analysis and feedback systems for enabling empirically guided software development}, booktitle = {Proceedings of the 13th international conference on Software engineering}, year = {1991}, month = {1991///}, pages = {288 - 298}, author = {Selby,R. W and Porter, Adam and Schmidt,D. C and Berney,J.} } @conference {14835, title = {Model group indexing for recognition}, booktitle = {Computer Vision and Pattern Recognition, 1991. Proceedings CVPR {\textquoteright}91., IEEE Computer Society Conference on}, year = {1991}, month = {1991/06//}, pages = {4 - 9}, abstract = {It is shown that an index space can be a powerful tool for reducing the image-model match search by a factor of kG-3 , but only when accompanied by some mechanism, such as grouping, that prevents the system from having to consider all matches between image groups of size G and model groups of size G. It is also shown that if image groups are to index a single point at recognition time, then the index space must contain pointers to each model group over a 2-D sheet, and should therefore be 2G-4 dimensional. A simple indexing system has been implemented to demonstrate these concepts, and a series of experiments have been conducted to investigate the tradeoffs between space and time. They indicate that the speedups are achievable, but require a large amount of space}, keywords = {2-D, dimensional;image, group, groups;image-model, indexing;pattern, lookup;, match, pattern, recognition;data, recognition;pointers;computer, search;index, sheet;2G-4, space;indexing, structures;table, system;model, vision;computerised}, doi = {10.1109/CVPR.1991.139652}, author = {Clemens,D. T and Jacobs, David W.} } @article {11930, title = {Modeling of cross traffic in conjunction with deterministic analysis of queues}, year = {1991}, month = {1991///}, institution = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Agrawala, Ashok K. and Sanghi,Dheeraj} } @article {16749, title = {Modern client-server DBMS architectures}, journal = {ACM SIGMOD RecordSIGMOD Rec.}, volume = {20}, year = {1991}, month = {1991/09//}, pages = {52 - 61}, isbn = {01635808}, doi = {10.1145/126482.126489}, url = {http://dl.acm.org/citation.cfm?doid=126482.126489}, author = {Roussopoulos, Nick and Delis,Alexis} } @article {11989, title = {A multi-frame approach to visual motion perception}, journal = {International Journal of Computer Vision}, volume = {6}, year = {1991}, month = {1991///}, pages = {245 - 255}, author = {Spetsakis, M. and Aloimonos, J.} } @conference {13594, title = {Mailpiece Preprocessing: The population of Character Parts}, booktitle = {ATC}, year = {1990}, month = {1990///}, pages = {961 - 972}, author = {David Doermann and Rosenfeld, A.} } @conference {16442, title = {Maintaining consistency in a stratified production system program}, booktitle = {Proceedings of the AAAI National Conference on Artificial Intelligence}, year = {1990}, month = {1990///}, pages = {284 - 289}, author = {Raschid, Louiqa} } @conference {16652, title = {Modeling diagnostic problem-solving at multiple levels of abstraction}, booktitle = {Artificial Intelligence Applications, 1990., Sixth Conference on}, year = {1990}, month = {1990/05//}, pages = {55 -61 vol.1 - 55 -61 vol.1}, abstract = {A precise domain-independent computational model for diagnostic problem-solving at multiple levels of abstraction is presented. The knowledge representation framework allows causal knowledge to be represented in a precise yet natural way that reflects a human diagnostician{\textquoteright}s experience in guiding diagnostic reasoning at multiple levels of abstraction. The inference mechanism clearly defines how to form plausible diagnostic hypotheses guided by explicit causal links and the principle of parsimonious covering. It permits the efficient formation of high-level diagnostic hypotheses while at the same time ensuring that all plausible diagnostic alternatives will be considered if one wishes to reason at sufficiently detailed levels. A prototype implementation is described to demonstrate that the proposed inference model is natural for capturing a small but representative fragment of medical causal knowledge, and, with the addition of reasonable heuristics, that the inference mechanism exhibits desirable problem-solving behavior}, keywords = {causal knowledge, diagnostic problem-solving, diagnostic reasoning, domain-independent computational model, explicit causal links, heuristic programming, heuristics, inference mechanism, inference mechanisms, knowledge capture, knowledge representation, knowledge representation framework, medical knowledge, multiple abstraction levels, parsimonious covering, plausible diagnostic hypotheses, problem solving}, doi = {10.1109/CAIA.1990.89171}, author = {Chu,B.-T.B. and Reggia, James A.} } @article {11971, title = {Motion--Boundary Illusions and their Regularization}, journal = {Proceedings of the Royal Society of London. Series B: Biological Sciences}, volume = {242}, year = {1990}, month = {1990/11/22/}, pages = {75 - 81}, abstract = {Humans use various cues to understand the structure of the world from images. One such cue is the contours of an object formed by occlusion or from surface discontinuities. It is known that contours in the image of an object provide various amounts of information about the shape of the object in view, depending on assumptions that the observer makes. Another powerful cue is motion. The ability of the human visual system to discern structure from a motion stimulus is well known and has a solid theoretical and experimental foundation. However, when humans interpret a visual scene they use various cues to understand what they observe, and the interpretation comes from combining the information acquired from the various modules devoted to specific cues. In such an integration of modules it seems that each cue carries a different weight and importance. We performed several experiments where we made sure that the only cues available to the observer were contour and motion. It turns out that when humans combine information from contour and motion to reconstruct the shape of an object in view, if the results of the two modules - shape from contour and structure from motion - are inconsistent, they experience a perceptual result which is due to the combination of the two modules, with the influence of the contour dominating, thus giving rise to the illusion. We describe here examples of such illusions and identify the conditions under which they happen. Finally, we introduce a computational theory for combining contour and motion using the theory of regularization. The theory explains such illusions and predicts many more. The same computational theory, when applied to retinal motion estimation, explains the effect of boundaries on the perception of motion that gives rise to a set of well-known illusions described by Wallach (1976).}, doi = {10.1098/rspb.1990.0106}, url = {http://rspb.royalsocietypublishing.org/content/242/1304/75.abstract}, author = {Aloimonos, J. and Huang, Liuqing} } @conference {16680, title = {Multiple underlying systems: Translating user requests into programs to produce answers}, booktitle = {Proceedings of the 28th annual meeting on Association for Computational Linguistics}, year = {1990}, month = {1990///}, pages = {227 - 234}, author = {Bobrow,R.J. and Resnik, Philip and Weischedel,R.M.} } @conference {16602, title = {A method for interactive satellite failure diagnosis: Towards a connectionist solution}, booktitle = {NASA. Goddard Space Flight Center, The 1989 Goddard Conference on Space Applications of Artificial Intelligence p 143-152(SEE N 89-26578 20-63)}, year = {1989}, month = {1989///}, author = {Bourret,P. and Reggia, James A.} } @conference {16653, title = {Methods for deriving competitive activation mechanisms}, booktitle = {Neural Networks, 1989. IJCNN., International Joint Conference on}, year = {1989}, month = {1989//00/0}, pages = {357 -363 vol.1 - 357 -363 vol.1}, abstract = {Inhibitory interactions in connectionist models have traditionally been implemented using inhibitory connections. Recently, an alternative approach based on competitive activation mechanisms has been proposed. To make this alternative approach practical in large and complex models, it is necessary to formulate general methods for creating task-specific competitive activation mechanisms. The author presents two such methods that have been applied successfully: heuristic computer-assisted search and decomposition of global optimization criteria. The usefulness of these two methods is demonstrated through simulations that establish the effectiveness of the competitive activation mechanisms so produced.<>}, keywords = {connectionist models, decomposition, global optimization criteria, heuristic computer-assisted search, neural nets, optimisation, search problems, task-specific competitive activation mechanisms, virtual machines}, doi = {10.1109/IJCNN.1989.118609}, author = {Reggia, James A.} } @conference {12010, title = {The Maryland approach to image understanding}, booktitle = {Science Applications International Corp, Proceedings: Image Understanding Workshop,}, volume = {1}, year = {1988}, month = {1988///}, author = {Aloimonos, J. and Davis, Larry S. and Rosenfeld, A.} } @article {18094, title = {Matching patterns in strings subject to multi-linear transformations}, journal = {Theoretical Computer Science}, volume = {60}, year = {1988}, month = {1988///}, pages = {231 - 254}, author = {Eilam-Tzoreff,T. and Vishkin, Uzi} } @conference {17829, title = {Mapping a single-assignment language onto the Warp systolic array}, booktitle = {Functional Programming Languages and Computer Architecture}, year = {1987}, month = {1987///}, pages = {347 - 363}, author = {Gross,T. and Sussman, Alan} } @article {16811, title = {Meta-Data Management.}, volume = {ISR-TR-1987-31}, year = {1987}, month = {1987///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {A database system should support a rich variety of meta-data describing and controlling the management and use of data. Few present database systems provide even rudimentary integrated meta-data management facilities.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/4540}, author = {Mark,Leo and Roussopoulos, Nick} } @article {16632, title = {Modeling diagnostic reasoning: a summary of parsimonious covering theory}, journal = {Computer methods and programs in biomedicine}, volume = {25}, year = {1987}, month = {1987///}, pages = {125 - 134}, author = {Reggia, James A. and Peng,Y.} } @article {16638, title = {Modelling reading aloud and its relevance to acquired dyslexia}, journal = {Computer methods and programs in biomedicine}, volume = {22}, year = {1986}, month = {1986///}, pages = {13 - 19}, author = {Reggia, James A. and Berndt,R. S} } @article {16935, title = {A model programming environment}, journal = {Advances in Human-Computer Interaction}, volume = {1}, year = {1985}, month = {1985///}, pages = {105 - 132}, author = {Shneiderman, Ben} } @article {15773, title = {Multi-splittings of Matrices and Parallel Solution of Linear Systems}, journal = {SIAM Journal on Algebraic and Discrete Methods}, volume = {6}, year = {1985}, month = {1985///}, pages = {630 - 640}, author = {O{\textquoteright}Leary, Dianne P. and White,R. E.} } @article {17294, title = {Memory For Menus: Effects of Study Mode}, journal = {University of Maryland Computer Science Technical Report Series, CS-TR-1412}, year = {1984}, month = {1984///}, abstract = {Menu selection systems require a certain amount of training in order for users to remember how to access target functions. In this experiment users studied four different types of documentation before searching for target words in a content-free menu containing no meaningful relationships among terms. Documentation was presented to subjects in one of four modes of study. In the Command Mode subjects studied sequences of choices to arrive at a desired target. In the Menu Frame Mode subjects studied individual frames in the menu system. In the Global Tree Mode subjects studied a diagram of the menu tree. Finally, in the Trial and Error Mode subjects studied the menu system by actually selecting alternatives. Although the Global Tree and Command Sequence Groups found the most target words during the test phase, the four groups did not differ significantly. On the other hand, differences in the ability to recall menu terms were significant with the command Sequence and Menu Frame Groups recalling the most terms. Furthermore, results indicated that the type of training fundamentally affected the type of information used in order to find targets. Subjects in the Command Sequence and Menu Frame Groups tended to rely on recall of menu terms. Furthermore, all groups relied heavily on memory of the menu tree except for the Command Squence Group. Results of this study are related to practical considerations for the design of menu selection systems.}, author = {Norman,K. L and Schwartz,J.P. and Shneiderman, Ben} } @article {18405, title = {Monitoring an Ada software development}, journal = {ACM SIG Ada Letters}, volume = {IV}, year = {1984}, month = {1984/07//}, pages = {32 - 39}, isbn = {1094-3641}, doi = {10.1145/998401.998402}, url = {http://doi.acm.org/10.1145/998401.998402}, author = {Basili, Victor R. and Chang,Shih and Gannon,John and Katz,Elizabeth and Panlilio-Yap,N. Monina and Ramsey,Connie Loggia and Zelkowitz, Marvin V and Bailey,John and Kruesi,Elizabeth and Sheppard,Sylvia} } @article {15772, title = {Multi-resolution relaxation}, journal = {Pattern Recognition}, volume = {16}, year = {1983}, month = {1983///}, pages = {223 - 230}, abstract = {Several types of iterative methods can be used to segment the pixels in an image into light and dark regions; these include {\textquotedblleft}relaxation{\textquotedblright} methods of probability adjustment and steepest-descent methods of cost function minimization. Conventionally, these methods operate on the image at a single resolution. This paper investigates the possibility of using these approaches at two (or more) resolutions in order to reduce their computational cost{\textemdash}e.g. first obtain an approximate solution by iterating at low resolution, then refine the solution using a few iterations at high resolution.}, keywords = {Multigrid methods, Pyramids, Relaxation, segmentation}, isbn = {0031-3203}, doi = {10.1016/0031-3203(83)90026-2}, url = {http://www.sciencedirect.com/science/article/pii/0031320383900262}, author = {Narayanan,K. A. and O{\textquoteright}Leary, Dianne P. and Rosenfeld,Azriel} } @article {17301, title = {Multiparty Grammars and Related Features for Defining Interactive Systems}, journal = {IEEE Transactions on Systems, Man and Cybernetics}, volume = {12}, year = {1982}, month = {1982/03//}, pages = {148 - 154}, abstract = {Multiparty grammars are introduced which contain labeled nonterminals to indicate the party that produces the terminal string. For interactive person-computer systems, both the user commands and system responses can be described by the linked BNF grammars. Multiparty grammars may also be used to describe communication among several people (by way of computers or in normal dialogue), network protocols among several machines, or complex interactions involving several people and machines. Visual features such as underlining, reversal, blinking, and color, window declarations, and dynamic operations dependent on cursor movement are also covered.}, keywords = {Application software, Computer aided instruction, Computer displays, Computer languages, Computer networks, Debugging, HUMANS, interactive systems, Protocols, Writing}, isbn = {0018-9472}, doi = {10.1109/TSMC.1982.4308798}, author = {Shneiderman, Ben} } @article {18403, title = {Measuring software development characteristics in the local environment}, journal = {Computers \& Structures}, volume = {10}, year = {1979}, month = {1979/04//}, pages = {39 - 43}, abstract = {This paper discusses the characterization and analysis facilities being performed by the Software Engineering Laboratory which can be done with minimal effort on many projects. Some examples are given of the kinds of analyses that can be done to aid in managing, understanding and characterizing the development of software in a production environment.}, isbn = {0045-7949}, doi = {10.1016/0045-7949(79)90071-3}, url = {http://www.sciencedirect.com/science/article/pii/0045794979900713}, author = {Basili, Victor R. and Zelkowitz, Marvin V} } @conference {13265, title = {A Method for Organizing a Project Network into a Tree Structure}, booktitle = {Third Symposium on Operations Research, Mannheim University, Tagungsbericht}, year = {1978}, month = {1978///}, author = {De Floriani, Leila} } @book {11939, title = {Machine recognition of patterns}, year = {1977}, month = {1977///}, publisher = {John Wiley \& Sons Canada, Limited}, organization = {John Wiley \& Sons Canada, Limited}, author = {Agrawala, Ashok K.} } @article {17289, title = {Measuring computer program quality and comprehension}, journal = {International Journal of Man-Machine Studies}, volume = {9}, year = {1977}, month = {1977/07//}, pages = {465 - 478}, abstract = {Judging the relative quality of computer programs and a programmer{\textquoteright}s comprehension of a given program has proven to be a difficult task. Ability to debug, modify, hand simulate execution or respond to questions about the program all have their weaknesses as comprehension metrics. This paper offers experimental evidence which supports the use of memorization/recall tasks as a further basis for judging program quality and programmer comprehension. A syntactic/semantic model of programmer behavior is presented to provide a basis for this hypothesis.}, keywords = {cognitive psychology, commenting, memorization, modification, program design, programmer behavior, Programming, programming experiments, programming languages, RECALL, structured programming}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(77)80014-X}, url = {http://www.sciencedirect.com/science/article/pii/S002073737780014X}, author = {Shneiderman, Ben} } @article {16934, title = {A model for optimizing indexed file structures}, journal = {International Journal of Parallel Programming}, volume = {3}, year = {1974}, month = {1974///}, pages = {91 - 101}, abstract = {Multilevel indexes have long been used for accessing records in sorted files. Given the access cost at each level, the total cost of retrieving a record from the file can be substantially reduced by selecting the proper size of the index at each level. Organizations involving a variable number of levels are covered and binary searching is compared to sequential searching.}, isbn = {0885-7458}, url = {http://dx.doi.org/10.1007/BF01355589}, author = {Shneiderman, Ben} } @article {16798, title = {A max {m, n} algorithm for determining the graph H from its line graph G}, journal = {Information Processing Letters}, volume = {2}, year = {1973}, month = {1973///}, pages = {108 - 112}, author = {Roussopoulos, Nick} }